제출 #1167530

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1167530		dion324	September (APIO24_september)	C++20	0 / 100	1 ms	580 KiB

september

#include <bits/stdc++.h>
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
#define all(x) (x).begin(), (x).end()

using ll = long long;
using namespace std;

int solve(int N, int M, vector<int> F, vector<vector<int>> S) {
    vector<vector<int>> adj(N);
    vector<int> indeg(N, 0);
    unordered_set<int> leaves;

    for (int i = 1; i < N; i++) {
        adj[F[i]].push_back(i);
    }

    for (int i = 0; i < N; i++) {
        if (adj[i].empty()) {
            leaves.insert(i);
        }
    }

    vector<vector<int>> dag(N);
    vector<int> in_degree(N, 0);

    for (int v = 0; v < M; v++) {
        for (int j = 0; j < N - 2; j++) {
            int u = S[v][j], w = S[v][j + 1];
            dag[u].push_back(w);
            in_degree[w]++;
        }
    }

    queue<int> q;
    vector<int> dist(N, 0);

    for (int i = 0; i < N; i++) {
        if (leaves.count(i) && in_degree[i] == 0) {
            q.push(i);
            dist[i] = 1;
        }
    }

    int max_days = 1;
    while (!q.empty()) {
        int u = q.front();
        q.pop();
        for (int v : dag[u]) {
            dist[v] = max(dist[v], dist[u] + 1);
            max_days = max(max_days, dist[v]);
            if (--in_degree[v] == 0) {
                q.push(v);
            }
        }
    }

    return max_days;
}

• Subtask 1: 0 / 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