제출 #1203035

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1203035		monstermceldritch	9월 (APIO24_september)	C++20	45 / 100	114 ms	7872 KiB

september

#include <bits/stdc++.h>

using namespace std;
typedef vector<int> vi;
typedef vector<vi> vii;

int solve(int n, int m, vector<int> f, vector<vector<int>> s)
{
    vii children(n, vi());
    for (int i = 1; i < n; i++)
        children[f[i]].push_back(i);
    if (m!=1)
        return 1;
    vi constraint = s[0];
    vector<bool> done(n, false);
    int threshold = 0, ans = 0;
    for (int i = 0; i < n-1; i++)
    {
        for (auto j : children[constraint[i]])
        {
            if (!done[j])
            {
                for (int k = max(i+1, threshold+1); k < n-1; k++)
                {
                    done[constraint[k]] = true;
                    if (constraint[k] == j)
                    {
                        threshold = k;
                        break;
                    }
                }
            }
        }
        done[constraint[i]] = true;
        if (i >= threshold)
            ans++;
    }
    return ans;
}

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