Submission #320241

#	Time	Username	Problem	Language	Result	Execution time	Memory
320241		blue	Connecting Supertrees (IOI20_supertrees)	C++17	0 / 100	1 ms	896 KiB

supertrees

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

int construct(vector< vector<int> > p)
{
    int n = p.size();
    vector< vector<int> > b(n);
    for(int i = 0; i < n; i++) b[i] = vector<int>(n, 0);

    vector<int> group(n, -1);
    set<int> grouplist;
    for(int i = 0; i < n; i++)
    {
        group[i] = i;
        grouplist.clear();
        for(int j = 0; j < i; j++) if(p[i][j]) grouplist.insert(group[j]);
        for(int j = 0; j < i; j++) if(grouplist.find(group[j]) != grouplist.end()) group[j] = i;
    }
    for(int i = 0; i < n; i++)
    {
        for(int j = 0; j < n; j++)
        {
            if(group[i] == group[j] && p[i][j] == 0) return 0;
            if(group[i] != group[j] && p[i][j] == 1) return 0;
        }
    }

    for(int i = 0; i < n; i++)
    {
        for(int j = 0; j < i; j++)
        {
            if(p[i][j])
            {
                b[i][j] = 1;
                break;
            }
        }
    }
    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