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;
typedef long long ll;
typedef pair<int,int> p32;
typedef pair<ll,ll> p64;
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define vi vector<int>
#define vp32 vector<p32>
#define fast_cin() ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define MOD %1000000007
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template <class T>
using Tree =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
//never guess
//never debug without reviewing code
//never try adding ones or substracting them
//only step by step debug when necessay
int construct(std::vector<std::vector<int>> p) {
int n = p.size();
vector<vi> res(n,vi(n));
int leader[n]; for(int i = 0; i<n; i++) leader[i] = i;
bool done[n]; memset(done,0,sizeof done);
for(int i = 0; i<n; i++){
for(int j = 0; j<n; j++){
if(p[i][j]==3) return 0;
}
}
for(int i = 0; i<n; i++){
if(done[i])continue;
done[i] = true;
set<int> zeros, ones, twos;
for(int j = 0; j<n; j++){
if(p[i][j]==0) zeros.insert(j);
else if(p[i][j]==1){
ones.insert(j);
done[j] = true;
}
else twos.insert(j);
}
for(int x : ones){
for(int j = 0; j<n; j++)
if((p[x][j]==0&&!zeros.count(j))||(p[x][j]==1&&!ones.count(j))||(p[x][j]==2&&!twos.count(j))) return 0;
}
vi comp(ones.begin(),ones.end());
for(int j = 0; j<comp.size()-1; j++){
int a = comp[j], b = comp[j+1];
res[a][b] = res[b][a] = 1;
leader[b] = i;
}
}
memset(done,0,sizeof done);
for(int ii = 0; ii<n; ii++){
int i = leader[ii];
if(done[i]) continue;
done[i] = true;
set<int> t = {i};
for(int k = 0; k<n; k++){
int j = leader[k];
if(p[i][j]==2){ t.insert(j); done[j] = true;}
}
if(t.size()==2) return 0;
if(t.size()<=1) continue;
for(int x : t){
for(int k = 0; k<n; k++){
int j = leader[k];
if((p[x][j]==2&&!t.count(j))||(p[x][j]==0&&t.count(j))) return 0;
}
}
vi comp(t.begin(),t.end());
for(int j = 0; j<comp.size()-1; j++){
int a = comp[j], b = comp[j+1];
res[a][b] = res[b][a] = 1;
}
int a = comp[0], b = comp[comp.size()-1];
res[a][b] = res[b][a] = 1;
}
build(res);
return 1;
}
Compilation message (stderr)
supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:55:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
55 | for(int j = 0; j<comp.size()-1; j++){
| ~^~~~~~~~~~~~~~
supertrees.cpp:80:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
80 | for(int j = 0; j<comp.size()-1; j++){
| ~^~~~~~~~~~~~~~
# | 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... |