# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
300564 | muhammad_hokimiyon | Connecting Supertrees (IOI20_supertrees) | C++14 | 305 ms | 30936 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 "supertrees.h"
#include <vector>
#include <bits/stdc++.h>
using namespace std;
const int maxn = 200200;
bool used[maxn];
vector < int > v[maxn],c;
void dfs( int x )
{
if( used[x] )return;
used[x] = true;
c.push_back(x);
for( auto y : v[x] ){
dfs( y );
}
}
int construct( vector<vector<int>> p )
{
int n = (int)p.size();
for( int i = 0; i < n; i++ ){
if( p[i][i] != 1 )return 0;
for( int j = 0; j < n; j++ ){
if( p[i][j] == 0 )continue;
if( p[i][j] == 3 || p[i][j] != p[j][i] )return 0;
if( p[i][j] == 1 ){
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |