# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
792972 | Trisanu_Das | Preokret (COCI18_preokret) | C++17 | 0 ms | 0 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;
vector<pair<int, int> >v;
int ans,cnt[N];
signed main(){
ios::sync_with_stdio(0);
cin.tie(0);
int n,m,i,j,k;
cin>>n;
for(i=0;i<n;i++){
cin>>j;
cnt[j]++;
if(j<=1440)ans++;
}
cin>>m;
for(i=0;i<m;i++){
cin>>j;
cnt[j]--;
if(j<=1440)ans++;
}
int ans2=-1,res=0,now=0;
for(i=1;i<=2880;i++){
now+=cnt[i];
if(res!=1&&now>0)ans2++,res=1;
if(res!=-1&&now<0)ans2++,res=-1;
}
cout<<ans<<'\n'<<ans2<<'\n';
}