제출 #424496

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
424496		MrFrancho	슈퍼트리 잇기 (IOI20_supertrees)	C++14	0 / 100	1080 ms	10160 KiB

supertrees

#include "supertrees.h"
#include <bits/stdc++.h>
using namespace std;

const int MAXN = 1000;

vector<vector<int>> connectedGroups;
bool vis[MAXN]{};
int N;

void DFS(int node, int cur, vector<vector<int>> &p) {
    connectedGroups[cur].push_back(node);
    vis[node] = true;

    for(int i = 0; i < N; i++) {
        if(i != node && p[node][i] == 1 && !vis[i])
            DFS(i,cur,p);
    }
}

int construct(vector<vector<int>> p) {
    N = p.size();
    vector<vector<int>> answer(N);

    for(int i = 0; i < N; i++) {
        for(int j = 0; j < N; j++) {
            answer[i].push_back(0);
            for(int k = 0; k < N; k++) {
                if (i != j && j != k && k != i &&
                    p[i][k] == 1 && p[j][k] == 1 && p[i][j] != 1)
                    return 0;
            }
        }
    }

    int c = 0;
    for (int i = 0; i < N; i++) {
        if(!vis[i]) {
            vector<int> emp;
            connectedGroups.push_back(emp);
            DFS(i,c,p);
            c++;
        }
    }

    /*for(int i = 0; i < connectedGroups.size(); i++) {
        cout << i << ":\n";
        for(auto x: connectedGroups[i])
            cout << x << endl;
    }*/

    for(auto v : connectedGroups) {
        for(int i = 1; i < (int)v.size(); i++) {
            answer[v[0]][v[i]] = answer[v[i]][v[0]] = 1;
        }
    }

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