Submission #1206543

#TimeUsernameProblemLanguageResultExecution timeMemory
1206543edga1Connecting Supertrees (IOI20_supertrees)C++20
0 / 100
0 ms328 KiB
#include <bits/stdc++.h> #include "supertrees.h" using namespace std; typedef long long ll; #define fi first #define se second #define pb push_back #define fastIO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0); #define MOD 1000000007 int construct(vector<vector<int>> p) { int n = p.size(); vector<vector<int>> answer(n,vector<int>(n)); for(int i=0; i<n; i++){ for(int j=0; j<n; j++){ if(p[i][j]==3) return 0; } } vector<int> s(n,0); for(int i=0; i<n; i++){ if(!s[i]){ vector<int> cur; cur.pb(i); s[i]=1; for(int j=0; j<n; j++){ if(p[i][j]>0){ if(s[j]) return 0; s[j]=1; cur.pb(j); } } for(int f1=0; f1<cur.size(); f1++){ for(int f2=f1+1; f2<cur.size(); f2++){ if(p[f1][f2]==0 && f1!=f2) return 0; } } for(int j=0; j<cur.size()-1; j++){ answer[cur[j]][cur[j+1]]=1; answer[cur[j+1]][cur[j]]=1; } } } build(answer); return 1; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...