Submission #1154355

#	Time	Username	Problem	Language	Result	Execution time	Memory
1154355		lrnnz	September (APIO24_september)	C++17	0 / 100	1 ms	324 KiB

september

#include <bits/stdc++.h>
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
 
#define all(a) (a).begin(), (a).end()
#define sz(a) (int)(a).size()
#define pb push_back
#define ll long long
#define ui uint64_t
#define ar array
#define us unordered_set
#define cont(set, element) ((set).find(element) != (set).end())
 
/********* DEBUG *********/
 
template <typename T>
void outvec(const vector<T>& Z){
    for (const T& x : Z)
    cout << x << ' ';
    cout << "\n";
}
 
/********* DEBUG *********/
 
const int MOD = 1e9+7;
const int mxN = 200005;
const ll inf = 1e18;

int solve(int N, int M, vector<int> F, vector<vector<int>> S){
    vector<vector<int>> children(N, vector<int>());
    for (int i = 1; i < sz(F); i++){
        children[F[i]].pb(i);
    }

    int ans = 0;
    int diffs = 0;
    int minleaf = 0;

    vector<int> cnts(N, 0);
    vector<bool> visited(N, false);

    for (int i = 0; i < N-1; i++){
        for (auto x : S){
            int node = x[i];

            if (!visited[node]){
                queue<int> q;
                q.push(node);
                visited[node] = true;

                while (sz(q)){
                    minleaf++;
                    int newnode = q.front(); q.pop();

                    for (auto y : children[newnode]){
                        if (!visited[y]){
                            visited[y] = true;
                            minleaf++;
                            q.push(y);
                        }
                    }
                }
            }

            cnts[node]++;
            if (cnts[node] == 1){
                diffs++;
            }

            if (cnts[node] == M){
                diffs--;
            }
        }
        if (i >= minleaf-1 && diffs == 0)
        ans++;
    }

    return ans;
}

• 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