# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
588955 | Arnch | The Potion of Great Power (CEOI20_potion) | C++17 | 51 ms | 8444 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 N = 1e3 + 10, maxn = 1e6 + 10;
int n, d, h[maxn], a[maxn], b[maxn];
set<int> st[N];
void init(int N, int D, int H[]) {
n = N, d = D;
for(int i = 0; i < n; i++) h[i] = H[i];
}
void curseChanges(int U, int A[], int B[]) {
for(int i = 0; i < U; i++) {
a[i] = A[i], b[i] = B[i];
}
for(int i = 0; i < U; i++) {
auto it = st[a[i]].find(b[i]);
if(*it == b[i]) st[a[i]].erase(b[i]);
else st[a[i]].insert(b[i]);
it = st[b[i]].find(a[i]);
if(*it == a[i]) st[b[i]].erase(a[i]);
else st[b[i]].insert(a[i]);
}
}
int question(int x, int y, int v) {
# | 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... |