Submission #777298

#TimeUsernameProblemLanguageResultExecution timeMemory
777298GrindMachineLibrary (JOI18_library)C++17
100 / 100
285 ms564 KiB
// 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); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...