| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 823074 | Sohsoh84 | Carnival Tickets (IOI20_tickets) | C++17 | 0 ms | 0 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 <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 10;
int f[MAXN], sz[MAXN], L[MAXN];
int construct(vector<vector<int>> p) {
int n = p.size();
vector<vector<int>> answer;
for (int i = 0; i < n; i++) {
vector<int> row;
row.resize(n, 0);
answer.push_back(row);
}
for (int i = 1; i < n; i++) {
int lst = i;
for (int j = 0; j < i; j++)
if (p[i][j])
if (lst == i) lst = j;
f[i] = i;
f[i] = f[lst];
L[f[i]] = i;
sz[f[i]]++;
if (lst < i) answer[i][lst] = answer[lst][i] = 1;
}
for (int i = 0; i < n; i++)
for (int j = i + 1; j < n; j++)
if (p[i][j] ^ (f[i] == f[j]))
return 0;
for (int i = 0; i < n; i++) {
if (sz[i] == 1 || sz[i] == 2)
return 0;
if (sz[i])
answer[L[i]][i] = answer[i][L[i]] = 1;
}
build(answer);
return 1;
}