Submission #564868

# Submission time Handle Problem Language Result Execution time Memory
564868 2022-05-19T21:37:21 Z ljuba Gap (APIO16_gap) C++17
30 / 100
50 ms 1872 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;
	} else {
		ll mini = 0, maksi = ll(1e18);
		MinMax(mini, maksi, &mini, &maksi);

		ll korak = (maksi - mini + N - 2) / (N - 1);

		ll prosli = mini;
		ll ans = 0;

		for(ll i = mini; i + korak <= maksi; i += korak + 1) {
			MinMax(i, i + korak, &mini, &maksi);
			if(mini != -1) {
				ans = max(ans, mini - prosli);
				prosli = mini;
			}
		}

		return ans;
	}

	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 0 ms 208 KB Output is correct
4 Correct 0 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 0 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 1 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 11 ms 768 KB Output is correct
17 Correct 12 ms 720 KB Output is correct
18 Correct 11 ms 720 KB Output is correct
19 Correct 11 ms 720 KB Output is correct
20 Correct 8 ms 592 KB Output is correct
21 Correct 37 ms 1812 KB Output is correct
22 Correct 45 ms 1868 KB Output is correct
23 Correct 41 ms 1820 KB Output is correct
24 Correct 41 ms 1800 KB Output is correct
25 Correct 37 ms 1848 KB Output is correct
26 Correct 41 ms 1820 KB Output is correct
27 Correct 50 ms 1824 KB Output is correct
28 Correct 41 ms 1800 KB Output is correct
29 Correct 43 ms 1872 KB Output is correct
30 Correct 50 ms 1872 KB Output is correct
31 Correct 0 ms 208 KB Output is correct
32 Correct 1 ms 208 KB Output is correct
# Verdict Execution time Memory Grader output
1 Incorrect 0 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 1 ms 208 KB Output isn't correct
6 Incorrect 1 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 1 ms 256 KB Output isn't correct
11 Incorrect 1 ms 208 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 6 ms 464 KB Output isn't correct
17 Incorrect 10 ms 464 KB Output isn't correct
18 Incorrect 6 ms 428 KB Output isn't correct
19 Incorrect 7 ms 456 KB Output isn't correct
20 Incorrect 3 ms 464 KB Output isn't correct
21 Incorrect 20 ms 1076 KB Output isn't correct
22 Incorrect 20 ms 1060 KB Output isn't correct
23 Incorrect 22 ms 988 KB Output isn't correct
24 Incorrect 27 ms 1024 KB Output isn't correct
25 Incorrect 22 ms 968 KB Output isn't correct
26 Incorrect 21 ms 1060 KB Output isn't correct
27 Incorrect 20 ms 1080 KB Output isn't correct
28 Incorrect 20 ms 1076 KB Output isn't correct
29 Incorrect 22 ms 1060 KB Output isn't correct
30 Incorrect 17 ms 992 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