제출 #1195630

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1195630		agrim_09	September (APIO24_september)	C++20	100 / 100	211 ms	11200 KiB

september

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

int solve(int n, int m, vector<int>par, vector<vector<int>>obs) {
	for(int i = 0;i<m;i++){
		obs[i].push_back(0);
	}
	vector<bool>to_check(n,false);
    set<int>st;
    for(int i = 0;i<n-1;i++){
        for(int j = 0;j<m;j++){
            st.insert(obs[j][i]);
        }
        bool yes = true;
        to_check[i] = (st.size()==i+1);
    }

    // solving for m = 1
    vector<bool>in_stack(n,false);
    vector<int>to_take(n);
    for(int i = 1;i<n;i++){
        to_take[par[i]]++;
    }

    vector<bool>is_fine(n,false);
    vector<int>vec = obs[0];

    int stack_size = 0;
    for(int i = 0;i<n-1;i++){
        int u = vec[i];
        in_stack[u] = true;
        stack_size++;
        if(to_take[u]==0){
            stack_size--; in_stack[u] = false;
            if(par[u]!=-1){
                to_take[par[u]]--;
                if(to_take[par[u]]==0 and in_stack[par[u]]){
                    stack_size--;
                    in_stack[par[u]] = false;
                }
            }
        }
        else{
            if(par[u]!=-1){
                to_take[par[u]]--;
                if(to_take[par[u]]==0 and in_stack[par[u]]){
                    stack_size--;
                    in_stack[par[u]] = false;
                }
            }
        }
        if(stack_size==0){
            is_fine[i] = true;
        }
    }
    int ans = 0;
    for(int i = 0;i<n-1;i++){
        ans += (to_check[i]&&is_fine[i]);
    }
    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