Submission #1173088

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1173088	2025-03-24 19:05:50	thecrazycandy	September (APIO24_september)	C++20	16 / 100	107 ms	3284 KiB

september

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
using namespace std;
int nw = 1;
vector <int> g[9999];
int tin[9999], tout[9999];
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 = 9999, 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++) {
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• 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