# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
790197 | Andrey | Connecting Supertrees (IOI20_supertrees) | C++14 | 178 ms | 27976 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;
vector<vector<int>> ans(0);
vector<vector<int>> haha(0);
vector<bool> bruh(3001,true);
int n;
vector<int> col(3000,-1);
vector<int> no(3000,-1);
void dfs(int a, int c) {
col[a] = c;
if(a != c) {
ans[a][c] = 1;
ans[c][a] = 1;
}
for(int i = 0; i < n; i++) {
if(col[i] == -1 && haha[a][i] == 1) {
dfs(i,c);
}
}
}
int construct(vector<vector<int>> p) {
n = p[0].size();
haha = p;
vector<int> wut(0);
for(int i = 0; i < n; 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |