| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 499732 | martarel | 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>
#include<algorithm>
#include <math.h>
#include <iostream>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pi;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<ll> vl;
const ll maxn = 2e5 + 100;
const ll INF = 1e9;
#define fast_io ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define pb push_back
#define pii pair<ll, pair<int, int>>
#define mp make_pair
#define f first
#define s second
#define all(x) (x).begin(), (x).end()
#define FOR(n) for(int i = 0; i < n; i++)
void build(int b[1005][1005]){
}
int construct(int p[1005][1005]) {
int ans[1005][1005];
//Case 1
for (int i = 1; i < 1005; i++){
ans[0][i] = 1;
ans[0][i] = 1;
}
build(ans);
return 1;
}