oj.uz

Submission #1069567

# Submission time Handle Problem Language Result Execution time Memory
1069567 2024-08-22T06:01:25 Z bleahbleah Beech Tree (IOI23_beechtree) C++17
49 / 100
 162 ms 19352 KB 
#include "beechtree.h"
#include <bits/stdc++.h>
#define all(x) (x).begin(),(x).end()
using namespace std;

using ll = long long;
using ld = long double;

//#define int ll
#define sz(x) ((int)(x).size())

using pii = pair<int,int>;
using tii = tuple<int,int,int>;

const int nmax = 2e3 + 5;

vector<pii> g[nmax];
vector<int> P, C;

unordered_set<int> colors[nmax], play[nmax];
bool isanc(unordered_set<int>& A, unordered_set<int>& B) {
   if(sz(A) < sz(B)) return 0;
   for(auto &x : B)
      if(!A.count(x)) return 0;
   return 1;
}

vector<int> sol;
int h[nmax];

bool SI[nmax][nmax];
bool calc[nmax][nmax];

bool superimposable(int x, int y) { // x peste y 
   if(sz(g[x]) == 0 || x == y) return 1;
   if(calc[x][y]) return SI[x][y];
   map<int, int> gy;
   for(auto [a, c] : g[y]) gy[c] = a;
   calc[x][y] = 1;
   SI[x][y] = 1; 
   for(auto [a, c] : g[x]) {
      if(gy.count(c) == 0) { return SI[x][y] = 0; }
      if(!superimposable(a, gy[c])) { return SI[x][y] = 0; }
   }
   return 1;
}

int area[nmax];

vector<int> dfs(int node) {
   vector<int> here;
   sol[node] = 1;
   area[node] = 1;
   here.emplace_back(node);
   
   for(auto [x, c] : g[node]) {
      auto T = dfs(x);
      for(auto x : T) 
         for(auto y : here)
            sol[node] &= superimposable(x, y) || superimposable(y, x);
      area[node] += area[x];
      sol[node] &= sol[x];
      copy(all(T), back_inserter(here));
   }
   
   if(sz(g[node]) != sz(colors[node])) sol[node] = 0;
   if(sol[node] == 0) { return here; }
   
   
   sort(all(here), [&](int a, int b) { return sz(colors[a]) > sz(colors[b]); });
   for(int i = 1; i < sz(here); i++) {
      if(!isanc(colors[here[i - 1]], colors[here[i]])) { sol[node] = 0; return here; }
   }
   return here;
}

std::vector<int> beechtree(int N, int M, std::vector<int> P_, std::vector<int> C_) {
   P = P_;
   C = C_;
   for(int i = 1; i < N; i++) {
      g[P[i]].emplace_back(i, C[i]);
      colors[P[i]].emplace(C[i]);
   }
   sol.assign(N, 0);
   dfs(0);
   
   
   return sol;
}

/**
      Töte es durch genaue Untersuchung\Töte es kann es nur noch schlimmer machen\Es lässt es irgendwie atmen
--
*/

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 0 ms 604 KB Output is correct
3 Correct 0 ms 604 KB Output is correct

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 0 ms 604 KB Output is correct
3 Correct 1 ms 600 KB Output is correct
4 Correct 1 ms 600 KB Output is correct
5 Correct 0 ms 604 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 0 ms 604 KB Output is correct
9 Correct 0 ms 708 KB Output is correct
10 Correct 1 ms 600 KB Output is correct
11 Correct 0 ms 604 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 1 ms 600 KB Output is correct
14 Correct 0 ms 604 KB Output is correct
15 Correct 0 ms 604 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 0 ms 604 KB Output is correct
20 Correct 0 ms 604 KB Output is correct
21 Correct 1 ms 604 KB Output is correct
22 Correct 1 ms 604 KB Output is correct
23 Correct 1 ms 600 KB Output is correct
24 Correct 1 ms 600 KB Output is correct
25 Correct 0 ms 604 KB Output is correct
26 Correct 1 ms 604 KB Output is correct
27 Correct 1 ms 604 KB Output is correct
28 Correct 1 ms 604 KB Output is correct
29 Correct 0 ms 604 KB Output is correct
30 Correct 0 ms 604 KB Output is correct
31 Correct 1 ms 716 KB Output is correct
32 Correct 1 ms 856 KB Output is correct
33 Correct 1 ms 604 KB Output is correct
34 Correct 0 ms 604 KB Output is correct

Subtask #2
0.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 0 ms 604 KB Output is correct
3 Correct 1 ms 600 KB Output is correct
4 Correct 1 ms 600 KB Output is correct
5 Correct 0 ms 604 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Runtime error 33 ms 13656 KB Execution killed with signal 11
8 Halted 0 ms 0 KB -

Subtask #3
0.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 1 ms 672 KB Output is correct
3 Correct 1 ms 600 KB Output is correct
4 Correct 1 ms 708 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 600 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 7 ms 860 KB Output is correct
12 Correct 5 ms 860 KB Output is correct
13 Correct 5 ms 860 KB Output is correct
14 Correct 6 ms 860 KB Output is correct
15 Runtime error 34 ms 19352 KB Execution killed with signal 11
16 Halted 0 ms 0 KB -

Subtask #4
0.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 0 ms 604 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 0 ms 604 KB Output is correct
5 Runtime error 33 ms 13656 KB Execution killed with signal 11
6 Halted 0 ms 0 KB -

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 0 ms 604 KB Output is correct
3 Correct 0 ms 604 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 0 ms 604 KB Output is correct
6 Correct 1 ms 600 KB Output is correct
7 Correct 1 ms 600 KB Output is correct
8 Correct 0 ms 604 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 0 ms 604 KB Output is correct
12 Correct 0 ms 708 KB Output is correct
13 Correct 1 ms 600 KB Output is correct
14 Correct 0 ms 604 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 1 ms 600 KB Output is correct
17 Correct 0 ms 604 KB Output is correct
18 Correct 0 ms 604 KB Output is correct
19 Correct 1 ms 604 KB Output is correct
20 Correct 1 ms 604 KB Output is correct
21 Correct 1 ms 604 KB Output is correct
22 Correct 0 ms 604 KB Output is correct
23 Correct 0 ms 604 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 1 ms 604 KB Output is correct
26 Correct 1 ms 600 KB Output is correct
27 Correct 1 ms 600 KB Output is correct
28 Correct 0 ms 604 KB Output is correct
29 Correct 1 ms 604 KB Output is correct
30 Correct 1 ms 604 KB Output is correct
31 Correct 1 ms 604 KB Output is correct
32 Correct 0 ms 604 KB Output is correct
33 Correct 0 ms 604 KB Output is correct
34 Correct 1 ms 716 KB Output is correct
35 Correct 1 ms 856 KB Output is correct
36 Correct 1 ms 604 KB Output is correct
37 Correct 0 ms 604 KB Output is correct
38 Correct 1 ms 604 KB Output is correct
39 Correct 1 ms 672 KB Output is correct
40 Correct 1 ms 600 KB Output is correct
41 Correct 1 ms 708 KB Output is correct
42 Correct 1 ms 604 KB Output is correct
43 Correct 1 ms 604 KB Output is correct
44 Correct 1 ms 604 KB Output is correct
45 Correct 1 ms 600 KB Output is correct
46 Correct 1 ms 604 KB Output is correct
47 Correct 1 ms 604 KB Output is correct
48 Correct 2 ms 1368 KB Output is correct
49 Correct 2 ms 1488 KB Output is correct
50 Correct 3 ms 1372 KB Output is correct
51 Correct 2 ms 1372 KB Output is correct
52 Correct 1 ms 860 KB Output is correct
53 Correct 1 ms 860 KB Output is correct
54 Correct 2 ms 1116 KB Output is correct
55 Correct 1 ms 1116 KB Output is correct
56 Correct 1 ms 1116 KB Output is correct
57 Correct 1 ms 1116 KB Output is correct
58 Correct 1 ms 1120 KB Output is correct
59 Correct 2 ms 1112 KB Output is correct
60 Correct 2 ms 1112 KB Output is correct
61 Correct 2 ms 1112 KB Output is correct
62 Correct 2 ms 1112 KB Output is correct
63 Correct 1 ms 1116 KB Output is correct
64 Correct 2 ms 1220 KB Output is correct

Subtask #6
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 0 ms 604 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 0 ms 604 KB Output is correct
5 Correct 0 ms 708 KB Output is correct
6 Correct 1 ms 600 KB Output is correct
7 Correct 0 ms 604 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 600 KB Output is correct
10 Correct 0 ms 604 KB Output is correct
11 Correct 0 ms 604 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 0 ms 604 KB Output is correct
16 Correct 0 ms 604 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 1 ms 600 KB Output is correct
20 Correct 1 ms 600 KB Output is correct
21 Correct 0 ms 604 KB Output is correct
22 Correct 1 ms 604 KB Output is correct
23 Correct 1 ms 604 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 135 ms 9152 KB Output is correct
26 Correct 150 ms 9204 KB Output is correct
27 Correct 147 ms 9296 KB Output is correct
28 Correct 162 ms 9044 KB Output is correct
29 Correct 142 ms 9040 KB Output is correct
30 Correct 129 ms 8784 KB Output is correct
31 Correct 80 ms 6224 KB Output is correct
32 Correct 80 ms 6244 KB Output is correct
33 Correct 85 ms 6224 KB Output is correct
34 Correct 61 ms 4944 KB Output is correct
35 Correct 63 ms 5052 KB Output is correct
36 Correct 77 ms 5420 KB Output is correct
37 Correct 59 ms 4944 KB Output is correct
38 Correct 117 ms 7764 KB Output is correct

Subtask #7
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 0 ms 604 KB Output is correct
3 Correct 0 ms 604 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 0 ms 604 KB Output is correct
6 Correct 1 ms 600 KB Output is correct
7 Correct 1 ms 600 KB Output is correct
8 Correct 0 ms 604 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 0 ms 604 KB Output is correct
12 Correct 0 ms 708 KB Output is correct
13 Correct 1 ms 600 KB Output is correct
14 Correct 0 ms 604 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 1 ms 600 KB Output is correct
17 Correct 0 ms 604 KB Output is correct
18 Correct 0 ms 604 KB Output is correct
19 Correct 1 ms 604 KB Output is correct
20 Correct 1 ms 604 KB Output is correct
21 Correct 1 ms 604 KB Output is correct
22 Correct 0 ms 604 KB Output is correct
23 Correct 0 ms 604 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 1 ms 604 KB Output is correct
26 Correct 1 ms 600 KB Output is correct
27 Correct 1 ms 600 KB Output is correct
28 Correct 0 ms 604 KB Output is correct
29 Correct 1 ms 604 KB Output is correct
30 Correct 1 ms 604 KB Output is correct
31 Correct 1 ms 604 KB Output is correct
32 Correct 0 ms 604 KB Output is correct
33 Correct 0 ms 604 KB Output is correct
34 Correct 1 ms 716 KB Output is correct
35 Correct 1 ms 856 KB Output is correct
36 Correct 1 ms 604 KB Output is correct
37 Correct 0 ms 604 KB Output is correct
38 Correct 2 ms 1368 KB Output is correct
39 Correct 2 ms 1488 KB Output is correct
40 Correct 3 ms 1372 KB Output is correct
41 Correct 2 ms 1372 KB Output is correct
42 Correct 1 ms 604 KB Output is correct
43 Correct 1 ms 672 KB Output is correct
44 Correct 1 ms 600 KB Output is correct
45 Correct 1 ms 708 KB Output is correct
46 Correct 1 ms 604 KB Output is correct
47 Correct 1 ms 604 KB Output is correct
48 Correct 1 ms 604 KB Output is correct
49 Correct 1 ms 600 KB Output is correct
50 Correct 1 ms 604 KB Output is correct
51 Correct 1 ms 604 KB Output is correct
52 Correct 7 ms 860 KB Output is correct
53 Correct 5 ms 860 KB Output is correct
54 Correct 5 ms 860 KB Output is correct
55 Correct 6 ms 860 KB Output is correct
56 Correct 1 ms 860 KB Output is correct
57 Correct 1 ms 860 KB Output is correct
58 Correct 2 ms 1116 KB Output is correct
59 Correct 1 ms 1116 KB Output is correct
60 Correct 1 ms 1116 KB Output is correct
61 Correct 1 ms 1116 KB Output is correct
62 Correct 1 ms 1120 KB Output is correct
63 Correct 2 ms 1112 KB Output is correct
64 Correct 2 ms 1112 KB Output is correct
65 Correct 2 ms 1112 KB Output is correct
66 Correct 2 ms 1112 KB Output is correct
67 Correct 1 ms 1116 KB Output is correct
68 Correct 2 ms 1220 KB Output is correct
69 Correct 135 ms 9152 KB Output is correct
70 Correct 150 ms 9204 KB Output is correct
71 Correct 147 ms 9296 KB Output is correct
72 Correct 162 ms 9044 KB Output is correct
73 Correct 142 ms 9040 KB Output is correct
74 Correct 129 ms 8784 KB Output is correct
75 Correct 80 ms 6224 KB Output is correct
76 Correct 80 ms 6244 KB Output is correct
77 Correct 85 ms 6224 KB Output is correct
78 Correct 61 ms 4944 KB Output is correct
79 Correct 63 ms 5052 KB Output is correct
80 Correct 77 ms 5420 KB Output is correct
81 Correct 59 ms 4944 KB Output is correct
82 Correct 117 ms 7764 KB Output is correct
83 Correct 149 ms 9224 KB Output is correct
84 Correct 143 ms 9304 KB Output is correct
85 Correct 149 ms 9296 KB Output is correct
86 Correct 151 ms 9208 KB Output is correct
87 Correct 40 ms 4692 KB Output is correct
88 Correct 11 ms 1116 KB Output is correct
89 Correct 118 ms 9080 KB Output is correct
90 Correct 121 ms 8788 KB Output is correct
91 Correct 80 ms 5976 KB Output is correct
92 Correct 84 ms 6228 KB Output is correct
93 Correct 82 ms 6480 KB Output is correct
94 Correct 31 ms 2396 KB Output is correct
95 Correct 40 ms 2892 KB Output is correct
96 Correct 61 ms 4428 KB Output is correct
97 Correct 62 ms 4948 KB Output is correct
98 Correct 109 ms 7988 KB Output is correct

Subtask #8
0.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 0 ms 604 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 0 ms 604 KB Output is correct
5 Correct 0 ms 708 KB Output is correct
6 Correct 1 ms 600 KB Output is correct
7 Correct 0 ms 604 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 600 KB Output is correct
10 Correct 0 ms 604 KB Output is correct
11 Correct 0 ms 604 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 0 ms 604 KB Output is correct
16 Correct 0 ms 604 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 1 ms 600 KB Output is correct
20 Correct 1 ms 600 KB Output is correct
21 Correct 0 ms 604 KB Output is correct
22 Correct 1 ms 604 KB Output is correct
23 Correct 1 ms 604 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 135 ms 9152 KB Output is correct
26 Correct 150 ms 9204 KB Output is correct
27 Correct 147 ms 9296 KB Output is correct
28 Correct 162 ms 9044 KB Output is correct
29 Correct 142 ms 9040 KB Output is correct
30 Correct 129 ms 8784 KB Output is correct
31 Correct 80 ms 6224 KB Output is correct
32 Correct 80 ms 6244 KB Output is correct
33 Correct 85 ms 6224 KB Output is correct
34 Correct 61 ms 4944 KB Output is correct
35 Correct 63 ms 5052 KB Output is correct
36 Correct 77 ms 5420 KB Output is correct
37 Correct 59 ms 4944 KB Output is correct
38 Correct 117 ms 7764 KB Output is correct
39 Runtime error 31 ms 12872 KB Execution killed with signal 11
40 Halted 0 ms 0 KB -

Subtask #9
0.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 0 ms 604 KB Output is correct
3 Correct 0 ms 604 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 0 ms 604 KB Output is correct
6 Correct 1 ms 600 KB Output is correct
7 Correct 1 ms 600 KB Output is correct
8 Correct 0 ms 604 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 0 ms 604 KB Output is correct
12 Correct 0 ms 708 KB Output is correct
13 Correct 1 ms 600 KB Output is correct
14 Correct 0 ms 604 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 1 ms 600 KB Output is correct
17 Correct 0 ms 604 KB Output is correct
18 Correct 0 ms 604 KB Output is correct
19 Correct 1 ms 604 KB Output is correct
20 Correct 1 ms 604 KB Output is correct
21 Correct 1 ms 604 KB Output is correct
22 Correct 0 ms 604 KB Output is correct
23 Correct 0 ms 604 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 1 ms 604 KB Output is correct
26 Correct 1 ms 600 KB Output is correct
27 Correct 1 ms 600 KB Output is correct
28 Correct 0 ms 604 KB Output is correct
29 Correct 1 ms 604 KB Output is correct
30 Correct 1 ms 604 KB Output is correct
31 Correct 1 ms 604 KB Output is correct
32 Correct 0 ms 604 KB Output is correct
33 Correct 0 ms 604 KB Output is correct
34 Correct 1 ms 716 KB Output is correct
35 Correct 1 ms 856 KB Output is correct
36 Correct 1 ms 604 KB Output is correct
37 Correct 0 ms 604 KB Output is correct
38 Runtime error 33 ms 13656 KB Execution killed with signal 11
39 Halted 0 ms 0 KB -