제출 #1294290

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1294290		eri16	9월 (APIO24_september)	C++20	45 / 100	159 ms	14124 KiB

september

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

void dfs(vector <vector<int>>& child,vector<int>& maxpos, int u){
    for (int i=0; i<child[u].size(); i++){
        dfs(child,maxpos,child[u][i]);
        maxpos[u]=max(maxpos[u],maxpos[child[u][i]]);
    }
}


int solve(int n, int m, vector<int> v1,vector<vector<int>> v2){
    
    vector <int> maxpos(n);
    
    vector <vector<int>> child(n);
    
    for (int i=1; i<n; i++){
        child[v1[i]].push_back(i);
    }
    
    for (int i=0; i<n-1; i++){
        maxpos[v2[0][i]]=max(maxpos[v2[0][i]],i);
    }
    
    dfs(child,maxpos,0);
    
    int ans=0;
    int cur=-1;
    
    for (int i=0; i<n-1; i++){
        if (cur<i){ans++;}
        cur=max(cur,maxpos[v2[0][i]]);
    }    
    /*
    for (int i=0; i<n; i++){
        cout<<maxpos[i]<<' ';
    }
    */
    return ans;
    
}

• Subtask 1: 11 / 11
• Subtask 2: 0 / 14
• Subtask 3: 5 / 5
• Subtask 4: 9 / 9
• Subtask 5: 0 / 5
• Subtask 6: 0 / 11
• Subtask 7: 9 / 9
• Subtask 8: 11 / 11
• Subtask 9: 0 / 9
• Subtask 10: 0 / 16