| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 230243 | mat_v | Gap (APIO16_gap) | C++14 | 0 ms | 0 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
#define ff(i,a,b) for(int (i) = (a); (i) <= (b); ++(i))
#define fb(i,a,b) for(int (i) = (a); (i) >= (b); --(i))
#define mod 998244353
#define xx first
#define yy second
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define ll long long
#define pii pair<int,int>
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>,rb_tree_tag, tree_order_statistics_node_update> ordered_set;/// find_by_order(x)(x+1th) , order_of_key() (strictly less)
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
//#include <stdio.h>
//#include <stdlib.h>
//#include "gap.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;
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;
}
long long findGap(int t, int n){
if(t == 1){
ll l = 0;
ll r = 1000000000;
r *= r;
vector<ll>svi;
while(l < r){
ll mn,mx;
MinMax(l,r,&mn,&mx);
svi.pb(mx);
if(mn != mx)svi.pb(mn);
l = mn+1;
r = mx-1;
}
sort(svi.begin(), svi.end());
ll res = 0;
ff(i,1,n - 1){
res = max(res, svi[i] - svi[i - 1]);
}
return res;
}
else if(t == 2){
ll mn,mx;
ll l = 0;
ll r = 1000000000;
r *= r;
vector<ll> svi;
MinMax(l,r,mn,mx);
svi.pb(mn);
svi.pb(mx);
ll dif = mx - mn;
dif /= (n-1);
for(ll i = mn; i<=mx; i+=dif){
ll p1,p2;
MinMax(i,i+dif,&p1,&p2);
svi.pb(p1);
svi.pb(p2);
}
ll res = 0;
ff(i,1,n - 1){
res = max(res, svi[i] - svi[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);
return 0;
}