| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 1027414 |
2024-07-19T06:12:48 Z |
Halym2007 |
Gap (APIO16_gap) |
C++17 |
|
50 ms |
4984 KB |
#include <bits/stdc++.h>
#include "gap.h"
using namespace std;
#define ff first
#define ss second
#define pb push_back
#define sz size()
#define ll long long
long long findGap(int T, int N) {
ll jog = 0;
ll l = 0, r = 1e18, mn, mx;
vector <ll> v;
if (T == 1) {
for (int i = 1; i <= (N + 1) / 2; ++i) {
MinMax(l, r, &mn, &mx);
v.pb (mn);v.pb (mx);
l = mn + 1;r = mx - 1;
}
}
else {
ll n = N;
ll l = 0, r = 1e18, mn, mx;
MinMax(l, r, &mn, &mx);
v.pb (mx);v.pb (mn);
l = mn + 1;r = mx - 1;
ll gosh = (r - l + 1) / (n - 1);
while (l <= r) {
MinMax (l, min(l + gosh - 1, r), &mn, &mx);
v.pb (mn);v.pb (mx);
l += gosh;
}
}
sort (v.begin(), v.end());
for (int i = 0; i < (int)v.sz - 1; ++i) {
jog = max (jog, v[i + 1] - v[i]);
}
return jog;
}
//#include <stdio.h>
//#include <stdlib.h>
//
//
//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;
//}
//
//int main()
//{
// 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 |
0 ms |
2392 KB |
Output is correct |
| 4 |
Correct |
0 ms |
344 KB |
Output is correct |
| 5 |
Correct |
0 ms |
344 KB |
Output is correct |
| 6 |
Correct |
0 ms |
344 KB |
Output is correct |
| 7 |
Correct |
0 ms |
344 KB |
Output is correct |
| 8 |
Correct |
0 ms |
344 KB |
Output is correct |
| 9 |
Correct |
0 ms |
344 KB |
Output is correct |
| 10 |
Correct |
0 ms |
344 KB |
Output is correct |
| 11 |
Correct |
0 ms |
344 KB |
Output is correct |
| 12 |
Correct |
1 ms |
344 KB |
Output is correct |
| 13 |
Correct |
1 ms |
344 KB |
Output is correct |
| 14 |
Correct |
1 ms |
344 KB |
Output is correct |
| 15 |
Correct |
0 ms |
344 KB |
Output is correct |
| 16 |
Correct |
9 ms |
2904 KB |
Output is correct |
| 17 |
Correct |
9 ms |
2904 KB |
Output is correct |
| 18 |
Correct |
7 ms |
2904 KB |
Output is correct |
| 19 |
Correct |
7 ms |
940 KB |
Output is correct |
| 20 |
Correct |
6 ms |
2904 KB |
Output is correct |
| 21 |
Correct |
28 ms |
3792 KB |
Output is correct |
| 22 |
Correct |
31 ms |
2256 KB |
Output is correct |
| 23 |
Correct |
28 ms |
3792 KB |
Output is correct |
| 24 |
Correct |
31 ms |
2256 KB |
Output is correct |
| 25 |
Correct |
27 ms |
2256 KB |
Output is correct |
| 26 |
Correct |
30 ms |
3784 KB |
Output is correct |
| 27 |
Correct |
29 ms |
2256 KB |
Output is correct |
| 28 |
Correct |
37 ms |
2248 KB |
Output is correct |
| 29 |
Correct |
29 ms |
3792 KB |
Output is correct |
| 30 |
Correct |
25 ms |
3792 KB |
Output is correct |
| 31 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 32 |
Correct |
0 ms |
2392 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
344 KB |
Output is correct |
| 2 |
Correct |
0 ms |
344 KB |
Output is correct |
| 3 |
Correct |
0 ms |
344 KB |
Output is correct |
| 4 |
Correct |
0 ms |
344 KB |
Output is correct |
| 5 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
| 6 |
Correct |
0 ms |
344 KB |
Output is correct |
| 7 |
Correct |
0 ms |
344 KB |
Output is correct |
| 8 |
Correct |
0 ms |
344 KB |
Output is correct |
| 9 |
Correct |
0 ms |
344 KB |
Output is correct |
| 10 |
Correct |
0 ms |
344 KB |
Output is correct |
| 11 |
Correct |
1 ms |
344 KB |
Output is correct |
| 12 |
Correct |
1 ms |
344 KB |
Output is correct |
| 13 |
Correct |
1 ms |
344 KB |
Output is correct |
| 14 |
Correct |
1 ms |
344 KB |
Output is correct |
| 15 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
| 16 |
Correct |
10 ms |
1236 KB |
Output is correct |
| 17 |
Correct |
10 ms |
1236 KB |
Output is correct |
| 18 |
Correct |
10 ms |
3028 KB |
Output is correct |
| 19 |
Correct |
12 ms |
3024 KB |
Output is correct |
| 20 |
Partially correct |
6 ms |
1236 KB |
Partially correct |
| 21 |
Correct |
42 ms |
3440 KB |
Output is correct |
| 22 |
Correct |
50 ms |
3276 KB |
Output is correct |
| 23 |
Correct |
42 ms |
3276 KB |
Output is correct |
| 24 |
Correct |
50 ms |
4804 KB |
Output is correct |
| 25 |
Incorrect |
35 ms |
4984 KB |
Output isn't correct |
| 26 |
Correct |
41 ms |
3268 KB |
Output is correct |
| 27 |
Correct |
42 ms |
3376 KB |
Output is correct |
| 28 |
Correct |
41 ms |
3276 KB |
Output is correct |
| 29 |
Correct |
49 ms |
4884 KB |
Output is correct |
| 30 |
Partially correct |
26 ms |
4804 KB |
Partially correct |
| 31 |
Correct |
0 ms |
2392 KB |
Output is correct |
| 32 |
Correct |
0 ms |
344 KB |
Output is correct |
