답안 #974449

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
974449	2024-05-03T10:51:48 Z	Kenjikrab	Gap (APIO16_gap)	C++14	30 / 100	40 ms	3100 KB

gap

#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)
{
	int cnt=N;
	ll A=1e18;
	ll ans=0;
	ll mn,mx;
	MinMax((ll)0,A,&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;
	//ans=(mx-mn-1)/(N-1)+1;
	// int 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;
	// 	}
	// 	cout<<a<<" "<<ans<<endl;
	// }
	// 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;
	
}

Compilation message

gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:9:6: warning: unused variable 'cnt' [-Wunused-variable]
    9 |  int cnt=N;
      |      ^~~

Subtask #1

30.0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	1 ms	2392 KB	Output is correct
3	Correct	1 ms	2392 KB	Output is correct
4	Correct	0 ms	2392 KB	Output is correct
5	Correct	0 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	1 ms	2392 KB	Output is correct
9	Correct	0 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	9 ms	2584 KB	Output is correct
17	Correct	7 ms	2580 KB	Output is correct
18	Correct	7 ms	2696 KB	Output is correct
19	Correct	7 ms	2584 KB	Output is correct
20	Correct	6 ms	2572 KB	Output is correct
21	Correct	31 ms	2860 KB	Output is correct
22	Correct	40 ms	2796 KB	Output is correct
23	Correct	32 ms	2848 KB	Output is correct
24	Correct	28 ms	2856 KB	Output is correct
25	Correct	28 ms	2852 KB	Output is correct
26	Correct	35 ms	3044 KB	Output is correct
27	Correct	29 ms	2856 KB	Output is correct
28	Correct	35 ms	2860 KB	Output is correct
29	Correct	32 ms	2852 KB	Output is correct
30	Correct	24 ms	2852 KB	Output is correct
31	Correct	1 ms	2392 KB	Output is correct
32	Correct	1 ms	2388 KB	Output is correct

Subtask #2

0 / 70.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	2392 KB	Output is correct
2	Partially correct	1 ms	2392 KB	Partially correct
3	Partially correct	1 ms	2392 KB	Partially correct
4	Partially correct	1 ms	2392 KB	Partially correct
5	Partially correct	1 ms	2392 KB	Partially correct
6	Partially correct	1 ms	2392 KB	Partially correct
7	Partially correct	0 ms	2392 KB	Partially correct
8	Partially correct	1 ms	2392 KB	Partially correct
9	Partially correct	1 ms	2392 KB	Partially correct
10	Partially correct	1 ms	2480 KB	Partially correct
11	Partially correct	1 ms	2392 KB	Partially correct
12	Partially correct	1 ms	2388 KB	Partially correct
13	Partially correct	1 ms	2392 KB	Partially correct
14	Partially correct	1 ms	2392 KB	Partially correct
15	Partially correct	1 ms	2392 KB	Partially correct
16	Partially correct	8 ms	2584 KB	Partially correct
17	Partially correct	11 ms	2580 KB	Partially correct
18	Partially correct	10 ms	2584 KB	Partially correct
19	Partially correct	7 ms	2588 KB	Partially correct
20	Partially correct	7 ms	2576 KB	Partially correct
21	Incorrect	28 ms	2864 KB	Expected int32, but "2500100000" found
22	Incorrect	28 ms	2856 KB	Expected int32, but "2500100000" found
23	Incorrect	32 ms	2856 KB	Expected int32, but "2500100000" found
24	Incorrect	28 ms	2860 KB	Expected int32, but "2500100000" found
25	Incorrect	25 ms	2848 KB	Expected int32, but "2500100000" found
26	Incorrect	28 ms	2856 KB	Expected int32, but "2500100000" found
27	Incorrect	32 ms	2796 KB	Expected int32, but "2500100000" found
28	Incorrect	33 ms	3100 KB	Expected int32, but "2500100000" found
29	Incorrect	28 ms	2852 KB	Expected int32, but "2500100000" found
30	Incorrect	23 ms	2864 KB	Expected int32, but "2500100000" found
31	Partially correct	1 ms	2388 KB	Partially correct
32	Partially correct	1 ms	2392 KB	Partially correct