Submission #313531

#	Time	Username	Problem	Language	Result	Execution time	Memory
313531		mohamedsobhi777	Connecting Supertrees (IOI20_supertrees)	C++14	11 / 100	246 ms	22264 KiB

supertrees

#include "supertrees.h"
#include <bits/stdc++.h>
#include <vector>

using namespace std;

int construct(std::vector<std::vector<int>> p)
{
        int n = p.size();
        std::vector<std::vector<int>> answer;
        for (int i = 0; i < n; i++)
        {
                std::vector<int> row;
                row.resize(n);
                answer.push_back(row);
        }
        for(int i = 1; i < n ; ++ i){
                answer[i-1][i] = answer[i][i-1] = 1; 
        }
        /*map<int, int> cyc;
        vector<int> cycle, line;
        for (int i = 0; i < n; ++i)
        {
                p[i][i] = 2;
                if (p[i] == vector<int>(n, 2))
                {
                        cycle.push_back(i);
                        cyc[i] = 1;
                }
                else
                {
                        line.push_back(i);
                }

                p[i][i] = 1;
        }

        if ((int)cycle.size() && (int)cycle.size() < 2)
                return 0;

        if ((int)line.size() && cycle.size())
                cycle.push_back(line[0]);
        for (int i = 0; i < (int)cycle.size(); ++i)
        {
                int j = (i + 1) % n;
                answer[cycle[i]][cycle[j]] = 1;
                answer[cycle[j]][cycle[i]] = 1;
        }
        for (int i = 1; i < (int)line.size(); ++i)
        {
                int x = line[i - 1], y = line[i];
                answer[x][y] = answer[y][x] = 1;

                for (int j = 0; j < n; ++j)
                {
                        if (i == j)
                                continue;
                        if (p[y][j] != 1 && !cyc[j])
                                return 0;
                }
        }
        for (int i = 1; i < n; ++i)
        {
                if (p[line[0]][i] == 2 && !cyc[i]){
                        return 0;
                }
        }*/
        build(answer);
        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