Submission #1004233

#TimeUsernameProblemLanguageResultExecution timeMemory
1004233spensaConnecting Supertrees (IOI20_supertrees)C++17
0 / 100
0 ms348 KiB
#include "supertrees.h" #include <vector> using namespace std; int construct(std::vector<std::vector<int>> p) { //subtask 1: star graph int n = p.size(); // vector<vector<int>> ans(); vector<vector<int>> ans(n, vector<int> (n)); for(int i=0; i<n; i++){ for(int j=0; j<n; j++){ if(i==j) ans[i][j] = 1; else ans[i][j] = 0; } } for(int i=0; i<n; i++){ ans[i][0] = 1; ans[0][i] = 1; } build(ans); 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...