Submission #330585

#	Time	Username	Problem	Language	Result	Execution time	Memory
330585		MilosMilutinovic	슈퍼트리 잇기 (IOI20_supertrees)	C++14	0 / 100	1 ms	512 KiB

supertrees

#include "supertrees.h"
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
int construct(vector<vector<int>> a){
    int n=(int)a[0].size();
    for(int i=0;i<n;i++)for(int j=0;j<n;j++)if(a[i][j]==3)return 0;
    vector<int> E[n];
    for(int i=0;i<n;i++){
        for(int j=0;j<n;j++){
            if(a[i][j]==1)E[i].pb(j),E[j].pb(i);
        }
    }
    vector<vector<int>> ans(n,vector<int>(n,0));
    for(int i=0;i<n;i++){
        for(int c:E[i])ans[i][c]=1;
    }
    build(ans);
    return 1;
}
/*int main(){
    int n;
    scanf("%i",&n);
    vector<vector<int>> a(n,vector<int>(n));
    for(int i=0;i<n;i++)for(int j=0;j<n;j++)scanf("%i",&a[i][j]);
    int ans=construct(a);
    return 0;
}*/

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