제출 #300580

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
300580		Dilshod_Imomov	슈퍼트리 잇기 (IOI20_supertrees)	C++17	0 / 100	1059 ms	33792 KiB

supertrees

#include "supertrees.h"
#include <bits/stdc++.h>
using namespace std;
const int N = 1e3 + 7;
int nn, comp, used[N], cc[N], cmp[N], ok;
vector < int > adj[N];

void dfs( int v, int rt, vector < vector < int > > p ) {
    used[v] = 1;
    if ( !p[rt][v] ) {
        ok = 0;
        return;
    }
    for ( auto u: adj[v] ) {
        if ( !used[u] ) {
            dfs( u, rt, p );
            if ( !ok ) {
                return;
            }
        }
    }
}

int construct(std::vector<std::vector<int>> p) {
	nn = p.size();
	std::vector<std::vector<int>> answer;
	for (int i = 0; i < nn; i++) {
		std::vector<int> row;
		row.resize(nn);
		answer.push_back(row);
	}
	for ( int i = 0; i < nn; i++ ) {
        if ( !cc[i] ) {
            cc[i] = ++comp;
        }
        cmp[ cc[i] ] = i;
        for ( int j = 0; j < nn; j++ ) {
            if ( p[i][j] && i != j ) {
                if ( cc[j] && cc[j] != cc[i] ) {
                    return 0;
                }
                if(  cc[j] ) {
                    continue;
                }
                cc[j] = cc[i];
                answer[ cmp[ cc[i] ] ][j] = 1;
                answer[ j ][ cmp[ cc[i] ] ] = 1;
                cmp[ cc[i] ] = j;
            }
        }
	}
	for ( int i = 0; i < nn; i++ ) {
        for ( int j = 0; j < nn; j++ ) {
            if ( answer[i][j] ) {
                adj[i].push_back(j);
            }
        }
	}
	for ( int i = 0; i < nn; i++ ) {
        for ( int j = 0; j < nn; j++ ) {
            used[j] = 0;
        }
        ok = 1;
        dfs(i, i, p);
        if ( !ok ) {
            return 0;
        }
	}
	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