Submission #1159604

#	Time	Username	Problem	Language	Result	Execution time	Memory
1159604		LolkasMeep	September (APIO24_september)	C++20	100 / 100	508 ms	28264 KiB

september

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

typedef long long int ll;



int solve(int N, int M, vector<int> F,vector<vector<int>> S){
    vector<unordered_set<int>> adjList(N);
    for(int i = 1; i < N; i++){
        adjList[i].insert(F[i]);
        adjList[F[i]].insert(i);
    }

    vector<int> leafToIndex(N,-1);
    for(int i = 0; i < N-1; i++){
        leafToIndex[S[0][i]] = i;
    }

    vector<bool> visited(N);  
    visited[0] = true;

    int counts = 0;

    int components = 1;

    int minIndex = N;

    for(int i = N-2; i >= 0; i--){
        components++;
        int node = S[0][i];

        for(const int &adjNode : adjList[node]){
            if(visited[adjNode]) components--;
        }

        // cout << i << " " << components << '\n';

        for(int j = 0; j < M; j++) minIndex = min(minIndex, leafToIndex[S[j][i]]);

        if(components == 1 && minIndex >= i){
            counts++;
        }
        visited[node] = true;
    }

    return counts;
}

// int main(){

//     cout << "poop\n";

//     cout << solve(5, 2, {-1, 0, 0, 1, 1}, {{1, 2, 3, 4}, {4, 1, 2, 3}}) << '\n';

//     return 0;
// }

• 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