Submission #1361712

#TimeUsernameProblemLanguageResultExecution timeMemory
1361712ahmetlbktd4September (APIO24_september)C++20
100 / 100
91 ms10812 KiB
#include "september.h"
#include "bits/stdc++.h"
using namespace std;

int solve(int n,int m,vector<int> f,vector<vector<int>> s){
    vector <int> g[n];
    for (int i = 0;i < n-1;i++){
        g[f[i+1]].push_back(i+1);
        // g[i+1].push_back(f[i+1]);
    }
    vector <int> in(n);
    for (int i = 0;i < n-1;i++){
        in[s[0][i]] = i;
    }
    int mx = 0,p = 0;
    for (int i = 0;i < n-1;i++){
        int nd = s[0][i];
        for (int to : g[nd]){
            mx = max(mx,in[to]);
        }
        for (int j = 0;j < m;j++){
            mx = max(mx,in[s[j][i]]);
        }
        if (mx <= i)
        p++;
    }
    return p;
}
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...