Submission #1000116

#	Time	Username	Problem	Language	Result	Execution time	Memory
1000116		Andrey	September (APIO24_september)	C++17	100 / 100	106 ms	14728 KiB

september

#include "september.h"
#include<bits/stdc++.h>
using namespace std;

vector<int> haha[200001];
int solve(int N, int M, std::vector<int> F, std::vector<std::vector<int>> S) {
    int n = N,m = M;
    for(int i = 0; i <= n; i++) {
        haha[i].clear();
    }
    for(int i = 1; i < n; i++) {
        haha[F[i]].push_back(i);
    }
    vector<int> p(n+1);
    for(int i = 0; i < n-1; i++) {
        for(int j = 0; j < m; j++) {
            p[S[j][i]] = max(p[S[j][i]],i);
        }
    }
    int y = 0,ans = 0;
    for(int i = 0; i < n-1; i++) {
        for(int j = 0; j < m; j++) {
            int a = S[j][i];
            y = max(y,p[a]);
            for(int v: haha[a]) {
                y = max(y,p[v]);
            }
        }
        if(y <= i) {
            ans++;
        }
    }
    return ans;
}

• 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