# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
314048 | 2020-10-18T01:29:05 Z | linear00000 | Connecting Supertrees (IOI20_supertrees) | C++14 | 233 ms | 22136 KB |
#include "supertrees.h" #include <bits/stdc++.h> using namespace std; vector<vector<int> > d; vector<int> C[1004]; int par[1004], num = 0; int findpar(int N) { if (N == par[N]) return N; else return par[N] = findpar(par[N]); } void merge(int a, int b) { int aa = findpar(a), bb = findpar(b); par[aa] = bb; } int construct(vector<vector<int> > v) { int n = v.size(); for (int i=0; i<n; i++) par[i] = i; d.resize(n); for (int i=0; i<n; i++) d[i].resize(n); for (int i=0; i<n; i++) { for (int j=i + 1; j < n; j++) { if (v[i][j] == 2 && i != j) merge(i, j); } } for (int i=0; i<n; i++) { for (int j=i + 1; j < n; j++) { if (v[i][j] == 0) { if (findpar(i) == findpar(j)) return 0; } } } for (int i=0; i<n; i++) par[i] = findpar(i); for (int i=0; i<n; i++) C[par[i]].push_back(i); for (int i=0; i<n; i++) { vector<int> tmp; for (int j=0; j<C[i].size(); j++) { if (C[i][j] != i) { d[i][C[i][j]] = 1, d[C[i][j]][i] = 1; tmp.push_back(C[i][j]); } } if (tmp.size() == 1) return 0; if (tmp.size() >= 2) { d[tmp[0]][tmp[tmp.size() - 1]] = 1, d[tmp.size() - 1][tmp[0]] = 1; } } build(d); return 1; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 384 KB | Output is correct |
2 | Incorrect | 0 ms | 384 KB | Too few ways to get from 0 to 1, should be 1 found 0 |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 384 KB | Output is correct |
2 | Incorrect | 0 ms | 384 KB | Too few ways to get from 0 to 1, should be 1 found 0 |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 384 KB | Output is correct |
2 | Correct | 0 ms | 384 KB | Output is correct |
3 | Correct | 0 ms | 384 KB | Output is correct |
4 | Correct | 0 ms | 384 KB | Output is correct |
5 | Correct | 0 ms | 384 KB | Output is correct |
6 | Correct | 1 ms | 384 KB | Output is correct |
7 | Correct | 0 ms | 384 KB | Output is correct |
8 | Correct | 10 ms | 1280 KB | Output is correct |
9 | Correct | 233 ms | 22136 KB | Output is correct |
10 | Incorrect | 1 ms | 384 KB | Too few ways to get from 1 to 2, should be 2 found 1 |
11 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 384 KB | Output is correct |
2 | Correct | 1 ms | 384 KB | Output is correct |
3 | Incorrect | 0 ms | 384 KB | Too few ways to get from 1 to 2, should be 1 found 0 |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 384 KB | Output is correct |
2 | Incorrect | 0 ms | 384 KB | Too few ways to get from 0 to 1, should be 1 found 0 |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 384 KB | Output is correct |
2 | Incorrect | 0 ms | 384 KB | Too few ways to get from 0 to 1, should be 1 found 0 |
3 | Halted | 0 ms | 0 KB | - |