Submission #841407

#	Time	Username	Problem	Language	Result	Execution time	Memory
841407		model_code	Beech Tree (IOI23_beechtree)	C++17	9 / 100	2097 ms	26928 KiB

beechtree

// correct/sol_db_tinyN.cpp

#include "beechtree.h"
#include <bits/stdc++.h>

#define all(x) (x).begin(), (x).end()
#define xx first
#define yy second

using namespace std;
typedef pair<int, int> pii;
const int N = 2e5 + 1;

struct Graph
{
    int col[N];
    int par[N];
    vector<int> adj[N];
} graph;

void dfs(int u, vector<int> &verts)
{
    verts.push_back(u);
    for (int v : graph.adj[u])
    {
        dfs(v, verts);
    }
}

bool compute(int r)
{
    vector<int> verts;
    dfs(r, verts);

    do
    {
        map<int, int> colCount;
        for (int i = 1; i < verts.size(); ++i)
        {
            int u = verts[i];
            int c = graph.col[u];
            int p = graph.par[u];

            int cnt = colCount[c];
            colCount[c]++;

            if (p != verts[cnt])
            {
                goto end;
            }
        }
        return true;
    end:;
    } while (next_permutation(verts.begin() + 1, verts.end()));

    return false;
}

vector<int> beechtree(int n, int m, vector<int> P, vector<int> C)
{
    for (int i = 1; i < n; ++i)
    {
        int p = P[i];
        int c = C[i];
        graph.par[i] = p;
        graph.col[i] = c;
        graph.adj[p].push_back(i);
    }
    vector<int> ans(n, 0);
    for (int i = 0; i < n; ++i)
    {
        ans[i] = compute(i);
    }
    return ans;
}

Compilation message (stderr)

beechtree.cpp: In function 'bool compute(int)':
beechtree.cpp:38:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   38 |         for (int i = 1; i < verts.size(); ++i)
      |                         ~~^~~~~~~~~~~~~~

• Subtask 0: 0 / 0
• Subtask 1: 9 / 9
• Subtask 2: 0 / 5
• Subtask 3: 0 / 9
• Subtask 4: 0 / 8
• Subtask 5: 0 / 14
• Subtask 6: 0 / 14
• Subtask 7: 0 / 12
• Subtask 8: 0 / 17
• Subtask 9: 0 / 12