제출 #1299281

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1299281		AksLolCoding	9월 (APIO24_september)	C++17	100 / 100	214 ms	17644 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 j=0; j<m; j++){
    for (int i=0; i<n-1; i++){
        maxpos[v2[j][i]]=max(maxpos[v2[j][i]],i);
    }}
    
    dfs(child,maxpos,0);
    
    int ans=0,cur=-1;
    for (int i=0; i<n-1; i++){
        if (cur<i)ans++;
        for (int j=0; j<m; j++){
        cur=max(cur,maxpos[v2[j][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