| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 106653 | Fasho | Preokret (COCI18_preokret) | C++14 | 3 ms | 384 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>
#define N 1000005
#define ll long long int 	
#define MP make_pair
#define pb push_back
#define ppb pop_back
#define sp " "
#define endl "\n"
#define fi first
#define se second
#define ii pair<int,int>
#define lli pair<ll,ll>
#define fast cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(false)
#define fast2 freopen ("myfile.in","r",stdin);freopen ("myfile.out","w",stdout);
#define mod 1000000007
#define fs(x,y) for(int i=1;i<=y;i++) cin>>x[i]
#define fo(i,x,y) for(int i=x;i<=y;i++)
using namespace std;
ll n,m,ar[N],sum;
vector<ii> v,bos;
int main()
{
	fast;
	ll x=24*60;
	cin>>n;
	fo(i,1,n)
	{
		ll a;
		cin>>a;
			ii tmp;
			tmp.fi=a;
			tmp.se=1;
		if(a<=x)
		{
			bos.pb(tmp);
		}
		v.pb(tmp);
	}
	cin>>m;
	fo(i,1,m)
	{
		ll a;
		cin>>a;
			ii tmp;
			tmp.fi=a;
			tmp.se=2;
		if(a<=x)
		{
			bos.pb(tmp);
		}
			v.pb(tmp);
	}
	ll a=0;
	
	sort(v.begin(),v.end());
	ll tut=0;
	cout<<bos.size()<<endl;
	fo(i,0,v.size()-1)
	{
		int tmp2=v[i].se;
		if(tmp2==1)
			a--;
		else
			a++;
		if(tut==-1 && a>0)
			sum++;
		if(tut==1 && a<0)
			sum++;
		if(a>0)
			tut=1;
		if(a<0)
			tut=-1;
	}
	cout<<sum;
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
