제출 #1198555

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1198555		tkm_algorithms	Connecting Supertrees (IOI20_supertrees)	C++20	0 / 100	0 ms	328 KiB

supertrees

/**
*    In the name of Allah
*    We are nothing and you're everything
**/
#include <bits/stdc++.h>
#include "supertrees.h"
using namespace std;
using ll = long long;

#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()

const char nl = '\n';
const int N = 1e5+10;

int construct(std::vector<std::vector<int>> p) {
	int n = p.size();
	vector<vector<int>> ans(n, vector<int> (n));
	for (int i = 0; i < n; i++) {
		if (i+1 < n) {
			ans[i][i+1] = ans[i+1][i] = 1;
			continue;
		}
		ans[i][0] = ans[0][i] = 1;
	}
	build(ans);
	return 1;
}


//void solve() {
	//init(2, {1, 0, 1});
	//cout << compare_plants(1, 2);
//}

//int32_t main() {
    //ios::sync_with_stdio(0);
    //cin.tie(0);
    //solve();
    //return 0;
//}

• Subtask 1: 0 / 11
• Subtask 2: 0 / 10
• Subtask 3: 0 / 19
• Subtask 4: 0 / 35
• Subtask 5: 0 / 21
• Subtask 6: 0 / 4