Submission #1160542

#	Time	Username	Problem	Language	Result	Execution time	Memory
1160542		ohdarndje	September (APIO24_september)	C++20	Compilation error	0 ms	0 KiB

september

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
 
#define MaxN 1000000
 
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;
}

int main() {
    int N, M;
    cin >> N >> M;
    vector<int> parents(N);
    parents[0] = -1;
    for (int i = 1; i < N; i++) {
        cin >> parents[i];
    }
    vector<vector<int>> sequences(M, vector<int>(N - 1));
    for (int i = 0; i < M; i++) {
        for (int j = 0; j < N - 1; j++) {
            cin >> sequences[i][j];
        }
    }
    cout << solve(N, M, parents, sequences) << "\n";
    return 0;
}

Compilation message (stderr)

/usr/bin/ld: /tmp/ccDdYKwG.o: in function `main':
grader.cpp:(.text.startup+0x0): multiple definition of `main'; /tmp/ccaeU9Bf.o:september.cpp:(.text.startup+0x0): first defined here
collect2: error: ld returned 1 exit status