# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|
1176042 | | hy_1 | 트리 (IOI24_tree) | C++20 | | 42 ms | 5700 KiB |
#include "tree.h"
#include <bits/stdc++.h>
int n;
std::vector<int> p, w;
void init(std::vector<int> P, std::vector<int> W) {
p = P;
w = W;
n = (int)p.size();
}
long long query(int L, int R) {
// return n * (long long)(R - L);
return 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... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |