답안 #106191

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
106191 2019-04-17T08:23:00 Z OpenTheWindow Gap (APIO16_gap) C++14
30 / 100
2000 ms 525312 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());

		ans = 0;

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


	}
	else{

		vector<long long> a;

		long long ms = 0, mt = 1000000000000000000LL;
		long long mn, mx;

		MinMax(ms, mt, &mn, &mx);

		int tmp = (mx - mn)/2;

		a.push_back(mn);
		a.push_back(mx);

		long long s = mn + tmp, t = mn + 2*tmp;
		while (true)
		{
			if(s > mt) break;

			MinMax(s, t, &mn, &mx);

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

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

			}

			s = t + 1;
			t = s + mn;
			
		}

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

		long long mingap = 0;

		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;
       ~~~~~~~~~^~~~
gap.cpp:97:13: warning: unused variable 'mingap' [-Wunused-variable]
   long long mingap = 0;
             ^~~~~~
# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 384 KB Output is correct
2 Correct 2 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 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 3 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 3 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 16 ms 1024 KB Output is correct
19 Correct 16 ms 896 KB Output is correct
20 Correct 14 ms 896 KB Output is correct
21 Correct 65 ms 2436 KB Output is correct
22 Correct 54 ms 2288 KB Output is correct
23 Correct 75 ms 2284 KB Output is correct
24 Correct 54 ms 2288 KB Output is correct
25 Correct 50 ms 2292 KB Output is correct
26 Correct 56 ms 2448 KB Output is correct
27 Correct 76 ms 2288 KB Output is correct
28 Correct 53 ms 2288 KB Output is correct
29 Correct 72 ms 2256 KB Output is correct
30 Correct 56 ms 2288 KB Output is correct
31 Correct 2 ms 384 KB Output is correct
32 Correct 3 ms 384 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Runtime error 2 ms 384 KB Execution failed because the return code was nonzero
2 Runtime error 2 ms 384 KB Execution failed because the return code was nonzero
3 Runtime error 3 ms 384 KB Execution failed because the return code was nonzero
4 Runtime error 2 ms 256 KB Execution failed because the return code was nonzero
5 Runtime error 1577 ms 525312 KB Execution killed with signal 9 (could be triggered by violating memory limits)
6 Runtime error 2 ms 384 KB Execution failed because the return code was nonzero
7 Runtime error 2 ms 384 KB Execution failed because the return code was nonzero
8 Runtime error 2 ms 384 KB Execution failed because the return code was nonzero
9 Runtime error 3 ms 384 KB Execution failed because the return code was nonzero
10 Execution timed out 2052 ms 521132 KB Time limit exceeded
11 Runtime error 3 ms 384 KB Execution failed because the return code was nonzero
12 Runtime error 3 ms 384 KB Execution failed because the return code was nonzero
13 Runtime error 3 ms 384 KB Execution failed because the return code was nonzero
14 Runtime error 2 ms 384 KB Execution failed because the return code was nonzero
15 Execution timed out 2047 ms 263228 KB Time limit exceeded
16 Runtime error 11 ms 1016 KB Execution failed because the return code was nonzero
17 Runtime error 12 ms 1024 KB Execution failed because the return code was nonzero
18 Runtime error 9 ms 1024 KB Execution failed because the return code was nonzero
19 Runtime error 8 ms 1024 KB Execution failed because the return code was nonzero
20 Execution timed out 2058 ms 263648 KB Time limit exceeded
21 Runtime error 26 ms 1528 KB Execution failed because the return code was nonzero
22 Runtime error 25 ms 1528 KB Execution failed because the return code was nonzero
23 Runtime error 32 ms 1528 KB Execution failed because the return code was nonzero
24 Runtime error 28 ms 1556 KB Execution failed because the return code was nonzero
25 Execution timed out 2048 ms 264332 KB Time limit exceeded
26 Runtime error 29 ms 1532 KB Execution failed because the return code was nonzero
27 Runtime error 26 ms 1528 KB Execution failed because the return code was nonzero
28 Runtime error 25 ms 1500 KB Execution failed because the return code was nonzero
29 Runtime error 30 ms 1528 KB Execution failed because the return code was nonzero
30 Execution timed out 2047 ms 264532 KB Time limit exceeded
31 Runtime error 2 ms 384 KB Execution failed because the return code was nonzero
32 Runtime error 2 ms 384 KB Execution failed because the return code was nonzero