Submission #1078696

#TimeUsernameProblemLanguageResultExecution timeMemory
1078696Faisal_Saqib슈퍼트리 잇기 (IOI20_supertrees)C++17
0 / 100
1 ms604 KiB
#include "supertrees.h" #include <bits/stdc++.h> using namespace std; int construct(std::vector<std::vector<int>> p) { int n = p.size(); vector<vector<int>> tree_case(n,vector<int>(n,1)); if(p==tree_case) { tree_case[0][0]=0; for(int i=1;i<n;i++) for(int j=0;j<n;j++) tree_case[i][j]=0; build(tree_case); return 1; } else { // Forest case } 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...