Submission #39803

# Submission time Handle Problem Language Result Execution time Memory
39803 2018-01-19T06:10:18 Z 14kg Gap (APIO16_gap) C++11
30 / 100
92 ms 9052 KB
#include "gap.h"
#include <set>
#define NUM_MAX 1000000000000000000
#define max2(x,y) (x>y?x:y)

using namespace std;
int n;
set<long long> S;

long long f1() {
	long long l = 0, r = NUM_MAX;
	long long t1, t2, res = 0;

	while (l <= r) {
		MinMax(l, r, &t1, &t2);
		if (t1 < 0) break;
		
		S.insert(l = t1), S.insert(r = t2);
		l++, r--;
		if (S.size() == n) break;
	}
	
	t1 = NUM_MAX;
	for (auto i : S) res = max2(res, i - t1), t1 = i;
	return res;
}
long long findGap(int T, int _n) {
	n = _n;
	if (T == 1) return f1();
	else;
}

Compilation message

gap.cpp: In function 'long long int f1()':
gap.cpp:20:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   if (S.size() == n) break;
                ^
gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:31:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^
# Verdict Execution time Memory Grader output
1 Correct 0 ms 4300 KB Output is correct
2 Correct 0 ms 4300 KB Output is correct
3 Correct 0 ms 4300 KB Output is correct
4 Correct 0 ms 4300 KB Output is correct
5 Correct 0 ms 4300 KB Output is correct
6 Correct 0 ms 4300 KB Output is correct
7 Correct 0 ms 4300 KB Output is correct
8 Correct 0 ms 4300 KB Output is correct
9 Correct 0 ms 4300 KB Output is correct
10 Correct 0 ms 4300 KB Output is correct
11 Correct 1 ms 4432 KB Output is correct
12 Correct 1 ms 4432 KB Output is correct
13 Correct 0 ms 4432 KB Output is correct
14 Correct 1 ms 4432 KB Output is correct
15 Correct 1 ms 4432 KB Output is correct
16 Correct 19 ms 5488 KB Output is correct
17 Correct 22 ms 5488 KB Output is correct
18 Correct 23 ms 5488 KB Output is correct
19 Correct 12 ms 5488 KB Output is correct
20 Correct 14 ms 5488 KB Output is correct
21 Correct 86 ms 9052 KB Output is correct
22 Correct 86 ms 9052 KB Output is correct
23 Correct 81 ms 9052 KB Output is correct
24 Correct 92 ms 9052 KB Output is correct
25 Correct 76 ms 9052 KB Output is correct
26 Correct 90 ms 9052 KB Output is correct
27 Correct 89 ms 9052 KB Output is correct
28 Correct 92 ms 9052 KB Output is correct
29 Correct 90 ms 9052 KB Output is correct
30 Correct 74 ms 9052 KB Output is correct
31 Correct 0 ms 4300 KB Output is correct
32 Correct 0 ms 4300 KB Output is correct
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 4300 KB Output isn't correct
2 Incorrect 0 ms 4300 KB Output isn't correct
3 Incorrect 0 ms 4300 KB Output isn't correct
4 Incorrect 0 ms 4300 KB Output isn't correct
5 Incorrect 0 ms 4300 KB Output isn't correct
6 Incorrect 0 ms 4300 KB Output isn't correct
7 Incorrect 0 ms 4300 KB Output isn't correct
8 Incorrect 0 ms 4300 KB Output isn't correct
9 Incorrect 0 ms 4300 KB Output isn't correct
10 Incorrect 0 ms 4300 KB Output isn't correct
11 Incorrect 1 ms 4300 KB Output isn't correct
12 Incorrect 1 ms 4300 KB Output isn't correct
13 Incorrect 1 ms 4300 KB Output isn't correct
14 Incorrect 0 ms 4300 KB Output isn't correct
15 Incorrect 0 ms 4300 KB Output isn't correct
16 Incorrect 8 ms 4300 KB Output isn't correct
17 Incorrect 9 ms 4300 KB Output isn't correct
18 Incorrect 8 ms 4300 KB Output isn't correct
19 Incorrect 9 ms 4300 KB Output isn't correct
20 Incorrect 3 ms 4300 KB Output isn't correct
21 Incorrect 26 ms 4300 KB Output isn't correct
22 Incorrect 20 ms 4300 KB Output isn't correct
23 Incorrect 35 ms 4300 KB Output isn't correct
24 Incorrect 55 ms 4300 KB Output isn't correct
25 Incorrect 11 ms 4300 KB Output isn't correct
26 Incorrect 23 ms 4300 KB Output isn't correct
27 Incorrect 33 ms 4300 KB Output isn't correct
28 Incorrect 24 ms 4300 KB Output isn't correct
29 Incorrect 23 ms 4300 KB Output isn't correct
30 Incorrect 16 ms 4300 KB Output isn't correct
31 Incorrect 0 ms 4300 KB Output isn't correct
32 Incorrect 0 ms 4300 KB Output isn't correct