# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
166592 | Lawliet | Network (BOI15_net) | C++17 | 879 ms | 94788 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;
typedef pair<int,int> pii;
const int MAXN = 500010;
int n;
int sub[MAXN];
vector< int > adj[MAXN];
vector< int > group[MAXN];
set< pii > s;
void DFS(int cur, int p, int t)
{
if( adj[cur].size() == 1 )
{
sub[ cur ] = 1;
group[ t ].push_back( cur );
return;
}
for(int i = 0 ; i < adj[cur].size() ; i++)
{
int viz = adj[cur][i];
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... |