Submission #313237

#TimeUsernameProblemLanguageResultExecution timeMemory
313237DanerZeinConnecting Supertrees (IOI20_supertrees)C++14
11 / 100
274 ms22264 KiB
#include "supertrees.h"
#include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
int construct(std::vector<std::vector<int>> p) {
  vector<vi> bu;
  int n=p.size();
  bu.resize(n);
  for(int i=0;i<n;i++) for(int j=0;j<n;j++) bu[i].push_back(0);
  for(int i=0;i<n-1;i++){
    bu[i][i+1]=bu[i+1][i]=1;
  }
  build(bu);
  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...