Submission #1136561

#	Time	Username	Problem	Language	Result	Execution time	Memory
1136561		bestbest	슈퍼트리 잇기 (IOI20_supertrees)	C++20	0 / 100	0 ms	324 KiB

supertrees

#include "supertrees.h"
#include <bits/stdc++.h>
using namespace std;
#define  en '\n'
#define  sp ' '
const int N=1000;

int par[N],chk[N][N],vis[N],branch[N];
map<int,vector<int>> m;


int find(int a){
	if(a!=par[a])return par[a]=find(par[a]);
	return par[a];
}

int construct(vector<vector<int>> p) {


	int n = p.size();
	vector<vector<int>> ans,comp;
    vector<int> v;
    for(int i=0;i<n;i++){
        v.clear();
        for(int j=0;j<n;j++){
            v.push_back(i==((j+1)%n));
            //cout << v.back() << sp;
        }
        //cout << en;
    }

	build(ans);
	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