Submission #431164

#TimeUsernameProblemLanguageResultExecution timeMemory
431164MOUF_MAHMALATConnecting Supertrees (IOI20_supertrees)C++14
0 / 100
2 ms332 KiB
#include "supertrees.h" #include<bits/stdc++.h> using namespace std; typedef int ll; vector<vector<ll> >v; ll n; int construct(vector<vector<int> > p) { n=p.size(); v.resize(n); for(ll i=0; i<n; i++) { v[i].resize(n); if(i<n-1) v[i][i+1]=v[i+1][i]=1; } build(v); 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...