Submission #1015743

#	Time	Username	Problem	Language	Result	Execution time	Memory
1015743		DON_F	September (APIO24_september)	C++17	100 / 100	84 ms	10628 KiB

september

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

int solve(int n, int m, vector<int> f, vector<vector<int>> s) {
    vector<int> child(n);
    for (int i = 1; i < n; ++i){
        child[f[i]]++;
    }
    int ans = 0, last = 0, counter = 0, leaf = 0;
    vector<int> num(n), vis(n);
    for (int i = 0; i < n - 1; ++i){
        for (int j = 0; j < m; ++j){
            num[s[j][i]]++;
            if (num[s[j][i]] == m){
                ++counter;
            }
            if (j == 0){
                vis[s[j][i]] = 1;
                int node = s[j][i];
                while (child[node] == 0 && vis[node] == 1){
                    ++leaf;
                    node = f[node];
                    --child[node];
                }
            }
        }
        if (counter == i - last + 1 && leaf == i - last + 1){
            ++ans;
            last = i + 1;
            counter = 0;
            leaf = 0;
        }
    }
	return ans;
}

• 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