oj.uz

Submission #974461

# Submission time Handle Problem Language Result Execution time Memory
974461 2024-05-03T11:04:35 Z Kenjikrab Gap (APIO16_gap) C++14
100 / 100
 39 ms 3352 KB 
#include "gap.h"
#include<bits/stdc++.h>
#define ll long long
#define fi first
#define se second
using namespace std;
long long findGap(int T, int N)
{
	if(T==1)
	{
		ll ans=0;
		ll mn,mx;
		MinMax((ll)0,(ll)1e18,&mn,&mx);
		if(N==2)return mx-mn;
		for(int i=0;i<(N-1)/2;i++)
		{
			ll mn1,mx1;
			MinMax(mn+1,mx-1,&mn1,&mx1);
			ans=max(ans,mn1-mn);
			ans=max(ans,mx-mx1);
			
			mn=mn1;
			mx=mx1;
		}
		ans=max(ans,mx-mn);
		return ans;
	}
	else
	{
		ll ans=0;
		ll mn,mx;
		MinMax((ll)0,(ll)1e18,&mn,&mx);
		if(N==2)return mx-mn;
		ans=(mx-mn-1)/(N-1)+1;
		ll a=mn;
		while(a<mx)
		{
		 	ll mn1,mx1;
		 	ll temp;
		 	MinMax(a+1,a+ans+1,&mn1,&mx1);
		 	if(mn1==-1&&mx1==-1)
		 	{
		 		temp=a+ans+1;
		 		while(true)
		 		{
		 			MinMax(temp+1,a+(temp+1-a)*2,&mn1,&mx1);
		 			if(mn1==-1&&mx1==-1)
		 			{
		 				temp=a+(temp+1-a)*2;
		 				continue;
		 			}
		 			ans=mn1-a;
		 			a=mx1;
		 			break;
		 		}
		 	}
		 	else
		 	{
		 		if(mn1==a+ans+1&&mx1==a+ans+1)ans+=1;
		 		a=mx1;
		 	}
		 }
		 return ans;
	}
	// queue<pair<ll,ll>> q;
	// q.push({mn,mx});
	// while(cnt>0&&!q.empty())
	// {
	// 	ll l=q.front().fi,r=q.front().se;
	// 	q.pop();
	// 	if(l+1==r||l==r)
	// 	{
	// 		ans=max(ans,r-l);
	// 		continue;
	// 	}
	// 	ll mid=(l+r)>>1;
	// 	ll mn1,mx1;
	// 	MinMax(l,mid,&mn1,&mx1);
	// 	ll mn2,mx2;
	// 	MinMax(mid+1,r,&mn2,&mx2);
	// 	if(mn1==-1&&mx1==-1&&mn2==-1&&mx2==-1)ans=max(ans,r-l);
	// 	if(mn1!=-1)
	// 	{
	// 		cnt--;
	// 		if(mn1!=mx2)cnt--;
	// 	}
	// 	if(mn2!=-1)
	// 	{
	// 		cnt--;
	// 		if(mn2!=mx2)cnt--;
	// 	}
	// 	if(mx1!=-1&&mn2!=-1)ans=max(ans,mn2-mx1);

	// 	if(mn1!=-1)ans=max(ans,mn1-l);
	// 	else if(mn2!=-1)ans=max(ans,mn2-l);

	// 	if(mx2!=-1)ans=max(ans,r-mx2);
	// 	else if(mx1!=-1)ans=max(ans,r-mx1);

	// 	if(mn1!=mx1&&mx1-mn1>ans)q.push({mn1,mx1});
	// 	if(mn2!=mx2&&mx2-mn2>ans)q.push({mn2,mx2});
	// }
	// return (ll)ans;
	
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 2392 KB Output is correct
3 Correct 0 ms 2392 KB Output is correct
4 Correct 1 ms 2392 KB Output is correct
5 Correct 1 ms 2392 KB Output is correct
6 Correct 0 ms 2392 KB Output is correct
7 Correct 0 ms 2392 KB Output is correct
8 Correct 1 ms 2392 KB Output is correct
9 Correct 1 ms 2392 KB Output is correct
10 Correct 1 ms 2392 KB Output is correct
11 Correct 1 ms 2392 KB Output is correct
12 Correct 1 ms 2392 KB Output is correct
13 Correct 1 ms 2392 KB Output is correct
14 Correct 1 ms 2392 KB Output is correct
15 Correct 1 ms 2392 KB Output is correct
16 Correct 8 ms 2560 KB Output is correct
17 Correct 8 ms 2584 KB Output is correct
18 Correct 8 ms 2680 KB Output is correct
19 Correct 8 ms 2588 KB Output is correct
20 Correct 6 ms 2568 KB Output is correct
21 Correct 29 ms 2852 KB Output is correct
22 Correct 29 ms 2856 KB Output is correct
23 Correct 30 ms 2856 KB Output is correct
24 Correct 29 ms 2860 KB Output is correct
25 Correct 27 ms 2852 KB Output is correct
26 Correct 38 ms 2848 KB Output is correct
27 Correct 29 ms 2856 KB Output is correct
28 Correct 30 ms 2856 KB Output is correct
29 Correct 29 ms 2860 KB Output is correct
30 Correct 24 ms 2848 KB Output is correct
31 Correct 1 ms 2588 KB Output is correct
32 Correct 1 ms 2392 KB Output is correct

Subtask #2
70.0 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 1 ms 2388 KB Output is correct
4 Correct 1 ms 2392 KB Output is correct
5 Correct 1 ms 2392 KB Output is correct
6 Correct 1 ms 2392 KB Output is correct
7 Correct 1 ms 2392 KB Output is correct
8 Correct 0 ms 2392 KB Output is correct
9 Correct 1 ms 2392 KB Output is correct
10 Correct 1 ms 2388 KB Output is correct
11 Correct 1 ms 2392 KB Output is correct
12 Correct 1 ms 2392 KB Output is correct
13 Correct 1 ms 2392 KB Output is correct
14 Correct 1 ms 2392 KB Output is correct
15 Correct 1 ms 2392 KB Output is correct
16 Correct 6 ms 2752 KB Output is correct
17 Correct 5 ms 2584 KB Output is correct
18 Correct 5 ms 2592 KB Output is correct
19 Correct 5 ms 2584 KB Output is correct
20 Correct 3 ms 2568 KB Output is correct
21 Correct 19 ms 2840 KB Output is correct
22 Correct 22 ms 3352 KB Output is correct
23 Correct 21 ms 2852 KB Output is correct
24 Correct 19 ms 2864 KB Output is correct
25 Correct 39 ms 2856 KB Output is correct
26 Correct 20 ms 2860 KB Output is correct
27 Correct 19 ms 2860 KB Output is correct
28 Correct 22 ms 3096 KB Output is correct
29 Correct 19 ms 3096 KB Output is correct
30 Correct 11 ms 2852 KB Output is correct
31 Correct 1 ms 2392 KB Output is correct
32 Correct 1 ms 2392 KB Output is correct