# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
935263 | wood | 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 <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> p32;
typedef pair<ll,ll> p64;
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define fast_cin() ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define MOD %1000000007
void build(vector<vector<int>> b);
int construct(vector<vector<int>> p){
int n = p.size();
vector<vector<int>> res;
res.resize(n);
for (size_t i = 0; i < n; i++)
{
res[i].resize(n);
}
for (size_t i = 1; i < n; i++)
{
res[0][i] = 1;
res[i][0] = 1;
}
for (size_t i = 0; i < n-1; i++)
{
for (size_t j = 0; j < n-1; j++)
{
res[i+1][j+1] = 0;
}
}
return 1;
build(res);
}
#ifndef ONLINE_JUDGE
int main()
{
fast_cin();
return 0;
}
#endif