# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
709601 | 2023-03-14T01:55:34 Z | null_awe | Minerals (JOI19_minerals) | C++14 | 33 ms | 1692 KB |
#include <iostream> #include <vector> #include <set> #include "minerals.h" using namespace std; set<int> on; 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]; for (int i = 0; i < m; ++i) a2[i] = a[i + n]; for (int i : a1) if (!on.count(i)) Query(i), on.insert(i); for (int i : a2) if (on.count(i)) Query(i), on.erase(i); for (int i = 0; i < n + m; ++i) { int now = Query(b[i]); if (now == on.size()) 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 (i <= n) on.insert(i); if (now > last) a.push_back(i); else b.push_back(i); last = now; } for (int i : b) Query(i); solve(a, b); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 208 KB | Wrong Answer [1] |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 336 KB | Output is correct |
2 | Correct | 4 ms | 508 KB | Output is correct |
3 | Correct | 8 ms | 592 KB | Output is correct |
4 | Correct | 17 ms | 1056 KB | Output is correct |
5 | Correct | 33 ms | 1692 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 208 KB | Wrong Answer [1] |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 208 KB | Wrong Answer [1] |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 208 KB | Wrong Answer [1] |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 208 KB | Wrong Answer [1] |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 208 KB | Wrong Answer [1] |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 208 KB | Wrong Answer [1] |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 208 KB | Wrong Answer [1] |
2 | Halted | 0 ms | 0 KB | - |