제출 #586019

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
586019		serize	슈퍼트리 잇기 (IOI20_supertrees)	C++17	21 / 100	197 ms	26264 KiB

supertrees

#include "supertrees.h"
#include<bits/stdc++.h>
#include <vector>
#include <cassert>
#include <cstdio>
#include <cstdlib>
#include <string>

using namespace std;

const int MAX = 10002;

int link[MAX];

inline int seek(int x){
    if(x == link[x]) return x;
    return link[x] = seek(link[x]);
}

int construct(std::vector<std::vector<int>> p) {
	int n = p.size();
	std::vector<std::vector<int>> answer;
	for(int i = 0; i < n; i++) link[i] = i;
	int f = 0;
	bool flag = 1;
	for(auto i: p){
        int a = seek(f);
        for(int j = 0; j < n; j++){
            if(f!=j and i[j] == 1) flag = 0;
            if(i[j] != 0){
                int b = seek(j);
                link[b] = a;
            }
        }
        f++;
	}
	vector<int> cc[MAX];
	for(int i = 0; i < n; i++){
        cc[ link[i]  ].push_back(i);
	}
	int mat[n+1][n+1];
	memset(mat,0,sizeof(mat));
	for(int i = 0; i < n; i++){
        int sz = (int)(cc[i].size());
        for(int j = 0; j < sz-1; j++){
            mat[ cc[i][j] ][ cc[i][j+1]  ] = 1;
            mat[ cc[i][j+1] ][ cc[i][j]  ] = 1;
        }
        if(flag and sz > 1){
            mat[ cc[i][0]  ][  cc[i][ sz-1 ] ] = 1;
            mat[ cc[i][ sz-1 ]  ][ cc[i][0]  ] = 1;
        }
	}
 	for(int i = 0; i < n; i++){
        vector<int> asd;
        for(int j = 0; j < n; j++){
            asd.push_back(mat[i][j]);
        }
        answer.push_back(asd);
	}
    bool ok = 1;
    f = 0;
    for(auto i: p){
        for(int j = 0; j < n; j++){
             if(i[j] == 0 and link[f] == link[j]){
                ok = 0;
                break;
             }
        }
        f++;
        if(!ok) break;
	}
	if(ok){
        build(answer);
        return 1;
	}
	else return 0;

}

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