Submission #1004328

#	Time	Username	Problem	Language	Result	Execution time	Memory
1004328		spensa	슈퍼트리 잇기 (IOI20_supertrees)	C++14	11 / 100	110 ms	24144 KiB

supertrees

#include "supertrees.h"
#include <iostream>
#include <vector>
#include <map>
using namespace std;

int construct(std::vector<std::vector<int>> p) {
    //subtask 2: star graph, but as connected components
	int n = p.size();
    vector<vector<int>> ans(n, vector<int> (n));  

    for(int i=0; i<n; i++){
        for(int j=0; j<n; j++){
            ans[i][j] = 0;
        }
    }

    map<int, vector<int>> cc;
    vector<int> flags;
    flags.push_back(0);
    for(int i=1; i<n; i++){
        int tmp = 0;
        for(int j: flags){
            if(p[i][j]==0) continue;
            ans[i][j] = 1;
            ans[j][i] = 1;
            cc[j].push_back(i);
            tmp++;
            // break;
        }
        if(tmp>=2) return 0;
        if(tmp==0){
            flags.push_back(i);
            cc[i].push_back(i);
        }
    }

    for(auto i: cc){
        // cout<<"i.first="<<i.first<<"\n";
        for(int j: i.second){
            for(int k: i.second){
                // cout<<"ABORT";
                if(p[j][k]==0){
                    // cout<<"j="<<j<<" k="<<k<<"\n";
                    // cout<<"NOPE\n";
                    return 0;
                }
            }
        }
    }

    build(ans);
	return 1;
}

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