Submission #655070

#	Time	Username	Problem	Language	Result	Execution time	Memory
655070		benjaminkleyn	슈퍼트리 잇기 (IOI20_supertrees)	C++17	40 / 100	181 ms	24096 KiB

supertrees

#include <bits/stdc++.h>
#include "supertrees.h"
using namespace std;
typedef long long ll;

int par[1000];

int find(int u)
{
    if (par[u] == u)
        return u;
    return par[u] = find(par[u]);
}

void unite(int u, int v)
{
    u = find(u), v = find(v);
    par[v] = u;
}

vector<int> comp[1000];

int construct(vector<vector<int>> p) {
	int n = p.size();

    iota(par, par + n, 0);

    for (int i = 0; i < n; i++)
        for (int j = 0; j < n; j++)
            if (p[i][j] > 0)
                unite(i, j);

    for (int i = 0; i < n; i++)
        comp[find(i)].push_back(i);

	vector<vector<int>> answer(n, vector<int>(n));
    for (int k = 0; k < n; k++)
        if (find(k) == k && comp[k].size() >= 2)
        {
            int x = p[comp[k][0]][comp[k][1]];

            for (int i : comp[k])
                for (int j : comp[k]) 
                    if (i != j && p[i][j] != x)
                        return 0;

            if (x == 3 || x == 0)
                return 0;

            for (int i = 0; i < comp[k].size() - 1; i++)
            {
                answer[comp[k][i]][comp[k][i+1]] = 1;
                answer[comp[k][i+1]][comp[k][i]] = 1;
            }

            if (x == 2)
            {
                if (comp[k].size() <= 2)
                    return 0;
                answer[comp[k][0]][comp[k].back()] = 1;
                answer[comp[k].back()][comp[k][0]] = 1;
            }
        }

    build(answer);
	return 1;
}

Compilation message (stderr)

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:33:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   33 |     for (int i = 0; i < n; i++)
      |     ^~~
supertrees.cpp:36:2: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   36 |  vector<vector<int>> answer(n, vector<int>(n));
      |  ^~~~~~
supertrees.cpp:50:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   50 |             for (int i = 0; i < comp[k].size() - 1; i++)
      |                             ~~^~~~~~~~~~~~~~~~~~~~

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