Submission #309399

#TimeUsernameProblemLanguageResultExecution timeMemory
309399pere_gilConnecting Supertrees (IOI20_supertrees)C++14
11 / 100
284 ms22356 KiB
#include "supertrees.h"
#include "bits/stdc++.h"

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;
    for(int j=0;j<n;j++){
        if(i==0 and j!=0) row.push_back(1);
        else if(i!=0 and j==0) row.push_back(1);
        else row.push_back(0);
    }
    row.resize(n);
    answer.push_back(row);
  }
  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...