Submission #1014292

# Submission time Handle Problem Language Result Execution time Memory
1014292 2024-07-04T16:09:32 Z aufan Gap (APIO16_gap) C++17
30 / 100
55 ms 3596 KB
#include "gap.h"
#include <bits/stdc++.h>

using namespace std;

const long long inff = 1e18;

long long findGap(int t, int n) {
	if (t == 1) {
		long long l = 0, r = inff;
		vector<long long> a(n);
		for (int i = 0; i < (n + 1) / 2; i++) {
			long long mn, mx;
			MinMax(l, r, &mn, &mx);
			a[i] = mn;
			a[n - 1 - i] = mx;
			l = mn + 1;
			r = mx - 1;
		}

		long long res = 0;
		for (int i = 0; i < n - 1; i++) res = max(res, a[i + 1] - a[i]);

		return res;
	} else if (t == 2) {

	}
}

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]
   28 | }
      | ^
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 6 ms 696 KB Output is correct
17 Correct 6 ms 692 KB Output is correct
18 Correct 6 ms 856 KB Output is correct
19 Correct 6 ms 660 KB Output is correct
20 Correct 6 ms 856 KB Output is correct
21 Correct 27 ms 1904 KB Output is correct
22 Correct 26 ms 1804 KB Output is correct
23 Correct 25 ms 1880 KB Output is correct
24 Correct 29 ms 3416 KB Output is correct
25 Correct 24 ms 3512 KB Output is correct
26 Correct 32 ms 1912 KB Output is correct
27 Correct 22 ms 1880 KB Output is correct
28 Correct 23 ms 1916 KB Output is correct
29 Correct 31 ms 3576 KB Output is correct
30 Correct 22 ms 1880 KB Output is correct
31 Correct 1 ms 2392 KB Output is correct
32 Correct 1 ms 2392 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Partially correct 0 ms 344 KB Partially correct
3 Partially correct 0 ms 2392 KB Partially correct
4 Partially correct 1 ms 344 KB Partially correct
5 Partially correct 0 ms 344 KB Partially correct
6 Partially correct 1 ms 344 KB Partially correct
7 Partially correct 1 ms 344 KB Partially correct
8 Partially correct 1 ms 2392 KB Partially correct
9 Partially correct 1 ms 344 KB Partially correct
10 Partially correct 0 ms 344 KB Partially correct
11 Partially correct 0 ms 344 KB Partially correct
12 Partially correct 1 ms 344 KB Partially correct
13 Partially correct 1 ms 2392 KB Partially correct
14 Partially correct 0 ms 344 KB Partially correct
15 Partially correct 1 ms 344 KB Partially correct
16 Partially correct 5 ms 2648 KB Partially correct
17 Partially correct 9 ms 856 KB Partially correct
18 Partially correct 6 ms 600 KB Partially correct
19 Partially correct 6 ms 840 KB Partially correct
20 Partially correct 4 ms 2648 KB Partially correct
21 Incorrect 55 ms 1908 KB Expected int32, but "2500100000" found
22 Incorrect 29 ms 1992 KB Expected int32, but "2500100000" found
23 Incorrect 25 ms 1880 KB Expected int32, but "2500100000" found
24 Incorrect 23 ms 3596 KB Expected int32, but "2500100000" found
25 Incorrect 30 ms 1872 KB Expected int32, but "2500100000" found
26 Incorrect 27 ms 3408 KB Expected int32, but "2500100000" found
27 Incorrect 26 ms 1880 KB Expected int32, but "2500100000" found
28 Incorrect 22 ms 1880 KB Expected int32, but "2500100000" found
29 Incorrect 27 ms 3416 KB Expected int32, but "2500100000" found
30 Incorrect 20 ms 1880 KB Expected int32, but "2500100000" found
31 Partially correct 1 ms 344 KB Partially correct
32 Partially correct 0 ms 2392 KB Partially correct