Submission #1027442

# Submission time Handle Problem Language Result Execution time Memory
1027442 2024-07-19T06:28:50 Z Muhammet Gap (APIO16_gap) C++17
30 / 100
35 ms 3924 KB
#include <bits/stdc++.h>
#include "gap.h"

using namespace std;

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

ll findGap(int T, int n){
	vector <ll> v, v1;
	ll k = 0;
	ll ans = 0;
	for(int i = 1; i <= (n+1)/2; i++){
		ll s, t, mn, mx;
		if(i == 1) s = 0, t = 1e18;
		else s = v.back()+1, t = v1.back()-1;
		if(s > t) break;
		MinMax(s, t, &mn, &mx);
		if(mn != -1) v.push_back(mn);
		if(mx != -1) v1.push_back(mx);
		k += (t-s+1);
		if(sz(v) > 1) ans = max(ans, (v.back()-v[sz(v)-2]));
		if(sz(v1) > 1) ans = max(ans, (v1[sz(v1)-2]-v1.back()));
		if(i == (n+1)/2) ans = max(ans, v1.back()-v.back());
	}
	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 1 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 0 ms 2392 KB Output is correct
7 Correct 0 ms 2468 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 9 ms 2720 KB Output is correct
17 Correct 7 ms 2720 KB Output is correct
18 Correct 7 ms 2648 KB Output is correct
19 Correct 7 ms 2904 KB Output is correct
20 Correct 6 ms 2732 KB Output is correct
21 Correct 26 ms 3708 KB Output is correct
22 Correct 34 ms 3716 KB Output is correct
23 Correct 28 ms 3716 KB Output is correct
24 Correct 25 ms 3716 KB Output is correct
25 Correct 30 ms 3708 KB Output is correct
26 Correct 25 ms 3708 KB Output is correct
27 Correct 28 ms 3924 KB Output is correct
28 Correct 35 ms 3716 KB Output is correct
29 Correct 25 ms 3716 KB Output is correct
30 Correct 21 ms 3716 KB Output is correct
31 Correct 1 ms 2392 KB Output is correct
32 Correct 0 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 0 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 0 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 2440 KB Partially correct
16 Partially correct 6 ms 2780 KB Partially correct
17 Partially correct 6 ms 2740 KB Partially correct
18 Partially correct 7 ms 2904 KB Partially correct
19 Partially correct 7 ms 2736 KB Partially correct
20 Partially correct 5 ms 2904 KB Partially correct
21 Incorrect 26 ms 3556 KB Expected int32, but "2500100000" found
22 Incorrect 25 ms 3708 KB Expected int32, but "2500100000" found
23 Incorrect 26 ms 3716 KB Expected int32, but "2500100000" found
24 Incorrect 25 ms 3608 KB Expected int32, but "2500100000" found
25 Incorrect 25 ms 3620 KB Expected int32, but "2500100000" found
26 Incorrect 25 ms 3724 KB Expected int32, but "2500100000" found
27 Incorrect 25 ms 3716 KB Expected int32, but "2500100000" found
28 Incorrect 25 ms 3548 KB Expected int32, but "2500100000" found
29 Incorrect 34 ms 3716 KB Expected int32, but "2500100000" found
30 Incorrect 21 ms 3716 KB Expected int32, but "2500100000" found
31 Partially correct 0 ms 2392 KB Partially correct
32 Partially correct 0 ms 2392 KB Partially correct