Submission #977850

# Submission time Handle Problem Language Result Execution time Memory
977850 2024-05-08T11:52:18 Z Amaarsaa Gap (APIO16_gap) C++14
30 / 100
38 ms 3884 KB
#include<bits/stdc++.h>
#include "gap.h"
using namespace std;
using ll =long long;
ll Sub1(ll N) {
	ll b[N + 2],ans, lo1, hi1, lo, hi, l, r;
	l = 1;
	r = N;
	lo = 0;
	hi = LONG_MAX;
	while ( l <= r) {
		MinMax(lo, hi, &lo1, &hi1);
		if (lo1 == -1) break;
		b[l] = lo1;
		b[r] = hi1;
		lo = lo1 + 1;
		hi = hi1 - 1;
		l ++;
		r --;
	}
	ans = 0;
	for (int i = 2; i <= N; i ++) {
		ans =max(ans, b[i] - b[i - 1]);
	}
	return ans;
}
ll Sub2(ll N) {
	return N;
}
long long findGap(int T, int N) {
	if ( T == 1) {
		return Sub1(N); 
	}
	else return Sub1(N);
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 2388 KB Output is correct
3 Correct 1 ms 2400 KB Output is correct
4 Correct 1 ms 2392 KB Output is correct
5 Correct 1 ms 2644 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 2644 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 8 ms 2648 KB Output is correct
17 Correct 9 ms 2572 KB Output is correct
18 Correct 8 ms 2588 KB Output is correct
19 Correct 8 ms 2584 KB Output is correct
20 Correct 7 ms 2576 KB Output is correct
21 Correct 32 ms 3628 KB Output is correct
22 Correct 38 ms 3620 KB Output is correct
23 Correct 30 ms 3644 KB Output is correct
24 Correct 30 ms 3620 KB Output is correct
25 Correct 27 ms 3644 KB Output is correct
26 Correct 30 ms 3624 KB Output is correct
27 Correct 31 ms 3884 KB Output is correct
28 Correct 37 ms 3616 KB Output is correct
29 Correct 32 ms 3572 KB Output is correct
30 Correct 24 ms 3628 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 1 ms 2392 KB Output is correct
2 Partially correct 1 ms 2392 KB Partially correct
3 Partially correct 0 ms 2392 KB Partially correct
4 Partially correct 1 ms 2392 KB Partially correct
5 Partially correct 1 ms 2392 KB Partially correct
6 Partially correct 1 ms 2392 KB Partially correct
7 Partially correct 1 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 1 ms 2392 KB Partially correct
11 Partially correct 2 ms 2392 KB Partially correct
12 Partially correct 2 ms 2392 KB Partially correct
13 Partially correct 1 ms 2552 KB Partially correct
14 Partially correct 1 ms 2392 KB Partially correct
15 Partially correct 1 ms 2392 KB Partially correct
16 Partially correct 8 ms 2584 KB Partially correct
17 Partially correct 8 ms 2580 KB Partially correct
18 Partially correct 8 ms 2584 KB Partially correct
19 Partially correct 8 ms 2584 KB Partially correct
20 Partially correct 7 ms 2648 KB Partially correct
21 Incorrect 31 ms 3628 KB Expected int32, but "2500100000" found
22 Incorrect 37 ms 3620 KB Expected int32, but "2500100000" found
23 Incorrect 33 ms 3628 KB Expected int32, but "2500100000" found
24 Incorrect 34 ms 3632 KB Expected int32, but "2500100000" found
25 Incorrect 29 ms 3620 KB Expected int32, but "2500100000" found
26 Incorrect 31 ms 3624 KB Expected int32, but "2500100000" found
27 Incorrect 37 ms 3600 KB Expected int32, but "2500100000" found
28 Incorrect 31 ms 3624 KB Expected int32, but "2500100000" found
29 Incorrect 30 ms 3624 KB Expected int32, but "2500100000" found
30 Incorrect 31 ms 3636 KB Expected int32, but "2500100000" found
31 Partially correct 1 ms 2392 KB Partially correct
32 Partially correct 1 ms 2392 KB Partially correct