제출 #1010408

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1010408		sleepntsheep	9월 (APIO24_september)	C++17	11 / 100	1 ms	596 KiB

september

#include "september.h"

#include <algorithm>
#include <vector>
#include <array>


int solve(int N, int M, std::vector<int> P/* F is patriarchy ! */, std::vector<std::vector<int>> S) {
    using i5 = std::array<int, 5>;

    std::vector<int> vis(N);
    std::vector<std::vector<int> > g(N);
    std::vector<std::vector<int> > SI(M, std::vector<int>(N));
    i5 at {}, at2 {}, at3;
    int K = 0, i, j;

    for (i = 1; i < N; ++i)
        g[P[i]].push_back(i);

    for (i = 0; i < M; ++i)
        for (j = 0; j < N - 1; ++j)
            SI[i][S[i][j]] = j;

    
    auto dfs = [&](auto &&dfs, int u) -> void {
        if (vis[u])
            return;
        vis[u] = 1;
        for (i = 0; i < M; ++i)
            at2[i] = std::max(at2[i], SI[i][u] + 1);
        for (auto v : g[u])
            dfs(dfs, v);
    };


    for (; *std::min_element(at.begin(), at.begin() + M) < N - 1; ++K) {
        for (i = 0; i < M; ++i)
            at2[i] = std::min(N - 1, at[i] + 1);

        while (at != at2) {
            at3 = at2;
            for (i = 0; i < M; ++i)
                for (j = at[i]; j < at2[i]; ++j)
                    dfs(dfs, S[i][j]);
            at = at3;
        }
    }

	return K;
}

• Subtask 1: 11 / 11
• Subtask 2: 0 / 14
• Subtask 3: 0 / 5
• Subtask 4: 0 / 9
• Subtask 5: 0 / 5
• Subtask 6: 0 / 11
• Subtask 7: 0 / 9
• Subtask 8: 0 / 11
• Subtask 9: 0 / 9
• Subtask 10: 0 / 16