답안 #106184

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
106184 2019-04-17T07:27:58 Z OpenTheWindow Gap (APIO16_gap) C++14
30 / 100
72 ms 2512 KB
#include<iostream>
#include<string>
#include<set>
#include<utility>
#include<vector>
#include<map>
#include<algorithm>
#include<queue>
#include<stack>

#include"gap.h"

using namespace std;


long long findGap(int T, int N){
	long long ans = 0;

	if(T == 1){
		vector<long long> a;

		long long s = 0, t = 1000000000000000000LL;
		while (true)
		{
			long long mn, mx;

			if(a.size() == N) break;

			if(s > t) break;
			MinMax(s, t, &mn, &mx);

			if(mn == -1) break;

			if(mn < mx){
				a.push_back(mn);
				a.push_back(mx);

				s = mn + 1;
				t = mx - 1;

			}
			if(mn == mx){
				a.push_back(mn);
				break;
			}
		}

		sort(a.begin(), a.end());

		for(int i=0; i<N-1; i++){
			ans = max(ans, a[i+1] - a[i]);
		}


	}

	return ans;
}

Compilation message

gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:27:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    if(a.size() == N) break;
       ~~~~~~~~~^~~~
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 3 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 3 ms 512 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 3 ms 384 KB Output is correct
12 Correct 4 ms 384 KB Output is correct
13 Correct 3 ms 384 KB Output is correct
14 Correct 3 ms 384 KB Output is correct
15 Correct 3 ms 384 KB Output is correct
16 Correct 15 ms 896 KB Output is correct
17 Correct 15 ms 896 KB Output is correct
18 Correct 20 ms 1016 KB Output is correct
19 Correct 15 ms 896 KB Output is correct
20 Correct 13 ms 896 KB Output is correct
21 Correct 65 ms 2288 KB Output is correct
22 Correct 72 ms 2260 KB Output is correct
23 Correct 62 ms 2512 KB Output is correct
24 Correct 66 ms 2416 KB Output is correct
25 Correct 55 ms 2288 KB Output is correct
26 Correct 60 ms 2288 KB Output is correct
27 Correct 62 ms 2416 KB Output is correct
28 Correct 58 ms 2416 KB Output is correct
29 Correct 56 ms 2260 KB Output is correct
30 Correct 53 ms 2288 KB Output is correct
31 Correct 3 ms 384 KB Output is correct
32 Correct 2 ms 384 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 384 KB Output isn't correct
2 Incorrect 2 ms 384 KB Output isn't correct
3 Incorrect 2 ms 384 KB Output isn't correct
4 Incorrect 2 ms 384 KB Output isn't correct
5 Incorrect 2 ms 384 KB Output isn't correct
6 Incorrect 2 ms 384 KB Output isn't correct
7 Incorrect 3 ms 384 KB Output isn't correct
8 Incorrect 2 ms 384 KB Output isn't correct
9 Incorrect 2 ms 384 KB Output isn't correct
10 Incorrect 2 ms 384 KB Output isn't correct
11 Incorrect 2 ms 384 KB Output isn't correct
12 Incorrect 2 ms 384 KB Output isn't correct
13 Incorrect 3 ms 384 KB Output isn't correct
14 Incorrect 3 ms 332 KB Output isn't correct
15 Incorrect 3 ms 384 KB Output isn't correct
16 Incorrect 8 ms 512 KB Output isn't correct
17 Incorrect 10 ms 512 KB Output isn't correct
18 Incorrect 13 ms 512 KB Output isn't correct
19 Incorrect 13 ms 512 KB Output isn't correct
20 Incorrect 6 ms 612 KB Output isn't correct
21 Incorrect 25 ms 1144 KB Output isn't correct
22 Incorrect 27 ms 1144 KB Output isn't correct
23 Incorrect 24 ms 1144 KB Output isn't correct
24 Incorrect 26 ms 1152 KB Output isn't correct
25 Incorrect 18 ms 1152 KB Output isn't correct
26 Incorrect 28 ms 1144 KB Output isn't correct
27 Incorrect 26 ms 1272 KB Output isn't correct
28 Incorrect 26 ms 1152 KB Output isn't correct
29 Incorrect 29 ms 1144 KB Output isn't correct
30 Incorrect 16 ms 1152 KB Output isn't correct
31 Incorrect 3 ms 384 KB Output isn't correct
32 Incorrect 2 ms 384 KB Output isn't correct