Submission #998199

#	Time	Username	Problem	Language	Result	Execution time	Memory
998199		Warinchai	September (APIO24_september)	C++17	59 / 100	127 ms	13364 KiB

september

#include "september.h"
#include<bits/stdc++.h>
using namespace std;
int rem=0;
struct tree{
    vector<int>adj[100005];
    int vis[5][100005];
    void dfs_add(int id,int u,int p=-1){
        if(vis[id][u])return;
        vis[id][u]=1;
        rem++;
        for(auto v:adj[u])dfs_add(id,v,u);
    }
    void remove(int id,int u){
        vis[id][u]++;
        rem--;
    }
    void clear(int n,int m){
        for(int i=0;i<=n;i++)adj[i].clear();
        for(int i=0;i<m;i++)for(int j=0;j<n;j++)vis[i][j]=0;
    }
}tr;
int solve(int N, int M, vector<int> F, vector<vector<int>> S) {
    rem=0;
    for(int i=0;i<M;i++)tr.clear(N,M);
    for(int j=1;j<N;j++){
        tr.adj[F[j]].push_back(j);
    }
    int ans=0;
    for(int i=0;i<N-1;i++){
        for(int j=0;j<M;j++){
            //cerr<<S[j][i]<<"\n";
            tr.dfs_add(j,S[j][i]);
            //cerr<<"work\n";
            tr.remove(j,S[j][i]);
        }
        if(rem==0)ans++;
        //cerr<<"rem:"<<rem<<"\n";
    }
	return ans;
}

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