제출 #902835

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
902835		ByeWorld	Connecting Supertrees (IOI20_supertrees)	C++14	0 / 100	1 ms	348 KiB

supertrees

#include "supertrees.h"
#include <bits/stdc++.h>
#define ll long long
#define fi first
#define se second
#define pb push_back
#define lb lower_bound
using namespace std;
const int MAXN = 1e3+10;
const double SMALL = 1e-6;
typedef pair<int,int> pii;
typedef pair<pii,int> ipii;

int n;
bool tag[MAXN];
vector <vector<int>> adj;

void bd(int x, int y){
	adj[x][y] = 1; adj[y][x] = 1;
}

int construct(vector<vector<int>> p) {
	n = p.size();
	vector <int> te(n);
	for(int i=0; i<n; i++) adj.pb(te);

	for(int i = 0; i < n; i++) {
		for(int j=i+1; j < n; j++){
			vector <int> vec; vec.pb(i); 
			tag[i] = 1;
			if(p[i][j] == 1){
				vec.pb(j); tag[j] = 1;
			}
			
			for(auto in : vec){
				for(int x=0; x<n; x++){
					if(tag[x] && p[in][x] != 1) return 0; //harusnya 1
					if(!tag[x] && p[in][x] == 1) return 0;
				}
			}
			for(auto x : vec){ // build
				for(auto y : vec){
					if(x==y) continue;
					bd(x, y);
				}
			}
		}
	}

	for(int i=0; i<n; i++) adj[i][i] = 0;
	build(adj);
	return 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