| # |
제출 시각 |
아이디 |
문제 |
언어 |
결과 |
실행 시간 |
메모리 |
| 1002818 |
2024-06-19T20:04:47 Z |
Tob |
Gap (APIO16_gap) |
C++14 |
|
39 ms |
3276 KB |
#include <bits/stdc++.h>
#include "gap.h"
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define pb push_back
#define FIO ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
using namespace std;
typedef long long ll;
typedef pair <ll, ll> pii;
/*
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;
}*/
//---------------------------
const ll inf = 1e18;
ll findGap(int t, int n) {
if (t == 1) {
ll x = 0, y = inf;
ll mn=0, mx=inf;
vector <ll> v;
for (int i = 0; i < (n+1)/2; i++) {
MinMax(x, y, &mn, &mx);
v.pb(mn);
v.pb(mx);
x = mn+1; y = mx-1;
}
sort(all(v)); v.erase(unique(all(v)), v.end());
ll res = 0;
for (int i = 1; i < n; i++) res = max(res, v[i]-v[i-1]);
return res;
}
ll lo=0, hi=0;
MinMax(0, inf, &lo, &hi);
ll d = (hi-lo+n-2)/(n-1);
vector <ll> v;
v = {lo, hi};
for (ll i = lo; i < hi; i += d) {
ll a=0, b=0;
MinMax(i, i+d-1, &a, &b);
if (a != -1) {v.pb(a); v.pb(b);}
}
sort(all(v)); v.erase(unique(all(v)), v.end());
ll res = 0;
for (int i = 1; i < n; i++) res = max(res, v[i]-v[i-1]);
return res;
}
//---------------------------
/*
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);
}*/
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
344 KB |
Output is correct |
| 2 |
Correct |
0 ms |
344 KB |
Output is correct |
| 3 |
Correct |
0 ms |
448 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 |
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 |
Correct |
1 ms |
344 KB |
Output is correct |
| 16 |
Correct |
8 ms |
980 KB |
Output is correct |
| 17 |
Correct |
6 ms |
952 KB |
Output is correct |
| 18 |
Correct |
9 ms |
980 KB |
Output is correct |
| 19 |
Correct |
6 ms |
980 KB |
Output is correct |
| 20 |
Correct |
5 ms |
980 KB |
Output is correct |
| 21 |
Correct |
25 ms |
2344 KB |
Output is correct |
| 22 |
Correct |
24 ms |
2256 KB |
Output is correct |
| 23 |
Correct |
33 ms |
2248 KB |
Output is correct |
| 24 |
Correct |
35 ms |
2256 KB |
Output is correct |
| 25 |
Correct |
30 ms |
2256 KB |
Output is correct |
| 26 |
Correct |
27 ms |
2256 KB |
Output is correct |
| 27 |
Correct |
36 ms |
2244 KB |
Output is correct |
| 28 |
Correct |
28 ms |
2248 KB |
Output is correct |
| 29 |
Correct |
26 ms |
2252 KB |
Output is correct |
| 30 |
Correct |
23 ms |
2400 KB |
Output is correct |
| 31 |
Correct |
0 ms |
344 KB |
Output is correct |
| 32 |
Correct |
0 ms |
344 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
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 |
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 |
340 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 |
Correct |
1 ms |
344 KB |
Output is correct |
| 16 |
Correct |
8 ms |
980 KB |
Output is correct |
| 17 |
Correct |
11 ms |
980 KB |
Output is correct |
| 18 |
Correct |
11 ms |
980 KB |
Output is correct |
| 19 |
Correct |
9 ms |
952 KB |
Output is correct |
| 20 |
Runtime error |
5 ms |
856 KB |
Execution killed with signal 11 |
| 21 |
Correct |
39 ms |
2268 KB |
Output is correct |
| 22 |
Correct |
37 ms |
2248 KB |
Output is correct |
| 23 |
Correct |
37 ms |
2256 KB |
Output is correct |
| 24 |
Correct |
39 ms |
2344 KB |
Output is correct |
| 25 |
Correct |
36 ms |
3276 KB |
Output is correct |
| 26 |
Correct |
37 ms |
2256 KB |
Output is correct |
| 27 |
Correct |
37 ms |
2196 KB |
Output is correct |
| 28 |
Correct |
36 ms |
2248 KB |
Output is correct |
| 29 |
Correct |
37 ms |
2328 KB |
Output is correct |
| 30 |
Runtime error |
28 ms |
2508 KB |
Execution killed with signal 11 |
| 31 |
Correct |
1 ms |
344 KB |
Output is correct |
| 32 |
Correct |
0 ms |
344 KB |
Output is correct |
