Submission #263396

#	Time	Username	Problem	Language	Result	Execution time	Memory
263396		_7_7_	Gap (APIO16_gap)	C++14	16.01 / 100	122 ms	2364 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 std;
using namespace __gnu_pbds;
 
//#define int long long
//#pragma GCC optimize("Ofast")
//#pragma comment(linker, "/stack:200000000")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4")
 
 
#define file(s) freopen(s".in","r",stdin); freopen(s".out","w",stdout);
#define fastio ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define all(x) x.begin(), x.end()
#define sz(s) (int)s.size()
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define s second
#define f first
 
 
 
 
typedef pair < long long, long long > pll;    
typedef pair < int, int > pii;  
typedef unsigned long long ull;         
typedef vector < pii > vpii;                                   	
typedef vector < int > vi;
typedef long double ldb;  
typedef long long ll;  
typedef double db;
 
typedef tree < int, null_type, less < int >, rb_tree_tag, tree_order_statistics_node_update > ordered_set;
 
const int inf = 1e9, maxn = 2e5 + 48, mod = 998244353, N = 2e5 + 12;
const int dx[] = {1, -1, 0, 0}, dy[] = {0, 0, 1, -1}, block = 300;
const pii base = mp(1171, 3307), Mod = mp(1e9 + 7, 1e9 + 9);
const db eps = 1e-12, pi = acos(-1);
const ll INF = 1e18;

vector < ll > v;
ll a, b;
ll getRand () {
	ll res = 0;
	for (int x = 0; x < 61; ++x)
		if (rand() & 1)
			res |= (1ll << x);

	return res;
}

void solve (ll l, ll r) {	
    if (l > r || l == -1)
    	return;

	if (l == r) {
		v.pb(l);
		return;
	}

	ll m = l;
	int y = (getRand() % 3) + 1;
	while (y--)
		m += (r - l) / 4;
	MinMax(l, m, &a, &b);
	if (a != -1) {
		v.pb(a);
		v.pb(b);
		solve(a + 1, b - 1);
	}

	MinMax(m + 1, r, &a, &b);
	if (a != -1) {
		v.pb(a);
		v.pb(b);
		solve(a + 1, b - 1);
	}
}


long long findGap(int T, int n) {
	srand(time(0));
	
	if (T == 1) {
		int l = 0, r = INF;
		while (l <= r) {
			MinMax(l, r, &a, &b);
			v.pb(a);
			v.pb(b);
			l = a + 1;
			r = b - 1;
		}
		sort(all(v));
		ll ans = 0;
		for (ll i = 1; i < sz(v); ++i)
			ans = max(ans, v[i] - v[i - 1]);
		return ans;
	}

	MinMax(0, INF, &a, &b);
	v.pb(a);
	v.pb(b);

	solve(a + 1, b - 1);
	sort(all(v));
	ll ans = 0;
	for (ll i = 1; i < sz(v); ++i)
		ans = max(ans, v[i] - v[i - 1]);
	return ans;
}

Compilation message (stderr)

gap.cpp: In function 'void solve(ll, ll)':
gap.cpp:57:5: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   57 |     if (l > r || l == -1)
      |     ^~
gap.cpp:60:2: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   60 |  if (l == r) {
      |  ^~
gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:89:18: warning: overflow in conversion from 'll' {aka 'long long int'} to 'int' changes value from '1000000000000000000' to '-1486618624' [-Woverflow]
   89 |   int l = 0, r = INF;
      |                  ^~~

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