Submission #732694

#TimeUsernameProblemLanguageResultExecution timeMemory
732694raul2008487Connecting Supertrees (IOI20_supertrees)C++17
0 / 100
1 ms288 KiB
#include "supertrees.h" #include <vector> int construct(std::vector<std::vector<int>> p) { int n = p.size(); std::vector<std::vector<int>> answer; for (int i = 0; i < n; i++) { std::vector<int> row; row.resize(n); for(int j=0;j<n;j++){ if(j==i+1){ row[j]=1; } else{ row[j]=0; } } answer.push_back(row); } 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...