# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
851861 | mickey080929 | Simurgh (IOI17_simurgh) | C++17 | 100 ms | 8264 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 "simurgh.h"
#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> pii;
const int inf = 1e9;
int ori;
vector<vector<pii>> adj;
vector<vector<pii>> back_edges;
vector<vector<pii>> childs;
vector<int> color; // -1 : uncolored, 0 : normal edge, 1 : golden edge
vector<int> vis;
vector<pii> par;
vector<int> dep;
vector<int> query;
vector<int> ans;
int ask() { return count_common_roads(query); }
void ins(vector<int> v) {
for (auto &i : v)
query.push_back(i);
}
vector<int> chk;
void del(vector<int> v) {
for (auto &i : v) chk[i] = 1;
vector<int> t;
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... |