# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1091613 | DeathIsAwe | Network (BOI15_net) | C++17 | 197 ms | 37700 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;
bool visited[500000];
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, d1,d2; cin >> n;
vector<vector<int>> graph(n);
for (int i=0;i<n-1;i++) {
cin >> d1 >> d2; d1--; d2--;
graph[d1].push_back(d2);
graph[d2].push_back(d1);
visited[i] = false;
}
visited[n - 1] = false;
vector<int> leaves;
stack<int> dfs; dfs.push(0);
int node;
while (dfs.size() > 0) {
node = dfs.top(); dfs.pop();
visited[node] = true;
for (int i: graph[node]) {
if (!visited[i]) {
dfs.push(i);
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |