Submission #1202656

#	Time	Username	Problem	Language	Result	Execution time	Memory
1202656		just	9월 (APIO24_september)	C++17	0 / 100	0 ms	324 KiB

september

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

#define ll long long
#define vec vector
#define add push_back
#define all(x) (x).begin(), (x).end()



int solve(int n, int m, vec<int> tree, vec<vec<int>> data) {
    vec<int> deg(n, 0); // number of children
    for(int i = 0; i < n; i++) {
        if (tree[i] != -1) deg[tree[i]]++;
    }
    
    set<int> leaves, unused;
    for(int i = 0; i < n; i++) if (!deg[i]) leaves.insert(i);
    
    for(auto &arr: data) reverse(all(arr));
    
    int ans = 0;
    int cur = 0;
    
    int rem = 0;
    multiset<int> unmatched;
    while (cur < m) {
        for(const auto &arr: data) {
            int x = arr[cur];
            unmatched.insert(x);
            
            if ((int)unmatched.count(x) == m) {
                // remove x from unmatched probably;
                rem += m;
                if (leaves.count(x)) {
                    leaves.erase(leaves.find(x));
                    
                    int parent = tree[x];
                    if (parent != -1) {
                        deg[parent]--;
                        if (deg[parent] == 0) {
                            if (unused.count(parent)) unused.erase(unused.find(parent));
                            else leaves.insert(parent);
                        }
                    }
                } else {
                    unused.insert(x);
                }
            }
        }
        
        if (unused.size() == 0 && (int)unmatched.size() == rem) {
            ans++;
        }
        
        cur++;
    }
    
    return ans + 1;
}

• 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