답안 #1015219

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1015219 2024-07-06T07:38:38 Z vjudge1 Gap (APIO16_gap) C++17
72.604 / 100
34 ms 2008 KB
#include "gap.h"
#include <bits/stdc++.h>

using namespace std;

#define ll long long

long long findGap(signed t,signed n)
{
	if (t==2 && n>60)
	{
		ll mn1,mx1;
		MinMax(0,(ll)1e18,&mn1,&mx1);
		ll st,mn,mx,ans=0;
		for (int i=0;i<=60;i++)
		{
			MinMax(mn1+1,mn1+(1LL<<i),&mn,&mx);
			if (mn!=-1)
			{
				ans=mn-mn1;
				st=mx;
				break;
			}
		}
		while (st<mx1)
		{
			MinMax(st+1,st+ans,&mn,&mx);
			if (mn!=-1)
				st=mx;
			else
			{
				ll val=ans*2;
				while (1)
				{
					MinMax(st+1,st+val,&mn,&mx);
					if (mn!=-1)
					{
						ans=mn-st;
						st=mx;
						break;
					}
					val*=2;
				}
			}
		}
		return ans;
	}
	else
	{
		long long a[n],i=0,j=n-1,lim1=0,lim2=1e18;
		long long mn,mx;
		while (i<=j)
		{
			MinMax(lim1,lim2,&mn,&mx);
			a[i++]=mn;
			a[j--]=mx;
			lim1=mn+1;
			lim2=mx-1;
		}
		long long ans=0;
		for (int i=0;i<n-1;i++)
			ans=max(ans,a[i+1]-a[i]);
		
		return ans;
	}
}

Compilation message

gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:38:10: warning: 'st' may be used uninitialized in this function [-Wmaybe-uninitialized]
   38 |       ans=mn-st;
      |       ~~~^~~~~~
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 9 ms 600 KB Output is correct
17 Correct 6 ms 632 KB Output is correct
18 Correct 6 ms 600 KB Output is correct
19 Correct 6 ms 604 KB Output is correct
20 Correct 5 ms 600 KB Output is correct
21 Correct 25 ms 1880 KB Output is correct
22 Correct 25 ms 2008 KB Output is correct
23 Correct 25 ms 1880 KB Output is correct
24 Correct 34 ms 1880 KB Output is correct
25 Correct 23 ms 1880 KB Output is correct
26 Correct 29 ms 1880 KB Output is correct
27 Correct 25 ms 1880 KB Output is correct
28 Correct 24 ms 1880 KB Output is correct
29 Correct 22 ms 1880 KB Output is correct
30 Correct 20 ms 2000 KB Output is correct
31 Correct 0 ms 344 KB Output is correct
32 Correct 0 ms 344 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Partially correct 0 ms 344 KB Partially correct
3 Partially correct 0 ms 344 KB Partially correct
4 Partially correct 0 ms 344 KB Partially correct
5 Partially correct 0 ms 344 KB Partially correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Partially correct 1 ms 344 KB Partially correct
16 Correct 5 ms 572 KB Output is correct
17 Correct 5 ms 600 KB Output is correct
18 Correct 4 ms 600 KB Output is correct
19 Correct 5 ms 600 KB Output is correct
20 Correct 4 ms 600 KB Output is correct
21 Correct 17 ms 1112 KB Output is correct
22 Correct 23 ms 996 KB Output is correct
23 Correct 16 ms 1112 KB Output is correct
24 Correct 14 ms 1112 KB Output is correct
25 Partially correct 32 ms 1208 KB Partially correct
26 Correct 17 ms 1112 KB Output is correct
27 Correct 17 ms 1112 KB Output is correct
28 Correct 22 ms 1112 KB Output is correct
29 Correct 15 ms 1112 KB Output is correct
30 Correct 16 ms 1108 KB Output is correct
31 Partially correct 0 ms 344 KB Partially correct
32 Correct 0 ms 344 KB Output is correct