Submission #901572

# Submission time Handle Problem Language Result Execution time Memory
901572 2024-01-09T15:21:36 Z ByeWorld Gap (APIO16_gap) C++14
30 / 100
34 ms 2144 KB
#include "gap.h"
#include <bits/stdc++.h>
#define bupol __builtin_popcount
//#define int long long 
#define ll long long
#define ld long double
#define fi first
#define se second
#define pb push_back
#define lf (id<<1)
#define rg ((id<<1)|1)
#define md ((l+r)>>1)
using namespace std;
const int MAXN = 1e5+5;
const int MAXK = 205;
const int LOG = 20;
const int MOD = 1e9+7;
const int SQRT = 520;
const ll INF = 1e18+10;
typedef pair<ll,ll> pii;
typedef pair<ll,pii> ipii;

ll mn, mx;
ll x, y;
int n;
ll a[MAXN], ans;

long long findGap(int T, int N)
{
	n = N;
	x = 0; y = INF;
	for(int i=1; i<=(n+1)/2; i++){
		MinMax(x, y, &mn, &mx);
		a[i] = mn; a[n-i+1] = mx;
		//cout << mn << ' '<< mx << " p\n";
		x = mn+1; y = mx-1;
	}
	for(int i=1; i<=n-1; i++){
		ans = max(ans, a[i+1]-a[i]);
	}
	return ans;
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 352 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 600 KB Output is correct
11 Correct 1 ms 620 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 620 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 7 ms 772 KB Output is correct
17 Correct 7 ms 644 KB Output is correct
18 Correct 8 ms 648 KB Output is correct
19 Correct 7 ms 652 KB Output is correct
20 Correct 6 ms 620 KB Output is correct
21 Correct 28 ms 1964 KB Output is correct
22 Correct 28 ms 1788 KB Output is correct
23 Correct 28 ms 1964 KB Output is correct
24 Correct 34 ms 1988 KB Output is correct
25 Correct 25 ms 1964 KB Output is correct
26 Correct 28 ms 1976 KB Output is correct
27 Correct 28 ms 1984 KB Output is correct
28 Correct 29 ms 2132 KB Output is correct
29 Correct 31 ms 1996 KB Output is correct
30 Correct 26 ms 1984 KB Output is correct
31 Correct 1 ms 344 KB Output is correct
32 Correct 0 ms 344 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Partially correct 0 ms 344 KB Partially correct
3 Partially correct 0 ms 344 KB Partially correct
4 Partially correct 0 ms 344 KB Partially correct
5 Partially correct 0 ms 344 KB Partially correct
6 Partially correct 0 ms 344 KB Partially correct
7 Partially correct 0 ms 344 KB Partially correct
8 Partially correct 0 ms 344 KB Partially correct
9 Partially correct 0 ms 344 KB Partially correct
10 Partially correct 0 ms 344 KB Partially correct
11 Partially correct 1 ms 344 KB Partially correct
12 Partially correct 1 ms 472 KB Partially correct
13 Partially correct 1 ms 344 KB Partially correct
14 Partially correct 1 ms 620 KB Partially correct
15 Partially correct 1 ms 344 KB Partially correct
16 Partially correct 7 ms 648 KB Partially correct
17 Partially correct 7 ms 648 KB Partially correct
18 Partially correct 7 ms 644 KB Partially correct
19 Partially correct 7 ms 652 KB Partially correct
20 Partially correct 6 ms 632 KB Partially correct
21 Incorrect 28 ms 2144 KB Expected int32, but "2500100000" found
22 Incorrect 28 ms 2140 KB Expected int32, but "2500100000" found
23 Incorrect 28 ms 2140 KB Expected int32, but "2500100000" found
24 Incorrect 30 ms 1784 KB Expected int32, but "2500100000" found
25 Incorrect 27 ms 1976 KB Expected int32, but "2500100000" found
26 Incorrect 28 ms 1992 KB Expected int32, but "2500100000" found
27 Incorrect 28 ms 1932 KB Expected int32, but "2500100000" found
28 Incorrect 28 ms 2144 KB Expected int32, but "2500100000" found
29 Incorrect 28 ms 1972 KB Expected int32, but "2500100000" found
30 Incorrect 23 ms 1956 KB Expected int32, but "2500100000" found
31 Partially correct 1 ms 340 KB Partially correct
32 Partially correct 0 ms 344 KB Partially correct