Submission #1105739

# Submission time Handle Problem Language Result Execution time Memory
1105739 2024-10-27T14:15:39 Z mariaclara Gap (APIO16_gap) C++17
30 / 100
30 ms 3512 KB
#include "gap.h"
#include<bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<int,int> pii;
const ll INF = 1e18;
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
#define mk make_pair
#define pb push_back
#define fr first 
#define sc second 

ll findGap(int T, int N) {

	if(T == 1) {
		vector<ll> a(N);
		int l = 0, r = N-1;
		ll val1 = 0, val2 = INF;

		while(l <= r) {
			MinMax(val1, val2, &a[l], &a[r]);
			val1 = a[l] + 1;
			val2 = a[r] - 1;
			l++;
			r--;
		}

		ll ans = 0;
		for(int i = 1; i < N; i++) 
			ans = max(ans, a[i] - a[i-1]);

		return ans;
	}

	return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 2384 KB Output is correct
3 Correct 1 ms 2552 KB Output is correct
4 Correct 1 ms 2384 KB Output is correct
5 Correct 1 ms 2384 KB Output is correct
6 Correct 1 ms 2384 KB Output is correct
7 Correct 1 ms 2384 KB Output is correct
8 Correct 1 ms 2384 KB Output is correct
9 Correct 1 ms 2384 KB Output is correct
10 Correct 1 ms 2384 KB Output is correct
11 Correct 1 ms 2384 KB Output is correct
12 Correct 1 ms 2384 KB Output is correct
13 Correct 1 ms 2384 KB Output is correct
14 Correct 1 ms 2384 KB Output is correct
15 Correct 1 ms 2384 KB Output is correct
16 Correct 10 ms 2640 KB Output is correct
17 Correct 7 ms 2640 KB Output is correct
18 Correct 7 ms 2640 KB Output is correct
19 Correct 8 ms 2760 KB Output is correct
20 Correct 6 ms 2640 KB Output is correct
21 Correct 29 ms 3408 KB Output is correct
22 Correct 28 ms 3400 KB Output is correct
23 Correct 28 ms 3408 KB Output is correct
24 Correct 27 ms 3408 KB Output is correct
25 Correct 29 ms 3408 KB Output is correct
26 Correct 30 ms 3500 KB Output is correct
27 Correct 28 ms 3512 KB Output is correct
28 Correct 26 ms 3408 KB Output is correct
29 Correct 30 ms 3396 KB Output is correct
30 Correct 25 ms 3408 KB Output is correct
31 Correct 1 ms 2384 KB Output is correct
32 Correct 1 ms 2384 KB Output is correct
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 2384 KB Output isn't correct
2 Incorrect 1 ms 2384 KB Output isn't correct
3 Incorrect 1 ms 2384 KB Output isn't correct
4 Incorrect 1 ms 2384 KB Output isn't correct
5 Incorrect 1 ms 2384 KB Output isn't correct
6 Incorrect 1 ms 2384 KB Output isn't correct
7 Incorrect 1 ms 2384 KB Output isn't correct
8 Incorrect 1 ms 2384 KB Output isn't correct
9 Incorrect 1 ms 2384 KB Output isn't correct
10 Incorrect 1 ms 2384 KB Output isn't correct
11 Incorrect 1 ms 2384 KB Output isn't correct
12 Incorrect 1 ms 2384 KB Output isn't correct
13 Incorrect 1 ms 2552 KB Output isn't correct
14 Incorrect 1 ms 2384 KB Output isn't correct
15 Incorrect 1 ms 2384 KB Output isn't correct
16 Incorrect 4 ms 2384 KB Output isn't correct
17 Incorrect 5 ms 2568 KB Output isn't correct
18 Incorrect 4 ms 2504 KB Output isn't correct
19 Incorrect 4 ms 2384 KB Output isn't correct
20 Incorrect 2 ms 2384 KB Output isn't correct
21 Incorrect 13 ms 2808 KB Output isn't correct
22 Incorrect 13 ms 2640 KB Output isn't correct
23 Incorrect 22 ms 2640 KB Output isn't correct
24 Incorrect 13 ms 2748 KB Output isn't correct
25 Incorrect 10 ms 2640 KB Output isn't correct
26 Incorrect 15 ms 2760 KB Output isn't correct
27 Incorrect 13 ms 2640 KB Output isn't correct
28 Incorrect 13 ms 2640 KB Output isn't correct
29 Incorrect 13 ms 2640 KB Output isn't correct
30 Incorrect 13 ms 2640 KB Output isn't correct
31 Incorrect 1 ms 2384 KB Output isn't correct
32 Incorrect 1 ms 2384 KB Output isn't correct