제출 #585954

#제출 시각아이디문제언어결과실행 시간메모리
585954serizeConnecting Supertrees (IOI20_supertrees)C++17
11 / 100
219 ms27932 KiB
#include "supertrees.h" #include<bits/stdc++.h> #include <vector> using namespace std; int construct(std::vector<std::vector<int>> p) { int n = p.size(); std::vector<std::vector<int>> answer; int mat[n+1][n+1]; memset(mat,0,sizeof(mat)); for(int i = 0; i < n-1; i++){ mat[i][i+1] = 1; mat[i+1][i] = 1; } for(int i = 0; i < n; i++){ vector <int> asd; for(int j = 0; j < n; j++){ asd.push_back(mat[i][j]); } answer.push_back(asd); } 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...