Submission #304935

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
304935	2020-09-22 08:47:52	myungwoo	Connecting Supertrees (IOI20_supertrees)	C++17	100 / 100	270 ms	22264 KiB

supertrees

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
#include "supertrees.h"
using namespace std;
  
int construct(vector<vector<int>> p)
{
    int N = p.size();
    for (int i=0;i<N;i++) for (int j=0;j<N;j++) if (p[i][j] == 3) return 0;
  
    vector<vector<int>> answer(N, vector<int>(N, 0));
  
    // union-find
    vector<int> line(N, 0), compo(N, 0);
    for (int i=0;i<N;i++) line[i] = compo[i] = i;
    function<int(int, vector<int>&)> find;
    find = [&](int n, vector<int> &par){
        return par[n] == n ? n : par[n] = find(par[n], par);
    };
    auto _union = [&](vector<int> &par, int a, int b){
      par[find(b, par)] = find(a, par);
    };
    for (int i=0;i<N;i++) for (int j=i+1;j<N;j++){
        if (p[i][j]) _union(compo, i, j);
        if (p[i][j] == 1) _union(line, i, j);
    }
    for (int i=0;i<N;i++) find(i, compo), find(i, line);
    auto connect = [&](int a, int b){ answer[a][b] = answer[b][a] = 1; };
    for (int i=0;i<N;i++) if (compo[i] == i){
        vector <int> cycle;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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