Submission #1084187

#	Time	Username	Problem	Language	Result	Execution time	Memory
1084187		nickolasarapidis	Connecting Supertrees (IOI20_supertrees)	C++17	11 / 100	123 ms	23948 KiB

supertrees

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

int construct(vector<vector<int>> p){
	int N = p.size();

	vector<vector<int>> b(N, vector<int>(N, 0));

	for(int i = 0; i < N; i++){
		if(i == N - 1) continue;
		if(p[i][i + 1] == 1){
			b[i][i + 1] = 1;
			b[i + 1][i] = 1;
		}
		else{
			for(int j = 0; j < N; j++){
				if(p[i + 1][j] == p[i][j] == 1) return 0;
			}
		}
	}

	build(b);

	return 1;
}

Compilation message (stderr)

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:18:20: warning: suggest parentheses around comparison in operand of '==' [-Wparentheses]
   18 |     if(p[i + 1][j] == p[i][j] == 1) return 0;

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