Submission #309450

#TimeUsernameProblemLanguageResultExecution timeMemory
309450jam_xd_Connecting Supertrees (IOI20_supertrees)C++17
11 / 100
246 ms22136 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; for(int j=0;j<n;j++){ if(i == 0 and j != 0) row.push_back(1); else if(i != 0 and j == 0) row.push_back(1); else if(i == 0 and j == 0) row.push_back(0); } row.resize(n); 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...