Submission #101271

# Submission time Handle Problem Language Result Execution time Memory
101271 2019-03-18T06:42:36 Z ae04071 Gap (APIO16_gap) C++11
30 / 100
108 ms 1272 KB
#include "gap.h"
#include <bits/stdc++.h>
#define fi first
#define se second
#define sz(x) ((int)(x).size())
using namespace std;
using lli=long long;
using pll=pair<lli,lli>;

const lli INF=1000000000000000000ll;

lli sub1(int n) {
    lli mx=0, lv=-1, rv=INF+1;
    for(int i=0;i<(n+1)/2;i++) {
        lli s=lv, t=rv, l, r;
        MinMax(s+1, t-1, &l, &r);
        if(i!=0) {
            mx = max(mx, l-lv);
            mx = max(mx, rv-r);
        }
        lv = l; rv = r;
    }
    if(!(n&1)) mx = max(mx, rv-lv);
    return mx;
}
lli mx=0;
int SEG = 3;
pll dfs(lli lv,lli rv) {
    if(lv>rv) return pll(-1,-1);
    lli s=lv, t=rv, l,r;
    MinMax(s,t,&l,&r);
    if(l==-1) return pll(-1, -1);
    else if(l==r) return pll(l,l);
    else {
        lli pr = l, ints=l;
        for(int i=0;i<SEG;i++) {
            lli s = ints+1, t=ints+1+(r-l)/SEG+1;
            if(s>=r) break;
            if(t>=r) t=r-1;
            
            pll tmp = dfs(s, t);
            if(tmp.fi!=-1) {
                mx = max(mx, tmp.fi-l);
                pr=tmp.se;
            }
            ints = t+1;
        }
        mx = max(mx, r-pr);
        return pll(l, r);
    }
}
lli sub2(int n) {
    dfs(0, INF);
    return mx;
}

long long findGap(int T, int N)
{
    mx=0;

    if(T==1) return sub1(N);
    else return sub2(N);
    
	return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 3 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 3 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 3 ms 384 KB Output is correct
12 Correct 3 ms 384 KB Output is correct
13 Correct 3 ms 384 KB Output is correct
14 Correct 3 ms 384 KB Output is correct
15 Correct 3 ms 384 KB Output is correct
16 Correct 14 ms 512 KB Output is correct
17 Correct 14 ms 520 KB Output is correct
18 Correct 14 ms 512 KB Output is correct
19 Correct 13 ms 512 KB Output is correct
20 Correct 10 ms 512 KB Output is correct
21 Correct 49 ms 1152 KB Output is correct
22 Correct 56 ms 1272 KB Output is correct
23 Correct 51 ms 1060 KB Output is correct
24 Correct 51 ms 1144 KB Output is correct
25 Correct 43 ms 1152 KB Output is correct
26 Correct 51 ms 1144 KB Output is correct
27 Correct 48 ms 1144 KB Output is correct
28 Correct 51 ms 1144 KB Output is correct
29 Correct 49 ms 1144 KB Output is correct
30 Correct 38 ms 1152 KB Output is correct
31 Correct 3 ms 384 KB Output is correct
32 Correct 3 ms 384 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Incorrect 3 ms 384 KB Output isn't correct
3 Incorrect 2 ms 384 KB Output isn't correct
4 Incorrect 3 ms 384 KB Output isn't correct
5 Incorrect 3 ms 384 KB Output isn't correct
6 Incorrect 2 ms 384 KB Output isn't correct
7 Incorrect 2 ms 384 KB Output isn't correct
8 Incorrect 3 ms 384 KB Output isn't correct
9 Incorrect 2 ms 384 KB Output isn't correct
10 Incorrect 2 ms 384 KB Output isn't correct
11 Incorrect 3 ms 384 KB Output isn't correct
12 Incorrect 3 ms 384 KB Output isn't correct
13 Incorrect 3 ms 384 KB Output isn't correct
14 Incorrect 4 ms 384 KB Output isn't correct
15 Incorrect 3 ms 384 KB Output isn't correct
16 Incorrect 20 ms 512 KB Output isn't correct
17 Incorrect 21 ms 512 KB Output isn't correct
18 Incorrect 24 ms 512 KB Output isn't correct
19 Incorrect 25 ms 512 KB Output isn't correct
20 Incorrect 11 ms 512 KB Output isn't correct
21 Incorrect 84 ms 1272 KB Output isn't correct
22 Incorrect 108 ms 1144 KB Output isn't correct
23 Incorrect 84 ms 1164 KB Output isn't correct
24 Incorrect 106 ms 1144 KB Output isn't correct
25 Incorrect 76 ms 1272 KB Output isn't correct
26 Incorrect 78 ms 1144 KB Output isn't correct
27 Incorrect 80 ms 1272 KB Output isn't correct
28 Incorrect 102 ms 1196 KB Output isn't correct
29 Incorrect 92 ms 1156 KB Output isn't correct
30 Incorrect 37 ms 1152 KB Output isn't correct
31 Partially correct 2 ms 384 KB Partially correct
32 Incorrect 3 ms 384 KB Output isn't correct