# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
612154 | 1bin | The Potion of Great Power (CEOI20_potion) | C++17 | 3087 ms | 32712 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;
#define fi first
#define all(v) v.begin(), v.end()
const int NMAX = 1e5 + 5;
const int sqt = 30;
int n, d, u, q, h[NMAX], a, b, A[2 * NMAX], B[2 * NMAX];
vector<int> ix[NMAX];
vector<vector<pair<int, int>>> v[NMAX];
set<pair<int, int>> l, r;
void init(int N, int D, int H[]){
n = N; d = D;
for(int i = 0; i < n; i++) h[i] = H[i];
return;
}
void curseChanges(int U, int A_[], int B_[]){
u = U;
for(int i = 0; i < u; i++) A[i] = A_[i], B[i] = B_[i];
for(int i = 0; i < u; i++){
a = A[i]; b = B[i];
ix[a].emplace_back(i);
ix[b].emplace_back(i);
}
for(int i = 0; i < n; i++){
set<pair<int, int>> s;
for(int j = 0; j < ix[i].size(); j++){
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... |