Submission #263574

#TimeUsernameProblemLanguageResultExecution timeMemory
263574_7_7_Gap (APIO16_gap)C++14
Compilation error
0 ms0 KiB
#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;
 
ll a, b, ans = 1, res, nn;
set < ll > q;
vector < ll > v;
vector < pair < ll, pll > > V;
 
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) {
    q.insert(l);
    q.insert(r);
	if (r - l <= 1)
		return;
	
 
	if (l == r - 2) {
		MinMax(l + 1, r - 1, &a, &b);
 
		if (a == -1) 
			ans = max(ans, 2ll);
		return;
	}
 

    ll y = 10;
	y = min({r - l, y, nn - sz(q)});
	y = max(y, 2ll);
	vector < ll > v;
	v.pb(l);
	for (int x = 1; x < y; ++x)	
		v.pb(l + ((r - l) / y)*x);

	v.pb(r - 1);

	vector < pll > vv;
	vv.pb({l, l});
	for (int i = 1; i < sz(v); ++i) { 
		assert(v[i - 1] + 1 <= v[i]);
		MinMax(v[i - 1] + 1, v[i], &a, &b);
		if (a != -1)
			vv.pb({a, b});
	}

	vv.pb({r, r});

	for (int i = 1; i < sz(vv); ++i)
		ans = max(ans, vv[i].f - vv[i - 1].s);

	for (int i = 1; i < sz(vv) - 1; ++i) {
		pll x = vv[i];
		V.pb(mp(x.s - x.f, x));
	}
}
 
 
 
 
long long findGap(int T, int n) {
    nn = n;
	srand(time(0));
	
	if (T == 1) {
		ll l = 0, r = INF;
		vector < ll > v;
		while (l <= r) {
			if (sz(v) >= n)
				break;
			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.insert(mp(b - a, mp(a, b)));
	ll iter = 1000;
	while (sz(V)) {
		ll j = getRand() % sz(V);
		pair < ll, pll > cur = V[j];
		if (cur.s.f - cur.s.s > ans) {
			solve(cur.s.f, cur.s.s);
			--iter;
		}
		if (!iter)
			break;
		swap(V[j], V.back());
		V.ppb();
	}
	return ans;
}

Compilation message (stderr)

gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:133:30: error: no matching function for call to 'std::vector<std::pair<long long int, std::pair<long long int, long long int> > >::insert(std::pair<long long int, std::pair<long long int, long long int> >)'
  133 |  V.insert(mp(b - a, mp(a, b)));
      |                              ^
In file included from /usr/include/c++/9/vector:72,
                 from /usr/include/c++/9/queue:61,
                 from /usr/include/x86_64-linux-gnu/c++/9/bits/stdc++.h:86,
                 from gap.cpp:2:
/usr/include/c++/9/bits/vector.tcc:130:5: note: candidate: 'std::vector<_Tp, _Alloc>::iterator std::vector<_Tp, _Alloc>::insert(std::vector<_Tp, _Alloc>::const_iterator, const value_type&) [with _Tp = std::pair<long long int, std::pair<long long int, long long int> >; _Alloc = std::allocator<std::pair<long long int, std::pair<long long int, long long int> > >; std::vector<_Tp, _Alloc>::iterator = __gnu_cxx::__normal_iterator<std::pair<long long int, std::pair<long long int, long long int> >*, std::vector<std::pair<long long int, std::pair<long long int, long long int> > > >; typename std::_Vector_base<_Tp, _Alloc>::pointer = std::pair<long long int, std::pair<long long int, long long int> >*; std::vector<_Tp, _Alloc>::const_iterator = __gnu_cxx::__normal_iterator<const std::pair<long long int, std::pair<long long int, long long int> >*, std::vector<std::pair<long long int, std::pair<long long int, long long int> > > >; typename __gnu_cxx::__alloc_traits<typename std::_Vector_base<_Tp, _Alloc>::_Tp_alloc_type>::const_pointer = const std::pair<long long int, std::pair<long long int, long long int> >*; std::vector<_Tp, _Alloc>::value_type = std::pair<long long int, std::pair<long long int, long long int> >]'
  130 |     vector<_Tp, _Alloc>::
      |     ^~~~~~~~~~~~~~~~~~~
/usr/include/c++/9/bits/vector.tcc:130:5: note:   candidate expects 2 arguments, 1 provided
In file included from /usr/include/c++/9/vector:67,
                 from /usr/include/c++/9/queue:61,
                 from /usr/include/x86_64-linux-gnu/c++/9/bits/stdc++.h:86,
                 from gap.cpp:2:
/usr/include/c++/9/bits/stl_vector.h:1290:7: note: candidate: 'std::vector<_Tp, _Alloc>::iterator std::vector<_Tp, _Alloc>::insert(std::vector<_Tp, _Alloc>::const_iterator, std::vector<_Tp, _Alloc>::value_type&&) [with _Tp = std::pair<long long int, std::pair<long long int, long long int> >; _Alloc = std::allocator<std::pair<long long int, std::pair<long long int, long long int> > >; std::vector<_Tp, _Alloc>::iterator = __gnu_cxx::__normal_iterator<std::pair<long long int, std::pair<long long int, long long int> >*, std::vector<std::pair<long long int, std::pair<long long int, long long int> > > >; typename std::_Vector_base<_Tp, _Alloc>::pointer = std::pair<long long int, std::pair<long long int, long long int> >*; std::vector<_Tp, _Alloc>::const_iterator = __gnu_cxx::__normal_iterator<const std::pair<long long int, std::pair<long long int, long long int> >*, std::vector<std::pair<long long int, std::pair<long long int, long long int> > > >; typename __gnu_cxx::__alloc_traits<typename std::_Vector_base<_Tp, _Alloc>::_Tp_alloc_type>::const_pointer = const std::pair<long long int, std::pair<long long int, long long int> >*; std::vector<_Tp, _Alloc>::value_type = std::pair<long long int, std::pair<long long int, long long int> >]'
 1290 |       insert(const_iterator __position, value_type&& __x)
      |       ^~~~~~
/usr/include/c++/9/bits/stl_vector.h:1290:7: note:   candidate expects 2 arguments, 1 provided
/usr/include/c++/9/bits/stl_vector.h:1307:7: note: candidate: 'std::vector<_Tp, _Alloc>::iterator std::vector<_Tp, _Alloc>::insert(std::vector<_Tp, _Alloc>::const_iterator, std::initializer_list<_Tp>) [with _Tp = std::pair<long long int, std::pair<long long int, long long int> >; _Alloc = std::allocator<std::pair<long long int, std::pair<long long int, long long int> > >; std::vector<_Tp, _Alloc>::iterator = __gnu_cxx::__normal_iterator<std::pair<long long int, std::pair<long long int, long long int> >*, std::vector<std::pair<long long int, std::pair<long long int, long long int> > > >; typename std::_Vector_base<_Tp, _Alloc>::pointer = std::pair<long long int, std::pair<long long int, long long int> >*; std::vector<_Tp, _Alloc>::const_iterator = __gnu_cxx::__normal_iterator<const std::pair<long long int, std::pair<long long int, long long int> >*, std::vector<std::pair<long long int, std::pair<long long int, long long int> > > >; typename __gnu_cxx::__alloc_traits<typename std::_Vector_base<_Tp, _Alloc>::_Tp_alloc_type>::const_pointer = const std::pair<long long int, std::pair<long long int, long long int> >*]'
 1307 |       insert(const_iterator __position, initializer_list<value_type> __l)
      |       ^~~~~~
/usr/include/c++/9/bits/stl_vector.h:1307:7: note:   candidate expects 2 arguments, 1 provided
/usr/include/c++/9/bits/stl_vector.h:1332:7: note: candidate: 'std::vector<_Tp, _Alloc>::iterator std::vector<_Tp, _Alloc>::insert(std::vector<_Tp, _Alloc>::const_iterator, std::vector<_Tp, _Alloc>::size_type, const value_type&) [with _Tp = std::pair<long long int, std::pair<long long int, long long int> >; _Alloc = std::allocator<std::pair<long long int, std::pair<long long int, long long int> > >; std::vector<_Tp, _Alloc>::iterator = __gnu_cxx::__normal_iterator<std::pair<long long int, std::pair<long long int, long long int> >*, std::vector<std::pair<long long int, std::pair<long long int, long long int> > > >; typename std::_Vector_base<_Tp, _Alloc>::pointer = std::pair<long long int, std::pair<long long int, long long int> >*; std::vector<_Tp, _Alloc>::const_iterator = __gnu_cxx::__normal_iterator<const std::pair<long long int, std::pair<long long int, long long int> >*, std::vector<std::pair<long long int, std::pair<long long int, long long int> > > >; typename __gnu_cxx::__alloc_traits<typename std::_Vector_base<_Tp, _Alloc>::_Tp_alloc_type>::const_pointer = const std::pair<long long int, std::pair<long long int, long long int> >*; std::vector<_Tp, _Alloc>::size_type = long unsigned int; std::vector<_Tp, _Alloc>::value_type = std::pair<long long int, std::pair<long long int, long long int> >]'
 1332 |       insert(const_iterator __position, size_type __n, const value_type& __x)
      |       ^~~~~~
/usr/include/c++/9/bits/stl_vector.h:1332:7: note:   candidate expects 3 arguments, 1 provided
/usr/include/c++/9/bits/stl_vector.h:1376:2: note: candidate: 'template<class _InputIterator, class> std::vector<_Tp, _Alloc>::iterator std::vector<_Tp, _Alloc>::insert(std::vector<_Tp, _Alloc>::const_iterator, _InputIterator, _InputIterator) [with _InputIterator = _InputIterator; <template-parameter-2-2> = <template-parameter-1-2>; _Tp = std::pair<long long int, std::pair<long long int, long long int> >; _Alloc = std::allocator<std::pair<long long int, std::pair<long long int, long long int> > >]'
 1376 |  insert(const_iterator __position, _InputIterator __first,
      |  ^~~~~~
/usr/include/c++/9/bits/stl_vector.h:1376:2: note:   template argument deduction/substitution failed:
gap.cpp:133:30: note:   candidate expects 3 arguments, 1 provided
  133 |  V.insert(mp(b - a, mp(a, b)));
      |                              ^