Submission #447346

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