# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
166934 | muhi1112 | Preokret (COCI18_preokret) | C++17 | 2 ms | 380 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define f1 first
#define s2 second
#define mp make_pair
#define pb push_back
#define ll long long
#define fri(a) freopen(a,"r",stdin);
#define fro(a) freopen(a,"w",stdout);
const int N=3e4+5;
bool cnt1[N],cnt2[N];
int ans1,ans2,n,a,x,y;
bool flag=0,flag1=0;
int main(){
//fri("in.txt");
//fro("out.txt");
ios_base::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
cin>>n;
for(int i=0;i<n;i++){
cin>>a;
if(a<=1440)ans1++;
cnt1[a]=1;
}
cin>>n;
for(int i=0;i<n;i++){
cin>>a;
if(a<=1440)ans1++;
cnt2[a]=1;
}
for(int i=0;i<=2880;i++){
if(cnt1[i]==1)x++;
if(cnt2[i]==1)y++;
if(((x>y && x>0 ) || (y>x && y>0)) && flag1==0){
flag1=1;
if(x>y)flag=1;
else flag=0;
continue;
}
if(flag1==1)
if(x>y && flag==0){
ans2++;
flag=1;
}
if(y>x && flag==1){
ans2++;
flag=0;
}
}
cout<<ans1<<endl;
cout<<ans2<<endl;
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |