Submission #1160545

#	Time	Username	Problem	Language	Result	Execution time	Memory
1160545		ohdarndje	September (APIO24_september)	C++20	100 / 100	100 ms	12552 KiB

september

#include "september.h"
#include <vector>
#include <algorithm>
using namespace std;

#define MaxN 100500

int childCount[MaxN];
bool visited[MaxN];
vector<int> graph[MaxN];

void calc(int N, vector<int>& sequence, bool *validFlag, int *minPos, int *maxPos) {
    for (int i = 0; i < N; i++)
        visited[i] = false;
    int activeCount = 0;
    for (int i = 0; i < N - 1; i++) {
        int node = sequence[i];
        minPos[node] = min(minPos[node], i);
        maxPos[node] = max(maxPos[node], i);
        visited[node] = true;
        activeCount += childCount[node];
        for (int j = 0; j < graph[node].size(); j++)
            if (visited[graph[node][j]])
                activeCount--;
        validFlag[i] &= (activeCount == 0);
    }
}

int minPos[MaxN], maxPos[MaxN], diff[MaxN];
bool validFlag[MaxN];

int solve(int N, int M, vector<int> parents, vector<vector<int>> sequences) {
    for (int i = 0; i < N; i++) {
        graph[i].clear();
        childCount[i] = 0;
    }
    for (int i = 1; i < N; i++) {
        graph[parents[i]].push_back(i);
        graph[i].push_back(parents[i]);
        childCount[parents[i]]++;
    }
    for (int i = 0; i + 1 < N - 1; i++) {
        validFlag[i] = true;
        diff[i] = 0;
    }
    for (int i = 1; i < N; i++) {
        minPos[i] = N + 1;
        maxPos[i] = -1;
    }
    for (int i = 0; i < M; i++)
        calc(N, sequences[i], validFlag, minPos, maxPos);
    for (int id = 1; id < N; id++) {
        diff[minPos[id]]++;
        diff[maxPos[id]]--;
    }
    int ans = 1;
    for (int i = 0; i + 1 < N - 1; i++) {
        if (i > 0)
            diff[i] += diff[i - 1];
        if (!diff[i] && validFlag[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