Submission #1173044

#	Time	Username	Problem	Language	Result	Execution time	Memory
1173044		ladnooo	9월 (APIO24_september)	C++20	0 / 100	1095 ms	2632 KiB

september

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

const int maxN = 1e5 + 7;
vector<int> g[maxN];
int par[maxN];

void dfs(int v) {
    par[v] = -1;
    for(int u : g[v]) {
        dfs(u);
    }
}
int solve(int N, int M, vector<int> F, vector<vector<int>> S) {
    int szz = F.size();
    for(int i = 1; i < szz; i++) {
        par[F[i]]++;
        g[F[i]].push_back(i);
    } 
    vector<int> m = S[0];
    int sz = m.size();
    int sum = 0;
    for(int i = 0; i < sz; i++) {
        if(par[m[i]] == 0) {
            par[F[m[i]]]--;
            sum++;
        } else if(par[m[i]] > 0) {
            dfs(m[i]);
            sum++;
        }
    }   
    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