제출 #200784

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
200784		dimash241	Gap (APIO16_gap)	C++17	100 / 100	79 ms	1304 KiB

gap

#include "gap.h"
 
# include <bits/stdc++.h>
 
# include <ext/pb_ds/assoc_container.hpp>
# include <ext/pb_ds/tree_policy.hpp>
 
using namespace __gnu_pbds;
using namespace std;
 
template<typename T> using ordered_set = tree <T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
 
#define _USE_MATH_DEFINES_
#define ll long long
#define ld long double
#define Accepted 0
#define pb push_back
#define mp make_pair
#define sz(x) (int)(x.size())
#define every(x) x.begin(),x.end()
#define F first
#define S second
#define lb lower_bound
#define ub upper_bound
#define For(i,x,y)  for (ll i = x; i <= y; i ++) 
#define FOr(i,x,y)  for (ll i = x; i >= y; i --)
#define SpeedForce ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
// ROAD to...                                                                                                                                                                                                                Red
 
inline void Input_Output () {
	//freopen(".in", "r", stdin);
   //freopen(".out", "w", stdout);
}
 
const double eps = 0.000001;
const ld pi = acos(-1);
const int maxn = 1e7 + 9;
const int mod = 1e9 + 7;
const ll MOD = 1e18 + 9;
const ll INF = 1e18 + 123;
const int inf = 2e9 + 11;
const int mxn = 1e6 + 9;
const int N = 6e5 + 123;                                          
const int M = 22;
const int pri = 997;
const int Magic = 2101;
 
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, -1, 0, 1};
 
 
ll solve1 (int n) {
	ll l, r, res = 0;
    MinMax(0, INF, &l, &r);
    int cnt = 2; 
 
    while (cnt < n) {
        ll m1, m2;
        MinMax(l + 1, r - 1, &m1, &m2);
        res = max(res, m1 - l);
        res = max(res, r - m2);
        l = m1;
        r = m2;
        cnt += 2;
    }
 
    res = max(res, r - l);
    return res;
}
ll L[N], R[N];
 
ll solve2 (int n) {
	ll l, r, res = 0;
    MinMax(0, INF, &l, &r);
    R[n] = r;
    L[1] = l;
    ll lim = (r - l + n - 1) / n, lst = l;
 
    for (int i = 1; i <= n; i ++) {
    	ll s = l + 1;
    	ll t = min(r, l + lim);
    	if (s > t) break;
    	ll cl, cr;
    	MinMax(s, t, &cl, &cr);
    	if (cl != -1) {
    		res = max(res, cl - lst);
    		lst = cr;
    	}
    	l += lim;
    }
    res = max(res, r - lst);
    return res;
}
 
long long findGap(int T, int N) {	
	if (T == 1) return solve1(N);
	return solve2(N);
}

• Subtask 1: 30 / 30
• Subtask 2: 70 / 70