제출 #300233

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
300233		daniel920712	슈퍼트리 잇기 (IOI20_supertrees)	C++14	11 / 100	249 ms	22268 KiB

supertrees

#include "supertrees.h"
#include <vector>
#include <stdio.h>
using namespace std;
vector < int > how[1005];
int Father[1005];
int Find(int here)
{
    if(Father[here]==here) return here;
    Father[here]=Find(Father[here]);
    return Father[here];
}
int construct(vector < vector< int > > p)
{
	int n=p.size(),i,j,m;
	vector< vector<int> > answer;
	vector< int > row;
	//printf("%d\n",n);
	for(i=0;i<n;i++) row.push_back(0);
	for(i=0;i<n;i++)
    {
        answer.push_back(row);
        Father[i]=i;
    }
    //printf("%d\n",n);
	for(i=0;i<n;i++)
    {
        for(j=0;j<n;j++)
        {
            //printf("%d %d\n",i,j);
            if(p[i][j]==0&&Find(i)==Find(j)) return 0;
            Father[Find(i)]=Find(j);
        }
    }
    //printf("%d\n",n);
    for(i=0;i<n;i++)
    {
        how[Find(i)].push_back(i);
        //printf("%d %d\n",i,Find(i));
    }
    for(i=0;i<n;i++)
    {
        m=how[i].size();
        if(m<=1) continue;
        for(j=1;j<m;j++)
        {
            answer[how[i][j-1]][how[i][j]]=1;
            answer[how[i][j]][how[i][j-1]]=1;
        }
        if(p[how[i][0]][how[i][1]]==2)
        {
            if(m==2) return 0;
            answer[how[i][m-1]][how[i][j]]=1;
            answer[how[i][j]][how[i][m-1]]=1;
        }
    }


	build(answer);
	return 1;
}

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