Submission #24967

# Submission time Handle Problem Language Result Execution time Memory
24967 2017-06-19T11:45:56 Z gabrielsimoes Gap (APIO16_gap) C++14
30 / 100
73 ms 4900 KB
#include "gap.h"
#include <cstdio>
#include <algorithm>
using namespace std;

typedef long long ll;
const ll MIn = 0, MAX = 1000000000000000000;

ll solve1(int n) {
	ll v[n+1];
	int i = 1, k = n;
	ll mn = MIn, mx = MAX;
	while (i <= k) {
		MinMax(mn, mx, v+i, v+k);
		mn = v[i++]+1;
		mx = v[k--]-1;
	}

	ll ret = 1;
	for (int i = 1; i < n; i++)
		ret = max(ret, v[i+1] - v[i]);
	return ret;
}

ll solve2(int n) {
	return solve1(n);
}

ll findGap(int t, int n)
{
	return t == 1 ? solve1(n) : solve2(n);
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 4240 KB Output is correct
2 Correct 0 ms 4240 KB Output is correct
3 Correct 0 ms 4240 KB Output is correct
4 Correct 0 ms 4240 KB Output is correct
5 Correct 0 ms 4240 KB Output is correct
6 Correct 0 ms 4240 KB Output is correct
7 Correct 0 ms 4240 KB Output is correct
8 Correct 0 ms 4240 KB Output is correct
9 Correct 0 ms 4240 KB Output is correct
10 Correct 0 ms 4240 KB Output is correct
11 Correct 0 ms 4240 KB Output is correct
12 Correct 0 ms 4240 KB Output is correct
13 Correct 0 ms 4240 KB Output is correct
14 Correct 0 ms 4240 KB Output is correct
15 Correct 0 ms 4240 KB Output is correct
16 Correct 13 ms 4312 KB Output is correct
17 Correct 13 ms 4308 KB Output is correct
18 Correct 13 ms 4308 KB Output is correct
19 Correct 9 ms 4308 KB Output is correct
20 Correct 9 ms 4308 KB Output is correct
21 Correct 59 ms 4896 KB Output is correct
22 Correct 49 ms 4900 KB Output is correct
23 Correct 59 ms 4896 KB Output is correct
24 Correct 56 ms 4896 KB Output is correct
25 Correct 56 ms 4896 KB Output is correct
26 Correct 49 ms 4892 KB Output is correct
27 Correct 59 ms 4896 KB Output is correct
28 Correct 66 ms 4896 KB Output is correct
29 Correct 56 ms 4892 KB Output is correct
30 Correct 63 ms 4900 KB Output is correct
31 Correct 0 ms 4240 KB Output is correct
32 Correct 0 ms 4240 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 4240 KB Output is correct
2 Partially correct 0 ms 4240 KB Partially correct
3 Partially correct 0 ms 4240 KB Partially correct
4 Partially correct 0 ms 4240 KB Partially correct
5 Partially correct 0 ms 4240 KB Partially correct
6 Partially correct 0 ms 4240 KB Partially correct
7 Partially correct 0 ms 4240 KB Partially correct
8 Partially correct 0 ms 4240 KB Partially correct
9 Partially correct 0 ms 4240 KB Partially correct
10 Partially correct 0 ms 4240 KB Partially correct
11 Partially correct 0 ms 4240 KB Partially correct
12 Partially correct 0 ms 4240 KB Partially correct
13 Partially correct 0 ms 4240 KB Partially correct
14 Partially correct 0 ms 4240 KB Partially correct
15 Partially correct 0 ms 4240 KB Partially correct
16 Partially correct 13 ms 4312 KB Partially correct
17 Partially correct 13 ms 4312 KB Partially correct
18 Partially correct 13 ms 4308 KB Partially correct
19 Partially correct 6 ms 4312 KB Partially correct
20 Partially correct 9 ms 4308 KB Partially correct
21 Incorrect 56 ms 4896 KB Expected int32, but "2500100000" found
22 Incorrect 56 ms 4896 KB Expected int32, but "2500100000" found
23 Incorrect 59 ms 4896 KB Expected int32, but "2500100000" found
24 Incorrect 56 ms 4896 KB Expected int32, but "2500100000" found
25 Incorrect 49 ms 4892 KB Expected int32, but "2500100000" found
26 Incorrect 73 ms 4896 KB Expected int32, but "2500100000" found
27 Incorrect 59 ms 4896 KB Expected int32, but "2500100000" found
28 Incorrect 63 ms 4900 KB Expected int32, but "2500100000" found
29 Incorrect 66 ms 4896 KB Expected int32, but "2500100000" found
30 Incorrect 39 ms 4900 KB Expected int32, but "2500100000" found
31 Partially correct 0 ms 4240 KB Partially correct
32 Partially correct 0 ms 4240 KB Partially correct