Submission #880424

#TimeUsernameProblemLanguageResultExecution timeMemory
880424AkibAzmainConnecting Supertrees (IOI20_supertrees)C++17
11 / 100
173 ms24060 KiB
#include <bits/stdc++.h>
using namespace std;
#include "supertrees.h"
#include <vector>

int construct(std::vector<std::vector<int>> p) {
  int n = p.size();
  std::vector<std::vector<int>> ans (n, vector < int > (n));
  for (int i = 0; i < n - 1; ++i) ans[i][i + 1] = ans[i + 1][i] = true;
  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...