제출 #1150816

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1150816		ngano_upat_na	9월 (APIO24_september)	C++20	0 / 100	0 ms	324 KiB

september

#include "bits/stdc++.h"
#include "september.h"
using namespace std;
using ll = long long;

int solve(int N, int M, vector<int> F, vector<vector<int>> S) {
    vector<int> cnt(N,0);
    vector<int> dist_to_leaf(N,-1);
    for (int x=0; x<N; x++) {
        int cnt = 0;
        dist_to_leaf[x] = max(dist_to_leaf[x],0);
        int node = x;
        while (true) {
            if (node == 0) {
                break;
            }
            else {
                dist_to_leaf[F[node]] = max(dist_to_leaf[node]+1,dist_to_leaf[F[node]]);
                node = F[node];
            }
        }
    }
    int idx = 0;
    for (int day=1; ; day++) {
        while (true) {
            for (int i=0; i<M; i++) {
                int node = S[i][idx];
                cnt[node]++;
                int cur_node = node;
                while (true) {
                    if (cur_node == 0) {
                        break;
                    }
                    if (dist_to_leaf[cur_node] == 0) {
                        dist_to_leaf[F[cur_node]]--;
                    }
                    cur_node = F[cur_node];
                }
            }
            bool ok = true;
            for (int i=0; i<N; i++) {
                if (cnt[i] == M && dist_to_leaf[i]!=0) {
                    ok = false;
                    break;
                }
            }
            if (ok) {
                idx++;
                break;
            }
            else {
                idx++;
            }
        }
        if (idx<=N-1) {
            return day;
        }
    }
}

• 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