| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 714127 | mongla | Preokret (COCI18_preokret) | C++17 | 1 ms | 340 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;
long long n,m,ans=0,anss=0,ld;
int a[3000],b[3000],jsa[3000],jsb[3000];
int main(){
	cin>>n;
	for(int i=1; i<=n; i++){
		cin>>a[i];
		if(a[i]<=1440) ans++;
		jsa[a[i]]=1;
	}
	scanf("%lld",&m);
	for(int i=1; i<=m; i++){
		cin>>b[i];
		if(b[i]<=1440) ans++;
		jsb[b[i]]=1;
	}
	cout<<ans<<endl;
	for(int i=1; i<=3000; i++)
		jsa[i]+=jsa[i-1],jsb[i]+=jsb[i-1];
	for(int i=1; i<=3000; i++)
	{
		if(jsa[i]>jsb[i] && jsa[i-1]==jsb[i-1] && ld==2)
			anss++;
		if(jsa[i]<jsb[i] && jsa[i-1]==jsb[i-1] && ld==1)
			anss++;
		if(jsa[i]!=jsb[i])
		{
			if(jsa[i]>jsb[i]) ld=1;
			else ld=2;
		}
	}
	cout<<anss;
	return 0;
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
