Submission #42627

# Submission time Handle Problem Language Result Execution time Memory
42627 2018-03-01T14:15:39 Z MatheusLealV Gap (APIO16_gap) C++14
30 / 100
80 ms 2232 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;
 
		if(a != -1 && b != -1) ans[st] = a, ans[en] = b;
	}
 
	for(int i = 2; i <= n; i++) best = max(best, ans[i] - ans[i - 1]);
 
	return best;
}
# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 480 KB Output is correct
3 Correct 2 ms 480 KB Output is correct
4 Correct 1 ms 480 KB Output is correct
5 Correct 1 ms 524 KB Output is correct
6 Correct 1 ms 540 KB Output is correct
7 Correct 1 ms 540 KB Output is correct
8 Correct 2 ms 576 KB Output is correct
9 Correct 2 ms 580 KB Output is correct
10 Correct 2 ms 620 KB Output is correct
11 Correct 2 ms 620 KB Output is correct
12 Correct 2 ms 704 KB Output is correct
13 Correct 2 ms 704 KB Output is correct
14 Correct 2 ms 704 KB Output is correct
15 Correct 2 ms 704 KB Output is correct
16 Correct 15 ms 1004 KB Output is correct
17 Correct 14 ms 1004 KB Output is correct
18 Correct 16 ms 1004 KB Output is correct
19 Correct 18 ms 1008 KB Output is correct
20 Correct 11 ms 1008 KB Output is correct
21 Correct 57 ms 2152 KB Output is correct
22 Correct 59 ms 2224 KB Output is correct
23 Correct 55 ms 2224 KB Output is correct
24 Correct 55 ms 2224 KB Output is correct
25 Correct 46 ms 2224 KB Output is correct
26 Correct 57 ms 2224 KB Output is correct
27 Correct 80 ms 2224 KB Output is correct
28 Correct 55 ms 2224 KB Output is correct
29 Correct 56 ms 2224 KB Output is correct
30 Correct 44 ms 2224 KB Output is correct
31 Correct 2 ms 2224 KB Output is correct
32 Correct 1 ms 2224 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 2224 KB Output is correct
2 Partially correct 2 ms 2224 KB Partially correct
3 Partially correct 1 ms 2224 KB Partially correct
4 Partially correct 1 ms 2224 KB Partially correct
5 Partially correct 1 ms 2224 KB Partially correct
6 Partially correct 2 ms 2224 KB Partially correct
7 Partially correct 1 ms 2224 KB Partially correct
8 Partially correct 2 ms 2224 KB Partially correct
9 Partially correct 2 ms 2224 KB Partially correct
10 Partially correct 1 ms 2224 KB Partially correct
11 Partially correct 3 ms 2224 KB Partially correct
12 Partially correct 2 ms 2224 KB Partially correct
13 Partially correct 2 ms 2224 KB Partially correct
14 Partially correct 2 ms 2224 KB Partially correct
15 Partially correct 2 ms 2224 KB Partially correct
16 Partially correct 15 ms 2224 KB Partially correct
17 Partially correct 15 ms 2224 KB Partially correct
18 Partially correct 15 ms 2224 KB Partially correct
19 Partially correct 15 ms 2224 KB Partially correct
20 Partially correct 11 ms 2224 KB Partially correct
21 Incorrect 54 ms 2224 KB Expected int32, but "2500100000" found
22 Incorrect 54 ms 2224 KB Expected int32, but "2500100000" found
23 Incorrect 63 ms 2224 KB Expected int32, but "2500100000" found
24 Incorrect 64 ms 2232 KB Expected int32, but "2500100000" found
25 Incorrect 47 ms 2232 KB Expected int32, but "2500100000" found
26 Incorrect 56 ms 2232 KB Expected int32, but "2500100000" found
27 Incorrect 55 ms 2232 KB Expected int32, but "2500100000" found
28 Incorrect 54 ms 2232 KB Expected int32, but "2500100000" found
29 Incorrect 55 ms 2232 KB Expected int32, but "2500100000" found
30 Incorrect 47 ms 2232 KB Expected int32, but "2500100000" found
31 Partially correct 2 ms 2232 KB Partially correct
32 Partially correct 1 ms 2232 KB Partially correct