Submission #497122

#	Time	Username	Problem	Language	Result	Execution time	Memory
497122		Hanksburger	슈퍼트리 잇기 (IOI20_supertrees)	C++17	11 / 100	182 ms	23928 KiB

supertrees

#include "supertrees.h"
#include <bits/stdc++.h>
using namespace std;
int construct(vector<vector<int> > P)
{
	int N=P.size();
	bool subtask1=1, subtask2=1;
	for (int i=0; i<N; i++)
	{
		for (int j=0; j<N; j++)
		{
			if (P[i][j]==0 || P[i][j]==2 || P[i][j]==3)
				subtask1=0;
			if (P[i][j]==2 || P[i][j]==3)
				subtask2=0;
		}
	}
	vector<vector<int> > ans;
	vector<int> tmp;
	if (subtask1)
	{
		tmp.push_back(0);
		for (int i=1; i<N; i++)
			tmp.push_back(1);
		ans.push_back(tmp);
		for (int i=1; i<N; i++)
		{
			tmp.clear();
			tmp.push_back(1);
			for (int j=1; j<N; j++)
				tmp.push_back(0);
			ans.push_back(tmp);
		}
		build(ans);
		return 1;
	}
	else
	{
		
	}
}

Compilation message (stderr)

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:7:19: warning: variable 'subtask2' set but not used [-Wunused-but-set-variable]
    7 |  bool subtask1=1, subtask2=1;
      |                   ^~~~~~~~
supertrees.cpp:18:23: warning: control reaches end of non-void function [-Wreturn-type]
   18 |  vector<vector<int> > ans;
      |                       ^~~

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