Submission #48378

# Submission time Handle Problem Language Result Execution time Memory
48378 2018-05-12T10:09:37 Z BThero Gap (APIO16_gap) C++17
30 / 100
61 ms 2264 KB
#include <bits/stdc++.h>
#include "gap.h"

#define pb push_back
#define all(x) (x).begin(), (x).end()

typedef long long ll;

using namespace std;

long long findGap(int T, int N) {
    ll arr[N + 5];
    int l = 1, r = N;

    arr[0] = 0, arr[N + 1] = (ll)1e18 + 1;

    while (l <= r) {
        MinMax(arr[l - 1] + 1, arr[r + 1] - 1, arr + l, arr + r);
        ++l, --r;
    }

    ll ret = 0;

    for (int i = 2; i <= N; ++i) {
        ret = max(ret, arr[i] - arr[i - 1]);
    }

	return ret;
}
# Verdict Execution time Memory Grader output
1 Correct 2 ms 380 KB Output is correct
2 Correct 2 ms 488 KB Output is correct
3 Correct 2 ms 488 KB Output is correct
4 Correct 2 ms 488 KB Output is correct
5 Correct 2 ms 488 KB Output is correct
6 Correct 2 ms 488 KB Output is correct
7 Correct 2 ms 492 KB Output is correct
8 Correct 2 ms 500 KB Output is correct
9 Correct 2 ms 628 KB Output is correct
10 Correct 2 ms 700 KB Output is correct
11 Correct 3 ms 708 KB Output is correct
12 Correct 2 ms 708 KB Output is correct
13 Correct 3 ms 708 KB Output is correct
14 Correct 2 ms 708 KB Output is correct
15 Correct 3 ms 708 KB Output is correct
16 Correct 14 ms 1024 KB Output is correct
17 Correct 14 ms 1024 KB Output is correct
18 Correct 14 ms 1024 KB Output is correct
19 Correct 14 ms 1024 KB Output is correct
20 Correct 11 ms 1024 KB Output is correct
21 Correct 54 ms 2172 KB Output is correct
22 Correct 55 ms 2172 KB Output is correct
23 Correct 53 ms 2172 KB Output is correct
24 Correct 55 ms 2172 KB Output is correct
25 Correct 47 ms 2264 KB Output is correct
26 Correct 56 ms 2264 KB Output is correct
27 Correct 55 ms 2264 KB Output is correct
28 Correct 54 ms 2264 KB Output is correct
29 Correct 55 ms 2264 KB Output is correct
30 Correct 39 ms 2264 KB Output is correct
31 Correct 2 ms 2264 KB Output is correct
32 Correct 2 ms 2264 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 2264 KB Output is correct
2 Partially correct 2 ms 2264 KB Partially correct
3 Partially correct 2 ms 2264 KB Partially correct
4 Partially correct 2 ms 2264 KB Partially correct
5 Partially correct 2 ms 2264 KB Partially correct
6 Partially correct 2 ms 2264 KB Partially correct
7 Partially correct 2 ms 2264 KB Partially correct
8 Partially correct 2 ms 2264 KB Partially correct
9 Partially correct 2 ms 2264 KB Partially correct
10 Partially correct 2 ms 2264 KB Partially correct
11 Partially correct 3 ms 2264 KB Partially correct
12 Partially correct 3 ms 2264 KB Partially correct
13 Partially correct 2 ms 2264 KB Partially correct
14 Partially correct 3 ms 2264 KB Partially correct
15 Partially correct 2 ms 2264 KB Partially correct
16 Partially correct 14 ms 2264 KB Partially correct
17 Partially correct 15 ms 2264 KB Partially correct
18 Partially correct 15 ms 2264 KB Partially correct
19 Partially correct 15 ms 2264 KB Partially correct
20 Partially correct 11 ms 2264 KB Partially correct
21 Incorrect 55 ms 2264 KB Expected int32, but "2500100000" found
22 Incorrect 55 ms 2264 KB Expected int32, but "2500100000" found
23 Incorrect 61 ms 2264 KB Expected int32, but "2500100000" found
24 Incorrect 55 ms 2264 KB Expected int32, but "2500100000" found
25 Incorrect 47 ms 2264 KB Expected int32, but "2500100000" found
26 Incorrect 53 ms 2264 KB Expected int32, but "2500100000" found
27 Incorrect 53 ms 2264 KB Expected int32, but "2500100000" found
28 Incorrect 53 ms 2264 KB Expected int32, but "2500100000" found
29 Incorrect 54 ms 2264 KB Expected int32, but "2500100000" found
30 Incorrect 39 ms 2264 KB Expected int32, but "2500100000" found
31 Partially correct 2 ms 2264 KB Partially correct
32 Partially correct 2 ms 2264 KB Partially correct