Submission #667337

# Submission time Handle Problem Language Result Execution time Memory
667337 2022-12-01T07:04:43 Z radal Gap (APIO16_gap) C++17
30 / 100
44 ms 1872 KB
#include "gap.h"
#include <bits/stdc++.h>
#pragma GCC target("sse,sse2,avx2")
#pragma GCC optimize("unroll-loops,O2")
#define rep(i,l,r) for (int i = l; i < r; i++)
#define repr(i,r,l) for (int i = r; i >= l; i--)
#define X first
#define Y second
#define all(x) (x).begin() , (x).end()
#define pb push_back
#define endl '\n'
#define debug(x) cerr << #x << " : " << x << endl;
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pll;
constexpr int N = 1e5+15,mod = 1e9+7;
constexpr ll inf = 1e18+10;

ll a[N];

long long findGap(int T, int n)
{
	if (T == 2) return 0;
	int m = (n+1)/2;
	ll x = -inf,y = inf;
	rep(i,0,m){
		MinMax(x,y,a+i,a+n-i-1);
		x = a[i]+1;
		y = a[n-i-1]-1;
	}
	ll ans = 0;
	rep(i,1,n) ans = max(ans,a[i]-a[i-1]);
	return ans;
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 0 ms 292 KB Output is correct
6 Correct 0 ms 208 KB Output is correct
7 Correct 0 ms 336 KB Output is correct
8 Correct 0 ms 208 KB Output is correct
9 Correct 0 ms 208 KB Output is correct
10 Correct 0 ms 208 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 9 ms 648 KB Output is correct
17 Correct 10 ms 672 KB Output is correct
18 Correct 10 ms 688 KB Output is correct
19 Correct 9 ms 592 KB Output is correct
20 Correct 7 ms 720 KB Output is correct
21 Correct 36 ms 1736 KB Output is correct
22 Correct 36 ms 1824 KB Output is correct
23 Correct 44 ms 1864 KB Output is correct
24 Correct 37 ms 1756 KB Output is correct
25 Correct 30 ms 1872 KB Output is correct
26 Correct 36 ms 1852 KB Output is correct
27 Correct 37 ms 1836 KB Output is correct
28 Correct 37 ms 1828 KB Output is correct
29 Correct 36 ms 1764 KB Output is correct
30 Correct 30 ms 1808 KB Output is correct
31 Correct 1 ms 208 KB Output is correct
32 Correct 0 ms 208 KB Output is correct
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 208 KB Output isn't correct
2 Incorrect 1 ms 208 KB Output isn't correct
3 Incorrect 0 ms 208 KB Output isn't correct
4 Incorrect 0 ms 208 KB Output isn't correct
5 Incorrect 0 ms 208 KB Output isn't correct
6 Incorrect 0 ms 208 KB Output isn't correct
7 Incorrect 0 ms 208 KB Output isn't correct
8 Incorrect 0 ms 208 KB Output isn't correct
9 Incorrect 0 ms 208 KB Output isn't correct
10 Incorrect 0 ms 208 KB Output isn't correct
11 Incorrect 1 ms 336 KB Output isn't correct
12 Incorrect 1 ms 336 KB Output isn't correct
13 Incorrect 1 ms 336 KB Output isn't correct
14 Incorrect 1 ms 336 KB Output isn't correct
15 Incorrect 1 ms 336 KB Output isn't correct
16 Incorrect 5 ms 432 KB Output isn't correct
17 Incorrect 5 ms 436 KB Output isn't correct
18 Incorrect 7 ms 464 KB Output isn't correct
19 Incorrect 7 ms 464 KB Output isn't correct
20 Incorrect 4 ms 464 KB Output isn't correct
21 Incorrect 22 ms 1056 KB Output isn't correct
22 Incorrect 18 ms 968 KB Output isn't correct
23 Incorrect 25 ms 968 KB Output isn't correct
24 Incorrect 17 ms 976 KB Output isn't correct
25 Incorrect 14 ms 972 KB Output isn't correct
26 Incorrect 17 ms 1064 KB Output isn't correct
27 Incorrect 18 ms 1004 KB Output isn't correct
28 Incorrect 22 ms 1036 KB Output isn't correct
29 Incorrect 23 ms 996 KB Output isn't correct
30 Incorrect 9 ms 976 KB Output isn't correct
31 Incorrect 0 ms 208 KB Output isn't correct
32 Incorrect 0 ms 208 KB Output isn't correct