Submission #1076753

# Submission time Handle Problem Language Result Execution time Memory
1076753 2024-08-26T16:11:23 Z TFF Gap (APIO16_gap) C++17
0 / 100
40 ms 2104 KB
#include <bits/stdc++.h>
#include "gap.h"
using namespace std;
long long findGap(int t, int n) {
    long long mn, mx, left, right;
    left = 0;
    right = 1000000000000000000;
    mn = mx = 0;
    vector<long long> arr1, arr2;
    for (int i = 0; i < (n + 1) / 2; i++) {
        MinMax(left, right, &mn, &mx);
        arr1.push_back(mn);
        arr2.push_back(mx);
        left = mn + 1;
        right = mx - 1;
    }
    long long ans = arr2.back() - arr1.back();
    for (int i = 0; i < (int)arr1.size() - 1; i++) {
        ans = max(ans, arr1[i + 1] - arr1[i]);
    }
    for (int i = (int)arr2.size() - 2; i >= 0; i--) {
        ans = max(ans, arr2[i + 1] - arr2[i]);
    }
    return ans;
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Incorrect 1 ms 344 KB Output isn't correct
3 Incorrect 1 ms 344 KB Output isn't correct
4 Incorrect 0 ms 344 KB Output isn't correct
5 Correct 0 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 Incorrect 0 ms 344 KB Output isn't correct
9 Incorrect 0 ms 344 KB Output isn't correct
10 Incorrect 0 ms 344 KB Output isn't correct
11 Incorrect 1 ms 344 KB Output isn't correct
12 Incorrect 1 ms 344 KB Output isn't correct
13 Incorrect 1 ms 344 KB Output isn't correct
14 Incorrect 1 ms 344 KB Output isn't correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 10 ms 948 KB Output is correct
17 Incorrect 9 ms 856 KB Output isn't correct
18 Incorrect 10 ms 868 KB Output isn't correct
19 Incorrect 7 ms 768 KB Output isn't correct
20 Incorrect 8 ms 856 KB Output isn't correct
21 Incorrect 32 ms 2008 KB Output isn't correct
22 Incorrect 27 ms 1924 KB Output isn't correct
23 Incorrect 40 ms 2084 KB Output isn't correct
24 Incorrect 25 ms 1924 KB Output isn't correct
25 Correct 35 ms 1924 KB Output is correct
26 Incorrect 26 ms 2012 KB Output isn't correct
27 Incorrect 36 ms 1916 KB Output isn't correct
28 Incorrect 27 ms 1916 KB Output isn't correct
29 Incorrect 31 ms 2064 KB Output isn't correct
30 Incorrect 23 ms 1924 KB Output isn't correct
31 Incorrect 0 ms 344 KB Output isn't correct
32 Correct 0 ms 344 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Partially correct 0 ms 344 KB Partially correct
3 Incorrect 0 ms 344 KB Output isn't correct
4 Incorrect 0 ms 344 KB Output isn't correct
5 Partially correct 1 ms 344 KB Partially correct
6 Partially correct 0 ms 344 KB Partially correct
7 Partially correct 1 ms 340 KB Partially correct
8 Partially correct 1 ms 344 KB Partially correct
9 Partially correct 0 ms 344 KB Partially correct
10 Incorrect 0 ms 344 KB Output isn't correct
11 Incorrect 1 ms 344 KB Output isn't correct
12 Incorrect 1 ms 344 KB Output isn't correct
13 Incorrect 1 ms 344 KB Output isn't correct
14 Incorrect 0 ms 344 KB Output isn't correct
15 Partially correct 1 ms 344 KB Partially correct
16 Incorrect 7 ms 856 KB Output isn't correct
17 Incorrect 7 ms 856 KB Output isn't correct
18 Incorrect 6 ms 944 KB Output isn't correct
19 Incorrect 7 ms 1108 KB Output isn't correct
20 Incorrect 6 ms 856 KB Output isn't correct
21 Incorrect 28 ms 1964 KB Expected int32, but "2500100000" found
22 Incorrect 27 ms 2092 KB Expected int32, but "2500100000" found
23 Incorrect 27 ms 1924 KB Expected int32, but "2500100000" found
24 Incorrect 26 ms 1924 KB Expected int32, but "2500100000" found
25 Incorrect 25 ms 1924 KB Expected int32, but "2500100000" found
26 Incorrect 29 ms 2104 KB Expected int32, but "2500100000" found
27 Incorrect 27 ms 2016 KB Expected int32, but "2500100000" found
28 Incorrect 35 ms 1924 KB Expected int32, but "2500100000" found
29 Incorrect 36 ms 1924 KB Expected int32, but "2500100000" found
30 Incorrect 21 ms 1924 KB Expected int32, but "2500100000" found
31 Incorrect 0 ms 596 KB Output isn't correct
32 Partially correct 0 ms 344 KB Partially correct