Submission #22997

# Submission time Handle Problem Language Result Execution time Memory
22997 2017-05-01T05:57:15 Z kdh9949 Gap (APIO16_gap) C++14
0 / 100
93 ms 7460 KB
#include "gap.h"
#include <algorithm>
using namespace std;
typedef long long ll;

vector<ll> v;
ll a = 0, b = (1LL << 62), c, x, y, ans;

ll findGap(int T, int N)
{
	if(T == 1){
        for(int i = 0; i < (N + 1) / 2; i++){
            MinMax(a, b, &a, &b);
            v.push_back(a); v.push_back(b);
        }
    }
	else{
		MinMax(a, b, &a, &b);
		c = b - a; N--;
		for(int i = 0; i < N; i++){
			MinMax(a + c / N * i + 1, a + c / N * (i + 1), &x, &y);
			v.push_back(x); v.push_back(y);
		}
	}
	sort(v.begin(), v.end());
	for(int i = 1; i < v.size(); i++) ans = max(ans, v[i] - v[i - 1]);
	return ans;
}

Compilation message

gap.cpp: In function 'll findGap(int, int)':
gap.cpp:26:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 1; i < v.size(); i++) ans = max(ans, v[i] - v[i - 1]);
                   ^
# Verdict Execution time Memory Grader output
1 Correct 0 ms 4300 KB Output is correct
2 Incorrect 0 ms 4300 KB Output isn't correct
3 Incorrect 0 ms 4300 KB Output isn't correct
4 Incorrect 0 ms 4300 KB Output isn't correct
5 Incorrect 0 ms 4300 KB Output isn't correct
6 Incorrect 0 ms 4300 KB Output isn't correct
7 Incorrect 0 ms 4300 KB Output isn't correct
8 Incorrect 0 ms 4300 KB Output isn't correct
9 Incorrect 0 ms 4300 KB Output isn't correct
10 Incorrect 0 ms 4300 KB Output isn't correct
11 Incorrect 0 ms 4300 KB Output isn't correct
12 Incorrect 0 ms 4300 KB Output isn't correct
13 Incorrect 0 ms 4300 KB Output isn't correct
14 Incorrect 0 ms 4300 KB Output isn't correct
15 Incorrect 0 ms 4300 KB Output isn't correct
16 Incorrect 3 ms 4772 KB Output isn't correct
17 Incorrect 9 ms 4772 KB Output isn't correct
18 Incorrect 9 ms 4772 KB Output isn't correct
19 Incorrect 13 ms 4772 KB Output isn't correct
20 Incorrect 6 ms 4772 KB Output isn't correct
21 Incorrect 46 ms 5924 KB Output isn't correct
22 Incorrect 53 ms 5924 KB Output isn't correct
23 Incorrect 43 ms 5924 KB Output isn't correct
24 Incorrect 36 ms 5924 KB Output isn't correct
25 Incorrect 26 ms 5924 KB Output isn't correct
26 Incorrect 36 ms 5924 KB Output isn't correct
27 Incorrect 43 ms 5924 KB Output isn't correct
28 Incorrect 39 ms 5924 KB Output isn't correct
29 Incorrect 49 ms 5924 KB Output isn't correct
30 Incorrect 23 ms 5924 KB Output isn't correct
31 Incorrect 0 ms 4300 KB Output isn't correct
32 Incorrect 0 ms 4300 KB Output isn't correct
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 4300 KB Output isn't correct
2 Correct 0 ms 4300 KB Output is correct
3 Incorrect 0 ms 4300 KB Output isn't correct
4 Correct 0 ms 4300 KB Output is correct
5 Correct 0 ms 4300 KB Output is correct
6 Correct 0 ms 4300 KB Output is correct
7 Correct 0 ms 4300 KB Output is correct
8 Correct 0 ms 4300 KB Output is correct
9 Correct 0 ms 4300 KB Output is correct
10 Correct 0 ms 4300 KB Output is correct
11 Correct 0 ms 4444 KB Output is correct
12 Correct 0 ms 4444 KB Output is correct
13 Correct 0 ms 4444 KB Output is correct
14 Correct 0 ms 4444 KB Output is correct
15 Correct 0 ms 4444 KB Output is correct
16 Correct 19 ms 5156 KB Output is correct
17 Correct 16 ms 5156 KB Output is correct
18 Correct 19 ms 5156 KB Output is correct
19 Correct 16 ms 5156 KB Output is correct
20 Incorrect 6 ms 5156 KB Output isn't correct
21 Correct 83 ms 7460 KB Output is correct
22 Correct 89 ms 7460 KB Output is correct
23 Correct 93 ms 7460 KB Output is correct
24 Correct 93 ms 7460 KB Output is correct
25 Correct 73 ms 7460 KB Output is correct
26 Correct 93 ms 7460 KB Output is correct
27 Correct 93 ms 7460 KB Output is correct
28 Correct 79 ms 7460 KB Output is correct
29 Correct 79 ms 7460 KB Output is correct
30 Incorrect 43 ms 7460 KB Output isn't correct
31 Correct 0 ms 4300 KB Output is correct
32 Incorrect 0 ms 4300 KB Output isn't correct