Submission #849854

# Submission time Handle Problem Language Result Execution time Memory
849854 2023-09-15T13:12:52 Z nnin Gap (APIO16_gap) C++14
30 / 100
43 ms 3092 KB
#include "gap.h"
#define ll long long
#include<bits/stdc++.h>
using namespace std;

long long findGap(int T, int N) {
    ll mn, mx, curmn, curmx;
    MinMax((ll)0, (ll)1e18, &mn, &mx);
    ll ans = 0;
    if(T==1) {
        while(N>2) {
            MinMax(mn+1, mx-1, &curmn, &curmx);
            ans = max(ans,  max(curmn-mn, mx-curmx));
            N -= 2;
            mx = curmx;
            mn = curmn;
        }
        ans = max(ans, mx-mn);
    } else {
        ll gap = ans = (mx-mn-1)/(N-1);
        ll rem = (mx-mn-1)%(N-1);
        ll last = mn;
        for(int i=1;i<N;i++) {
            MinMax(last+1, mn+gap+(i<=rem), &curmn, &curmx);
            if(curmn!=-1) {
                ans = max(ans, curmn-last);
                last = curmx;
            }
            mn += gap+(i<=rem);
        }
    }
    return ans;
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 2392 KB Output is correct
3 Correct 0 ms 2392 KB Output is correct
4 Correct 0 ms 2392 KB Output is correct
5 Correct 1 ms 2392 KB Output is correct
6 Correct 0 ms 2392 KB Output is correct
7 Correct 1 ms 2392 KB Output is correct
8 Correct 1 ms 2392 KB Output is correct
9 Correct 0 ms 2440 KB Output is correct
10 Correct 1 ms 2392 KB Output is correct
11 Correct 1 ms 2392 KB Output is correct
12 Correct 1 ms 2392 KB Output is correct
13 Correct 1 ms 2392 KB Output is correct
14 Correct 1 ms 2392 KB Output is correct
15 Correct 1 ms 2392 KB Output is correct
16 Correct 8 ms 2392 KB Output is correct
17 Correct 8 ms 2584 KB Output is correct
18 Correct 9 ms 2588 KB Output is correct
19 Correct 8 ms 2580 KB Output is correct
20 Correct 6 ms 2832 KB Output is correct
21 Correct 30 ms 3092 KB Output is correct
22 Correct 29 ms 2856 KB Output is correct
23 Correct 29 ms 2856 KB Output is correct
24 Correct 30 ms 2856 KB Output is correct
25 Correct 27 ms 2848 KB Output is correct
26 Correct 29 ms 2852 KB Output is correct
27 Correct 30 ms 2860 KB Output is correct
28 Correct 29 ms 2852 KB Output is correct
29 Correct 30 ms 2856 KB Output is correct
30 Correct 25 ms 2820 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 Incorrect 0 ms 2392 KB Output isn't correct
2 Correct 0 ms 2392 KB Output is correct
3 Correct 1 ms 2392 KB Output is correct
4 Correct 1 ms 2392 KB Output is correct
5 Correct 1 ms 2392 KB Output is correct
6 Correct 0 ms 2392 KB Output is correct
7 Correct 1 ms 2392 KB Output is correct
8 Correct 1 ms 2392 KB Output is correct
9 Correct 0 ms 2392 KB Output is correct
10 Correct 0 ms 2392 KB Output is correct
11 Correct 1 ms 2392 KB Output is correct
12 Correct 1 ms 2392 KB Output is correct
13 Correct 1 ms 2392 KB Output is correct
14 Correct 1 ms 2392 KB Output is correct
15 Correct 1 ms 2392 KB Output is correct
16 Correct 10 ms 2752 KB Output is correct
17 Correct 10 ms 2584 KB Output is correct
18 Correct 10 ms 2392 KB Output is correct
19 Correct 10 ms 2752 KB Output is correct
20 Correct 5 ms 2392 KB Output is correct
21 Correct 41 ms 2832 KB Output is correct
22 Correct 41 ms 2852 KB Output is correct
23 Correct 41 ms 2860 KB Output is correct
24 Correct 43 ms 2860 KB Output is correct
25 Correct 39 ms 2852 KB Output is correct
26 Correct 42 ms 2856 KB Output is correct
27 Correct 40 ms 2860 KB Output is correct
28 Correct 41 ms 2852 KB Output is correct
29 Correct 41 ms 2860 KB Output is correct
30 Correct 24 ms 2856 KB Output is correct
31 Incorrect 1 ms 2392 KB Output isn't correct
32 Correct 1 ms 2440 KB Output is correct