oj.uz

Submission #777298

# Submission time Handle Problem Language Result Execution time Memory
777298 2023-07-09T02:39:29 Z GrindMachine Library (JOI18_library) C++17
100 / 100
 285 ms 564 KB 
// Om Namah Shivaya

#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) 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

/*

refs:
https://codeforces.com/blog/entry/58433?#comment-422156

*/

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

#include "library.h"

void Solve(int n)
{
	vector<int> adj[n+5];
	vector<pii> edges;

	auto get = [&](int l, int r){
		int cnt = 0;
		for(auto [u,v] : edges){
			if(u >= l and u <= r and v >= l and v <= r){
				cnt++;
			}
		}
		return cnt;
	};

	rep1(iter,n-1){
		int lo = 1, hi = n;
		int u = -1;

		while(lo <= hi){
			int mid = (lo+hi) >> 1;
			vector<int> ask(n);
			rep1(i,mid) ask[i-1] = 1;
			int res = Query(ask);
			int edges_in_range = get(1,mid);
			int want = mid-edges_in_range;
			if(res < want){
				// some extra edge is there
				u = mid;
				hi = mid-1;
			}
			else{
				lo = mid+1;
			}
		}

		lo = 1, hi = u-1;
		int v = -1;

		while(lo <= hi){
			int mid = (lo+hi) >> 1;
			vector<int> ask(n);
			for(int i = mid; i <= u; ++i){
				ask[i-1] = 1;
			}
			int res = Query(ask);
			int edges_in_range = get(mid,u);
			int want = (u-mid+1)-edges_in_range;

			if(res < want){
				v = mid;
				lo = mid+1;
			}
			else{
				hi = mid-1;
			}
		}

		edges.pb({u,v});
		adj[u].pb(v), adj[v].pb(u);
	}

	vector<bool> vis(n+5);
	int src = -1;
	rep1(i,n){
		if(sz(adj[i]) <= 1){
			src = i;
			break;
		}
	}

	vector<int> ans;
	int u = src;

	while(true){
		vis[u] = 1;
		ans.pb(u);
		bool ok = false;
		trav(v,adj[u]){
			if(!vis[v]){
				u = v;
				ok = true;
				break;
			}
		}

		if(!ok) break;
	}

	Answer(ans);
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 292 KB # of queries: 2797
2 Correct 27 ms 308 KB # of queries: 2784
3 Correct 29 ms 304 KB # of queries: 2931
4 Correct 32 ms 208 KB # of queries: 2935
5 Correct 31 ms 292 KB # of queries: 2936
6 Correct 30 ms 284 KB # of queries: 2938
7 Correct 28 ms 208 KB # of queries: 2924
8 Correct 32 ms 208 KB # of queries: 2791
9 Correct 32 ms 284 KB # of queries: 2926
10 Correct 15 ms 300 KB # of queries: 1719
11 Correct 0 ms 208 KB # of queries: 0
12 Correct 1 ms 208 KB # of queries: 3
13 Correct 1 ms 208 KB # of queries: 7
14 Correct 0 ms 208 KB # of queries: 13
15 Correct 1 ms 208 KB # of queries: 103
16 Correct 3 ms 208 KB # of queries: 238

Subtask #2
81.0 / 81.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 292 KB # of queries: 2797
2 Correct 27 ms 308 KB # of queries: 2784
3 Correct 29 ms 304 KB # of queries: 2931
4 Correct 32 ms 208 KB # of queries: 2935
5 Correct 31 ms 292 KB # of queries: 2936
6 Correct 30 ms 284 KB # of queries: 2938
7 Correct 28 ms 208 KB # of queries: 2924
8 Correct 32 ms 208 KB # of queries: 2791
9 Correct 32 ms 284 KB # of queries: 2926
10 Correct 15 ms 300 KB # of queries: 1719
11 Correct 0 ms 208 KB # of queries: 0
12 Correct 1 ms 208 KB # of queries: 3
13 Correct 1 ms 208 KB # of queries: 7
14 Correct 0 ms 208 KB # of queries: 13
15 Correct 1 ms 208 KB # of queries: 103
16 Correct 3 ms 208 KB # of queries: 238
17 Correct 280 ms 344 KB # of queries: 19266
18 Correct 231 ms 468 KB # of queries: 19022
19 Correct 263 ms 340 KB # of queries: 19225
20 Correct 203 ms 328 KB # of queries: 18016
21 Correct 218 ms 336 KB # of queries: 16925
22 Correct 285 ms 344 KB # of queries: 19268
23 Correct 234 ms 440 KB # of queries: 19242
24 Correct 101 ms 312 KB # of queries: 8893
25 Correct 285 ms 316 KB # of queries: 18813
26 Correct 240 ms 336 KB # of queries: 17601
27 Correct 99 ms 304 KB # of queries: 8861
28 Correct 216 ms 564 KB # of queries: 18945
29 Correct 201 ms 316 KB # of queries: 18924
30 Correct 266 ms 336 KB # of queries: 18945