답안 #30728

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
30728	2017-07-26T10:28:16 Z	inqr	Gap (APIO16_gap)	C++14	0 / 100	69 ms	5804 KB

gap

#include "gap.h"
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define rt insert
#define st first
#define nd second
#define ll long long
#define pii pair < int , int >
#define DB printf("debug\n");
#define umax( x , y ) x = max( x , (y) )
#define umin( x , y ) x = min( x , (y) )
#define all(x) x.begin() , x.end()
using namespace std;
long long findGap(int T, int N)
{
	if(T==1){
		long long a[N];memset(a,0,sizeof(a));
		int l=0,r=N-1;
		while(l<r){
			if(l==0 && r==N-1){
				MinMax(0,1e18,&a[l],&a[r]);
			}
			else{
				MinMax(a[l-1]+1,a[r+1]-1,&a[l],&a[r]);	
			}
			l++,r--;
		}
		long long ans=0;
		for(int i=0;i<N-1;i++){
			//printf("i=%d a[i]=%lld a[i+1]=%lld\n",i,a[i],a[i+1]);
			umax(ans,a[i+1]-a[i]);
		}
		return ans;
	}
	else if(T==2){

	}
	return 0;
}

Subtask #1

0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	5144 KB	Output is correct
2	Incorrect	0 ms	5144 KB	Output isn't correct
3	Incorrect	0 ms	5144 KB	Output isn't correct
4	Incorrect	0 ms	5144 KB	Output isn't correct
5	Incorrect	0 ms	5144 KB	Output isn't correct
6	Correct	0 ms	5144 KB	Output is correct
7	Correct	0 ms	5144 KB	Output is correct
8	Correct	0 ms	5144 KB	Output is correct
9	Correct	0 ms	5144 KB	Output is correct
10	Correct	0 ms	5144 KB	Output is correct
11	Correct	0 ms	5144 KB	Output is correct
12	Correct	0 ms	5144 KB	Output is correct
13	Correct	0 ms	5144 KB	Output is correct
14	Correct	0 ms	5144 KB	Output is correct
15	Correct	0 ms	5144 KB	Output is correct
16	Correct	13 ms	5212 KB	Output is correct
17	Correct	13 ms	5212 KB	Output is correct
18	Correct	13 ms	5216 KB	Output is correct
19	Correct	13 ms	5216 KB	Output is correct
20	Correct	9 ms	5212 KB	Output is correct
21	Correct	69 ms	5804 KB	Output is correct
22	Correct	63 ms	5800 KB	Output is correct
23	Correct	53 ms	5800 KB	Output is correct
24	Correct	49 ms	5796 KB	Output is correct
25	Correct	43 ms	5800 KB	Output is correct
26	Correct	56 ms	5796 KB	Output is correct
27	Correct	59 ms	5804 KB	Output is correct
28	Correct	69 ms	5804 KB	Output is correct
29	Correct	59 ms	5800 KB	Output is correct
30	Correct	43 ms	5800 KB	Output is correct
31	Correct	0 ms	5144 KB	Output is correct
32	Correct	0 ms	5144 KB	Output is correct

Subtask #2

0 / 70.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	0 ms	5144 KB	Output isn't correct
2	Incorrect	0 ms	5144 KB	Output isn't correct
3	Incorrect	0 ms	5144 KB	Output isn't correct
4	Incorrect	0 ms	5144 KB	Output isn't correct
5	Incorrect	0 ms	5144 KB	Output isn't correct
6	Incorrect	0 ms	5144 KB	Output isn't correct
7	Incorrect	0 ms	5144 KB	Output isn't correct
8	Incorrect	0 ms	5144 KB	Output isn't correct
9	Incorrect	0 ms	5144 KB	Output isn't correct
10	Incorrect	0 ms	5144 KB	Output isn't correct
11	Incorrect	0 ms	5144 KB	Output isn't correct
12	Incorrect	0 ms	5144 KB	Output isn't correct
13	Incorrect	0 ms	5144 KB	Output isn't correct
14	Incorrect	0 ms	5144 KB	Output isn't correct
15	Incorrect	0 ms	5144 KB	Output isn't correct
16	Incorrect	6 ms	5144 KB	Output isn't correct
17	Incorrect	6 ms	5144 KB	Output isn't correct
18	Incorrect	9 ms	5144 KB	Output isn't correct
19	Incorrect	6 ms	5144 KB	Output isn't correct
20	Incorrect	3 ms	5144 KB	Output isn't correct
21	Incorrect	29 ms	5144 KB	Output isn't correct
22	Incorrect	33 ms	5144 KB	Output isn't correct
23	Incorrect	16 ms	5144 KB	Output isn't correct
24	Incorrect	26 ms	5144 KB	Output isn't correct
25	Incorrect	19 ms	5144 KB	Output isn't correct
26	Incorrect	33 ms	5144 KB	Output isn't correct
27	Incorrect	29 ms	5144 KB	Output isn't correct
28	Incorrect	29 ms	5144 KB	Output isn't correct
29	Incorrect	26 ms	5144 KB	Output isn't correct
30	Incorrect	9 ms	5144 KB	Output isn't correct
31	Incorrect	0 ms	5144 KB	Output isn't correct
32	Incorrect	0 ms	5144 KB	Output isn't correct