답안 #40700

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
40700 2018-02-06T19:17:42 Z Hassoony Gap (APIO16_gap) C++14
30 / 100
86 ms 2200 KB
#include <stdio.h>
#include <stdlib.h>
#include<bits/stdc++.h>
using namespace std;
#include "gap.h"

static void my_assert(int k){ if (!k) exit(1); }

static int subtask_num, N;
static long long A[100001];
static long long call_count;
typedef long long ll;
typedef double D;
const ll inf=(1ll<<61);
const ll mod=1e9+7;
const int MX=2e5+9;
ll findGap(int T, int n){
    if(T==1){
        ll ans=0;
        ll l,r,a[MX];
        l=0,r=n+1;
        for(int i=0;i<n;i++)a[i]=-inf;
        a[l]=-1;
        a[r]=1000000000000000009;
        for(int i=1;i<=(n+1)/2;i++){
            MinMax(a[l]+1,a[r]-1,&a[l+1],&a[r-1]);
            l++;r--;
        }
        for(int i=2;i<=n;i++)ans=max(ans,a[i]-a[i-1]);
        return ans;
    }
    else{
        ll l,r,add,last,mn,mx,ans=0;
        MinMax(-1,1000000000000000009,&l,&r);
        last=l;add=(r-l-1)/(n+1);
        for(ll x=l+1,y=l+add,i=0;i<n;i++,x+=add,y+=add){
            y=min(y,r-1);
            if(x>y)break;
            MinMax(x,y,&mn,&mx);
            if(mn==-1)continue;
            ans=max(ans,mn-last);
            last=mx;
        }
        ans=max(ans,r-last);
        return ans;
    }
}


Compilation message

gap.cpp:7:13: warning: 'void my_assert(int)' defined but not used [-Wunused-function]
 static void my_assert(int k){ if (!k) exit(1); }
             ^
gap.cpp:9:12: warning: 'subtask_num' defined but not used [-Wunused-variable]
 static int subtask_num, N;
            ^
gap.cpp:9:25: warning: 'N' defined but not used [-Wunused-variable]
 static int subtask_num, N;
                         ^
gap.cpp:10:18: warning: 'A' defined but not used [-Wunused-variable]
 static long long A[100001];
                  ^
gap.cpp:11:18: warning: 'call_count' defined but not used [-Wunused-variable]
 static long long call_count;
                  ^
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 248 KB Output is correct
2 Correct 1 ms 352 KB Output is correct
3 Correct 1 ms 424 KB Output is correct
4 Correct 1 ms 428 KB Output is correct
5 Correct 1 ms 500 KB Output is correct
6 Correct 1 ms 500 KB Output is correct
7 Correct 1 ms 512 KB Output is correct
8 Correct 2 ms 512 KB Output is correct
9 Correct 2 ms 568 KB Output is correct
10 Correct 2 ms 568 KB Output is correct
11 Correct 2 ms 584 KB Output is correct
12 Correct 2 ms 584 KB Output is correct
13 Correct 2 ms 616 KB Output is correct
14 Correct 2 ms 616 KB Output is correct
15 Correct 2 ms 616 KB Output is correct
16 Correct 19 ms 1000 KB Output is correct
17 Correct 14 ms 1004 KB Output is correct
18 Correct 14 ms 1004 KB Output is correct
19 Correct 14 ms 1004 KB Output is correct
20 Correct 12 ms 1128 KB Output is correct
21 Correct 54 ms 2156 KB Output is correct
22 Correct 59 ms 2156 KB Output is correct
23 Correct 52 ms 2156 KB Output is correct
24 Correct 52 ms 2156 KB Output is correct
25 Correct 48 ms 2156 KB Output is correct
26 Correct 52 ms 2200 KB Output is correct
27 Correct 53 ms 2200 KB Output is correct
28 Correct 69 ms 2200 KB Output is correct
29 Correct 60 ms 2200 KB Output is correct
30 Correct 40 ms 2200 KB Output is correct
31 Correct 2 ms 2200 KB Output is correct
32 Correct 1 ms 2200 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2200 KB Output is correct
2 Correct 1 ms 2200 KB Output is correct
3 Correct 1 ms 2200 KB Output is correct
4 Correct 2 ms 2200 KB Output is correct
5 Correct 2 ms 2200 KB Output is correct
6 Correct 1 ms 2200 KB Output is correct
7 Correct 1 ms 2200 KB Output is correct
8 Correct 1 ms 2200 KB Output is correct
9 Correct 1 ms 2200 KB Output is correct
10 Incorrect 2 ms 2200 KB Output isn't correct
11 Correct 2 ms 2200 KB Output is correct
12 Correct 2 ms 2200 KB Output is correct
13 Correct 2 ms 2200 KB Output is correct
14 Correct 3 ms 2200 KB Output is correct
15 Correct 2 ms 2200 KB Output is correct
16 Correct 18 ms 2200 KB Output is correct
17 Correct 18 ms 2200 KB Output is correct
18 Correct 18 ms 2200 KB Output is correct
19 Correct 18 ms 2200 KB Output is correct
20 Incorrect 9 ms 2200 KB Output isn't correct
21 Correct 72 ms 2200 KB Output is correct
22 Correct 86 ms 2200 KB Output is correct
23 Correct 69 ms 2200 KB Output is correct
24 Correct 77 ms 2200 KB Output is correct
25 Incorrect 67 ms 2200 KB Output isn't correct
26 Correct 70 ms 2200 KB Output is correct
27 Correct 69 ms 2200 KB Output is correct
28 Correct 71 ms 2200 KB Output is correct
29 Correct 70 ms 2200 KB Output is correct
30 Incorrect 37 ms 2200 KB Output isn't correct
31 Correct 1 ms 2200 KB Output is correct
32 Correct 1 ms 2200 KB Output is correct