Submission #421179

#TimeUsernameProblemLanguageResultExecution timeMemory
421179ApiramConnecting Supertrees (IOI20_supertrees)C++14
0 / 100
1 ms204 KiB
#include "supertrees.h" #include<bits/stdc++.h> using namespace std; int construct(vector<std::vector<int>> p) { int n = p.size(); for (int i =0;i<n;++i){ p[i][i]=0; } vector<vector<int>>answer(n,vector<int>(n,0)); for (int i =0;i<n;++i){ for (int j =0;j<n;++j){ if (p[i][j]>0){ answer[i][j]=1; p[i][j]--; } } } for (int i =0;i<n;++i){ for (int j =0;j<n;++j)cout<<answer[i][j]<<" "; cout<<endl; } 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...