답안 #76387

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
76387	2018-09-13T09:19:52 Z	vex	Gap (APIO16_gap)	C++14	30 / 100	2000 ms	2272 KB

gap

#include <bits/stdc++.h>
#include<gap.h>
#define maxn 100005
#define INF 1e18 + 1000
using namespace std;

int n;
long long a[maxn];

long long findGap(int t,int n)
{
    if(t==1)
    {
        int br=1;
        long long mn,mx;
        a[0]=0;
        a[n+1]=INF;
        while(br<=(n+1)/2)
        {
            MinMax(a[br-1]+1,a[n+2-br]-1,&mn,&mx);
            a[br]=mn;
            a[n+1-br]=mx;
            br++;
        }

        long long sol=0;
        for(int i=1;i<n;i++)
        {
            if(a[i+1]-a[i]>sol)sol=a[i+1]-a[i];
        }
        return sol;
    }

    long long mn,mx;
    long long sol=0;

    MinMax(1,INF,&mn,&mx);
    long long last=mn;
    long long exp=(mx-mn)/(n-1);
    long long d=mn;

    while(d<INF)
    {
        MinMax(d+1,d+exp,&mn,&mx);
        if(mn!=-1)
        {
            if(mn-last>sol && last!=0)sol=mn-last;
            last=mx;
        }
        d+=exp;
        if(sol>exp)exp=sol;
    }

    return sol;
}

Subtask #1

30.0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	476 KB	Output is correct
3	Correct	2 ms	476 KB	Output is correct
4	Correct	2 ms	476 KB	Output is correct
5	Correct	2 ms	476 KB	Output is correct
6	Correct	2 ms	524 KB	Output is correct
7	Correct	2 ms	524 KB	Output is correct
8	Correct	2 ms	564 KB	Output is correct
9	Correct	2 ms	564 KB	Output is correct
10	Correct	2 ms	592 KB	Output is correct
11	Correct	3 ms	720 KB	Output is correct
12	Correct	3 ms	720 KB	Output is correct
13	Correct	3 ms	720 KB	Output is correct
14	Correct	3 ms	720 KB	Output is correct
15	Correct	3 ms	720 KB	Output is correct
16	Correct	17 ms	992 KB	Output is correct
17	Correct	17 ms	992 KB	Output is correct
18	Correct	15 ms	1248 KB	Output is correct
19	Correct	16 ms	1248 KB	Output is correct
20	Correct	11 ms	1248 KB	Output is correct
21	Correct	57 ms	2156 KB	Output is correct
22	Correct	55 ms	2164 KB	Output is correct
23	Correct	58 ms	2164 KB	Output is correct
24	Correct	59 ms	2272 KB	Output is correct
25	Correct	47 ms	2272 KB	Output is correct
26	Correct	55 ms	2272 KB	Output is correct
27	Correct	59 ms	2272 KB	Output is correct
28	Correct	58 ms	2272 KB	Output is correct
29	Correct	59 ms	2272 KB	Output is correct
30	Correct	42 ms	2272 KB	Output is correct
31	Correct	2 ms	2272 KB	Output is correct
32	Correct	2 ms	2272 KB	Output is correct

Subtask #2

0 / 70.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	2272 KB	Output is correct
2	Correct	2 ms	2272 KB	Output is correct
3	Correct	2 ms	2272 KB	Output is correct
4	Correct	2 ms	2272 KB	Output is correct
5	Execution timed out	2033 ms	2272 KB	Time limit exceeded
6	Correct	2 ms	2272 KB	Output is correct
7	Correct	2 ms	2272 KB	Output is correct
8	Correct	2 ms	2272 KB	Output is correct
9	Correct	2 ms	2272 KB	Output is correct
10	Execution timed out	2045 ms	2272 KB	Time limit exceeded
11	Correct	3 ms	2272 KB	Output is correct
12	Correct	3 ms	2272 KB	Output is correct
13	Correct	3 ms	2272 KB	Output is correct
14	Correct	3 ms	2272 KB	Output is correct
15	Execution timed out	2053 ms	2272 KB	Time limit exceeded
16	Correct	12 ms	2272 KB	Output is correct
17	Correct	11 ms	2272 KB	Output is correct
18	Correct	12 ms	2272 KB	Output is correct
19	Correct	11 ms	2272 KB	Output is correct
20	Execution timed out	2036 ms	2272 KB	Time limit exceeded
21	Correct	43 ms	2272 KB	Output is correct
22	Correct	38 ms	2272 KB	Output is correct
23	Correct	47 ms	2272 KB	Output is correct
24	Correct	38 ms	2272 KB	Output is correct
25	Execution timed out	2049 ms	2272 KB	Time limit exceeded
26	Correct	37 ms	2272 KB	Output is correct
27	Correct	37 ms	2272 KB	Output is correct
28	Correct	40 ms	2272 KB	Output is correct
29	Correct	37 ms	2272 KB	Output is correct
30	Execution timed out	2064 ms	2272 KB	Time limit exceeded
31	Correct	2 ms	2272 KB	Output is correct
32	Correct	2 ms	2272 KB	Output is correct