Submission #1332460

#	Time	Username	Problem	Language	Result	Execution time	Memory
1332460		aren_dance	September (APIO24_september)	C++20	100 / 100	149 ms	21152 KiB

september

#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int N=2e5+100;
vector<int> g[N];
vector<vector<int>> f1;
int sz[N];
void dfs(int v){
    sz[v]=0;
    for(int i=0;i<f1[v].size();++i)
    sz[v] = max(sz[v],f1[v][i]);
    for(auto i:g[v]){
        dfs(i);
        sz[v]=max(sz[v],sz[i]);
    }
}
int solve(int n, int m, std::vector<int> f,
std::vector<std::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);
    }
    f1.clear();
    f1.resize(n+1);
    for(int j=0;j<=n;++j){
        f1[j].resize(m+1);
    }
    for(int j=0;j<m;++j){
        for(int i=0;i<s[0].size();++i){
            f1[s[j][i]][j]=i;
        }
    }
    dfs(0);
    int day=0;
    int last_mx=0;
    for(int i=0;i<s[0].size();++i){
        for(int j=0;j<m;++j){
            last_mx=max(last_mx,sz[s[j][i]]);
        }
        if(last_mx==i){
            day++;
        }
    }
    return day;
}

• 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