Submission #1138608

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1138608	2025-01-23 00:10:19	mnbvcxz123	Editor (BOI15_edi)	C++20	100 / 100	140 ms	27088 KiB

edi

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;
const int MAX_N = 3e5 + 1;
const int MAX_D = 19;
int state[MAX_N], par[MAX_N][MAX_D], lev[MAX_N];
int get_par(int x, int max_lev) {
  if (lev[x] <= max_lev) { return x; }
  for (int i = MAX_D - 1; i >= 0; i--) {
    if (lev[par[x][i]] > max_lev) { x = par[x][i]; }
  }
  return par[x][0];
}
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
  int n;
  std::cin >> n;
  for (int i = 1; i <= n; i++) {
    std::cin >> state[i];
    if (state[i] < 0) {
      lev[i] = -state[i];
      int z = get_par(i - 1, lev[i] - 1);
      par[i][0] = get_par(z - 1, lev[i]-1);
      for (int j = 1; j < MAX_D; j++) {
        par[i][j] = par[par[i][j - 1]][j - 1];
      }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 20 / 20
• Subtask 2: 15 / 15
• Subtask 3: 28 / 28
• Subtask 4: 37 / 37