Submission #332727

#TimeUsernameProblemLanguageResultExecution timeMemory
332727daniel920712JOIRIS (JOI16_joiris)C++14
0 / 100
1 ms384 KiB
#include <iostream> #include <stdio.h> #include <stdlib.h> #include <vector> using namespace std; int all[55]; bool ok2[55]={0}; vector < pair < int , int > > ans; int main() { int N,M,t=0,ok,small,i,j,st; scanf("%d %d",&N,&M); for(i=0;i<N;i++) { scanf("%d",&all[i]); t+=all[i]; //all[i]=i%2; } if(t%2!=N%2&&N%2==0) { printf("-1\n"); return 0; } else { while(1) { //for(i=0;i<N;i++) printf("%d ",all[i]); //printf("\n"); //printf("%d\n",ans.size()); for(i=0;i<N;i++) ok2[i]=0; for(i=0;i<N;i++) { if(i+2<N&&all[i]==1&&all[i+1]==0&&all[i+2]==1) { ok2[i]=1; ok2[i+1]=1; ok2[i+2]=1; ans.push_back(make_pair(2,i+1)); all[i]++; all[i+1]++; ans.push_back(make_pair(1,i+3)); all[i+2]+=2; } } if(i!=N) { for(j=0;j<N;j++) { if(all[j]>=2||ok2[j]) continue; ans.push_back(make_pair(1,j+1)); all[j]+=2; } small=all[0]; for(i=0;i<N;i++) small=min(small,all[i]); for(i=0;i<N;i++) all[i]-=small; for(i=0;i<N;i++) if(all[i]) break; if(i==N) break; } for(i=0;i<N;i++) { if(all[i]==0) { if(i+1<N&&all[i+1]==0) { ans.push_back(make_pair(2,i+1)); all[i]++; all[i+1]++; } else if(i+3<N&&all[i+1]==1&&all[i+2]==0&all[i+3]==1) { ans.push_back(make_pair(1,i+1)); all[i]+=2; ans.push_back(make_pair(2,i+2)); all[i+1]++; all[i+2]++; ans.push_back(make_pair(1,i+4)); all[i+3]+=2; } else { ans.push_back(make_pair(1,i+1)); all[i]+=2; } } } small=all[0]; for(i=0;i<N;i++) small=min(small,all[i]); for(i=0;i<N;i++) all[i]-=small; for(i=0;i<N;i++) if(all[i]) break; if(i==N) break; } } printf("%d\n",ans.size()); for(auto i:ans) printf("%d %d\n",i.first,i.second); return 0; }

Compilation message (stderr)

joiris.cpp: In function 'int main()':
joiris.cpp:80:57: warning: suggest parentheses around comparison in operand of '&' [-Wparentheses]
   80 |                     else if(i+3<N&&all[i+1]==1&&all[i+2]==0&all[i+3]==1)
      |                                                 ~~~~~~~~^~~
joiris.cpp:118:14: warning: format '%d' expects argument of type 'int', but argument 2 has type 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wformat=]
  118 |     printf("%d\n",ans.size());
      |             ~^    ~~~~~~~~~~
      |              |            |
      |              int          std::vector<std::pair<int, int> >::size_type {aka long unsigned int}
      |             %ld
joiris.cpp:12:17: warning: unused variable 'ok' [-Wunused-variable]
   12 |     int N,M,t=0,ok,small,i,j,st;
      |                 ^~
joiris.cpp:12:30: warning: unused variable 'st' [-Wunused-variable]
   12 |     int N,M,t=0,ok,small,i,j,st;
      |                              ^~
joiris.cpp:13:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   13 |     scanf("%d %d",&N,&M);
      |     ~~~~~^~~~~~~~~~~~~~~
joiris.cpp:16:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   16 |         scanf("%d",&all[i]);
      |         ~~~~~^~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...