Codeforces Round #473 (Div. 2)-白红宇

Codeforces Round #473 (Div. 2)

阅读量：5143 次

发布时间：2019-06-13

本文共 5494 字，大约阅读时间需要 18 分钟。

A. Mahmoud and Ehab and the even-odd game

1 #include
      
        2 using namespace std; 3 #define fre(i,t,n)  for(int i =(t);i<=(n);++i) 4 #define fer(i,n,t)  for(int i =(n);i>=(t);--i) 5 #define mp make_pair 6 #define pb push_back 7 typedef long long ll; 8 void smain(); 9 int main(){10     ios::sync_with_stdio(false);11     smain();12     return 0;13 }14 void smain(){15     int n;16     cin>>n;17     if(n%2==0)  cout<<"Mahmoud";18     else cout<<"Ehab";19     cout<

View Code

B. Mahmoud and Ehab and the message

1 #include
      
        2 using namespace std; 3 #define fre(i,t,n)  for(int i =(t);i<=(n);++i) 4 #define fer(i,n,t)  for(int i =(n);i>=(t);--i) 5 #define mp make_pair 6 #define pb push_back 7 typedef long long ll; 8 void smain(); 9 int main(){10     ios::sync_with_stdio(false);11     smain();12     return 0;13 }14 map
       
         M;15 const int MAXN = 1e5+10;16 const ll INF = 2e9;17 string str[MAXN];18 ll cost[MAXN];19 int tmp[MAXN];20 void smain(){21     int n,k,m;22     cin>>n>>k>>m;23     fre(i,1,n)24     {25         cin>>str[i];26         M[str[i]]=i;27     }28     fre(i,1,n)29     {30         cin>>cost[i];31     }32     fre(i,1,k)33     {34         int K;35         cin>>K;36         ll mc=INF;37         fre(j,1,K)38         {39             cin>>tmp[j];40             mc=min(mc,cost[tmp[j]]);41         }42         fre(j,1,K)43             cost[tmp[j]]=mc;44     }45     string s;46     ll ans=0;47     fre(i,1,m)48     {49         cin>>s;50         ans+=cost[M[s]];51     }52     cout<
        
         <

View Code

C. Mahmoud and Ehab and the wrong algorithm

1 #include
      
        2 using namespace std; 3 #define fre(i,t,n)  for(int i =(t);i<=(n);++i) 4 #define fer(i,n,t)  for(int i =(n);i>=(t);--i) 5 #define mp make_pair 6 #define pb push_back 7 typedef long long ll; 8 void smain(); 9 int main(){10     ios::sync_with_stdio(false);11     smain();12     return 0;13 }14 void smain(){15     int n;16     cin>>n;17     if(n<=5)18     {19         cout<<-1<

View Code

D. Mahmoud and Ehab and another array construction task

1 #include
      
        2 using namespace std; 3 #define fre(i,t,n)  for(int i =(t);i<=(n);++i) 4 #define fer(i,n,t)  for(int i =(n);i>=(t);--i) 5 #define mp make_pair 6 #define pb push_back 7 //#define fuckoj 8 typedef long long ll; 9 void smain();10 int main(){11     ios::sync_with_stdio(false);12 13     #ifdef fuckoj14     freopen("d.in","r",stdin);15     #endif // fuckoj16     smain();17     return 0;18 }19 const int MAXN = 2e6+10;20 bool isNotPrime[MAXN];21 int prime[MAXN];22 bool Out[MAXN];23 int tot=0;24 set
       
         Set;25 void Shai()26 {27     int L=2e6+1;28     fre(i,2,L)29     {30         if(!isNotPrime[i])  prime[tot++]=i;31         for(int j=0;j
        
         
          g)  break;49         if(g%prime[i]==0)50         {51             Clear(prime[i]);52             Out[i]=true;53             while(g%prime[i])   g%=prime[i];54         }55     }56 }57 void smain()58 {59     Shai();60     fre(i,2,MAXN-1)61         Set.insert(i);62     int n,d;63     cin>>n;64     bool flag=false;65     int k=0;66     fre(i,1,n)67     {68         cin>>d;69         if(flag)70         {71             while(Out[k])   k++;72             Out[k]=true;73             cout<
          
           <<" ";74         }else{75             auto iter=Set.lower_bound(d);76             if(*iter>d) flag=true;77             cout<<*iter<<" ";78             XX(*iter);79         }80     }81 }

View Code

E. Mahmoud and Ehab and the xor-MST

1 #include
      
        2 using namespace std; 3 #define fre(i,t,n)  for(int i =(t);i<=(n);++i) 4 #define fer(i,n,t)  for(int i =(n);i>=(t);--i) 5 #define mp make_pair 6 #define pb push_back 7 typedef long long ll; 8 void smain(); 9 int main(){10     ios::sync_with_stdio(false);11     smain();12     return 0;13 }14 ll pow(ll k){15     ll ans=1,now=2;16     //cout<<"pow("<
       
        <<")=";17     while(k){18         if(k&1) ans*=now;19         k>>=1ll;20         now*=now;21     }22     //cout<
        
         <
         
          >n;28     ll t=n-1;29     ll ans=0;30     ll ai=1;31     int i=0;32     fre(i,0,62){33         ans+=(t/pow(i)+1)/2*pow(i);34     }35     cout<
          
           <

View Code

F. Mahmoud and Ehab and yet another xor task

线性积的题=-=感觉最近线性积的出现频率其高，不过也算是学习了一发

1 #include
      
        2 using namespace std; 3 #define fre(i,t,n)  for(int i =(t);i<=(n);++i) 4 #define fer(i,n,t)  for(int i =(n);i>=(t);--i) 5 #define mp make_pair 6 #define pb push_back 7 typedef long long ll; 8 void smain(); 9 int main(){10     ios::sync_with_stdio(false);11     smain();12     return 0;13 }14 const int MAXN = 1e5+10;15 int Base[MAXN][20];16 int add(int k,int &g)17 {18     fer(i,19,0)19         if((g&(1<
       
        >=1;34     }35     return ans;36 }37 void smain(){38     int n,q;39     cin>>n>>q;40     fre(i,1,n)  cin>>T[i];41     fre(i,1,n)42     {43         sum[i]=sum[i-1];44         fre(j,0,19) Base[i][j]=Base[i-1][j];45         int c=add(i,T[i]);46         if(c!=-1)   Base[i][c]=T[i],sum[i]++;47     }48     //fre(i,1,n)  cout<
        
         <
         
          >l>>x;53         if(add(l,x)!=-1)54             cout<<0;55         else cout<