Submission #1293739

#	Time	Username	Problem	Language	Result	Execution time	Memory
1293739		AbdullahIshfaq	Connecting Supertrees (IOI20_supertrees)	C++20	100 / 100	113 ms	22164 KiB

supertrees

#include "supertrees.h"
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define MOD 998244353
using namespace std;
int construct(vector<vector<int>> p)
{
    int n = p.size();
    vector<vector<int>> ans(n, vector<int>(n, 0));
    for (int i = 0; i < n; i++)
        for (int j = 0; j < n; j++)
            if (p[i][j] == 3)
                return 0;
    vector<int> rt(n, 0);
    for (int i = 0; i < n; i++)
    {
        int la = 0;
        for (; p[i][la] != 1; la++)
            ;
        if (la != i)
        {
            if (p[la] != p[i])
                return 0;
            ans[la][i] = 1;
            ans[i][la] = 1;
        }
        else
            rt[i] = 1;
    }
    for (int i = 0; i < n; i++)
        if (rt[i])
        {
            int cc = 0;
            for (; p[i][cc] == 0; cc++)
                ;
            for (int j = 0; j < n; j++)
                if ((p[cc][j] == 0) ^ (p[i][j] == 0))
                    return 0;
            if (cc == i)
            {
                int la = i;
                for (int j = i + 1; j < n; j++)
                    if (rt[j] && p[i][j])
                    {
                        ans[la][j] = 1;
                        ans[j][la] = 1;
                        la = j;
                    }
                if (la == i)
                    ;
                else if (ans[la][i])
                    return 0;
                else
                {
                    ans[la][i] = 1;
                    ans[i][la] = 1;
                }
            }
        }
    build(ans);
    return 1;
}

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