Submission #1364818

#	Time	Username	Problem	Language	Result	Execution time	Memory
1364818		maharram234567	September (APIO24_september)	C++20	45 / 100	76 ms	8272 KiB

september

#include "september.h"
#include <bits/stdc++.h>
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
vector<int> vis, pos;
vector<vector<int>> g;
int mx=0;

void dfs(int node) {
    vis[node]=1;
    if (pos[node]!=-1) {
        mx=max(mx,pos[node]);
    }
    for(int i:g[node]) {
        if(!vis[i]) {
            dfs(i);
        }
    }
}

int solve(int n, int m, vector<int> par, vector<vector<int>> s) {
    vis.assign(n, 0);
    pos.assign(n, -1);
    g.assign(n, vector<int>());
    mx=0;
    for(int i=1; i<n; i++) {
        g[par[i]].pb(i);
    }
    for(int i=0; i<n-1; i++) {
        pos[s[0][i]]=i;
    }
    int res=0, i=0;
    while(i<n-1) {
        while(i<n-1 && i<=mx) {
            int node=s[0][i];
            if(vis[node]==0) {
                dfs(node);
            }
            i++;
        }
        res++;
        if(i<n-1) mx=i;
    }
    return res;
}

• 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