Submission #30798

# Submission time Handle Problem Language Result Execution time Memory
30798 2017-07-26T14:19:07 Z cdemirer Gap (APIO16_gap) C++14
30 / 100
106 ms 9900 KB
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> llp;
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ii> vii;
typedef vector<vii> vvii;
#define pb(x) push_back(x)
#define mp(x, y) make_pair(x, y)
#include "gap.h"

set<ll> S;

ll subtask1(int N) {
	//cerr << N << endl;
	ll l = 0, r = 1e18+1;
	ll q, w;
	while (N > 0) {
		MinMax(l, r, &q, &w);
		//cerr << q << w << endl;
		S.insert(q); S.insert(w);
		l = q+1;
		r = w-1;
		N -= 2;
	}
	set<ll>::iterator it = S.begin();
	it++;
	ll best = 0;
	for (; it != S.end(); it++) {
		set<ll>::iterator it2 = it;
		it2--;
		best = max(best, (*it) - (*it2));
	}
	return best;
}

ll subtask2(int N) {
	return 1337;
}

long long findGap(int T, int N)
{
	if (T == 1) return subtask1(N);
	else return subtask2(N);
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 5148 KB Output is correct
2 Correct 0 ms 5148 KB Output is correct
3 Correct 0 ms 5148 KB Output is correct
4 Correct 0 ms 5148 KB Output is correct
5 Correct 0 ms 5148 KB Output is correct
6 Correct 0 ms 5148 KB Output is correct
7 Correct 0 ms 5148 KB Output is correct
8 Correct 0 ms 5148 KB Output is correct
9 Correct 0 ms 5148 KB Output is correct
10 Correct 0 ms 5148 KB Output is correct
11 Correct 0 ms 5280 KB Output is correct
12 Correct 0 ms 5280 KB Output is correct
13 Correct 0 ms 5280 KB Output is correct
14 Correct 0 ms 5280 KB Output is correct
15 Correct 0 ms 5280 KB Output is correct
16 Correct 13 ms 6336 KB Output is correct
17 Correct 16 ms 6336 KB Output is correct
18 Correct 16 ms 6336 KB Output is correct
19 Correct 19 ms 6336 KB Output is correct
20 Correct 16 ms 6336 KB Output is correct
21 Correct 106 ms 9900 KB Output is correct
22 Correct 99 ms 9900 KB Output is correct
23 Correct 86 ms 9900 KB Output is correct
24 Correct 96 ms 9900 KB Output is correct
25 Correct 86 ms 9900 KB Output is correct
26 Correct 96 ms 9900 KB Output is correct
27 Correct 99 ms 9900 KB Output is correct
28 Correct 103 ms 9900 KB Output is correct
29 Correct 99 ms 9900 KB Output is correct
30 Correct 86 ms 9900 KB Output is correct
31 Correct 0 ms 5148 KB Output is correct
32 Correct 0 ms 5148 KB Output is correct
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 5148 KB Output isn't correct
2 Incorrect 0 ms 5148 KB Output isn't correct
3 Incorrect 0 ms 5148 KB Output isn't correct
4 Incorrect 0 ms 5148 KB Output isn't correct
5 Incorrect 0 ms 5148 KB Output isn't correct
6 Incorrect 0 ms 5148 KB Output isn't correct
7 Incorrect 0 ms 5148 KB Output isn't correct
8 Incorrect 0 ms 5148 KB Output isn't correct
9 Incorrect 0 ms 5148 KB Output isn't correct
10 Incorrect 0 ms 5148 KB Output isn't correct
11 Incorrect 0 ms 5148 KB Output isn't correct
12 Incorrect 0 ms 5148 KB Output isn't correct
13 Incorrect 0 ms 5148 KB Output isn't correct
14 Incorrect 0 ms 5148 KB Output isn't correct
15 Incorrect 0 ms 5148 KB Output isn't correct
16 Incorrect 9 ms 5148 KB Output isn't correct
17 Incorrect 6 ms 5148 KB Output isn't correct
18 Incorrect 6 ms 5148 KB Output isn't correct
19 Incorrect 6 ms 5148 KB Output isn't correct
20 Incorrect 3 ms 5148 KB Output isn't correct
21 Incorrect 43 ms 5148 KB Output isn't correct
22 Incorrect 39 ms 5148 KB Output isn't correct
23 Incorrect 36 ms 5148 KB Output isn't correct
24 Incorrect 36 ms 5148 KB Output isn't correct
25 Incorrect 16 ms 5148 KB Output isn't correct
26 Incorrect 36 ms 5148 KB Output isn't correct
27 Incorrect 29 ms 5148 KB Output isn't correct
28 Incorrect 26 ms 5148 KB Output isn't correct
29 Incorrect 36 ms 5148 KB Output isn't correct
30 Incorrect 16 ms 5148 KB Output isn't correct
31 Incorrect 0 ms 5148 KB Output isn't correct
32 Incorrect 0 ms 5148 KB Output isn't correct