답안 #786587

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
786587	2023-07-18T09:36:08 Z	tch1cherin	Cat Exercise (JOI23_ho_t4)	C++17	31 / 100	2000 ms	29920 KB

Main

#include <bits/stdc++.h>
using namespace std;

vector<int> P, D, Max;
vector<bool> used;
vector<vector<int>> G;

void DFS(int u, int p) {
  Max[u] = u;
  for (int v : G[u]) {
    if (v != p && !used[v]) {
      D[v] = D[u] + 1;
      DFS(v, u);
      if (P[Max[v]] > P[Max[u]]) {
        Max[u] = Max[v];
      }
    }
  }
}

int solve(int u) {
  D[u] = 0;
  DFS(u, -1);
  used[u] = true;
  int ans = 0;
  for (int v : G[u]) {
    if (!used[v]) {
      int dist = D[Max[v]];
      ans = max(ans, dist + solve(Max[v]));
    }
  }
  return ans;
}

int main() {
  cin.tie(nullptr)->sync_with_stdio(false);
  int N;
  cin >> N;
  P = D = Max = vector<int>(N);
  G.resize(N);
  used.resize(N);
  for (int &v : P) {
    cin >> v;
  }
  for (int i = 0; i < N - 1; i++) {
    int u, v;
    cin >> u >> v;
    u--, v--;
    G[u].push_back(v);
    G[v].push_back(u);
  }
  for (int i = 0; i < N; i++) {
    if (P[i] == N) {
      cout << solve(i) << "\n"; 
    }
  }
}

Subtask #1

7.0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	324 KB	Output is correct
4	Correct	0 ms	316 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	0 ms	324 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct

Subtask #2

7.0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	324 KB	Output is correct
4	Correct	0 ms	316 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	0 ms	324 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	340 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	1 ms	340 KB	Output is correct
16	Correct	1 ms	324 KB	Output is correct
17	Correct	1 ms	320 KB	Output is correct

Subtask #3

7.0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	324 KB	Output is correct
4	Correct	0 ms	316 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	0 ms	324 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	340 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	1 ms	340 KB	Output is correct
16	Correct	1 ms	324 KB	Output is correct
17	Correct	1 ms	320 KB	Output is correct
18	Correct	107 ms	1012 KB	Output is correct
19	Correct	98 ms	980 KB	Output is correct
20	Correct	95 ms	1008 KB	Output is correct
21	Correct	3 ms	952 KB	Output is correct
22	Correct	3 ms	852 KB	Output is correct
23	Correct	3 ms	852 KB	Output is correct
24	Correct	2 ms	844 KB	Output is correct

Subtask #4

10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	324 KB	Output is correct
4	Correct	0 ms	316 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	0 ms	324 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	340 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	1 ms	340 KB	Output is correct
16	Correct	1 ms	324 KB	Output is correct
17	Correct	1 ms	320 KB	Output is correct
18	Correct	107 ms	1012 KB	Output is correct
19	Correct	98 ms	980 KB	Output is correct
20	Correct	95 ms	1008 KB	Output is correct
21	Correct	3 ms	952 KB	Output is correct
22	Correct	3 ms	852 KB	Output is correct
23	Correct	3 ms	852 KB	Output is correct
24	Correct	2 ms	844 KB	Output is correct
25	Correct	0 ms	212 KB	Output is correct
26	Correct	107 ms	920 KB	Output is correct
27	Correct	93 ms	916 KB	Output is correct
28	Correct	116 ms	956 KB	Output is correct
29	Correct	101 ms	948 KB	Output is correct
30	Correct	7 ms	724 KB	Output is correct
31	Correct	14 ms	724 KB	Output is correct
32	Correct	9 ms	728 KB	Output is correct
33	Correct	15 ms	736 KB	Output is correct

Subtask #5

0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	324 KB	Output is correct
4	Correct	0 ms	316 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	0 ms	324 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	340 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	1 ms	340 KB	Output is correct
16	Correct	1 ms	324 KB	Output is correct
17	Correct	1 ms	320 KB	Output is correct
18	Correct	107 ms	1012 KB	Output is correct
19	Correct	98 ms	980 KB	Output is correct
20	Correct	95 ms	1008 KB	Output is correct
21	Correct	3 ms	952 KB	Output is correct
22	Correct	3 ms	852 KB	Output is correct
23	Correct	3 ms	852 KB	Output is correct
24	Correct	2 ms	844 KB	Output is correct
25	Execution timed out	2059 ms	29920 KB	Time limit exceeded
26	Halted	0 ms	0 KB	-

Subtask #6

0 / 23.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Execution timed out	2069 ms	17328 KB	Time limit exceeded
4	Halted	0 ms	0 KB	-

Subtask #7

0 / 26.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	324 KB	Output is correct
4	Correct	0 ms	316 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	0 ms	324 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	340 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	1 ms	340 KB	Output is correct
16	Correct	1 ms	324 KB	Output is correct
17	Correct	1 ms	320 KB	Output is correct
18	Correct	107 ms	1012 KB	Output is correct
19	Correct	98 ms	980 KB	Output is correct
20	Correct	95 ms	1008 KB	Output is correct
21	Correct	3 ms	952 KB	Output is correct
22	Correct	3 ms	852 KB	Output is correct
23	Correct	3 ms	852 KB	Output is correct
24	Correct	2 ms	844 KB	Output is correct
25	Correct	0 ms	212 KB	Output is correct
26	Correct	107 ms	920 KB	Output is correct
27	Correct	93 ms	916 KB	Output is correct
28	Correct	116 ms	956 KB	Output is correct
29	Correct	101 ms	948 KB	Output is correct
30	Correct	7 ms	724 KB	Output is correct
31	Correct	14 ms	724 KB	Output is correct
32	Correct	9 ms	728 KB	Output is correct
33	Correct	15 ms	736 KB	Output is correct
34	Execution timed out	2059 ms	29920 KB	Time limit exceeded
35	Halted	0 ms	0 KB	-