제출 #916051

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
916051		GrindMachine	Gap (APIO16_gap)	C++17	4.83 / 100	1159 ms	3108 KiB

gap

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a,b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a,b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*

read some solutions a long time ago, slightly remember some ideas
may have still solved it if not for those ideas

*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

#include "gap.h"

ll go(ll l, ll r){
	if(l >= r) return 0;

	ll mid = (l+r) >> 1;
	ll lmn,lmx,rmn,rmx;
	MinMax(l,mid,&lmn,&lmx);
	MinMax(mid+1,r,&rmn,&rmx);
	
	ll ans = 0;
	if(lmx != -1 and rmn != -1){
		ans = rmn-lmx;
	}

	if(lmx != -1){
		amax(ans,go(l,mid));
	}
	if(rmn != -1){
		amax(ans,go(mid+1,r));
	}

	return ans;
}

long long findGap(int T, int n)
{
	return go(0,inf2);
}

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