Submission #107428

# Submission time Handle Problem Language Result Execution time Memory
107428 2019-04-24T07:52:34 Z OpenTheWindow Gap (APIO16_gap) C++14
30 / 100
81 ms 3412 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)/N;

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

		long long s = mn + tmp, t = s + tmp;
		while (true)
		{
			if(mx - t < tmp) break;

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

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

			}

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

		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;
       ~~~~~~~~~^~~~
# Verdict Execution time Memory 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 3 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 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 3 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 3 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 16 ms 1280 KB Output is correct
17 Correct 18 ms 1136 KB Output is correct
18 Correct 22 ms 1280 KB Output is correct
19 Correct 16 ms 1152 KB Output is correct
20 Correct 16 ms 896 KB Output is correct
21 Correct 65 ms 3412 KB Output is correct
22 Correct 65 ms 3156 KB Output is correct
23 Correct 57 ms 3272 KB Output is correct
24 Correct 60 ms 3184 KB Output is correct
25 Correct 51 ms 3184 KB Output is correct
26 Correct 55 ms 3312 KB Output is correct
27 Correct 64 ms 3184 KB Output is correct
28 Correct 81 ms 3184 KB Output is correct
29 Correct 57 ms 3184 KB Output is correct
30 Correct 41 ms 2808 KB Output is correct
31 Correct 2 ms 384 KB Output is correct
32 Correct 2 ms 384 KB Output is correct
# Verdict Execution time Memory Grader output
1 Runtime error 3 ms 384 KB Execution failed because the return code was nonzero
2 Incorrect 2 ms 384 KB Output isn't correct
3 Runtime error 2 ms 384 KB Execution failed because the return code was nonzero
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 Runtime error 3 ms 384 KB Execution failed because the return code was nonzero
8 Runtime error 3 ms 384 KB Execution failed because the return code was nonzero
9 Incorrect 3 ms 384 KB Output isn't correct
10 Incorrect 2 ms 512 KB Output isn't correct
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 Incorrect 2 ms 384 KB Output isn't correct
14 Incorrect 3 ms 384 KB Output isn't correct
15 Incorrect 2 ms 384 KB Output isn't correct
16 Runtime error 10 ms 1152 KB Execution killed with signal 11 (could be triggered by violating memory limits)
17 Runtime error 9 ms 1152 KB Execution killed with signal 11 (could be triggered by violating memory limits)
18 Runtime error 11 ms 1152 KB Execution killed with signal 11 (could be triggered by violating memory limits)
19 Runtime error 10 ms 896 KB Execution failed because the return code was nonzero
20 Runtime error 5 ms 896 KB Execution killed with signal 11 (could be triggered by violating memory limits)
21 Runtime error 32 ms 3068 KB Execution killed with signal 11 (could be triggered by violating memory limits)
22 Runtime error 31 ms 3192 KB Execution killed with signal 11 (could be triggered by violating memory limits)
23 Runtime error 44 ms 3192 KB Execution killed with signal 11 (could be triggered by violating memory limits)
24 Runtime error 42 ms 3064 KB Execution killed with signal 11 (could be triggered by violating memory limits)
25 Runtime error 25 ms 2912 KB Execution killed with signal 11 (could be triggered by violating memory limits)
26 Runtime error 41 ms 3192 KB Execution killed with signal 11 (could be triggered by violating memory limits)
27 Runtime error 43 ms 3016 KB Execution killed with signal 11 (could be triggered by violating memory limits)
28 Runtime error 30 ms 3192 KB Execution killed with signal 11 (could be triggered by violating memory limits)
29 Runtime error 28 ms 3064 KB Execution killed with signal 11 (could be triggered by violating memory limits)
30 Runtime error 15 ms 2552 KB Execution killed with signal 11 (could be triggered by violating memory limits)
31 Incorrect 2 ms 384 KB Output isn't correct
32 Incorrect 3 ms 460 KB Output isn't correct