Submission #1184994

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

supertrees

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

int construct(vector<vector<int>> p) {
    int n = p.size();
    vector<vector<int>> b(n, vector<int>(n, 0));
    
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            if (p[i][j] != 1 && p[i][j]!=0) return 0;
            if(p[i][j]){
                b[i][j]=b[j][i]=1;
            }
        }
    }

    

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