제출 #1355429

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1355429		Francisco_Martin	September (APIO24_september)	C++20	100 / 100	85 ms	15960 KiB

september

//APIO 2024 September
//https://qoj.ac/contest/1684/problem/8724

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector<ll>;
const ll MAXN = 1e5+5;

vll g[MAXN];
void dfs(ll v,vll &R){
    for(auto u:g[v])  dfs(u,R), R[v]=max(R[v],R[u]);
}

int solve(int n,int m,vector<int> F,vector<vector<int>> S){
    for(int i=0; i<n; i++) g[i].clear();
    for(int i=1; i<n; i++) g[F[i]].push_back(i);
    vll R(n,-1); ll r=0, ans=0;
    for(int i=0; i<m; i++) for(int j=0; j<n-1; j++) R[S[i][j]]=max(R[S[i][j]],(ll)j);
    dfs(0,R);
    for(int j=0; j<n-1; j++){
        for(int i=0; i<m; i++) r=max(r,R[S[i][j]]);
        if(j==r) ans++;
    }
    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