Submission #605539

#TimeUsernameProblemLanguageResultExecution timeMemory
605539VanillaICC (CEOI16_icc)C++17
90 / 100
123 ms512 KiB
#include "icc.h" #include <bits/stdc++.h> using namespace std; const int maxn = 102; int dsu [maxn]; vector <int> el [maxn]; int dad (int x) { return dsu[x] = (x == dsu[x] ? x: dad(dsu[x])); } void merge (int x, int y){ x = dad(x), y = dad(y); if (x != y) { // if (el[x].size() < el[y].size()) swap(x, y); for (int j: el[y]) el[x].push_back(j); el[y].clear(); dsu[y] = x; } } int qq (vector <int> a, vector <int> b) { return query(a.size(), b.size(), a.data(), b.data()); } void run(int n) { srand(time(NULL)); for (int i = 1; i <= n; i++) { dsu[i] = i; el[i].push_back(i); } for (int p = 0; p < n - 1; p++){ set <int> s; vector <int> comp; for (int j = 1; j <= n; j++) s.insert(dad(j)); for (int k: s) comp.push_back(k); int m = comp.size(); // shuffle (bt.begin(), bt.end(), std::default_random_engine(std::chrono::system_clock::now().time_since_epoch().count())); vector <int> a,b; for (int i = 0; i < 8; i++){ vector <int> v1, v2; for (int j = 0; j < m; j++){ if (j & (1 << i)) for (int l: el[comp[j]]) v1.push_back(l); else for (int l: el[comp[j]]) v2.push_back(l); } if (qq(v1, v2)) { a = v1, b = v2; break; } } int l = 0, r = a.size(), rs1 = -1, rs2 = -1; sort(a.begin(), a.end()); sort(b.begin(), b.end()); reverse(a.begin(), a.end()); reverse(b.begin(), b.end()); // if (rand() % 5)shuffle (a.begin(), a.end(), std::default_random_engine(std::chrono::system_clock::now().time_since_epoch().count())); // if (rand() % 5)shuffle (b.begin(), b.end(), std::default_random_engine(std::chrono::system_clock::now().time_since_epoch().count())); while (l < r) { int mid = (l + r) / 2; vector <int> v; for (int i = 0; i <= mid; i++) v.push_back(a[i]); if (qq(v, b)) { rs1 = v.back(); r = mid; } else { l = mid + 1; } } l = 0, r = b.size(); while (l < r) { int mid = (l + r) / 2; vector <int> v; for (int i = 0; i <= mid; i++) v.push_back(b[i]); if (qq(v, a)) { rs2 = v.back(); r = mid; } else { l = mid + 1; } } merge(rs1, rs2); setRoad(rs1, rs2); } }
#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...