oj.uz

답안 #330512

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
330512 2020-11-25T15:19:41 Z AmineWeslati Gap (APIO16_gap) C++14
100 / 100
 69 ms 4940 KB 
//Never stop trying
/*#pragma GCC target ("avx2")
#pragma GCC optimize ("Ofast")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")*/
#include "bits/stdc++.h"
#ifndef LOCAL
#include "gap.h"
#endif
using namespace std;
#define boost ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)

typedef long long ll;
typedef string str;
typedef double db;
typedef long double ld;
typedef pair<int, int> pi;
#define fi first
#define se second
typedef vector<int> vi;
typedef vector<pi> vpi;
typedef vector<str> vs;
typedef vector<ld> vd;
#define pb push_back
#define eb emplace_back
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define endl "\n"

#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)

const int MOD = 1e9 + 7; //998244353
const ll INF = 1e18;
const int MX = 2e5 + 10;
const int nx[4] = {0, 0, 1, -1}, ny[4] = {1, -1, 0, 0}; //right left down up

template<class T> using V = vector<T>;
template<class T> bool ckmin(T& a, const T& b) { return a > b ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }

ll cdiv(ll a, ll b) { return a / b + ((a ^ b) > 0 && a % b); } // divide a by b rounded up
//constexpr int log2(int x) { return 31 - __builtin_clz(x); } // floor(log2(x))

mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
//mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());

ll random(ll a, ll b){
    return a + rng() % (b - a + 1);
}

#ifndef LOCAL  
#define cerr if(false) cerr
#endif
#define dbg(x) cerr << #x << " : " << x << endl; 
#define dbgs(x,y) cerr << #x << " : " << x << " / " << #y << " : " << y << endl;
#define dbgv(v) cerr << #v << " : " << "[ "; for(auto it : v) cerr << it << ' '; cerr << ']' << endl;
#define here() cerr << "here" << endl;

void IO() {
#ifdef LOCAL
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif
}

V<ll> v(MX,INF+1);

#ifdef LOCAL
void MinMax(ll l, ll r, ll *x, ll *y){
	auto it=lower_bound(all(v),l)-v.begin();
	auto itr=upper_bound(all(v),r)-v.begin(); itr--;
	if(it>itr) *x=-1ll,*y=-1ll;
	else *x=v[it],*y=v[itr];
}
#endif

ll fir,last;
bool check(ll x){
	x--;
	ll l=fir;
	while(l+x<=last){
		ll v,vv;
		MinMax(l,l+x,&v,&vv);
		if(v!=vv) l=vv;
		else return true; 
	}
	return false;
}

ll findGap(int T, int N){
	if(T==1){
		V<ll> a(N);
		ll l,r,mn=0,mx=INF;
		FOR(i,0,(N+1)/2){
			MinMax(mn,mx,&l,&r);
			a[i]=l,a[N-i-1]=r;
			mn=l+1,mx=r-1;
		}
		ll ans=1;
		FOR(i,0,N-1) ckmax(ans,a[i+1]-a[i]);
		return ans;

	}
	else{
		MinMax(0,INF,&fir,&last);

		V<ll> vec;
		ll B=(last-fir)/(N-1);
		ll l=fir;
		while(l<=last){
			ll v,vv; 
			MinMax(l,min(last,l+B),&v,&vv);
			if(v!=-1){ vec.pb(v); vec.pb(vv); }
			l+=B+1;
		}
		ll ans=B;
		FOR(i,0,sz(vec)-1){
			ckmax(ans,vec[i+1]-vec[i]);
		}
		return ans;

	}
	return 1;
}

#ifdef LOCAL
int main() {
    boost; IO();

    int N; cin>>N;
    FOR(i,0,N) cin>>v[i];
    cout << findGap(2,N) << endl;
    

    return 0;
}
#endif

/* Careful!!!
    .Array bounds
    .Infinite loops
    .Uninitialized variables / empty containers
    .Multisets are shit

   Some insights:
    .Binary search
    .Graph representation
    .Write brute force code
    .Change your approach
*/

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1900 KB Output is correct
2 Correct 1 ms 1900 KB Output is correct
3 Correct 1 ms 1900 KB Output is correct
4 Correct 1 ms 1900 KB Output is correct
5 Correct 1 ms 1900 KB Output is correct
6 Correct 1 ms 1900 KB Output is correct
7 Correct 2 ms 1900 KB Output is correct
8 Correct 2 ms 1900 KB Output is correct
9 Correct 1 ms 1900 KB Output is correct
10 Correct 1 ms 1900 KB Output is correct
11 Correct 2 ms 1900 KB Output is correct
12 Correct 3 ms 1900 KB Output is correct
13 Correct 2 ms 1900 KB Output is correct
14 Correct 2 ms 1900 KB Output is correct
15 Correct 2 ms 1900 KB Output is correct
16 Correct 12 ms 2364 KB Output is correct
17 Correct 14 ms 2284 KB Output is correct
18 Correct 12 ms 2284 KB Output is correct
19 Correct 12 ms 2284 KB Output is correct
20 Correct 10 ms 2284 KB Output is correct
21 Correct 47 ms 3436 KB Output is correct
22 Correct 46 ms 3436 KB Output is correct
23 Correct 49 ms 3488 KB Output is correct
24 Correct 50 ms 3488 KB Output is correct
25 Correct 41 ms 3436 KB Output is correct
26 Correct 46 ms 3436 KB Output is correct
27 Correct 46 ms 3436 KB Output is correct
28 Correct 48 ms 3616 KB Output is correct
29 Correct 47 ms 3640 KB Output is correct
30 Correct 37 ms 3436 KB Output is correct
31 Correct 1 ms 1920 KB Output is correct
32 Correct 1 ms 1900 KB Output is correct

Subtask #2
70.0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1900 KB Output is correct
2 Correct 1 ms 1900 KB Output is correct
3 Correct 1 ms 1900 KB Output is correct
4 Correct 1 ms 1900 KB Output is correct
5 Correct 1 ms 1900 KB Output is correct
6 Correct 1 ms 1900 KB Output is correct
7 Correct 1 ms 1900 KB Output is correct
8 Correct 1 ms 1900 KB Output is correct
9 Correct 1 ms 1900 KB Output is correct
10 Correct 1 ms 1900 KB Output is correct
11 Correct 2 ms 1900 KB Output is correct
12 Correct 2 ms 1900 KB Output is correct
13 Correct 2 ms 1900 KB Output is correct
14 Correct 2 ms 1900 KB Output is correct
15 Correct 57 ms 2028 KB Output is correct
16 Correct 16 ms 2540 KB Output is correct
17 Correct 16 ms 2540 KB Output is correct
18 Correct 16 ms 2540 KB Output is correct
19 Correct 44 ms 2620 KB Output is correct
20 Correct 11 ms 2156 KB Output is correct
21 Correct 64 ms 4068 KB Output is correct
22 Correct 63 ms 3812 KB Output is correct
23 Correct 69 ms 3812 KB Output is correct
24 Correct 65 ms 3812 KB Output is correct
25 Correct 61 ms 4940 KB Output is correct
26 Correct 66 ms 3812 KB Output is correct
27 Correct 65 ms 3940 KB Output is correct
28 Correct 65 ms 3936 KB Output is correct
29 Correct 64 ms 3812 KB Output is correct
30 Correct 35 ms 3052 KB Output is correct
31 Correct 1 ms 1900 KB Output is correct
32 Correct 1 ms 1900 KB Output is correct