Submission #107590

# Submission time Handle Problem Language Result Execution time Memory
107590 2019-04-25T09:06:27 Z Minnakhmetov Gap (APIO16_gap) C++14
30 / 100
59 ms 3592 KB
#include "gap.h"
#include <algorithm>
using namespace std;

#define ll long long
const ll MAX = 1e18;
const int N = 1e5 + 5;
ll a[N];


long long findGap(int t, int n)
{
	if (t == 1) {
		ll l = 0, r = MAX;
		int x = 0, y = n - 1;
		while (x <= y) {
			MinMax(l, r, &a[x], &a[y]);
			l = a[x] + 1;
			r = a[y] - 1;
			x++;
			y--;
		}
		ll mx = 0;
		for (int i = 0; i < n - 1; i++)
			mx = max(mx, a[i + 1] - a[i]);
		return mx;
	}
	return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 2 ms 256 KB Output is correct
11 Correct 3 ms 384 KB Output is correct
12 Correct 3 ms 384 KB Output is correct
13 Correct 3 ms 384 KB Output is correct
14 Correct 3 ms 384 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 11 ms 1024 KB Output is correct
17 Correct 18 ms 1008 KB Output is correct
18 Correct 15 ms 1024 KB Output is correct
19 Correct 15 ms 1016 KB Output is correct
20 Correct 15 ms 768 KB Output is correct
21 Correct 59 ms 3548 KB Output is correct
22 Correct 50 ms 3528 KB Output is correct
23 Correct 47 ms 3576 KB Output is correct
24 Correct 50 ms 3500 KB Output is correct
25 Correct 43 ms 2936 KB Output is correct
26 Correct 49 ms 3592 KB Output is correct
27 Correct 48 ms 3576 KB Output is correct
28 Correct 48 ms 3580 KB Output is correct
29 Correct 54 ms 3576 KB Output is correct
30 Correct 57 ms 2424 KB Output is correct
31 Correct 3 ms 384 KB Output is correct
32 Correct 2 ms 256 KB Output is correct
# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 256 KB Output isn't correct
2 Incorrect 2 ms 256 KB Output isn't correct
3 Incorrect 2 ms 384 KB Output isn't correct
4 Incorrect 2 ms 384 KB Output isn't correct
5 Incorrect 2 ms 256 KB Output isn't correct
6 Incorrect 2 ms 384 KB Output isn't correct
7 Incorrect 3 ms 256 KB Output isn't correct
8 Incorrect 2 ms 384 KB Output isn't correct
9 Incorrect 2 ms 384 KB Output isn't correct
10 Incorrect 1 ms 256 KB Output isn't correct
11 Incorrect 3 ms 384 KB Output isn't correct
12 Incorrect 2 ms 384 KB Output isn't correct
13 Incorrect 2 ms 384 KB Output isn't correct
14 Incorrect 3 ms 384 KB Output isn't correct
15 Incorrect 2 ms 384 KB Output isn't correct
16 Incorrect 9 ms 896 KB Output isn't correct
17 Incorrect 9 ms 768 KB Output isn't correct
18 Incorrect 9 ms 768 KB Output isn't correct
19 Incorrect 10 ms 768 KB Output isn't correct
20 Incorrect 5 ms 512 KB Output isn't correct
21 Incorrect 28 ms 2808 KB Output isn't correct
22 Incorrect 27 ms 2808 KB Output isn't correct
23 Incorrect 35 ms 2792 KB Output isn't correct
24 Incorrect 28 ms 2808 KB Output isn't correct
25 Incorrect 22 ms 2176 KB Output isn't correct
26 Incorrect 41 ms 2808 KB Output isn't correct
27 Incorrect 28 ms 2808 KB Output isn't correct
28 Incorrect 29 ms 2808 KB Output isn't correct
29 Incorrect 28 ms 2808 KB Output isn't correct
30 Incorrect 16 ms 1664 KB Output isn't correct
31 Incorrect 2 ms 256 KB Output isn't correct
32 Incorrect 2 ms 256 KB Output isn't correct