Submission #838562

#TimeUsernameProblemLanguageResultExecution timeMemory
838562SoulKnightConnecting Supertrees (IOI20_supertrees)C++17
11 / 100
142 ms23928 KiB
#include "supertrees.h" #include <vector> #include <iostream> using namespace std; #define ll long long #define ln '\n' int rand(int a, int b){return a + rand() % (b-a+1);} const int N = 1000 + 5; 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); } for (int i = 1; i < n; i++){ answer[i][0] = answer[0][i] = 1; } 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...