Submission #978185

# Submission time Handle Problem Language Result Execution time Memory
978185 2024-05-09T02:37:38 Z Amaarsaa Gap (APIO16_gap) C++14
30 / 100
36 ms 2240 KB
#include<bits/stdc++.h>
#include "gap.h"
using namespace std;
using ll =long long;
ll Sub1(ll N) {
	ll b[N + 2],ans, lo1, hi1, lo, hi, l, r;
	l = 1;
	r = N;
	lo = 0;
	hi = LONG_MAX;
	while ( l <= r) {
		MinMax(lo, hi, &lo1, &hi1);
		if (lo1 == -1) break;
		b[l] = lo1;
		b[r] = hi1;
		lo = lo1 + 1;
		hi = hi1 - 1;
		l ++;
		r --;
	}
	ans = 0;
	for (int i = 2; i <= N; i ++) {
		ans =max(ans, b[i] - b[i - 1]);
	}
	return ans;
}
ll Sub2(ll N) {
	
	ll l, r, x, y, ans, n = N, s, i;
	MinMax(0, 1e18, &l, &r);
	s = (r - l - 1)/(n - 1);
	ans = s;
	for ( i = l; i <= r; i += (s + 1)) {
		MinMax(i, i + s, &x, &y);
		if ( x != -1) {
			ans =max(ans, x - l);
			l = y;
		}
	}
	
	return ans;
}
long long findGap(int T, int N) {
	if ( T == 1) {
		return Sub1(N); 
	}
	else return Sub1(N);
}
# 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 1 ms 344 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 0 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 8 ms 700 KB Output is correct
17 Correct 7 ms 636 KB Output is correct
18 Correct 8 ms 644 KB Output is correct
19 Correct 8 ms 1012 KB Output is correct
20 Correct 6 ms 1072 KB Output is correct
21 Correct 30 ms 2008 KB Output is correct
22 Correct 33 ms 1972 KB Output is correct
23 Correct 30 ms 2240 KB Output is correct
24 Correct 30 ms 1980 KB Output is correct
25 Correct 30 ms 1928 KB Output is correct
26 Correct 30 ms 1976 KB Output is correct
27 Correct 30 ms 1972 KB Output is correct
28 Correct 30 ms 2156 KB Output is correct
29 Correct 29 ms 2020 KB Output is correct
30 Correct 31 ms 1996 KB Output is correct
31 Correct 0 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 1 ms 344 KB Partially correct
8 Partially correct 0 ms 344 KB Partially correct
9 Partially correct 1 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 344 KB Partially correct
13 Partially correct 1 ms 344 KB Partially correct
14 Partially correct 1 ms 344 KB Partially correct
15 Partially correct 1 ms 344 KB Partially correct
16 Partially correct 7 ms 652 KB Partially correct
17 Partially correct 8 ms 640 KB Partially correct
18 Partially correct 8 ms 644 KB Partially correct
19 Partially correct 8 ms 640 KB Partially correct
20 Partially correct 8 ms 800 KB Partially correct
21 Incorrect 30 ms 1972 KB Expected int32, but "2500100000" found
22 Incorrect 30 ms 1976 KB Expected int32, but "2500100000" found
23 Incorrect 36 ms 1976 KB Expected int32, but "2500100000" found
24 Incorrect 31 ms 1992 KB Expected int32, but "2500100000" found
25 Incorrect 27 ms 1960 KB Expected int32, but "2500100000" found
26 Incorrect 30 ms 1912 KB Expected int32, but "2500100000" found
27 Incorrect 30 ms 1980 KB Expected int32, but "2500100000" found
28 Incorrect 30 ms 2016 KB Expected int32, but "2500100000" found
29 Incorrect 31 ms 1984 KB Expected int32, but "2500100000" found
30 Incorrect 25 ms 1936 KB Expected int32, but "2500100000" found
31 Partially correct 0 ms 344 KB Partially correct
32 Partially correct 0 ms 344 KB Partially correct