답안 #974418

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
974418 2024-05-03T10:10:22 Z Kenjikrab Gap (APIO16_gap) C++14
19.1923 / 100
34 ms 3120 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)
{
	int cnt=N;
	ll A=1e18;
	ll ans=0;
	ll mn,mx;
	MinMax((ll)0,A,&mn,&mx);
	if(N==2)return mx-mn;
	if(N==3||N==4)
	{
		ll mn1,mx1;
		MinMax(mn+1,mx-1,&mn1,&mx1);
		return max(max(mn1-mn,mx-mx1),mx1-mn1);
	}
	ans=(mn-mx-1)/(N-1)+1;
	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;
	
}
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 1 ms 2392 KB Output isn't correct
3 Correct 1 ms 2392 KB Output is correct
4 Incorrect 1 ms 2392 KB Output isn't correct
5 Incorrect 0 ms 2392 KB Output isn't 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 Incorrect 1 ms 2392 KB Output isn't 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 2432 KB Output is correct
14 Correct 1 ms 2392 KB Output is correct
15 Incorrect 1 ms 2392 KB Output isn't correct
16 Correct 8 ms 2592 KB Output is correct
17 Correct 6 ms 2588 KB Output is correct
18 Correct 7 ms 2572 KB Output is correct
19 Correct 6 ms 2584 KB Output is correct
20 Correct 3 ms 2572 KB Output is correct
21 Correct 24 ms 2916 KB Output is correct
22 Correct 24 ms 2856 KB Output is correct
23 Correct 21 ms 2856 KB Output is correct
24 Correct 21 ms 2852 KB Output is correct
25 Incorrect 34 ms 3120 KB Output isn't correct
26 Correct 20 ms 2852 KB Output is correct
27 Correct 20 ms 2856 KB Output is correct
28 Correct 23 ms 2852 KB Output is correct
29 Correct 21 ms 3044 KB Output is correct
30 Correct 8 ms 2848 KB Output is correct
31 Correct 1 ms 2644 KB Output is correct
32 Correct 1 ms 2392 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Partially correct 0 ms 2644 KB Partially correct
3 Partially correct 1 ms 2392 KB Partially correct
4 Correct 1 ms 2392 KB Output is correct
5 Partially correct 0 ms 2392 KB Partially correct
6 Partially correct 1 ms 2404 KB Partially correct
7 Partially correct 1 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 2392 KB Partially correct
11 Partially correct 1 ms 2392 KB Partially correct
12 Partially correct 1 ms 2392 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 7 ms 2752 KB Partially correct
17 Partially correct 7 ms 2616 KB Partially correct
18 Partially correct 6 ms 2560 KB Partially correct
19 Partially correct 5 ms 2580 KB Partially correct
20 Partially correct 2 ms 2572 KB Partially correct
21 Partially correct 27 ms 2968 KB Partially correct
22 Partially correct 23 ms 2856 KB Partially correct
23 Partially correct 20 ms 2868 KB Partially correct
24 Partially correct 21 ms 3024 KB Partially correct
25 Partially correct 33 ms 3104 KB Partially correct
26 Partially correct 29 ms 2848 KB Partially correct
27 Partially correct 21 ms 2860 KB Partially correct
28 Partially correct 23 ms 2856 KB Partially correct
29 Partially correct 22 ms 2788 KB Partially correct
30 Partially correct 9 ms 2856 KB Partially correct
31 Correct 1 ms 2392 KB Output is correct
32 Correct 1 ms 2392 KB Output is correct