제출 #732735

#제출 시각아이디문제언어결과실행 시간메모리
732735raul2008487Connecting Supertrees (IOI20_supertrees)C++17
11 / 100
207 ms22248 KiB
#include "supertrees.h" #include <vector> int construct(std::vector<std::vector<int>> p) { int n = p.size(); std::vector<std::vector<int>> ans; std::vector<std::vector<bool>> vis; for(int i=0;i<n;i++){ std::vector<int> row; row.resize(n,0); ans.push_back(row); } for (int i = 0; i < n; i++) { for(int j=0;j<n;j++){ if(j==i+1 && p[i][j]){ ans[i][j]=1; } else if(j==i-1 && p[i][j]){ ans[i][j]=1; } else{ ans[i][j]=0; } } } 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...