Submission #812380

#	Time	Username	Problem	Language	Result	Execution time	Memory
812380		KemalK	Connecting Supertrees (IOI20_supertrees)	C++17	11 / 100	178 ms	23920 KiB

supertrees

#include "supertrees.h"
#include <vector>
#include <bits/stdc++.h>
using namespace std;

int construct(std::vector<std::vector<int>> p) {
	int n = p.size();
	
	bool sub_task_1 = true;
	bool sub_task_2 = true;
	for (int i = 0; i < n; i++){
		for (int j = 0; j < n; j++){
			if (p[i][j] != 1){
				sub_task_1 = false;
			}
			if (p[i][j] != 2 and p[i][j] != 3){
				sub_task_2 = false;
			}
		}
	}
	std::vector<std::vector<int>> answer;
	for (int i = 0; i < n; i++) {
		std::vector<int> row;
		row.resize(n);
		answer.push_back(row);
	}
	if (n == 1){
		//nothing to change
	}	
	else if (sub_task_1){ // p[i][j] = 1
		for (int i = 0; i < n - 1; i++){
			answer[i][i + 1] = 1;
			answer[i + 1][i] = 1;
		}
	}
	else if(sub_task_2) {	// p[i][j] = 1 or p[i][j] = 0
		for (int i = 0; i < n; i++){
			for (int j = 0; j < n; j++){
				if (i != j and p[i][j]){
					answer[i][j] = 1;
				}
			}
		}
	}
	build(answer);
	return 1;
}

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