제출 #1184804

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1184804		windowwife	9월 (APIO24_september)	C++20	100 / 100	101 ms	32192 KiB

september

#ifndef rtgsp
#include "september.h"
#endif // rtgsp

#include<bits/stdc++.h>
#define ll long long
#define task ""
using namespace std;
const int maxn = 1e6 + 4;
int n, m, res, cnt[maxn], appear, fallen;
bool visited[maxn];
vector<int> adj[maxn];
void dfs (int u)
{
    if (visited[u]) return;
    visited[u] = true;
    fallen++;
    for (int v : adj[u])
        dfs(v);
}
int solve (int N, int M, vector<int> F, vector<vector<int>> S)
{
    n = N; m = M;
    appear = fallen = 0; res = 0;
    for (int i = 0; i < n; i++)
    {
        visited[i] = false;
        adj[i].clear();
        cnt[i] = 0;
    }
    for (int i = 1; i < n; i++)
        adj[F[i]].push_back(i);
    for (int i = 0; i < n - 1; i++)
    {
        for (int j = 0; j < m; j++)
        {
            if (++cnt[S[j][i]] == m) appear++;
            dfs(S[j][i]);
        }
        if (appear == fallen) res++;
    }
    return res;
}

#ifdef rtgsp
int main ()
{
    //freopen(task".INP", "r", stdin);
    //freopen(task".OUT", "w", stdout);
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout << solve(3, 1, {-1, 0, 0}, {{1, 2}}) << '\n';
    cout << solve(5, 2, {-1, 0, 0, 1, 1}, {{1, 2, 3, 4}, {4, 1, 2, 3}}) << '\n';
}
#endif // rtgsp

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