답안 #40208

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
40208	2018-01-29T18:04:31 Z	igzi	Gap (APIO16_gap)	C++14	87.6397 / 100	78 ms	5804 KB

gap

#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,ans,last,s,e;
        MinMax(-1,1000000000000000005,&a,&b);
      last=a;
        if(n==2) return b-a;
        long long d=(b-a-2)/(n-1);
        ans=0;
        for(s=a+1,e=a+d+1;e<b;s+=d,e+=d){
            long long mi,ma;
            MinMax(s,e,&mi,&ma);
            if(mi!=-1){
                ans=max(ans,mi-last);
                last=ma;
            }
        }
        long long mi,ma;
        MinMax(s,b-1,&mi,&ma);
        if(mi==-1) ans=max(ans,b-last);
        else ans=max(ans,mi-last);
        return ans;
    }
  return 0;
}

Subtask #1

30.0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	5796 KB	Output is correct
2	Correct	0 ms	5796 KB	Output is correct
3	Correct	0 ms	5800 KB	Output is correct
4	Correct	0 ms	5800 KB	Output is correct
5	Correct	1 ms	5796 KB	Output is correct
6	Correct	0 ms	5800 KB	Output is correct
7	Correct	0 ms	5804 KB	Output is correct
8	Correct	0 ms	5800 KB	Output is correct
9	Correct	0 ms	5800 KB	Output is correct
10	Correct	0 ms	5804 KB	Output is correct
11	Correct	0 ms	5800 KB	Output is correct
12	Correct	1 ms	5796 KB	Output is correct
13	Correct	1 ms	5800 KB	Output is correct
14	Correct	1 ms	5800 KB	Output is correct
15	Correct	1 ms	5800 KB	Output is correct
16	Correct	11 ms	5800 KB	Output is correct
17	Correct	7 ms	5804 KB	Output is correct
18	Correct	9 ms	5804 KB	Output is correct
19	Correct	14 ms	5800 KB	Output is correct
20	Correct	5 ms	5800 KB	Output is correct
21	Correct	52 ms	5796 KB	Output is correct
22	Correct	51 ms	5804 KB	Output is correct
23	Correct	48 ms	5804 KB	Output is correct
24	Correct	51 ms	5796 KB	Output is correct
25	Correct	41 ms	5804 KB	Output is correct
26	Correct	58 ms	5800 KB	Output is correct
27	Correct	55 ms	5800 KB	Output is correct
28	Correct	52 ms	5804 KB	Output is correct
29	Correct	52 ms	5800 KB	Output is correct
30	Correct	41 ms	5800 KB	Output is correct
31	Correct	0 ms	5800 KB	Output is correct
32	Correct	0 ms	5804 KB	Output is correct

Subtask #2

57.639749718 / 70.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	5800 KB	Output is correct
2	Correct	0 ms	5796 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	5796 KB	Output is correct
6	Correct	0 ms	5804 KB	Output is correct
7	Correct	0 ms	5796 KB	Output is correct
8	Correct	0 ms	5800 KB	Output is correct
9	Correct	0 ms	5800 KB	Output is correct
10	Correct	0 ms	5800 KB	Output is correct
11	Correct	1 ms	5796 KB	Output is correct
12	Correct	1 ms	5796 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	20 ms	5800 KB	Output is correct
17	Correct	21 ms	5800 KB	Output is correct
18	Correct	20 ms	5800 KB	Output is correct
19	Correct	20 ms	5800 KB	Output is correct
20	Partially correct	9 ms	5800 KB	Partially correct
21	Correct	73 ms	5800 KB	Output is correct
22	Correct	73 ms	5804 KB	Output is correct
23	Correct	70 ms	5800 KB	Output is correct
24	Correct	58 ms	5796 KB	Output is correct
25	Correct	68 ms	5804 KB	Output is correct
26	Correct	78 ms	5800 KB	Output is correct
27	Correct	67 ms	5800 KB	Output is correct
28	Correct	77 ms	5800 KB	Output is correct
29	Correct	73 ms	5800 KB	Output is correct
30	Partially correct	41 ms	5804 KB	Partially correct
31	Correct	0 ms	5800 KB	Output is correct
32	Correct	0 ms	5800 KB	Output is correct