Submission #1173087

#	Time	Username	Problem	Language	Result	Execution time	Memory
1173087		thecrazycandy	September (APIO24_september)	C++20	16 / 100	19 ms	584 KiB

september

#include <bits/stdc++.h>
using namespace std;
int nw = 1;
vector <int> g[2001];
int tin[2001], tout[2001];
void dfs (int v) {
    tin[v] = nw;
    for (auto i : g[v]) {
        dfs(i);
        nw++;
    }
    tout[v] = nw;
}
int solve (int n, int m, vector <int> v, vector <vector <int>> a) {
    int cnt = 0;
    for (int i = 1; i < n; i++) {
        g[v[i]].push_back(i);
    }
    dfs(0);
    for (int i = 0; i < n - 1; i++) {
        int ind = 0;
        int idx = 0, mn = 2001, mx = -1;
        for (int j = i + 1; j < n - 1; j++) {
            if (tin[a[0][i]] <= tin[a[0][j]] && tout[a[0][i]] >= tout[a[0][j]]) {
                ind = max(ind, j);
            }
        }
        cnt++;
        if (ind == 0) continue;
        for (int j = i + 1; j <= ind; j++) {
            if (tin[a[0][j]] <= tin[a[0][i]] && tout[a[0][j]] >= tout[a[0][i]] && tin[a[0][j]] <= mn && tout[a[0][j]] >= mx) {
                mx = tout[a[0][j]];
                mn = tin[a[0][j]];
                idx = j;
            }
        }
        if (idx == 0) {
            i = ind;
            continue;
        }
        i = idx - 1;
        cnt--;
    }
    for (int i = 0; i < n; i++) g[i].clear();
    return cnt;
}

• Subtask 1: 11 / 11
• Subtask 2: 0 / 14
• Subtask 3: 5 / 5
• Subtask 4: 0 / 9
• Subtask 5: 0 / 5
• Subtask 6: 0 / 11
• Subtask 7: 0 / 9
• Subtask 8: 0 / 11
• Subtask 9: 0 / 9
• Subtask 10: 0 / 16