Codeforces Beta Round #63 (Div. 2)

Codeforces Beta Round #63 (Div. 2)

http://codeforces.com/contest/69

A

 #include<bits/stdc++.h>
 using namespace std;
 #define lson l,mid,rt<<1
 #define rson mid+1,r,rt<<1|1
 #define sqr(x) ((x)*(x))
 #define pb push_back
 #define eb emplace_back
 #define maxn 1000006
 #define rep(k,i,j) for(int k=i;k<j;k++)
 typedef long long ll;
 typedef unsigned long long ull;

 int n;
 struct sair{
     int x,y,z;
 }a[];

 int main(){
     #ifndef ONLINE_JUDGE
      //   freopen("input.txt","r",stdin);
     #endif
     std::ios::sync_with_stdio(false);
     cin>>n;
     for(int i=;i<=n;i++){
         cin>>a[i].x>>a[i].y>>a[i].z;
     }
     int aa=,bb=,cc=;
     for(int i=;i<=n;i++){
         aa+=a[i].x;
         bb+=a[i].y;
         cc+=a[i].z;
     }
     if(aa||bb||cc) cout<<"NO"<<endl;
     else cout<<"YES"<<endl;
 }

B

 #include<bits/stdc++.h>
 using namespace std;
 #define lson l,mid,rt<<1
 #define rson mid+1,r,rt<<1|1
 #define sqr(x) ((x)*(x))
 #define pb push_back
 #define eb emplace_back
 #define maxn 1000006
 #define rep(k,i,j) for(int k=i;k<j;k++)
 typedef long long ll;
 typedef unsigned long long ull;

 int n,m;
 int k[],p[];

 int main(){
     #ifndef ONLINE_JUDGE
      //   freopen("input.txt","r",stdin);
     #endif
     std::ios::sync_with_stdio(false);
     int l,r,t,c;
     int ans=;
     cin>>n>>m;
     for(int i=;i<m;i++){
         cin>>l>>r>>t>>c;
         for(int j=l;j<=r;j++){
             if(t<k[j]||!k[j]){
                 k[j]=t;
                 ans-=p[j];
                 p[j]=c;
                 ans+=p[j];
             }
         }
     }
     cout<<ans<<endl;
 }

C

模拟

 #include<bits/stdc++.h>
 using namespace std;
 #define lson l,mid,rt<<1
 #define rson mid+1,r,rt<<1|1
 #define sqr(x) ((x)*(x))
 #define pb push_back
 #define eb emplace_back
 #define maxn 1000006
 #define rep(k,i,j) for(int k=i;k<j;k++)
 typedef long long ll;
 typedef unsigned long long ull;

 char name1[][],name2[][];
 int with[][],have[][],n;
 int g[][];
 char tname[];
 char s[];
 int Find(char *name)
 {
     for (int i=;i<n;i++)
         if (strcmp(name,name1[i])==) return i;
     return ;
 }
 struct sair{
     char name[];
     int num;
 };
 sair p[];
 bool cmp(sair x,sair y)
 {
     return strcmp(x.name,y.name)<;
 }

 int main(){
     #ifndef ONLINE_JUDGE
      //   freopen("input.txt","r",stdin);
     #endif
     std::ios::sync_with_stdio(false);
     int k,m,t;
     scanf("%d%d%d%d",&k,&n,&m,&t);
     for (int i=;i<n;i++)
         scanf("%s",name1[i]);
     getchar();
     memset(g,,sizeof(g));
     for (int ii=;ii<m;ii++)
     {
         gets(s);
         int len=strlen(s);
         int cnt=,i=;
         for (i=;i<len&&s[i]!=':';i++)
             name2[ii][cnt++]=s[i];
         name2[ii][cnt++]=;
         i+=;
         while (i<len)
         {
             cnt=;
             for (;s[i]!=' ';i++)
                 tname[cnt++]=s[i];
             tname[cnt]=;
             int id=Find(tname);
             i++;
             int num=;
             for (;s[i]!=&&s[i]!=',';i++)
                 num=num*+s[i]-'';
             g[ii][id]=num;
             i+=;
         }
     }
     memset(have,,sizeof(have));
     memset(with,,sizeof(with));
     for (int i=;i<t;i++)
     {
         int tnum;
         scanf("%d",&tnum);
         scanf("%s",tname);
         int id=Find(tname);
         have[tnum][id]++;
         for (int j=;j<m;j++)
         {
             bool tfind=true;
             for (int k=;k<n;k++)
                 if (have[tnum][k]<g[j][k]) tfind=false;
             if (tfind)
             {
                 for (int k=;k<n;k++)
                     have[tnum][k]-=g[j][k];
                 with[tnum][j]++;
             }
         }
     }
     for (int i=;i<=k;i++)
     {
         int cnt=;
         for (int j=;j<n;j++)
             if (have[i][j]!=)
             {
                 p[cnt].num=have[i][j];
                 strcpy(p[cnt++].name,name1[j]);
             }
         for (int j=;j<m;j++)
             if (with[i][j]!=)
             {
                 p[cnt].num=with[i][j];
                 strcpy(p[cnt++].name,name2[j]);
             }
         sort(p,p+cnt,cmp);
         printf("%d\n",cnt);
         for (int j=;j<cnt;j++)
             printf("%s %d\n",p[j].name,p[j].num);
     }
 }

D

记忆化搜索的博弈，和前天的E题很像

题意：给个初始点，然后两个人轮流移动一段距离，当点和原点的距离大于d时失败。题目中的点可以移动到y=x的对称点这条件没用，因为一个人使用了这个条件，另一个人也可以使用它使点回到刚刚的位置

 #include<bits/stdc++.h>
 using namespace std;
 #define lson l,mid,rt<<1
 #define rson mid+1,r,rt<<1|1
 #define sqr(x) ((x)*(x))
 #define pb push_back
 #define eb emplace_back
 #define maxn 1000006
 #define rep(k,i,j) for(int k=i;k<j;k++)
 typedef long long ll;
 typedef unsigned long long ull;

 int d,n;
 struct sair{
     int x,y;
 }a[];

 int book[][];

 bool dist(int a,int b){
     return (a-)*(a-)+(b-)*(b-) <= d*d;
 }

 int dfs(int x,int y){
     int xx,yy;
     if(book[x][y]) return book[x][y];
     for(int i=;i<=n;i++){
         xx=x+a[i].x;
         yy=y+a[i].y;
         if(dist(xx,yy)){
             if(==dfs(xx,yy)){
                 return book[x][y]=;
             }
         }
     }
     return book[x][y]=;
 }

 int main(){
     #ifndef ONLINE_JUDGE
      //   freopen("input.txt","r",stdin);
     #endif
     std::ios::sync_with_stdio(false);
     int x,y;
     cin>>x>>y>>n>>d;
     for(int i=;i<=n;i++){
         cin>>a[i].x>>a[i].y;
     }
     if(dfs(x+,y+)==) cout<<"Anton"<<endl;
     else cout<<"Dasha"<<endl;

 }

E

题意:找出在一定区间内只出现过一次的最大的数

思路：建两个map，一个记录数的个数，另一个记录当前个数为1的值即可

 #include<bits/stdc++.h>
 using namespace std;
 #define lson l,mid,rt<<1
 #define rson mid+1,r,rt<<1|1
 #define sqr(x) ((x)*(x))
 #define pb push_back
 #define eb emplace_back
 #define maxn 1000006
 #define rep(k,i,j) for(int k=i;k<j;k++)
 typedef long long ll;
 typedef unsigned long long ull;

 int n,k;
 int a[];
 map<int,int>mp;
 map<int,int>book;
 map<int,int>::iterator it;
 map<int,int>::reverse_iterator rit;

 int main(){
     #ifndef ONLINE_JUDGE
      //   freopen("input.txt","r",stdin);
     #endif
     std::ios::sync_with_stdio(false);
     cin>>n>>k;
     for(int i=;i<=n;i++) cin>>a[i];
     for(int i=;i<=k;i++){
         mp[a[i]]++;
         if(mp[a[i]]==){
             book.erase(book.find(a[i]));
         }
         else if(mp[a[i]]==){
             book[a[i]]=;
         }
     }
     if(book.size()==){
         cout<<"Nothing"<<endl;
     }
     else{
         rit=book.rbegin();
         cout<<rit->first<<endl;
     }
     for(int i=k+;i<=n;i++){
         mp[a[i-k]]--;
         if(mp[a[i-k]]==) book.erase(book.find(a[i-k]));
         else if(mp[a[i-k]]==) book[a[i-k]]=;
         mp[a[i]]++;
         if(mp[a[i]]==) book[a[i]]=;
         else if(mp[a[i]]==)book.erase(book.find(a[i]));
         if(book.size()==){
             cout<<"Nothing"<<endl;
         }
         else{
             rit=book.rbegin();
             cout<<rit->first<<endl;
         }
     }

 }