Submission #1312919

#TimeUsernameProblemLanguageResultExecution timeMemory
1312919tuncay_pashaConnecting Supertrees (IOI20_supertrees)C++20
0 / 100
0 ms332 KiB
#include "supertrees.h"
#include <vector>

using namespace std;

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