Submission #1025261

# Submission time Handle Problem Language Result Execution time Memory
1025261 2024-07-16T18:41:06 Z _8_8_ Gap (APIO16_gap) C++17
70 / 100
45 ms 4804 KB
#include "gap.h"
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
ll findGap(int tc, int n){
	ll L,R;
	MinMax(0,(ll)1e18,&L,&R);
	if(R - L + 1 == n) return 1;
	ll s = (R - L + n - 1) / (n - 1);
	vector<ll> vals;
	for(ll i = L;i <= R;i += s){
		ll nx = min(R,i + s -1);	
		ll _l,_r;
		MinMax(i,nx,&_l,&_r);
		if(_l!=-1 && _l <= nx){
			vals.push_back(_l);
			vals.push_back(_r);
		}
	}
	assert((int)vals.size() >= 2);
	ll ret = 0;
	// for(ll o:vals){
	// 	cout << o << ' ';
	// }
	// cout << '\n';
	for(int i = 1;i < (int)vals.size();i++){
		ret = max(ret,vals[i] - vals[i  - 1]);
	}
	return ret;
}
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Incorrect 1 ms 2392 KB Output isn't correct
3 Incorrect 0 ms 2392 KB Output isn't correct
4 Incorrect 0 ms 2392 KB Output isn't correct
5 Incorrect 1 ms 2392 KB Output isn't correct
6 Incorrect 0 ms 2392 KB Output isn't correct
7 Incorrect 1 ms 2392 KB Output isn't correct
8 Incorrect 1 ms 2392 KB Output isn't correct
9 Incorrect 0 ms 2392 KB Output isn't correct
10 Incorrect 1 ms 2392 KB Output isn't correct
11 Incorrect 1 ms 2484 KB Output isn't correct
12 Incorrect 1 ms 2392 KB Output isn't correct
13 Incorrect 1 ms 2392 KB Output isn't correct
14 Incorrect 1 ms 2392 KB Output isn't correct
15 Incorrect 1 ms 2392 KB Output isn't correct
16 Incorrect 9 ms 2904 KB Output isn't correct
17 Incorrect 12 ms 2904 KB Output isn't correct
18 Incorrect 9 ms 2904 KB Output isn't correct
19 Incorrect 11 ms 2904 KB Output isn't correct
20 Incorrect 5 ms 2392 KB Output isn't correct
21 Incorrect 36 ms 3792 KB Output isn't correct
22 Incorrect 36 ms 3792 KB Output isn't correct
23 Incorrect 36 ms 3856 KB Output isn't correct
24 Incorrect 39 ms 3904 KB Output isn't correct
25 Incorrect 34 ms 4804 KB Output isn't correct
26 Incorrect 36 ms 3836 KB Output isn't correct
27 Incorrect 36 ms 3788 KB Output isn't correct
28 Incorrect 36 ms 3792 KB Output isn't correct
29 Incorrect 35 ms 3792 KB Output isn't correct
30 Incorrect 21 ms 3152 KB Output isn't correct
31 Incorrect 1 ms 2392 KB Output isn't correct
32 Incorrect 0 ms 2392 KB Output isn't correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 2388 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 0 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 0 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 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 12 ms 2904 KB Output is correct
17 Correct 9 ms 2940 KB Output is correct
18 Correct 11 ms 2904 KB Output is correct
19 Correct 9 ms 2904 KB Output is correct
20 Correct 5 ms 2392 KB Output is correct
21 Correct 37 ms 3932 KB Output is correct
22 Correct 43 ms 3792 KB Output is correct
23 Correct 35 ms 3824 KB Output is correct
24 Correct 36 ms 3792 KB Output is correct
25 Correct 40 ms 4804 KB Output is correct
26 Correct 44 ms 3996 KB Output is correct
27 Correct 36 ms 3848 KB Output is correct
28 Correct 36 ms 3828 KB Output is correct
29 Correct 45 ms 3992 KB Output is correct
30 Correct 21 ms 3152 KB Output is correct
31 Correct 1 ms 2392 KB Output is correct
32 Correct 0 ms 2392 KB Output is correct