Submission #764216

#TimeUsernameProblemLanguageResultExecution timeMemory
764216Dan4LifeMinerals (JOI19_minerals)C++17
40 / 100
27 ms3540 KiB
#include "minerals.h" #include <bits/stdc++.h> using namespace std; #define pb push_back #define sz(a) (int)a.size() #define all(a) begin(a),end(a) int n; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); void dnc(vector<int> l, vector<int> r){ if(sz(l)<1) return; if(sz(l)==1) return void(Answer(l[0],r[0])); int mid = sz(l)/2, x, tot; vector<int> v[2],w[2]; for(int i : {0,1}) v[i].clear(),w[i].clear(); for(int i = 0; i < mid; i++) tot=Query(l[i]); for(int i = 0; i < sz(l); i++) v[i>=mid].pb(l[i]); shuffle(all(r),rng); for(int i : r) x = Query(i), w[x==tot].pb(i), Query(i); for(int i = 0; i < mid; i++) Query(l[i]); dnc(v[0],w[0]), dnc(v[1],w[1]); } void Solve(int N) { n = N; vector<int> v(2*n,0),w[2]; int p=0; iota(all(v),1); shuffle(all(v),rng); for(int i = 0; i < sz(v); i++){ int x = Query(v[i]); if(x!=p) w[0].pb(v[i]), p=x; else w[1].pb(v[i]),p=Query(v[i]); } dnc(w[0],w[1]); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...