Submission #696368

#	Time	Username	Problem	Language	Result	Execution time	Memory
696368		T0p_	Connecting Supertrees (IOI20_supertrees)	C++14	Compilation error	0 ms	0 KiB

supertrees

// Subtask 2

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

const int N = 1000;

bool visited[N];

int construct(vector<vector<int>> p)
{
	int n = p.size();
	vector<vector<int>> ans(n, vector<int> (n, 0));
	
	vector<int> connectedList(n);
	for (int i=0 ; i<n ; i++) for (int j=0 ; j<n ; j++) if (p[i][j] == 1) connectedList[i].push_back(j);

	for (int i=0 ; i<n ; i++) for (int j=0 ; j<n ; j++) if (p[i][j] == 1 && connectedList[i] != connectedList[j]) return 0;

	for (int i=0 ; i<n ; i++) if (!visited[i])
	{
		visited[i] = true;

		for (int j=i+1 ; j<n ; j++) if (p[i][j] == 1)
		{
			visited[j] = true;
			ans[i][j] = ans[j][i] = 1;
		}
	}
	

	build(ans);
	return 1;
}

Compilation message (stderr)

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:17:89: error: request for member 'push_back' in 'connectedList.std::vector<int>::operator[](((std::vector<int>::size_type)i))', which is of non-class type '__gnu_cxx::__alloc_traits<std::allocator<int>, int>::value_type' {aka 'int'}
   17 |  for (int i=0 ; i<n ; i++) for (int j=0 ; j<n ; j++) if (p[i][j] == 1) connectedList[i].push_back(j);
      |                                                                                         ^~~~~~~~~