# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
526733 | Olympia | 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 <cmath>
#include <cassert>
#include <iostream>
#include <set>
#include <climits>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <type_traits>
#include <string>
#include <queue>
#include <map>
#include "supertrees.h"
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("Ofast")
#pragma GCC optimization ("unroll-loops")
using namespace std;
void construct (vector<vector<int>> grid) {
vector<vector<int>> ans(grid.size());
for (int i = 0; i < grid.size(); i++) {
grid[i].assign(grid[0].size(), 0);
}
set<int> s;
for (int i = 0; i < grid.size(); i++) {
for (int j = 0; j < grid.size(); j++) {
s.insert(grid[i][j]);
}
}
if (s.count(1)) {
for (int i = 1; i < grid.size(); i++) {
grid[i][0] = grid[0][i] = 1;
}
}
build(grid);
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
}