Submission #42624

# Submission time Handle Problem Language Result Execution time Memory
42624 2018-03-01T14:08:15 Z MatheusLealV Gap (APIO16_gap) C++14
0 / 100
75 ms 40028 KB
#include <bits/stdc++.h>
#include "gap.h"
#define N 100005
using namespace std;
typedef long long ll;

ll n, v[N], ans[N];

ll findGap(int T, int N_)
{
	n = N_;

	ll esq = 0, dir = 2000000000000000000LL, best = 0;

	for(int i = 1, st = 1, en = n; i <= (n + 1)/2; i++, st ++, en --)
	{
		ll a, b;

		MinMax(esq, dir, &a, &b);

		esq = a + 1, dir = b - 1;

		ans[st] = a, ans[en] = b;
	}

	for(int i = 1; i <= n; i++) best = max(best, ans[i] - ans[i - 1]);

	return best;
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 248 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 2 ms 540 KB Output is correct
4 Correct 2 ms 648 KB Output is correct
5 Incorrect 1 ms 676 KB Output isn't correct
6 Correct 2 ms 692 KB Output is correct
7 Correct 2 ms 724 KB Output is correct
8 Correct 2 ms 744 KB Output is correct
9 Correct 1 ms 744 KB Output is correct
10 Correct 2 ms 812 KB Output is correct
11 Correct 2 ms 816 KB Output is correct
12 Correct 2 ms 816 KB Output is correct
13 Correct 2 ms 836 KB Output is correct
14 Correct 2 ms 860 KB Output is correct
15 Incorrect 2 ms 944 KB Output isn't correct
16 Correct 15 ms 1688 KB Output is correct
17 Correct 15 ms 2152 KB Output is correct
18 Correct 15 ms 2624 KB Output is correct
19 Correct 16 ms 3208 KB Output is correct
20 Correct 11 ms 3304 KB Output is correct
21 Correct 75 ms 6292 KB Output is correct
22 Correct 70 ms 8264 KB Output is correct
23 Correct 55 ms 9980 KB Output is correct
24 Correct 55 ms 11824 KB Output is correct
25 Incorrect 46 ms 13036 KB Output isn't correct
26 Correct 55 ms 14976 KB Output is correct
27 Correct 55 ms 16728 KB Output is correct
28 Correct 55 ms 18572 KB Output is correct
29 Correct 65 ms 20560 KB Output is correct
30 Correct 41 ms 21124 KB Output is correct
31 Correct 1 ms 21124 KB Output is correct
32 Correct 1 ms 21124 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 21124 KB Output is correct
2 Partially correct 1 ms 21124 KB Partially correct
3 Partially correct 1 ms 21124 KB Partially correct
4 Partially correct 2 ms 21124 KB Partially correct
5 Incorrect 1 ms 21124 KB Output isn't correct
6 Partially correct 2 ms 21124 KB Partially correct
7 Partially correct 1 ms 21124 KB Partially correct
8 Partially correct 1 ms 21124 KB Partially correct
9 Partially correct 1 ms 21124 KB Partially correct
10 Partially correct 2 ms 21124 KB Partially correct
11 Partially correct 2 ms 21124 KB Partially correct
12 Partially correct 3 ms 21124 KB Partially correct
13 Partially correct 3 ms 21124 KB Partially correct
14 Partially correct 2 ms 21124 KB Partially correct
15 Incorrect 2 ms 21124 KB Output isn't correct
16 Partially correct 14 ms 21124 KB Partially correct
17 Partially correct 15 ms 21124 KB Partially correct
18 Partially correct 15 ms 21504 KB Partially correct
19 Partially correct 15 ms 22096 KB Partially correct
20 Partially correct 11 ms 22176 KB Partially correct
21 Incorrect 56 ms 25220 KB Expected int32, but "2500100000" found
22 Incorrect 62 ms 27024 KB Expected int32, but "2500100000" found
23 Incorrect 55 ms 29016 KB Expected int32, but "2500100000" found
24 Incorrect 55 ms 30712 KB Expected int32, but "2500100000" found
25 Incorrect 47 ms 32044 KB Expected int32, but "2500100000" found
26 Incorrect 55 ms 33772 KB Expected int32, but "2500100000" found
27 Incorrect 55 ms 35632 KB Expected int32, but "2500100000" found
28 Incorrect 55 ms 37492 KB Expected int32, but "2500100000" found
29 Incorrect 55 ms 39320 KB Expected int32, but "2500100000" found
30 Incorrect 41 ms 40028 KB Expected int32, but "2500100000" found
31 Partially correct 1 ms 40028 KB Partially correct
32 Partially correct 1 ms 40028 KB Partially correct