Submission #1083362

# Submission time Handle Problem Language Result Execution time Memory
1083362 2024-09-03T03:16:58 Z Seungni Gap (APIO16_gap) C++17
70 / 100
40 ms 1112 KB
#include <bits/stdc++.h>
#include "gap.h"

using namespace std;
using ll = long long;
using pii = pair<int, int>;

long long findGap(int T, int N) {
    
    ll l = 0, r = 1e18 + 500;
    
    ll mn, mx;
    MinMax(l, r, &mn, &mx);
    
    l = mn, r = mx;
    
    ll len = (r - 1) - (l + 1) + 1;
    
    if (N == 2) return r - l;
    
    ll b = len / N;
    if (len % N) b++;
    
    ll ret = 0;
    
    ll p = l;
    l++;
    
    while (l < r) {
        MinMax(l, l + b, &mn, &mx);
        
        l += b + 1;
        if (mn == -1 && mx == -1) continue;
        
        ret = max(ret, mn - p);
        ret = max(ret, mx - mn);
        p = mx;
    }
    
    return ret;
}
# Verdict Execution time Memory Grader output
1 Correct 0 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 Incorrect 0 ms 344 KB Output isn't correct
6 Incorrect 0 ms 344 KB Output isn't correct
7 Incorrect 0 ms 344 KB Output isn't 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 Incorrect 1 ms 344 KB Output isn't correct
16 Incorrect 9 ms 660 KB Output isn't correct
17 Incorrect 8 ms 600 KB Output isn't correct
18 Incorrect 9 ms 600 KB Output isn't correct
19 Incorrect 9 ms 600 KB Output isn't correct
20 Incorrect 8 ms 652 KB Output isn't correct
21 Incorrect 40 ms 1112 KB Output isn't correct
22 Incorrect 36 ms 1112 KB Output isn't correct
23 Incorrect 36 ms 1112 KB Output isn't correct
24 Incorrect 35 ms 1112 KB Output isn't correct
25 Incorrect 32 ms 1112 KB Output isn't correct
26 Incorrect 35 ms 1112 KB Output isn't correct
27 Incorrect 40 ms 1112 KB Output isn't correct
28 Incorrect 37 ms 1112 KB Output isn't correct
29 Incorrect 35 ms 1112 KB Output isn't correct
30 Incorrect 20 ms 1112 KB Output isn't correct
31 Incorrect 1 ms 344 KB Output isn't correct
32 Incorrect 0 ms 344 KB Output isn't correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is 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 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 408 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 9 ms 600 KB Output is correct
17 Correct 8 ms 600 KB Output is correct
18 Correct 8 ms 436 KB Output is correct
19 Correct 11 ms 652 KB Output is correct
20 Correct 6 ms 600 KB Output is correct
21 Correct 34 ms 1112 KB Output is correct
22 Correct 35 ms 1112 KB Output is correct
23 Correct 35 ms 1112 KB Output is correct
24 Correct 35 ms 1112 KB Output is correct
25 Correct 33 ms 1112 KB Output is correct
26 Correct 40 ms 1112 KB Output is correct
27 Correct 37 ms 1108 KB Output is correct
28 Correct 34 ms 1112 KB Output is correct
29 Correct 34 ms 1112 KB Output is correct
30 Correct 20 ms 1112 KB Output is correct
31 Correct 0 ms 344 KB Output is correct
32 Correct 0 ms 344 KB Output is correct