Submission #1083361

# Submission time Handle Problem Language Result Execution time Memory
1083361 2024-09-03T03:15:53 Z Seungni Gap (APIO16_gap) C++17
59.0204 / 100
45 ms 1360 KB
#include <bits/stdc++.h>
#include "gap.h"

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

ll ans[100005];

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;
    
    while (l < r) {
        MinMax(l, l + b, &mn, &mx);
        
        l += b;
        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 1 ms 344 KB Output is correct
2 Incorrect 0 ms 344 KB Output isn't correct
3 Incorrect 0 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 440 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 4 ms 600 KB Output isn't correct
21 Incorrect 35 ms 1112 KB Output isn't correct
22 Incorrect 42 ms 1112 KB Output isn't correct
23 Incorrect 35 ms 1112 KB Output isn't correct
24 Incorrect 36 ms 1112 KB Output isn't correct
25 Incorrect 33 ms 1360 KB Output isn't correct
26 Incorrect 37 ms 1112 KB Output isn't correct
27 Incorrect 43 ms 1112 KB Output isn't correct
28 Incorrect 35 ms 1112 KB Output isn't correct
29 Incorrect 36 ms 1112 KB Output isn't correct
30 Incorrect 26 ms 1112 KB Output isn't correct
31 Incorrect 0 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 0 ms 344 KB Output is correct
2 Partially correct 1 ms 344 KB Partially correct
3 Partially correct 0 ms 344 KB Partially correct
4 Partially correct 1 ms 344 KB Partially correct
5 Partially correct 0 ms 344 KB Partially correct
6 Partially correct 0 ms 344 KB Partially correct
7 Partially correct 0 ms 344 KB Partially correct
8 Partially correct 1 ms 344 KB Partially correct
9 Partially correct 0 ms 344 KB Partially correct
10 Partially correct 0 ms 344 KB Partially correct
11 Partially correct 1 ms 344 KB Partially correct
12 Partially correct 1 ms 344 KB Partially correct
13 Partially correct 1 ms 344 KB Partially correct
14 Partially correct 1 ms 344 KB Partially correct
15 Partially correct 1 ms 344 KB Partially correct
16 Partially correct 11 ms 660 KB Partially correct
17 Partially correct 10 ms 656 KB Partially correct
18 Partially correct 11 ms 600 KB Partially correct
19 Partially correct 9 ms 600 KB Partially correct
20 Partially correct 5 ms 600 KB Partially correct
21 Partially correct 37 ms 1220 KB Partially correct
22 Partially correct 43 ms 1224 KB Partially correct
23 Partially correct 35 ms 1360 KB Partially correct
24 Partially correct 36 ms 1112 KB Partially correct
25 Partially correct 33 ms 1112 KB Partially correct
26 Partially correct 35 ms 1112 KB Partially correct
27 Partially correct 40 ms 1356 KB Partially correct
28 Partially correct 35 ms 1112 KB Partially correct
29 Partially correct 45 ms 1112 KB Partially correct
30 Partially correct 22 ms 1112 KB Partially correct
31 Partially correct 1 ms 344 KB Partially correct
32 Partially correct 0 ms 344 KB Partially correct