Submission #564850

# Submission time Handle Problem Language Result Execution time Memory
564850 2022-05-19T19:31:37 Z ljuba Gap (APIO16_gap) C++17
30 / 100
58 ms 1884 KB
#include "gap.h"
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

long long findGap(int T, int N) //probably again different solution for different test cases :(
{
	if(T == 1) {
		// cerr << "entered?" << endl;
	}
	vector<ll> v(N);
	ll mini = -1, maksi = ll(1e18) + 1;

	for(int i = 0; i < N; ++i) {
		if(i > N - i - 1) break;
		++mini, --maksi;
		MinMax(mini, maksi, &mini, &maksi);
		// cerr << mini << " " << maksi << '\n';
		v[i] = mini;
		v[N - i - 1] = maksi;
	}

	ll ans = 0;

	for(int i = 1; i < N; ++i) {
		ans = max(ans, v[i] - v[i - 1]);
	}

	return ans;

	//maybe we are again able to find all elements of the array

	return 0;
}
# 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 1 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 0 ms 208 KB Output is correct
7 Correct 1 ms 208 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 10 ms 720 KB Output is correct
17 Correct 10 ms 684 KB Output is correct
18 Correct 11 ms 676 KB Output is correct
19 Correct 10 ms 720 KB Output is correct
20 Correct 8 ms 720 KB Output is correct
21 Correct 41 ms 1764 KB Output is correct
22 Correct 52 ms 1776 KB Output is correct
23 Correct 39 ms 1864 KB Output is correct
24 Correct 39 ms 1816 KB Output is correct
25 Correct 51 ms 1836 KB Output is correct
26 Correct 58 ms 1848 KB Output is correct
27 Correct 44 ms 1864 KB Output is correct
28 Correct 41 ms 1824 KB Output is correct
29 Correct 41 ms 1864 KB Output is correct
30 Correct 33 ms 1812 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 Correct 0 ms 208 KB Output is correct
2 Partially correct 0 ms 208 KB Partially correct
3 Partially correct 1 ms 208 KB Partially correct
4 Partially correct 0 ms 208 KB Partially correct
5 Partially correct 1 ms 208 KB Partially correct
6 Partially correct 1 ms 220 KB Partially correct
7 Partially correct 1 ms 208 KB Partially correct
8 Partially correct 0 ms 208 KB Partially correct
9 Partially correct 0 ms 208 KB Partially correct
10 Partially correct 0 ms 208 KB Partially correct
11 Partially correct 1 ms 336 KB Partially correct
12 Partially correct 1 ms 336 KB Partially correct
13 Partially correct 1 ms 336 KB Partially correct
14 Partially correct 1 ms 336 KB Partially correct
15 Partially correct 2 ms 336 KB Partially correct
16 Partially correct 31 ms 672 KB Partially correct
17 Partially correct 11 ms 720 KB Partially correct
18 Partially correct 11 ms 592 KB Partially correct
19 Partially correct 10 ms 596 KB Partially correct
20 Partially correct 8 ms 720 KB Partially correct
21 Incorrect 40 ms 1808 KB Expected int32, but "2500100000" found
22 Incorrect 41 ms 1880 KB Expected int32, but "2500100000" found
23 Incorrect 39 ms 1864 KB Expected int32, but "2500100000" found
24 Incorrect 57 ms 1772 KB Expected int32, but "2500100000" found
25 Incorrect 34 ms 1884 KB Expected int32, but "2500100000" found
26 Incorrect 42 ms 1824 KB Expected int32, but "2500100000" found
27 Incorrect 36 ms 1836 KB Expected int32, but "2500100000" found
28 Incorrect 40 ms 1824 KB Expected int32, but "2500100000" found
29 Incorrect 39 ms 1824 KB Expected int32, but "2500100000" found
30 Incorrect 35 ms 1832 KB Expected int32, but "2500100000" found
31 Partially correct 0 ms 208 KB Partially correct
32 Partially correct 0 ms 208 KB Partially correct