Submission #1198858

#TimeUsernameProblemLanguageResultExecution timeMemory
1198858ElayV13Connecting Supertrees (IOI20_supertrees)C++20
11 / 100
110 ms22132 KiB
#include "supertrees.h" #include <bits/stdc++.h> using namespace std; int construct(vector < vector < int > > p) { int n = p.size(); vector < vector < int > > b(n , vector < int > (n , 0)); for(int i = 0;i < n;i++) { for(int j = 0;j < n;j++) { if(i == j) continue; if(i == 0 or j == 0) b[i][j] = 1; } } build(b); 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...