Submission #152825

#TimeUsernameProblemLanguageResultExecution timeMemory
152825AldeaDanutPreokret (COCI18_preokret)C++14
40 / 50
3 ms380 KiB
#include <iostream> #define x first #define y second using namespace std; int a,b,A[3000],B[3000],cnt,i,j,n,s[3],lead; pair <int,int> v[6000]; int main(){ cin>>a; for(i=1;i<=a;i++) cin>>A[i]; cin>>b; for(i=1;i<=b;i++) cin>>B[i]; int ok=1; for(i=1,j=1;i<=a&&j<=b;){ if(A[i]<B[j]){ n++; v[n].x=A[i]; v[n].y=0; i++; }else{ n++; v[n].x=B[j]; v[n].y=1; j++; } if(v[n].x>1440 && ok) cout<<n-1<<"\n",ok=0; } if(ok) cout<<n; for(;i<=a;i++) v[++n].x=A[i],v[n].y=0; for(;j<=b;j++) v[++n].x=B[j],v[n].y=1; lead=v[1].y; s[lead]++; for(i=2;i<=n;i++){ s[v[i].y]++; if(s[lead]<s[1-lead]){ cnt++; lead=1-lead; //cout<<v[i].x<<"-"; } } cout<<cnt; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...