Submission #305245

#TimeUsernameProblemLanguageResultExecution timeMemory
305245chubyxdxdConnecting Supertrees (IOI20_supertrees)C++17
0 / 100
1 ms384 KiB
#include "supertrees.h" #include <bits/stdc++.h> #include <vector> using namespace std; int construct(vector<vector<int>> p) { int n = p.size(); vector<vector<int>> answer; for(int i=0;i<n;i++){ answer.push_back(vector<int>(n,0)); } for(int i=0;i<n;i++){ for(int j=0;j<n;j++){ if(i==j){answer[i][j]=0;continue;} if(p[i][j]==1)answer[i][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...