Submission #1048612

#TimeUsernameProblemLanguageResultExecution timeMemory
1048612IUA_HasinConnecting Supertrees (IOI20_supertrees)C++17
11 / 100
103 ms24148 KiB
#include "supertrees.h" #include <bits/stdc++.h> #define ll long long using namespace std; int construct(std::vector<std::vector<int>> p) { int n = p.size(); if(n==1){ vector<vector<int>> answer; answer.push_back({0}); build(answer); return 1; } std::vector<std::vector<int>> answer; for (int i = 0; i < n; i++) { vector<int> row; if(i==0){ for(int j=0; j<n; j++){ if(j==1){ row.push_back(1); } else { row.push_back(0); } } } else if(i!=n-1){ for(int j=0; j<n; j++){ if(j==i-1 || j==i+1){ row.push_back(1); } else { row.push_back(0); } } } else { for(int j=0; j<n; j++){ if(j==n-2){ row.push_back(1); } else { row.push_back(0); } } } answer.push_back(row); } build(answer); return 1; } // 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); // 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...