# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
590199 | piOOE | The Potion of Great Power (CEOI20_potion) | C++17 | 1224 ms | 33440 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
const int maxN = 100000, maxU = 200000, INF = 1000000000, BL = 70;
int a[maxU], b[maxU], h[maxN], n, u;
bool cmp(int i, int j) {
return (h[i] != h[j] ? h[i] < h[j] : i < j);
}
vector<int> mrg(vector<int>& A, vector<int>& B) {
vector<int> C(A.size() + B.size()), ans;
merge(A.begin(), A.end(), B.begin(), B.end(), C.begin(), cmp);
for (int i = 0; i < C.size();) {
int j = i;
while (j < C.size() && C[j] == C[i]) {
j += 1;
}
if ((j - i) & 1) {
ans.push_back(C[i]);
}
i = j;
}
return ans;
}
vector<vector<int>> g[maxN];
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |