Submission #420112

#	Time	Username	Problem	Language	Result	Execution time	Memory
420112		Belgutei	Connecting Supertrees (IOI20_supertrees)	C++17	11 / 100	232 ms	23876 KiB

supertrees

#include "supertrees.h"
#include<bits/stdc++.h>

using namespace std;

#define mk make_pair
#define ff first
#define ss second
#define pb push_back


int construct(std::vector<std::vector<int> > p) {
	int n=p.size();
	std::vector<std::vector<int> > answer;
	bool cc=0;
	for(int i=0; i<p.size(); i++){
		for(int j=0; j<p[i].size(); j++){
			if(p[i][j]!=1) cc=1;
		}
	}
	if(cc==0){
		// subtask 1
		answer.resize(n);
		for(int i=0; i<n; i++){
			answer[i].resize(n);
		}
		for(int i=1; i<n; i++){
			answer[i][i-1]=1;
			answer[i-1][i]=1;
		}
		build(answer);
		return 1;
	}
	build(answer);
	return 1;
}

Compilation message (stderr)

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:16:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   16 |  for(int i=0; i<p.size(); i++){
      |               ~^~~~~~~~~
supertrees.cpp:17:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   17 |   for(int j=0; j<p[i].size(); j++){
      |                ~^~~~~~~~~~~~

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