답안 #40212

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
40212 2018-01-29T18:11:08 Z igzi Gap (APIO16_gap) C++14
100 / 100
79 ms 5804 KB
#include <bits/stdc++.h>
#include "gap.h"
 
using namespace std;
 
long long findGap(int t,int n){
    if(t==1){
    long long l=0,d=n+1,a[100005],m=0,i;
    for(i=0;i<n;i++){
        a[i]=-5;
    }
    a[0]=-1;
    a[n+1]=1000000000000000005;
    for(i=1;i<=(n+1)/2;i++){
        MinMax(a[l]+1,a[d]-1,&a[l+1],&a[d-1]);
        l++; d--;
    }
    for(i=2;i<=l;i++){
        m=max(m,a[i]-a[i-1]);
    }
    if(l+1==d) m=max(m,a[d]-a[l]);
    for(i=d+1;i<n+1;i++){
        m=max(m,a[i]-a[i-1]);
    }
    return m;}
    else{
        long long a,b,i,ans=0,last,s,e;
        MinMax(0,1e18+5,&a,&b);
        last=a;
        long long d=(b-a-1)/n+1;
        for(s=a+1,e=a+d,i=0;i<n;s+=d,e+=d,i++){
            if(e>=b) e=b-1;
            if(s>e) break;
            long long mi,ma;
            MinMax(s,e,&mi,&ma);
            if(mi!=-1){
                ans=max(ans,mi-last);
                last=ma;
            }
        }
        ans=max(ans,b-last);
        return ans;
    }
}
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 5800 KB Output is correct
2 Correct 0 ms 5800 KB Output is correct
3 Correct 0 ms 5804 KB Output is correct
4 Correct 0 ms 5800 KB Output is correct
5 Correct 0 ms 5804 KB Output is correct
6 Correct 0 ms 5796 KB Output is correct
7 Correct 0 ms 5800 KB Output is correct
8 Correct 0 ms 5800 KB Output is correct
9 Correct 0 ms 5804 KB Output is correct
10 Correct 0 ms 5800 KB Output is correct
11 Correct 1 ms 5800 KB Output is correct
12 Correct 1 ms 5800 KB Output is correct
13 Correct 1 ms 5804 KB Output is correct
14 Correct 1 ms 5796 KB Output is correct
15 Correct 1 ms 5800 KB Output is correct
16 Correct 15 ms 5796 KB Output is correct
17 Correct 17 ms 5804 KB Output is correct
18 Correct 12 ms 5796 KB Output is correct
19 Correct 16 ms 5800 KB Output is correct
20 Correct 9 ms 5800 KB Output is correct
21 Correct 51 ms 5796 KB Output is correct
22 Correct 60 ms 5804 KB Output is correct
23 Correct 63 ms 5804 KB Output is correct
24 Correct 59 ms 5796 KB Output is correct
25 Correct 51 ms 5800 KB Output is correct
26 Correct 52 ms 5800 KB Output is correct
27 Correct 60 ms 5800 KB Output is correct
28 Correct 58 ms 5796 KB Output is correct
29 Correct 58 ms 5804 KB Output is correct
30 Correct 29 ms 5800 KB Output is correct
31 Correct 0 ms 5804 KB Output is correct
32 Correct 0 ms 5800 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 5800 KB Output is correct
2 Correct 0 ms 5800 KB Output is correct
3 Correct 0 ms 5800 KB Output is correct
4 Correct 0 ms 5804 KB Output is correct
5 Correct 0 ms 5796 KB Output is correct
6 Correct 0 ms 5796 KB Output is correct
7 Correct 0 ms 5796 KB Output is correct
8 Correct 0 ms 5796 KB Output is correct
9 Correct 0 ms 5804 KB Output is correct
10 Correct 0 ms 5800 KB Output is correct
11 Correct 2 ms 5804 KB Output is correct
12 Correct 1 ms 5804 KB Output is correct
13 Correct 1 ms 5804 KB Output is correct
14 Correct 1 ms 5796 KB Output is correct
15 Correct 1 ms 5800 KB Output is correct
16 Correct 19 ms 5800 KB Output is correct
17 Correct 14 ms 5800 KB Output is correct
18 Correct 16 ms 5804 KB Output is correct
19 Correct 15 ms 5804 KB Output is correct
20 Correct 9 ms 5796 KB Output is correct
21 Correct 74 ms 5804 KB Output is correct
22 Correct 72 ms 5804 KB Output is correct
23 Correct 70 ms 5804 KB Output is correct
24 Correct 64 ms 5796 KB Output is correct
25 Correct 59 ms 5800 KB Output is correct
26 Correct 79 ms 5800 KB Output is correct
27 Correct 65 ms 5804 KB Output is correct
28 Correct 73 ms 5804 KB Output is correct
29 Correct 69 ms 5796 KB Output is correct
30 Correct 42 ms 5800 KB Output is correct
31 Correct 0 ms 5800 KB Output is correct
32 Correct 0 ms 5796 KB Output is correct