# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
433560 | SAAD | Connecting Supertrees (IOI20_supertrees) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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 < a.size(); i++) {
for (int j = 0; j < a.size(); j++) {
if (abs(i - j) == 1)
a[i][j] = 1;
else a[i][j] = 0;
}
}
return build(a);
}