| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 705854 | Alihan_8 | 슈퍼트리 잇기 (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 "supertrees.h"
// include <ext/pb_ds/assoc_container.hpp>
// include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
using namespace std;
#define all(x) x.begin(), x.end()
#define pb push_back
// define ordered_set tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>
#define mpr make_pair
#define ln '\n'
void IO(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
//#define int long long
// don't forget to call "build" and return (true or false)
int construct(vector <vector<int>> p){
int n = (int)p.size();
vector <vector<int>> ans(n, vector <int> (n));
for ( int i = 0; i < n; i++ ){
for ( int j = 0; j < n; j++ ){
if ( i == j ) continue;
if ( !i or !j ) ans[i][j] = true;
}
}
build(ans);
return true;
}
#if true
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n; cin >> n;
vector <vector<int>> p(n, vector <int> (n));
for ( auto &i: p ){
for ( auto &j: i ) cin >> j;
}
construct(p);
cout << '\n';
/*
4
1 1 2 2
1 1 2 2
2 2 1 2
2 2 2 1
*/
}
#endif