Submission #709598

#TimeUsernameProblemLanguageResultExecution timeMemory
709598null_aweMinerals (JOI19_minerals)C++14
40 / 100
26 ms3148 KiB
#include <iostream> #include <vector> #include "minerals.h" using namespace std; void solve(vector<int> a, vector<int> b) { if (a.size() == 1) { Answer(a[0], b[0]); return; } int n = a.size() / 2, m = a.size() - n; vector<int> a1(n), a2(m); vector<int> b1, b2; for (int i = 0; i < n; ++i) a1[i] = a[i], Query(a[i]); for (int i = 0; i < m; ++i) a2[i] = a[i + n]; for (int i = 0; i < n + m; ++i) { int now = Query(b[i]); if (now == n) b1.push_back(b[i]); else b2.push_back(b[i]); Query(b[i]); } for (int i = 0; i < n; ++i) Query(a[i]); solve(a1, b1), solve(a2, b2); } void Solve(int n) { vector<int> a, b; int last = 0; for (int i = 1; i <= 2 * n; ++i) { int now = Query(i); if (now > last) a.push_back(i); else b.push_back(i); last = now; } for (int i = 1; i <= 2 * n; ++i) Query(i); solve(a, b); }
#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...