# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
578482 | amunduzbaev | The Potion of Great Power (CEOI20_potion) | C++17 | 2945 ms | 92420 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;
#ifndef EVAL
#include "grader.cpp"
#endif
#define ar array
const int N = 1e5 + 5;
const int C = 50;
vector<ar<int, 2>> edges[N];
vector<set<ar<int, 2>>> vals[N];
int h[N], n;
void init(int N, int D, int H[]) {
n = N;
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++){
edges[A[i]].push_back({i + 1, B[i]});
edges[B[i]].push_back({i + 1, A[i]});
}
for(int i=0;i<n;i++){
set<ar<int, 2>> ss;
for(int j=0;j<(int)edges[i].size();j++){
if(j % C == 0){
# | 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... |