Submission #1173051

#	Time	Username	Problem	Language	Result	Execution time	Memory
1173051		ladnooo	9월 (APIO24_september)	C++20	0 / 100	2 ms	2628 KiB

september

#include <bits/stdc++.h>
using namespace std;

const int maxN = 1e5 + 7;
int sum = 0;
vector<int> g[maxN];
int was[maxN];

void dfs(int v, int p) {
    if(was[v]) return;
    if(v == p) {
        sum++;
    }
    was[v] = 1;
    for(int u : g[v]) {
        dfs(u, p);
    }
    g[v].clear();
}
int solve(int N, int M, vector<int> F, vector<vector<int>> S) {
    int szz = F.size();
    for(int i = 1; i < szz; i++) {
        g[F[i]].push_back(i);
    } 
    vector<int> m = S[0];
    int sz = m.size();
    for(int i = 0; i < sz; i++) {
        dfs(m[i], m[i]);
    }   
    return sum;
}

• 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