# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
303859 | kjain_1810 | Connecting Supertrees (IOI20_supertrees) | 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 <vector>
const int N = 1005;
using namespace std;
int taken[N], compcnt;
vector<int>comp[N];
bool checkValid(vector<vector<int>>p)
{
for(int a = 0; a < compcnt; a++)
for(int b = 0; b < comp[a].size(); b++)
for(int c = 0; c < comp[a].size(); c++)
if(!p[comp[a][b]][comp[a][c]] || p[a][b] == 3)
return false;
for(int a = 0; a < n; a++)
for(int b = 0; b < n; b++)
if(p[a][b] && taken[a] != taken[b])
return false;
return true;
}
int gettype(vector<int>component, vector<vector<int>>p)
{
int mini = 3;
int maxi = 0;
for(auto a:component)
for(auto b:component)
{
mini=min(mini, p[a][b]);
maxi=max(maxi, p[a][b]);
}
if(mini == maxi)
{
if(mini == 1)
return 0;
else
return 1;
}
return 2;
}
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);
answer.push_back(row);
}
for(int a = 0; a < n; a++){
if(taken[a])
continue;
for(int b = 0; b < n; b++) {
if(p[a][b])
{
comp[compcnt].pb(b);
taken[b] = compcnt;
}
compcnt++;
}
if(!checkValid(p))
return 0;
for(auto component:comp)
{
int x = gettype(component, p);
if(x == 1)
{
for(int a = 1; a < component.size(); a++)
answer[component[a]][component[a - 1]] = answer[component[a - 1][component[a]]] = 1;
}
else if(x == 2)
{
for(int a = 1; a < component.size(); a++)
answer[component[a]][component[a - 1]] = answer[component[a - 1][component[a]]] = 1;
answer[component[component.size() - 1]][0] = answer[component[0]][component[component.size() - 1]] = 1;
}
else
{
}
}
build(answer);
return 1;
}