Submission #39802

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
39802	2018-01-19T05:39:38 Z	14kg	Gap (APIO16_gap)	C++11	0 / 100	106 ms	9052 KB

gap

#include "gap.h"
#include <set>
#define NUM_MAX 1000000000000000000
#define max2(x,y) (x>y?x:y)

using namespace std;
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--;
	}
	
	t1 = NUM_MAX;
	for (auto i : S) res = max2(res, i - t1), t1 = i;
	return res;
}
long long findGap(int T, int _n) {
	if (T == 1) return f1();
	else;
}

Compilation message

gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:28:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^

Subtask #1

0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	0 ms	4300 KB	Output isn't 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	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	Correct	0 ms	4300 KB	Output is correct
11	Incorrect	0 ms	4432 KB	Output isn't correct
12	Incorrect	1 ms	4432 KB	Output isn't correct
13	Incorrect	1 ms	4432 KB	Output isn't correct
14	Incorrect	1 ms	4432 KB	Output isn't correct
15	Incorrect	1 ms	4432 KB	Output isn't correct
16	Incorrect	8 ms	5488 KB	Output isn't correct
17	Incorrect	16 ms	5488 KB	Output isn't correct
18	Incorrect	20 ms	5488 KB	Output isn't correct
19	Incorrect	18 ms	5488 KB	Output isn't correct
20	Correct	9 ms	5488 KB	Output is correct
21	Incorrect	93 ms	9052 KB	Output isn't correct
22	Incorrect	97 ms	9052 KB	Output isn't correct
23	Incorrect	99 ms	9052 KB	Output isn't correct
24	Incorrect	102 ms	9052 KB	Output isn't correct
25	Incorrect	70 ms	9052 KB	Output isn't correct
26	Incorrect	69 ms	9052 KB	Output isn't correct
27	Incorrect	74 ms	9052 KB	Output isn't correct
28	Incorrect	82 ms	9052 KB	Output isn't correct
29	Incorrect	106 ms	9052 KB	Output isn't correct
30	Correct	81 ms	9052 KB	Output is correct
31	Correct	0 ms	4300 KB	Output is correct
32	Correct	0 ms	4300 KB	Output is correct

Subtask #2

0 / 70.0

#	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	1 ms	4300 KB	Output isn't correct
15	Incorrect	0 ms	4300 KB	Output isn't correct
16	Incorrect	9 ms	4300 KB	Output isn't correct
17	Incorrect	6 ms	4300 KB	Output isn't correct
18	Incorrect	9 ms	4300 KB	Output isn't correct
19	Incorrect	9 ms	4300 KB	Output isn't correct
20	Incorrect	4 ms	4300 KB	Output isn't correct
21	Incorrect	34 ms	4300 KB	Output isn't correct
22	Incorrect	31 ms	4300 KB	Output isn't correct
23	Incorrect	24 ms	4300 KB	Output isn't correct
24	Incorrect	25 ms	4300 KB	Output isn't correct
25	Incorrect	19 ms	4300 KB	Output isn't correct
26	Incorrect	34 ms	4300 KB	Output isn't correct
27	Incorrect	32 ms	4300 KB	Output isn't correct
28	Incorrect	32 ms	4300 KB	Output isn't correct
29	Incorrect	26 ms	4300 KB	Output isn't correct
30	Incorrect	7 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