Submission #433561

#TimeUsernameProblemLanguageResultExecution timeMemory
433561SAADConnecting Supertrees (IOI20_supertrees)C++17
11 / 100
223 ms23932 KiB
#include <iostream> #include <math.h> #include <algorithm> #include <vector> #include "supertrees.h" using namespace std; int construct( vector<vector<int>> p) { vector<vector<int>> a = p; for (int i = 0; i < (int)a.size(); i++) { for (int j = 0; j < (int)a.size(); j++) { if (abs(i - j) == 1) a[i][j] = 1; else a[i][j] = 0; } } build(a); 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...