답안 #30724

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
30724 2017-07-26T10:18:29 Z PrOAhMeT Gap (APIO16_gap) C++14
0 / 100
73 ms 6772 KB
#include "gap.h"
#include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define pii pair<int,int>
#define LL long long
#define st first
#define nd second
#define endl '\n'
using namespace std;

long long findGap(int T, int N)
{
	
	vector<LL> v;
	LL x=-1,y=1e18+1,nx,ny,ret=0,cnt=0;
	if(T==1) {

		while(cnt<N) {
			MinMax(x+1,y-1,&nx,&ny);
			x=nx; y=ny;
			v.pb(x);
			++cnt;
			if(x!=y) {
				v.pb(y);
				++cnt;
			}
			x=nx;
			y=ny;
		}
		sort(v.begin(),v.end());
		for(int i=1;i<v.size();++i)
			ret=max(ret,v[i]-v[i-1]);
		return ret;

	}
	else {



	}

}

Compilation message

gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:32:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i=1;i<v.size();++i)
                ^
gap.cpp:43:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 5148 KB Output is correct
2 Correct 0 ms 5148 KB Output is correct
3 Correct 0 ms 5148 KB Output is correct
4 Correct 0 ms 5148 KB Output is correct
5 Correct 0 ms 5148 KB Output is correct
6 Correct 0 ms 5148 KB Output is correct
7 Correct 0 ms 5148 KB Output is correct
8 Correct 0 ms 5148 KB Output is correct
9 Correct 0 ms 5148 KB Output is correct
10 Correct 0 ms 5148 KB Output is correct
11 Correct 0 ms 5148 KB Output is correct
12 Correct 0 ms 5148 KB Output is correct
13 Correct 0 ms 5148 KB Output is correct
14 Correct 0 ms 5148 KB Output is correct
15 Correct 0 ms 5148 KB Output is correct
16 Correct 13 ms 5620 KB Output is correct
17 Correct 9 ms 5620 KB Output is correct
18 Correct 16 ms 5620 KB Output is correct
19 Correct 16 ms 5620 KB Output is correct
20 Correct 9 ms 5620 KB Output is correct
21 Correct 69 ms 6772 KB Output is correct
22 Correct 63 ms 6772 KB Output is correct
23 Correct 66 ms 6772 KB Output is correct
24 Correct 73 ms 6772 KB Output is correct
25 Correct 49 ms 6772 KB Output is correct
26 Correct 53 ms 6772 KB Output is correct
27 Correct 66 ms 6772 KB Output is correct
28 Correct 59 ms 6772 KB Output is correct
29 Correct 63 ms 6772 KB Output is correct
30 Correct 46 ms 6772 KB Output is correct
31 Incorrect 0 ms 5148 KB Unexpected end of file - int64 expected
32 Incorrect 0 ms 5148 KB Unexpected end of file - int64 expected
# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 5148 KB Output isn't correct
2 Incorrect 0 ms 5148 KB Output isn't correct
3 Incorrect 0 ms 5148 KB Output isn't correct
4 Incorrect 0 ms 5148 KB Output isn't correct
5 Incorrect 0 ms 5148 KB Output isn't correct
6 Incorrect 0 ms 5148 KB Output isn't correct
7 Incorrect 0 ms 5148 KB Output isn't correct
8 Incorrect 0 ms 5148 KB Output isn't correct
9 Incorrect 0 ms 5148 KB Output isn't correct
10 Incorrect 0 ms 5148 KB Output isn't correct
11 Incorrect 0 ms 5148 KB Output isn't correct
12 Incorrect 0 ms 5148 KB Output isn't correct
13 Incorrect 0 ms 5148 KB Output isn't correct
14 Incorrect 0 ms 5148 KB Output isn't correct
15 Incorrect 0 ms 5148 KB Output isn't correct
16 Incorrect 9 ms 5148 KB Output isn't correct
17 Incorrect 3 ms 5148 KB Output isn't correct
18 Incorrect 6 ms 5148 KB Output isn't correct
19 Incorrect 9 ms 5148 KB Output isn't correct
20 Incorrect 3 ms 5148 KB Output isn't correct
21 Incorrect 29 ms 5148 KB Output isn't correct
22 Incorrect 29 ms 5148 KB Output isn't correct
23 Incorrect 29 ms 5148 KB Output isn't correct
24 Incorrect 23 ms 5148 KB Output isn't correct
25 Incorrect 26 ms 5148 KB Output isn't correct
26 Incorrect 29 ms 5148 KB Output isn't correct
27 Incorrect 26 ms 5148 KB Output isn't correct
28 Incorrect 23 ms 5148 KB Output isn't correct
29 Incorrect 39 ms 5148 KB Output isn't correct
30 Incorrect 19 ms 5148 KB Output isn't correct
31 Incorrect 0 ms 5148 KB Output isn't correct
32 Incorrect 0 ms 5148 KB Output isn't correct