Submission #456197

#	Time	Username	Problem	Language	Result	Execution time	Memory
456197		osmanallazov	Connecting Supertrees (IOI20_supertrees)	C++14	21 / 100	390 ms	22176 KiB

supertrees

#include "supertrees.h"
#include<bits/stdc++.h>
#include <vector>
using namespace std;
bool used[1001];
int construct(vector<vector<int>> p)
{
    vector<int>v;
	int n=p.size();
	int b=1;
	vector<vector<int>>answer;
	answer.resize(n);
	for (int i=0;i<n;i++)
	{
		answer[i].resize(n);
	}
	for(int i=0;i<n;i++){
		if(used[i]==false)
		{
			v.clear();
			for(int j=0;j<n;j++)
				if(p[i][j])
				{
					if(p[i]==p[j]){
                    v.push_back(j);
					}
					else{
                            b=0;
					}
				}
			for(int j=0;j<v.size()-1;j++)
				answer[v[j]][v[j+1]]=answer[v[j+1]][v[j]]=1;
		}
	}
	if(b==0){
    return 0;
	}
	build(answer);
	return 1;
}

Compilation message (stderr)

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

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