제출 #422478

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
422478		Apiram	Connecting Supertrees (IOI20_supertrees)	C++14	11 / 100	540 ms	29804 KiB

supertrees

#include "supertrees.h"
#include<bits/stdc++.h>
using namespace std;
void markall(int i ,int j ,vector<int>&f,vector<int>&b,vector<vector<int>>&p,vector<vector<int>>&answer){
int k = b[i];
while(k!=-1){
int u = j;	
while(u!=-1){
if (!answer[k][u]){
p[k][u]--;
p[u][k]--;
answer[k][u]++;
answer[u][k]++;}
u=f[u];}
k=b[k];
}
}
bool check(vector<int>f,vector<int>b,int i ,int j,vector<vector<int>>p){
int k = b[i];
while(k!=-1){
int u = j;	
while(u!=-1){
if (p[k][u]<=0)return false;
u=f[u];}
k=b[k];
}
return true;
}
int construct(vector<std::vector<int>> p) {
	int n = p.size();
	vector<vector<int>>answer(n,vector<int>(n,0));
	vector<pair<int,int>>ans;
	/*
	 1 1 0 0 - 0 - 1
	 1 1 1 0  0 - 1 -  2
	 1 0 1 1  2 - 3
	 1 0 1 0
	 //0 - 1 - 2 - 3 - 4
	 */
	 for (int i =0;i<n;++i){
	 	for (int j=i+1;j<n;++j){
	 	
	 	if(p[i][j] == 0)
			{
				for(int h = 0; h < n; h++)
				{
					if(p[i][h] == 1 && p[j][h] == 1)return 0;
				}
			}
	 	}
	 }
	 for (int i =0;i<n;++i){
	 	for (int j =0;j<n;++j){
	 	if (p[i][j]==1){
	 	if (j==i+1||j==i-1)answer[i][j]=1;}
	 	else  ans.push_back({i,j});
	 	}
	 	} 
	
	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