Submission #456252

#	Time	Username	Problem	Language	Result	Execution time	Memory
456252		BT21tata	Connecting Supertrees (IOI20_supertrees)	C++17	0 / 100	1 ms	204 KiB

supertrees

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

using namespace std;


int construct(vector<vector<int>> p)
{
	int n = p.size(), mx=0;
	bool f=1;
	vector<vector<int>> ans;
	ans.resize(n);
	for (int i = 0; i < n; i++)
	{
		ans[i].resize(n);
	}
	vector<int>v;
	for(int i=0; i<n; i++)
	{
		v.clear(); v.push_back(i);
		for(int j=0; j<n; j++)
		{
			if(p[i][j]==2) v.push_back(j);
		}
		for(int j=0; j<(int)v.size()-1; j++)
				ans[v[j]][v[j+1]]=ans[v[j+1]][v[j]]=1;
		ans[v[0]][v[v.size()-1]]=ans[v[v.size()-1]][v[0]]=1;
	}
	for(int i=0; i<n; i++)
		for(int j=0; j<n; j++)
			if(i!=j and p[i][j]==1) 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:9:20: warning: unused variable 'mx' [-Wunused-variable]
    9 |  int n = p.size(), mx=0;
      |                    ^~
supertrees.cpp:10:7: warning: unused variable 'f' [-Wunused-variable]
   10 |  bool f=1;
      |       ^

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