| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 974183 |
2024-05-03T04:52:21 Z |
Halym2007 |
Gap (APIO16_gap) |
C++17 |
|
52 ms |
5264 KB |
#include <bits/stdc++.h>
#include "gap.h"
using namespace std;
#define ll long long
#define pb push_back
#define sz size()
//static void my_assert(int k){
// if (!k) exit(1);
//}
//
//static int subtask_num, N;
//static long long A[100001];
//static long long call_count;
//long long findGap(int, int);
//void MinMax(long long s, long long t, long long *mn, long long *mx) {
// int lo = 1, hi = N, left = N+1, right = 0;
// my_assert(s <= t && mn != NULL && mx != NULL);
// while (lo <= hi){
// int mid = (lo+hi)>>1;
// if (A[mid] >= s) hi = mid - 1, left = mid;
// else lo = mid + 1;
// }
// lo = 1, hi = N;
// while (lo <= hi){
// int mid = (lo+hi)>>1;
// if (A[mid] <= t) lo = mid + 1, right = mid;
// else hi = mid - 1;
// }
// if (left > right) *mn = *mx = -1;
// else{
// *mn = A[left];
// *mx = A[right];
// }
// if (subtask_num == 1) call_count++;
// else if (subtask_num == 2) call_count += right-left+2;
//}
ll findGap(int T, int N) {
vector <ll> v;
ll l = 0, r = 1e18, mn = 100, mx = 100;
if (T == 1 or N <= 2) {
while (1) {
if ((int)v.sz == N) break;
MinMax (l, r, &mn, &mx);
ll x = mn, y = mx;
if (x == y) {
v.pb (x);
break;
}
else {
v.pb (x);v.pb (y);
}
l = x + 1;r = y - 1;
}
}
else {
MinMax (l, r, &mn, &mx);
ll gosh = mx - mn - 1;
v.pb (mn);
gosh = (gosh + N - 2) / (N - 1);
v.pb (mx);
ll ok = mn, ko = mx;
for (ll i = ok + 1; i <= ko - 1; i += gosh) {
l = i;r = min (gosh + i - 1, ko - 1);
MinMax (l, r, &mn, &mx);
if (mn != -1 and mx != -1);
v.pb (mn);v.pb (mx);
}
}
ll jog = 0;
sort (v.begin(), v.end());
for (int i = 1; i < (int)v.sz; ++i) {
jog = max (jog, v[i] - v[i - 1]);
}
return jog;
}
/*
1 4
2 3 6 8
*/
//int main() {
// freopen ("input.txt", "r", stdin);
// FILE *in = stdin, *out = stdout;
// my_assert(2 == fscanf(in, "%d%d", &subtask_num, &N));
// my_assert(1 <= subtask_num && subtask_num <= 2);
// my_assert(2 <= N && N <= 100000);
// for (int i=1;i<=N;i++) my_assert(1 == fscanf(in, "%lld", A+i));
// for (int i=1;i<N;i++) my_assert(A[i] < A[i+1]);
// fprintf(out, "%lld\n", findGap(subtask_num, N));
// fprintf(out, "%lld\n", call_count);
//}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
344 KB |
Output is correct |
| 2 |
Correct |
0 ms |
2392 KB |
Output is correct |
| 3 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 4 |
Correct |
0 ms |
2392 KB |
Output is correct |
| 5 |
Correct |
0 ms |
2392 KB |
Output is correct |
| 6 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 7 |
Correct |
0 ms |
2392 KB |
Output is correct |
| 8 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 9 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 10 |
Correct |
0 ms |
2392 KB |
Output is correct |
| 11 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 12 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 13 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 14 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 15 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 16 |
Correct |
8 ms |
2836 KB |
Output is correct |
| 17 |
Correct |
8 ms |
2844 KB |
Output is correct |
| 18 |
Correct |
9 ms |
2844 KB |
Output is correct |
| 19 |
Correct |
9 ms |
2836 KB |
Output is correct |
| 20 |
Correct |
8 ms |
2824 KB |
Output is correct |
| 21 |
Correct |
33 ms |
3980 KB |
Output is correct |
| 22 |
Correct |
32 ms |
3992 KB |
Output is correct |
| 23 |
Correct |
32 ms |
3960 KB |
Output is correct |
| 24 |
Correct |
32 ms |
3988 KB |
Output is correct |
| 25 |
Correct |
30 ms |
3796 KB |
Output is correct |
| 26 |
Correct |
31 ms |
3996 KB |
Output is correct |
| 27 |
Correct |
32 ms |
3988 KB |
Output is correct |
| 28 |
Correct |
34 ms |
3904 KB |
Output is correct |
| 29 |
Correct |
32 ms |
4256 KB |
Output is correct |
| 30 |
Correct |
27 ms |
3972 KB |
Output is correct |
| 31 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 32 |
Correct |
1 ms |
2636 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
2644 KB |
Output is correct |
| 2 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 3 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 4 |
Correct |
0 ms |
2392 KB |
Output is correct |
| 5 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
| 6 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 7 |
Correct |
0 ms |
2392 KB |
Output is correct |
| 8 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 9 |
Correct |
0 ms |
2392 KB |
Output is correct |
| 10 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 11 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 12 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 13 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 14 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 15 |
Incorrect |
1 ms |
2392 KB |
Output isn't correct |
| 16 |
Correct |
11 ms |
3216 KB |
Output is correct |
| 17 |
Correct |
12 ms |
3220 KB |
Output is correct |
| 18 |
Correct |
12 ms |
3224 KB |
Output is correct |
| 19 |
Correct |
11 ms |
3220 KB |
Output is correct |
| 20 |
Correct |
6 ms |
3204 KB |
Output is correct |
| 21 |
Correct |
48 ms |
4928 KB |
Output is correct |
| 22 |
Correct |
49 ms |
5020 KB |
Output is correct |
| 23 |
Correct |
52 ms |
5004 KB |
Output is correct |
| 24 |
Correct |
48 ms |
5012 KB |
Output is correct |
| 25 |
Incorrect |
41 ms |
5004 KB |
Output isn't correct |
| 26 |
Correct |
47 ms |
5016 KB |
Output is correct |
| 27 |
Correct |
48 ms |
5032 KB |
Output is correct |
| 28 |
Correct |
48 ms |
4868 KB |
Output is correct |
| 29 |
Correct |
47 ms |
5264 KB |
Output is correct |
| 30 |
Correct |
27 ms |
5024 KB |
Output is correct |
| 31 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 32 |
Correct |
0 ms |
2392 KB |
Output is correct |
