#include <bits/stdc++.h>
#include "supertrees.h"
using namespace std;
#define N 100005
#define wr cout << "Continue debugging\n";
#define all(x) (x).begin(), (x).end()
#define ll long long int
#define pii pair <int, int>
#define pb push_back
#define ff first
#define ss second
vector<int> vec[N];
int find(int i, vector<vector<int>> p, int n){
set<int> s;
for (int j = 0; j < n; j++){
if (p[i][j] and i != j) s.insert(p[i][j]);
}
if (s.size() > 1) return -1;
if (!s.size()) return -2;
return *s.begin();
}
int construct(vector<vector<int>> p){
int n = p.size();
vector<vector<int>> b(n, vector<int>(n, 0));
vector<int> vis(n+1, 0);
int cnt = 0;
for (int i = 0; i < n; i++){
if (vis[i]){
for (auto j : vec[vis[i]]){
if (p[i][j]) return 0;
}
continue;
}
cnt++;
int x = find(i, p, n);
if (x == -1) return 0;
if (x == -2) continue;
for (int j = 0; j < n; j++){
if (p[i][j] and i != j){
b[i][j] = b[j][i] = 1;
vis[j] = cnt;
}else if (!p[i][j]) vec[cnt].pb(j);
}
if (x == 2){
int a1 = -1, b1 = -1;
for (int j = 0; j < n; j++){
if (p[i][j] and i != j){
if (a1 == -1) a1 = j;
else b1 = j;
}
}
if (b1 == -1) return 0;
b[a1][b1] = b[b1][a1] = 1;
}
}
// for (int i = 0; i < n; i++){
// for (int j = 0; j < n; j++) cout << b[i][j] << ' ';
// cout << '\n';
// }
build(b);
return 1;
}
// int main ()
// {
// int n;
// cin >> n;
// vector<vector<int>> p(n, vector<int>(n));
// for (int i = 0; i < n; i++){
// for (int j = 0; j < n; j++) cin >> p[i][j];
// }
// int x = construct(p);
// }
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
2644 KB |
Output is correct |
2 |
Correct |
2 ms |
2644 KB |
Output is correct |
3 |
Correct |
2 ms |
2652 KB |
Output is correct |
4 |
Correct |
2 ms |
2648 KB |
Output is correct |
5 |
Correct |
2 ms |
2648 KB |
Output is correct |
6 |
Correct |
8 ms |
3516 KB |
Output is correct |
7 |
Correct |
158 ms |
24660 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
2644 KB |
Output is correct |
2 |
Correct |
2 ms |
2644 KB |
Output is correct |
3 |
Correct |
2 ms |
2652 KB |
Output is correct |
4 |
Correct |
2 ms |
2648 KB |
Output is correct |
5 |
Correct |
2 ms |
2648 KB |
Output is correct |
6 |
Correct |
8 ms |
3516 KB |
Output is correct |
7 |
Correct |
158 ms |
24660 KB |
Output is correct |
8 |
Correct |
1 ms |
2644 KB |
Output is correct |
9 |
Correct |
2 ms |
2652 KB |
Output is correct |
10 |
Correct |
1 ms |
2644 KB |
Output is correct |
11 |
Correct |
1 ms |
2644 KB |
Output is correct |
12 |
Correct |
11 ms |
3596 KB |
Output is correct |
13 |
Execution timed out |
1067 ms |
24008 KB |
Time limit exceeded |
14 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
2644 KB |
Output is correct |
2 |
Correct |
2 ms |
2648 KB |
Output is correct |
3 |
Correct |
2 ms |
2648 KB |
Output is correct |
4 |
Correct |
1 ms |
2644 KB |
Output is correct |
5 |
Correct |
1 ms |
2644 KB |
Output is correct |
6 |
Correct |
1 ms |
2644 KB |
Output is correct |
7 |
Correct |
1 ms |
2648 KB |
Output is correct |
8 |
Correct |
11 ms |
3604 KB |
Output is correct |
9 |
Execution timed out |
1063 ms |
23972 KB |
Time limit exceeded |
10 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
2644 KB |
Output is correct |
2 |
Correct |
1 ms |
2644 KB |
Output is correct |
3 |
Correct |
1 ms |
2644 KB |
Output is correct |
4 |
Correct |
61 ms |
8532 KB |
Output is correct |
5 |
Correct |
164 ms |
24692 KB |
Output is correct |
6 |
Correct |
552 ms |
26340 KB |
Output is correct |
7 |
Correct |
175 ms |
24732 KB |
Output is correct |
8 |
Incorrect |
1 ms |
2644 KB |
Too few ways to get from 0 to 2, should be 2 found 1 |
9 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
2644 KB |
Output is correct |
2 |
Correct |
2 ms |
2644 KB |
Output is correct |
3 |
Correct |
2 ms |
2652 KB |
Output is correct |
4 |
Correct |
2 ms |
2648 KB |
Output is correct |
5 |
Correct |
2 ms |
2648 KB |
Output is correct |
6 |
Correct |
8 ms |
3516 KB |
Output is correct |
7 |
Correct |
158 ms |
24660 KB |
Output is correct |
8 |
Correct |
1 ms |
2644 KB |
Output is correct |
9 |
Correct |
2 ms |
2652 KB |
Output is correct |
10 |
Correct |
1 ms |
2644 KB |
Output is correct |
11 |
Correct |
1 ms |
2644 KB |
Output is correct |
12 |
Correct |
11 ms |
3596 KB |
Output is correct |
13 |
Execution timed out |
1067 ms |
24008 KB |
Time limit exceeded |
14 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
2644 KB |
Output is correct |
2 |
Correct |
2 ms |
2644 KB |
Output is correct |
3 |
Correct |
2 ms |
2652 KB |
Output is correct |
4 |
Correct |
2 ms |
2648 KB |
Output is correct |
5 |
Correct |
2 ms |
2648 KB |
Output is correct |
6 |
Correct |
8 ms |
3516 KB |
Output is correct |
7 |
Correct |
158 ms |
24660 KB |
Output is correct |
8 |
Correct |
1 ms |
2644 KB |
Output is correct |
9 |
Correct |
2 ms |
2652 KB |
Output is correct |
10 |
Correct |
1 ms |
2644 KB |
Output is correct |
11 |
Correct |
1 ms |
2644 KB |
Output is correct |
12 |
Correct |
11 ms |
3596 KB |
Output is correct |
13 |
Execution timed out |
1067 ms |
24008 KB |
Time limit exceeded |
14 |
Halted |
0 ms |
0 KB |
- |