Submission #1039048

#	Time	Username	Problem	Language	Result	Execution time	Memory
1039048		Zicrus	Beech Tree (IOI23_beechtree)	C++17	9 / 100	2028 ms	2097152 KiB

beechtree

#include <bits/stdc++.h>
#include "beechtree.h"
using namespace std;

typedef long long ll;

void dfs(vector<vector<ll>> &adj, ll cur) {
    vector<ll> nxt;
    for (auto &e : adj[cur]) {
        dfs(adj, e);
        for (auto &j : adj[e]) {
            nxt.push_back(j);
        }
    }
    for (auto &j : nxt) {
        adj[cur].push_back(j);
    }
}

bool isBeautiful(int &n, int &m, vector<int> &p, vector<int> &c, vector<vector<ll>> &adj, ll root) {
    ll fact = 1;
    for (int i = 2; i <= adj[root].size(); i++) {
        fact *= i;
    }

    for (int perm = 0; perm < fact; perm++) {
        vector<ll> order = adj[root];
        ll prod = fact / adj[root].size();
        for (int i = 0; i < adj[root].size()-1; i++) {
            swap(order[i], order[i + ((perm / prod) % (adj[root].size()-i))]);
            prod /= (adj[root].size()-i-1);
        }
        
        unordered_multiset<ll> numC;
        order.insert(order.begin(), root);
        for (auto &e : order) {
            if (e == root) continue;
            if (p[e] != order[numC.count(c[e])]) goto skipThing;
            numC.insert(c[e]);
        }
        
        return true;
        skipThing:
        continue;
    }
    
    return false;
}

vector<int> beechtree(int n, int m, vector<int> p, vector<int> c) {
    vector<int> res(n);
    vector<vector<ll>> adj(n);
    for (int i = 1; i < n; i++) {
        adj[p[i]].push_back(i);
    }
    dfs(adj, 0);

    for (int i = 0; i < n; i++) {
        res[i] = adj[i].empty() ? true : isBeautiful(n, m, p, c, adj, i);
    }

    return res;
}

Compilation message (stderr)

beechtree.cpp: In function 'bool isBeautiful(int&, int&, std::vector<int>&, std::vector<int>&, std::vector<std::vector<long long int> >&, ll)':
beechtree.cpp:22:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   22 |     for (int i = 2; i <= adj[root].size(); i++) {
      |                     ~~^~~~~~~~~~~~~~~~~~~
beechtree.cpp:29:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   29 |         for (int i = 0; i < adj[root].size()-1; 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