Submission #1027380

# Submission time Handle Problem Language Result Execution time Memory
1027380 2024-07-19T05:29:54 Z Muhammet Gap (APIO16_gap) C++17
30 / 100
37 ms 4436 KB
#include <bits/stdc++.h>
#include "gap.h"

#define ll long long
#define sz(s) (int)s.size()

using namespace std;

long long findGap(int T, int n){
	vector <ll> v, v1;
	for(int i = 0; i < (n+1)/2; i++){
		ll s, t, mn, mx;
		if(i == 0) s = 0, t = 1e18;
		else s = v.back()+1, t = v1.back()-1;
		MinMax(s, t, &mn, &mx);
		v.push_back(mn);
		v1.push_back(mx);
	}
	if(v.back() == v1.back()) v1.pop_back();
	while(sz(v1) > 0){
		v.push_back(v1.back());
		v1.pop_back();
	}
	ll ans = 0;
	for(int i = 0; i < n-1; i++){
		ans = max(ans, v[i+1]-v[i]);
	}
	return ans;
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 2392 KB Output is correct
3 Correct 0 ms 2392 KB Output is correct
4 Correct 1 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 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 7 ms 3032 KB Output is correct
17 Correct 8 ms 2904 KB Output is correct
18 Correct 7 ms 2904 KB Output is correct
19 Correct 7 ms 2904 KB Output is correct
20 Correct 6 ms 2896 KB Output is correct
21 Correct 26 ms 4220 KB Output is correct
22 Correct 26 ms 4420 KB Output is correct
23 Correct 26 ms 4212 KB Output is correct
24 Correct 27 ms 4220 KB Output is correct
25 Correct 29 ms 4220 KB Output is correct
26 Correct 34 ms 4212 KB Output is correct
27 Correct 26 ms 4220 KB Output is correct
28 Correct 30 ms 4436 KB Output is correct
29 Correct 26 ms 4208 KB Output is correct
30 Correct 21 ms 4220 KB Output is correct
31 Correct 1 ms 2392 KB Output is correct
32 Correct 1 ms 2392 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 2392 KB Output is correct
2 Partially correct 0 ms 2392 KB Partially correct
3 Partially correct 0 ms 2392 KB Partially correct
4 Partially correct 0 ms 2392 KB Partially correct
5 Partially correct 1 ms 2392 KB Partially correct
6 Partially correct 0 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 0 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 9 ms 2904 KB Partially correct
17 Partially correct 6 ms 2996 KB Partially correct
18 Partially correct 8 ms 2904 KB Partially correct
19 Partially correct 9 ms 2988 KB Partially correct
20 Partially correct 5 ms 2904 KB Partially correct
21 Incorrect 28 ms 4220 KB Expected int32, but "2500100000" found
22 Incorrect 36 ms 4360 KB Expected int32, but "2500100000" found
23 Incorrect 34 ms 4220 KB Expected int32, but "2500100000" found
24 Incorrect 27 ms 4220 KB Expected int32, but "2500100000" found
25 Incorrect 24 ms 4280 KB Expected int32, but "2500100000" found
26 Incorrect 27 ms 4220 KB Expected int32, but "2500100000" found
27 Incorrect 28 ms 4212 KB Expected int32, but "2500100000" found
28 Incorrect 28 ms 4220 KB Expected int32, but "2500100000" found
29 Incorrect 37 ms 4212 KB Expected int32, but "2500100000" found
30 Incorrect 23 ms 4212 KB Expected int32, but "2500100000" found
31 Partially correct 0 ms 2392 KB Partially correct
32 Partially correct 0 ms 2392 KB Partially correct