# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
99180 | dsg213 | Torrent (COI16_torrent) | C++14 | 2021 ms | 41860 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 pb push_back
#define mp make_pair
#define st first
#define nd second
#define ll long long
#define ull unsigned ll
#define pii pair<int,int>
#define pll pair<ll,ll>
#define vi vector<int>
const int mod=1000000007,mxn=1000010;
int ost[mxn];
vector<int> pol[mxn];
void dfs1(int v,int p){
ost[v]=p;
for(int i=0;i<pol[v].size();i++){
int u=pol[v][i];
if(u==p){
continue;
}
dfs1(u,v);
}
}
int dfs2(int v,int p,int om){
vector<int> vec(1,0);
for(int i=0;i<pol[v].size();i++){
int u=pol[v][i];
if(u==p || u==om){
continue;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |