| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 107417 |
2019-04-24T07:06:28 Z |
yamamayumi9489 |
Gap (APIO16_gap) |
C++14 |
|
84 ms |
3360 KB |
#include<iostream>
#include<utility>
#include<string>
#include<vector>
#include<algorithm>
#include<deque>
#include<queue>
#include<set>
#include<map>
#include<functional>
using namespace std;
#define LL long long
#define ALF "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
#define LLBIG 1999999999999999999
#define INTBIG 1111111111
#define MOD 1000000007
#define PI pair<int,int>
#define VI vector<int>
#define VL vector<LL>
#define VVI vector<vector<int>>
#include"gap.h"
//MinMax(int,int,int&,int&)
long long findGap(int T, int N) {
if (T == 1) {
LL A[100002];
LL l = 0, r = 1000000000000000000LL;
for (int i = 0; i<(N + 1) / 2; i++) {
MinMax(l, r, &A[i], &A[N - 1 - i]);
l = A[i] + 1; r = A[N - 1 - i] - 1;
}
LL ans = 0;
for (int i = 0; i<N - 1; i++)
ans = max(ans, A[i + 1] - A[i]);
return ans;
}
else if (T == 2) {
VL A; LL mn, mx;
MinMax(0, 1000000000000000000LL, &mn, &mx);
LL l = mn + 1;
LL r = mn + ((mx - mn) / N);
r = min(r,mx-1);
for (LL i = 0; i < N; i++) {
LL a, b;
MinMax(l, r, &a, &b);
if (a != -1) {
A.push_back(a); A.push_back(b);
}
if(r == mx-1) break;
l += ((mx - mn) / N);
r += ((mx - mn) / N);
r = min(r,mx-1);
}
A.push_back(mn);
A.push_back(mx);
sort(A.begin(), A.end());
LL ans = 0;
for (int i = 1; i < (int)A.size(); i++)
ans = max(ans, A[i] - A[i - 1]);
return ans;
}
else return 0;
}
| # |
Verdict |
Execution time |
Memory |
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 |
2 ms |
384 KB |
Output is correct |
| 6 |
Correct |
3 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 |
3 ms |
384 KB |
Output is correct |
| 11 |
Correct |
4 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 |
2 ms |
384 KB |
Output is correct |
| 15 |
Correct |
2 ms |
384 KB |
Output is correct |
| 16 |
Correct |
13 ms |
768 KB |
Output is correct |
| 17 |
Correct |
18 ms |
760 KB |
Output is correct |
| 18 |
Correct |
14 ms |
768 KB |
Output is correct |
| 19 |
Correct |
15 ms |
896 KB |
Output is correct |
| 20 |
Correct |
11 ms |
768 KB |
Output is correct |
| 21 |
Correct |
49 ms |
1912 KB |
Output is correct |
| 22 |
Correct |
52 ms |
1868 KB |
Output is correct |
| 23 |
Correct |
50 ms |
1912 KB |
Output is correct |
| 24 |
Correct |
50 ms |
1912 KB |
Output is correct |
| 25 |
Correct |
62 ms |
1916 KB |
Output is correct |
| 26 |
Correct |
48 ms |
1912 KB |
Output is correct |
| 27 |
Correct |
47 ms |
1912 KB |
Output is correct |
| 28 |
Correct |
56 ms |
1912 KB |
Output is correct |
| 29 |
Correct |
53 ms |
1912 KB |
Output is correct |
| 30 |
Correct |
39 ms |
1912 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 |
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 |
3 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 |
2 ms |
384 KB |
Output is correct |
| 10 |
Incorrect |
2 ms |
384 KB |
Output isn't correct |
| 11 |
Correct |
3 ms |
392 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 |
22 ms |
1024 KB |
Output is correct |
| 17 |
Correct |
19 ms |
1024 KB |
Output is correct |
| 18 |
Correct |
22 ms |
1024 KB |
Output is correct |
| 19 |
Correct |
20 ms |
768 KB |
Output is correct |
| 20 |
Incorrect |
13 ms |
640 KB |
Output isn't correct |
| 21 |
Correct |
77 ms |
2288 KB |
Output is correct |
| 22 |
Correct |
74 ms |
2288 KB |
Output is correct |
| 23 |
Correct |
74 ms |
2288 KB |
Output is correct |
| 24 |
Correct |
80 ms |
2332 KB |
Output is correct |
| 25 |
Correct |
67 ms |
3360 KB |
Output is correct |
| 26 |
Correct |
69 ms |
2292 KB |
Output is correct |
| 27 |
Correct |
84 ms |
2600 KB |
Output is correct |
| 28 |
Correct |
74 ms |
2288 KB |
Output is correct |
| 29 |
Correct |
83 ms |
2288 KB |
Output is correct |
| 30 |
Incorrect |
40 ms |
1400 KB |
Output isn't correct |
| 31 |
Correct |
2 ms |
384 KB |
Output is correct |
| 32 |
Correct |
3 ms |
384 KB |
Output is correct |
