Submission #106931

# Submission time Handle Problem Language Result Execution time Memory
106931 2019-04-21T07:01:22 Z tjd229 Gap (APIO16_gap) C++14
70 / 100
86 ms 3436 KB
#include "gap.h"
#include <vector>
#include <algorithm>
#define ll long long
using namespace std;
long long findGap(int T, int N)
{
	if (!N) return 0;
	vector<ll> a;
	ll res = 0;
	if (T) {
		ll mn, mx,bnd;
		MinMax(0,1e18,&mn,&bnd);
		ll d = (bnd - mn)/(N-1);
		a.push_back(mn); a.push_back(bnd);
		ll l = mn, r = mn + d;
		res = d;
		for (;l< bnd;l+=d+1,r+=d+1) {
			MinMax(l, r, &mn, &mx);
			if (mn != -1) a.push_back(mn);
			if (mx != -1) a.push_back(mx);
		}
	}
	else {
		ll mn = -1, mx = (ll)1e18+1;
		for (int i = N; i > 0; i -= 2) {
			MinMax(mn + 1, mx - 1,&mn,&mx);
			a.push_back(mn); a.push_back(mx);
		}
	}
	sort(a.begin(), a.end());
	for (int i = 1; i < a.size(); ++i) {
		ll d = a[i] - a[i - 1];
		if (res < d) res = d;
	}
	return res;
}

Compilation message

gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:32:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 1; i < a.size(); ++i) {
                  ~~^~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 256 KB Output isn't correct
2 Incorrect 2 ms 384 KB Output isn't correct
3 Incorrect 3 ms 384 KB Output isn't correct
4 Incorrect 2 ms 256 KB Output isn't correct
5 Incorrect 2 ms 384 KB Output isn't correct
6 Incorrect 2 ms 256 KB Output isn't correct
7 Incorrect 2 ms 384 KB Output isn't correct
8 Incorrect 2 ms 384 KB Output isn't correct
9 Incorrect 2 ms 384 KB Output isn't correct
10 Incorrect 2 ms 256 KB Output isn't correct
11 Incorrect 3 ms 384 KB Output isn't correct
12 Incorrect 2 ms 384 KB Output isn't correct
13 Incorrect 3 ms 384 KB Output isn't correct
14 Incorrect 3 ms 384 KB Output isn't correct
15 Incorrect 3 ms 384 KB Output isn't correct
16 Incorrect 23 ms 896 KB Output isn't correct
17 Incorrect 19 ms 896 KB Output isn't correct
18 Incorrect 20 ms 896 KB Output isn't correct
19 Incorrect 20 ms 896 KB Output isn't correct
20 Incorrect 9 ms 512 KB Output isn't correct
21 Incorrect 72 ms 2288 KB Output isn't correct
22 Incorrect 71 ms 2288 KB Output isn't correct
23 Incorrect 70 ms 2320 KB Output isn't correct
24 Incorrect 70 ms 2288 KB Output isn't correct
25 Incorrect 68 ms 3296 KB Output isn't correct
26 Incorrect 70 ms 2292 KB Output isn't correct
27 Incorrect 71 ms 2288 KB Output isn't correct
28 Incorrect 86 ms 2288 KB Output isn't correct
29 Incorrect 66 ms 2260 KB Output isn't correct
30 Incorrect 33 ms 1532 KB Output isn't correct
31 Incorrect 2 ms 384 KB Output isn't correct
32 Incorrect 2 ms 384 KB Output isn't correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 3 ms 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 256 KB Output is correct
11 Correct 3 ms 384 KB Output is correct
12 Correct 3 ms 384 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 4 ms 384 KB Output is correct
15 Correct 3 ms 384 KB Output is correct
16 Correct 18 ms 888 KB Output is correct
17 Correct 25 ms 896 KB Output is correct
18 Correct 19 ms 896 KB Output is correct
19 Correct 18 ms 896 KB Output is correct
20 Correct 9 ms 512 KB Output is correct
21 Correct 70 ms 2292 KB Output is correct
22 Correct 72 ms 2260 KB Output is correct
23 Correct 72 ms 2288 KB Output is correct
24 Correct 71 ms 2292 KB Output is correct
25 Correct 68 ms 3436 KB Output is correct
26 Correct 75 ms 2288 KB Output is correct
27 Correct 75 ms 2288 KB Output is correct
28 Correct 80 ms 2288 KB Output is correct
29 Correct 71 ms 2288 KB Output is correct
30 Correct 42 ms 1532 KB Output is correct
31 Correct 2 ms 256 KB Output is correct
32 Correct 2 ms 384 KB Output is correct