# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
430479 | OptxPrime | Network (BOI15_net) | C++11 | 1 ms | 308 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<iostream>
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
bool visited[1000010];
vector<vector<int>> adj;
vector<int> listovi;
void dfs(int x)
{
visited[x] = true;
if( adj[x].size()==1 )
listovi.pb(x);
for( auto u : adj[x]){
if(!visited[u])
dfs(u);
}
}
int main(){
int n,a,b;
cin>>n;
adj.resize(n);
for(int i=0;i<n-1;i++){
cin>>a>>b;
a--;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |