Submission #578763

# Submission time Handle Problem Language Result Execution time Memory
578763 2022-06-17T22:45:11 Z MohamedAhmed04 Gap (APIO16_gap) C++14
70 / 100
65 ms 3260 KB
#include "gap.h"
#include <bits/stdc++.h>

using namespace std ;

long long solve1(int N)
{
	long long L = 1 , R = 1e18 ;
	vector<long long>v ;
	while(L <= R)
	{
		long long x , y ;
		MinMax(L , R , &x , &y) ;
		if(x == -1)
			break ;
		v.push_back(x) , v.push_back(y) ;
		L = x+1 , R = y-1 ;
	}
	sort(v.begin() , v.end()) ;
	long long ans = 0 ;
	int sz = v.size() ;
	for(int i = 1 ; i < sz ; ++i)
		ans = max(ans , v[i] - v[i-1]) ;
	return ans ;
}

long long solve2(int N)
{
	long long L , R ;
	MinMax(1 , 1e18 , &L , &R) ;
	long long sz = (R-L+1 + N-1) / N ;
	vector<long long>v ;
	v.push_back(L) ;
	for(long long i = L ; i < R ; i += sz)
	{
		long long l = max(i , L+1) , r = min(i+sz-1 , R-1) ;
		if(l > r)
			continue ;
		long long x , y ;
		MinMax(l , r , &x , &y) ;
		if(x != -1 && y != -1)
			v.push_back(x) , v.push_back(y) ;
	}
	v.push_back(R) ;
	sz = v.size() ;
	long long ans = 0 ;
	for(int i = 1 ; i < sz ; ++i)
		ans = max(ans , v[i] - v[i-1]) ;
	return ans ;
}

long long findGap(int T, int N)
{
	if(T == 1)
		return solve1(N) ;
	else
		return solve2(N) ;
}
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 208 KB Output isn't correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Incorrect 0 ms 208 KB Output isn't correct
7 Incorrect 0 ms 208 KB Output isn't correct
8 Incorrect 1 ms 208 KB Output isn't correct
9 Incorrect 0 ms 208 KB Output isn't correct
10 Correct 0 ms 208 KB Output is correct
11 Incorrect 1 ms 336 KB Output isn't correct
12 Incorrect 2 ms 336 KB Output isn't correct
13 Incorrect 1 ms 336 KB Output isn't correct
14 Incorrect 1 ms 336 KB Output isn't correct
15 Incorrect 1 ms 336 KB Output isn't correct
16 Incorrect 11 ms 848 KB Output isn't correct
17 Incorrect 10 ms 848 KB Output isn't correct
18 Incorrect 14 ms 824 KB Output isn't correct
19 Incorrect 11 ms 848 KB Output isn't correct
20 Correct 8 ms 848 KB Output is correct
21 Incorrect 48 ms 2192 KB Output isn't correct
22 Incorrect 45 ms 2200 KB Output isn't correct
23 Incorrect 45 ms 2188 KB Output isn't correct
24 Incorrect 45 ms 2144 KB Output isn't correct
25 Incorrect 43 ms 2240 KB Output isn't correct
26 Incorrect 46 ms 2216 KB Output isn't correct
27 Incorrect 48 ms 2144 KB Output isn't correct
28 Incorrect 48 ms 2232 KB Output isn't correct
29 Incorrect 41 ms 2244 KB Output isn't correct
30 Correct 36 ms 2220 KB Output is correct
31 Correct 0 ms 208 KB Output is correct
32 Correct 1 ms 256 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 0 ms 208 KB Output is correct
7 Correct 0 ms 208 KB Output is correct
8 Correct 0 ms 208 KB Output is correct
9 Correct 1 ms 208 KB Output is correct
10 Correct 0 ms 208 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 14 ms 848 KB Output is correct
17 Correct 13 ms 892 KB Output is correct
18 Correct 14 ms 848 KB Output is correct
19 Correct 18 ms 880 KB Output is correct
20 Correct 7 ms 528 KB Output is correct
21 Correct 53 ms 2240 KB Output is correct
22 Correct 51 ms 2240 KB Output is correct
23 Correct 62 ms 2192 KB Output is correct
24 Correct 65 ms 2172 KB Output is correct
25 Correct 51 ms 3260 KB Output is correct
26 Correct 62 ms 2240 KB Output is correct
27 Correct 63 ms 2192 KB Output is correct
28 Correct 57 ms 2164 KB Output is correct
29 Correct 59 ms 2252 KB Output is correct
30 Correct 28 ms 1480 KB Output is correct
31 Correct 0 ms 208 KB Output is correct
32 Correct 0 ms 208 KB Output is correct