Submission #406347

# Submission time Handle Problem Language Result Execution time Memory
406347 2021-05-17T12:34:50 Z p_square Gap (APIO16_gap) C++14
30 / 100
52 ms 1908 KB
#include<bits/stdc++.h>
#include "gap.h"

#define fast ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define ll long long
#define mp make_pair
#define se second
#define fi first

using namespace std;

ll findGap(int t, int n)
{
	ll a[n];
	ll l = 0, r = 1e18+1;
	ll ptr1, ptr2;

	for(int i = 0; 2*i<n; i++)
	{
		MinMax(l, r, &ptr1, &ptr2);
		a[2*i] = ptr1;
		if(2*i < n-1)
			a[2*i+1] = ptr2;

		l = ptr1 + 1;
		r = ptr2 - 1;
	}

	sort(a, a+n);
	ll ma = 0;
	for(int i = 1; i<n; i++)
	{
		ma = max(ma, a[i]-a[i-1]);
	}

	return ma;
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 200 KB Output is correct
2 Correct 1 ms 200 KB Output is correct
3 Correct 1 ms 200 KB Output is correct
4 Correct 1 ms 200 KB Output is correct
5 Correct 1 ms 200 KB Output is correct
6 Correct 1 ms 200 KB Output is correct
7 Correct 1 ms 200 KB Output is correct
8 Correct 1 ms 200 KB Output is correct
9 Correct 1 ms 200 KB Output is correct
10 Correct 1 ms 200 KB Output is correct
11 Correct 1 ms 328 KB Output is correct
12 Correct 1 ms 328 KB Output is correct
13 Correct 1 ms 328 KB Output is correct
14 Correct 1 ms 328 KB Output is correct
15 Correct 1 ms 328 KB Output is correct
16 Correct 12 ms 584 KB Output is correct
17 Correct 12 ms 700 KB Output is correct
18 Correct 13 ms 584 KB Output is correct
19 Correct 12 ms 584 KB Output is correct
20 Correct 10 ms 704 KB Output is correct
21 Correct 47 ms 1856 KB Output is correct
22 Correct 48 ms 1728 KB Output is correct
23 Correct 49 ms 1856 KB Output is correct
24 Correct 51 ms 1728 KB Output is correct
25 Correct 41 ms 1780 KB Output is correct
26 Correct 48 ms 1820 KB Output is correct
27 Correct 47 ms 1780 KB Output is correct
28 Correct 48 ms 1736 KB Output is correct
29 Correct 47 ms 1820 KB Output is correct
30 Correct 39 ms 1864 KB Output is correct
31 Correct 1 ms 200 KB Output is correct
32 Correct 1 ms 200 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 200 KB Output is correct
2 Partially correct 1 ms 200 KB Partially correct
3 Partially correct 1 ms 200 KB Partially correct
4 Partially correct 1 ms 200 KB Partially correct
5 Partially correct 1 ms 200 KB Partially correct
6 Partially correct 1 ms 200 KB Partially correct
7 Partially correct 1 ms 200 KB Partially correct
8 Partially correct 1 ms 200 KB Partially correct
9 Partially correct 1 ms 200 KB Partially correct
10 Partially correct 1 ms 200 KB Partially correct
11 Partially correct 1 ms 328 KB Partially correct
12 Partially correct 1 ms 328 KB Partially correct
13 Partially correct 1 ms 328 KB Partially correct
14 Partially correct 1 ms 328 KB Partially correct
15 Partially correct 1 ms 328 KB Partially correct
16 Partially correct 12 ms 692 KB Partially correct
17 Partially correct 12 ms 696 KB Partially correct
18 Partially correct 12 ms 584 KB Partially correct
19 Partially correct 14 ms 584 KB Partially correct
20 Partially correct 10 ms 584 KB Partially correct
21 Incorrect 51 ms 1728 KB Expected int32, but "2500100000" found
22 Incorrect 47 ms 1820 KB Expected int32, but "2500100000" found
23 Incorrect 46 ms 1856 KB Expected int32, but "2500100000" found
24 Incorrect 51 ms 1908 KB Expected int32, but "2500100000" found
25 Incorrect 42 ms 1848 KB Expected int32, but "2500100000" found
26 Incorrect 46 ms 1904 KB Expected int32, but "2500100000" found
27 Incorrect 48 ms 1788 KB Expected int32, but "2500100000" found
28 Incorrect 52 ms 1728 KB Expected int32, but "2500100000" found
29 Incorrect 46 ms 1728 KB Expected int32, but "2500100000" found
30 Incorrect 39 ms 1856 KB Expected int32, but "2500100000" found
31 Partially correct 1 ms 200 KB Partially correct
32 Partially correct 1 ms 200 KB Partially correct