#include "gap.h"
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
long long a[100009]; int res = 0, maxn = 0;
vector<long long>Q;
long long findGap(int T, int N)
{
if (T == 1 || N <= 8) {
long long L = 0, R = 1000000000000000000LL, s, t, cnt = 0;
while (cnt < (N + 1) / 2) {
MinMax(L, R, &s, &t);
L = s; R = t;
if (L != -1) { a[cnt + 1] = L; a[N - cnt] = R; }
cnt++; L++; R--;
}
long long maxn = 0;
for (int i = 1; i <= N - 1; i++) maxn = max(maxn, a[i + 1] - a[i]);
return maxn;
}
if (T == 2) {
long long s, t; MinMax(0, 1000000000000000000LL, &s, &t); t++;
long long T = N + 1;
vector<long long>B; long double L = 1.0L*(t - s) / T;
for (int i = 0; i <= T; i++) B.push_back(s + (long long)(1.0L*L*i));
B[T] = t;
for (int i = 0; i < B.size() - 1; i++) {
MinMax(B[i], B[i + 1] - 1, &s, &t);
//cout << B[i] << " " << B[i + 1] - 1 << " " << s << " " << t << endl;
if (s != -1) {
Q.push_back(s);
Q.push_back(t);
}
}
sort(Q.begin(), Q.end());
Q.erase(unique(Q.begin(), Q.end()), Q.end());
long long maxn = 0;
for (int i = 0; i < Q.size() - 1; i++) maxn = max(maxn, Q[i + 1] - Q[i]);
return maxn;
}
return 0;
}
Compilation message
gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:33:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (int i = 0; i < B.size() - 1; i++) {
~~^~~~~~~~~~~~~~
gap.cpp:45:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (int i = 0; i < Q.size() - 1; i++) maxn = max(maxn, Q[i + 1] - Q[i]);
~~^~~~~~~~~~~~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
2 ms |
376 KB |
Output is correct |
| 2 |
Correct |
2 ms |
376 KB |
Output is correct |
| 3 |
Correct |
2 ms |
428 KB |
Output is correct |
| 4 |
Correct |
2 ms |
428 KB |
Output is correct |
| 5 |
Correct |
2 ms |
480 KB |
Output is correct |
| 6 |
Correct |
2 ms |
480 KB |
Output is correct |
| 7 |
Correct |
2 ms |
528 KB |
Output is correct |
| 8 |
Correct |
2 ms |
536 KB |
Output is correct |
| 9 |
Correct |
2 ms |
556 KB |
Output is correct |
| 10 |
Correct |
2 ms |
556 KB |
Output is correct |
| 11 |
Correct |
3 ms |
556 KB |
Output is correct |
| 12 |
Correct |
2 ms |
616 KB |
Output is correct |
| 13 |
Correct |
2 ms |
616 KB |
Output is correct |
| 14 |
Correct |
3 ms |
620 KB |
Output is correct |
| 15 |
Correct |
2 ms |
620 KB |
Output is correct |
| 16 |
Correct |
15 ms |
1064 KB |
Output is correct |
| 17 |
Correct |
15 ms |
1064 KB |
Output is correct |
| 18 |
Correct |
15 ms |
1064 KB |
Output is correct |
| 19 |
Correct |
14 ms |
1064 KB |
Output is correct |
| 20 |
Correct |
12 ms |
1064 KB |
Output is correct |
| 21 |
Correct |
55 ms |
2148 KB |
Output is correct |
| 22 |
Correct |
56 ms |
2172 KB |
Output is correct |
| 23 |
Correct |
54 ms |
2172 KB |
Output is correct |
| 24 |
Correct |
58 ms |
2172 KB |
Output is correct |
| 25 |
Correct |
45 ms |
2172 KB |
Output is correct |
| 26 |
Correct |
53 ms |
2172 KB |
Output is correct |
| 27 |
Correct |
53 ms |
2196 KB |
Output is correct |
| 28 |
Correct |
53 ms |
2196 KB |
Output is correct |
| 29 |
Correct |
59 ms |
2304 KB |
Output is correct |
| 30 |
Correct |
39 ms |
2304 KB |
Output is correct |
| 31 |
Correct |
2 ms |
2304 KB |
Output is correct |
| 32 |
Correct |
2 ms |
2304 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
2 ms |
2304 KB |
Output is correct |
| 2 |
Partially correct |
2 ms |
2304 KB |
Partially correct |
| 3 |
Partially correct |
2 ms |
2304 KB |
Partially correct |
| 4 |
Partially correct |
2 ms |
2304 KB |
Partially correct |
| 5 |
Partially correct |
2 ms |
2304 KB |
Partially correct |
| 6 |
Partially correct |
2 ms |
2304 KB |
Partially correct |
| 7 |
Partially correct |
2 ms |
2304 KB |
Partially correct |
| 8 |
Partially correct |
2 ms |
2304 KB |
Partially correct |
| 9 |
Partially correct |
2 ms |
2304 KB |
Partially correct |
| 10 |
Partially correct |
2 ms |
2304 KB |
Partially correct |
| 11 |
Partially correct |
3 ms |
2304 KB |
Partially correct |
| 12 |
Partially correct |
3 ms |
2304 KB |
Partially correct |
| 13 |
Partially correct |
3 ms |
2304 KB |
Partially correct |
| 14 |
Partially correct |
3 ms |
2304 KB |
Partially correct |
| 15 |
Partially correct |
3 ms |
2304 KB |
Partially correct |
| 16 |
Partially correct |
20 ms |
2304 KB |
Partially correct |
| 17 |
Partially correct |
20 ms |
2304 KB |
Partially correct |
| 18 |
Partially correct |
22 ms |
2304 KB |
Partially correct |
| 19 |
Partially correct |
20 ms |
2304 KB |
Partially correct |
| 20 |
Partially correct |
10 ms |
2304 KB |
Partially correct |
| 21 |
Partially correct |
77 ms |
3696 KB |
Partially correct |
| 22 |
Partially correct |
77 ms |
3696 KB |
Partially correct |
| 23 |
Partially correct |
76 ms |
3696 KB |
Partially correct |
| 24 |
Partially correct |
77 ms |
3696 KB |
Partially correct |
| 25 |
Partially correct |
74 ms |
4328 KB |
Partially correct |
| 26 |
Partially correct |
77 ms |
4328 KB |
Partially correct |
| 27 |
Partially correct |
76 ms |
4328 KB |
Partially correct |
| 28 |
Partially correct |
77 ms |
4328 KB |
Partially correct |
| 29 |
Partially correct |
81 ms |
4328 KB |
Partially correct |
| 30 |
Partially correct |
72 ms |
4328 KB |
Partially correct |
| 31 |
Partially correct |
2 ms |
4328 KB |
Partially correct |
| 32 |
Partially correct |
2 ms |
4328 KB |
Partially correct |
