# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
547602 | Olympia | Cat in a tree (BOI17_catinatree) | C++17 | 163 ms | 16812 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 <cmath>
#include <iostream>
#include <set>
#include <climits>
#include <algorithm>
#include <cassert>
#include <vector>
#include <iomanip>
#include <type_traits>
#include <string>
#include <queue>
#include <map>
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
using namespace std;
vector<vector<int>> adj;
vector<pair<int,int>> vec;
vector<int> parent;
vector<bool> isValid;
vector<int> marked;
vector<int> qr;
bool comp (pair<int,int> p1, pair<int,int> p2) {
return (p1.second > p2.second);
}
void go_down (int curNode, int d) {
if (d == 0) return;
if (marked[curNode] >= d) return;
marked[curNode] = d;
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... |