Submission #992578

#	Time	Username	Problem	Language	Result	Execution time	Memory
992578		KasymK	September (APIO24_september)	C++17	45 / 100	105 ms	11836 KiB

september

#include "bits/stdc++.h"
using namespace std;
const int N = 1e5+5;
vector<int> adj[N];
int pos[N], vis[N], r;

void dfs(int nd){
    if(vis[nd])
        return;
    vis[nd] = 1;
    r = max(r, pos[nd]);
    for(auto i : adj[nd])
        dfs(i);
}

int solve(int n, int m, vector<int> F, vector<vector<int>> S){
    assert(m == 1);
    for(int i = 0; i <= n; ++i)
        adj[i].clear(), pos[i] = 0, vis[i] = 0;
    for(int i = 1; i < n; ++i)
        adj[F[i]].push_back(i);
    for(int i = 0; i < n-1; ++i)
        pos[S[0][i]] = i;
    int l = 0, answer = 0;
    r = 0;
    while(r < n-1){
        while(l <= r){
            dfs(S[0][l]);
            l++;
        }
        r++, answer++;
    }
    return answer;
}

• 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