Submission #572163

#	Time	Username	Problem	Language	Result	Execution time	Memory
572163		fuad27	슈퍼트리 잇기 (IOI20_supertrees)	C++17	46 / 100	215 ms	22036 KiB

supertrees

#include "supertrees.h"
#include <vector>
#include<bits/stdc++.h>
using namespace std;
int construct(std::vector<std::vector<int>> p) {
	int n = p.size();
	for(int i = 0;i<n;i++) {
		for(int j = 0;j<n;j++) {
			if(p[i][j] == 3 or p[i][j]!=p[j][i])return 0;
		}
	}
	vector<vector<int>> ans(n,vector<int> (n,0));
	{
		vector<bool> vis(n);
		vector<int> t;
		for(int i = 0;i<n;i++) {
			if(vis[i])continue;
			vector<int> cur;
			for(int j = 0;j<n;j++) {
				if(p[i][j] == 1) {
					cur.push_back(j);
					vis[j]=1;
				}
			}
			for(int j = 0;j<(int)cur.size()-1;j++) {
				ans[cur[j]][cur[j+1]]=1;
				ans[cur[j+1]][cur[j]]=1;
			}
			t.push_back(i);
		}
		for(int i = 0;i<n;i++)vis[i]=0;
		vector<pair<int,int>> cur;
		vector<int> beg;
		for(int j:t) {
			bool flag = 0;
			for(pair<int,int> &i:cur) {
				if(p[j][i.first] == 2) {
					ans[i.first][j] = ans[j][i.first] = 1;
					i.first=j;
					i.second++;
					flag=1;
					break;
				}
			}
			if(!flag){
				cur.push_back(make_pair(j,1));
				beg.push_back(j);
			}
		}
		for(int i = 0;i<cur.size();i++) {
			if(cur[i].first!=beg[i] and p[cur[i].first][beg[i]] == 1)return 0;
			if(cur[i].first!=beg[i]) {
				ans[cur[i].first][beg[i]] = ans[beg[i]][cur[i].first] = 1;
			}
			else if(cur[i].second == 2)return 0;
		}
	}
	build(ans);
	return 1;
}

Compilation message (stderr)

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

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