Submission #1010405

#	Time	Username	Problem	Language	Result	Execution time	Memory
1010405		sleepntsheep	September (APIO24_september)	C++17	64 / 100	145 ms	17640 KiB

september

#include "september.h"
#include <cstdio>
#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);
    for (int i = 1; i < N; ++i)
        g[P[i]].push_back(i);

    std::vector<std::vector<int> > SI(M, std::vector<int>(N));
    for (int i = 0; i < M; ++i)
        for (int j = 0; j < N - 1; ++j)
            SI[i][S[i][j]] = j;

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


    auto sheep = [&]() {
        at2 = at;
        for (int i = 0; i < M; ++i) {
            if (at[i] == N - 1)
                continue;
            dfs(dfs, S[i][at[i]]);
        };

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

    int K = 0;
    for (; *std::min_element(at.begin(), at.begin() + M) < N - 1; ++K)
        sheep();

	return K;
}

Compilation message (stderr)

september.cpp: In function 'int solve(int, int, std::vector<int>, std::vector<std::vector<int> >)':
september.cpp:52:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   52 |     for (; *std::min_element(at.begin(), at.begin() + M) < N - 1; ++K)
      |     ^~~
september.cpp:55:2: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   55 |  return K;
      |  ^~~~~~

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