oj.uz

Submission #1076545

# Submission time Handle Problem Language Result Execution time Memory
1076545 2024-08-26T14:40:32 Z anango Beech Tree (IOI23_beechtree) C++17
58 / 100
 1650 ms 2097152 KB 
#include "beechtree.h"
#include <bits/stdc++.h>
using namespace std;
#define int long long


void prmap(map<int,int> mp) {
    for (auto i:mp) {
        cout << i.first <<":"<<i.second<<", ";
    }
    cout << endl;
}

std::vector<signed> beechtree(signed N, signed M, std::vector<signed> P, std::vector<signed> C) {
    int n=N; int m=M;
    //if any vertex has 2 children with same color then it jambloats
    //also any vertex must be before its child in ordering since if ind[parent]>ind[child] then there are
    //ind[parent]-1 edges considered for child contradiction hyperbloat
    //also consider in the order of a permutation, for each color, it starts being on and turns off at some point
    //in the edges leading from a node to its children
    //thus consider the vertices which have each color in children, and make an ordering
    //if the ordering is consistent, hope it works
    //insufficient
    //increasing order of subtree size?
    //add condition that if color of par[x]->x and color of par[y]->y are the same, put from the par with larger subtree into par with smaller subtree
    //this also deals with the 2 children same color thing

    vector<int> subsize(n,1);
    vector<vector<int>> subtree(n);
    vector<vector<int>> sons(n);
    for (int i=0; i<n; i++) subtree[i] = {i};
    for (int i=n-1; i>=1; i--) {
        subsize[P[i]]+=subsize[i];
        for (int j:subtree[i]) {
            subtree[P[i]].push_back(j);
        }
        sons[P[i]].push_back(i);
    }
    vector<int> ans(n,1);
    for (int root=0; root<n; root++) {
        vector<int> relevant=subtree[root];
        map<int,int> revcoords;
        for (int j=0; j<relevant.size(); j++) {
            revcoords[relevant[j]] = j;
        }
        /*vector<vector<int>> adjlist(relevant.size());
        vector<vector<int>> sonsv2(relevant.size());
        for (int i:relevant) {
            for (int j:sons[i]) {
                adjlist[revcoords[i]].push_back(revcoords[j]);
                sonsv2[revcoords[i]].push_back(revcoords[j]);
            }
        }
        for (int j=1; j<dep1.size(); j++) {
            if (subsize[relevant[dep1[j-1]]]<subsize[relevant[dep1[j]]]) {
                adjlist[dep1[j]].push_back(dep1[j-1]);
            }
        }
        map<int,vector<int>> revcols;
        for (int i:relevant) {
            if (i!=root) {
                revcols[C[i]].push_back(revcoords[i]);
            }
        }
        for (auto i:revcols) {
            vector<int> dep1 = i.second;
            sort(dep1.begin(), dep1.end(), [&](const int i1, const int i2) {
                return subsize[relevant[i1]]<subsize[relevant[i2]]
            });
            for (int j=1; j<dep1.size(); j++) {
                if (subsize[relevant[dep1[j-1]]]<subsize[relevant[dep1[j]]]) {
                    adjlist[dep1[j]].push_back(dep1[j-1]);
                }
            }
        }*/
       
        vector<int> dep1; for (int i=0; i<relevant.size(); i++) dep1.push_back(i);
        sort(dep1.begin(), dep1.end(), [&](const int i1, const int i2) {
            return subsize[relevant[i1]]<subsize[relevant[i2]];
        });
        reverse(dep1.begin(), dep1.end());
        map<int,int> colors;
        int fail = 0;
        for (int i=0; i<dep1.size(); i++) {
            int node = dep1[i];
            set<int> subbers;
            map<int,int> colors2;
            for (int j:sons[relevant[node]]) {
                subbers.insert(C[j]);
                if (i>0 && colors[C[j]]<subsize[j]) {
                    fail=1;
                }
                colors2[C[j]] = subsize[j];
            }
            colors=colors2;
            if (subbers.size()<sons[relevant[node]].size()) {
                fail=1;
            }
            //cout << "DOING " << root <<" " << i << " " << node << endl;
            //prmap(colors);
        }
        ans[root] = 1-fail;
        
    }
    vector<signed> ans2(ans.begin(), ans.end());
    return ans2;
}

Compilation message

beechtree.cpp: In function 'std::vector<int> beechtree(int, int, std::vector<int>, std::vector<int>)':
beechtree.cpp:43:24: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   43 |         for (int j=0; j<relevant.size(); j++) {
      |                       ~^~~~~~~~~~~~~~~~
beechtree.cpp:77:42: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   77 |         vector<int> dep1; for (int i=0; i<relevant.size(); i++) dep1.push_back(i);
      |                                         ~^~~~~~~~~~~~~~~~
beechtree.cpp:84:24: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   84 |         for (int i=0; i<dep1.size(); i++) {
      |                       ~^~~~~~~~~~~~
beechtree.cpp:15:18: warning: unused variable 'm' [-Wunused-variable]
   15 |     int n=N; int m=M;
      |                  ^

Subtask #0
0.0 / 0.0

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

Subtask #1
9.0 / 9.0

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

Subtask #2
0.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Runtime error 1650 ms 2097152 KB Execution killed with signal 9
8 Halted 0 ms 0 KB -

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 2 ms 856 KB Output is correct
13 Correct 1 ms 600 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 117 ms 24780 KB Output is correct
16 Correct 114 ms 23236 KB Output is correct
17 Correct 132 ms 23756 KB Output is correct
18 Correct 112 ms 24272 KB Output is correct

Subtask #4
0.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 436 KB Output is correct
5 Runtime error 1650 ms 2097152 KB Execution killed with signal 9
6 Halted 0 ms 0 KB -

Subtask #5
14.0 / 14.0

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

Subtask #6
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 436 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 436 KB Output is correct
13 Correct 0 ms 440 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 432 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 440 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 344 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 277 ms 20824 KB Output is correct
26 Correct 289 ms 20936 KB Output is correct
27 Correct 282 ms 20932 KB Output is correct
28 Correct 315 ms 20824 KB Output is correct
29 Correct 260 ms 20828 KB Output is correct
30 Correct 27 ms 2908 KB Output is correct
31 Correct 5 ms 860 KB Output is correct
32 Correct 5 ms 860 KB Output is correct
33 Correct 11 ms 1116 KB Output is correct
34 Correct 6 ms 860 KB Output is correct
35 Correct 4 ms 860 KB Output is correct
36 Correct 3 ms 860 KB Output is correct
37 Correct 78 ms 6072 KB Output is correct
38 Correct 29 ms 3416 KB Output is correct

Subtask #7
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 436 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 436 KB Output is correct
20 Correct 0 ms 440 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 432 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 440 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 344 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 0 ms 436 KB Output is correct
36 Correct 0 ms 344 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 3 ms 604 KB Output is correct
39 Correct 3 ms 604 KB Output is correct
40 Correct 3 ms 604 KB Output is correct
41 Correct 3 ms 604 KB Output is correct
42 Correct 1 ms 344 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 0 ms 348 KB Output is correct
45 Correct 0 ms 348 KB Output is correct
46 Correct 1 ms 344 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 1 ms 348 KB Output is correct
49 Correct 1 ms 348 KB Output is correct
50 Correct 1 ms 348 KB Output is correct
51 Correct 0 ms 344 KB Output is correct
52 Correct 1 ms 604 KB Output is correct
53 Correct 2 ms 856 KB Output is correct
54 Correct 1 ms 600 KB Output is correct
55 Correct 1 ms 604 KB Output is correct
56 Correct 1 ms 348 KB Output is correct
57 Correct 1 ms 348 KB Output is correct
58 Correct 1 ms 348 KB Output is correct
59 Correct 1 ms 604 KB Output is correct
60 Correct 1 ms 348 KB Output is correct
61 Correct 1 ms 348 KB Output is correct
62 Correct 1 ms 344 KB Output is correct
63 Correct 0 ms 348 KB Output is correct
64 Correct 0 ms 348 KB Output is correct
65 Correct 1 ms 684 KB Output is correct
66 Correct 1 ms 348 KB Output is correct
67 Correct 2 ms 344 KB Output is correct
68 Correct 1 ms 344 KB Output is correct
69 Correct 277 ms 20824 KB Output is correct
70 Correct 289 ms 20936 KB Output is correct
71 Correct 282 ms 20932 KB Output is correct
72 Correct 315 ms 20824 KB Output is correct
73 Correct 260 ms 20828 KB Output is correct
74 Correct 27 ms 2908 KB Output is correct
75 Correct 5 ms 860 KB Output is correct
76 Correct 5 ms 860 KB Output is correct
77 Correct 11 ms 1116 KB Output is correct
78 Correct 6 ms 860 KB Output is correct
79 Correct 4 ms 860 KB Output is correct
80 Correct 3 ms 860 KB Output is correct
81 Correct 78 ms 6072 KB Output is correct
82 Correct 29 ms 3416 KB Output is correct
83 Correct 281 ms 20856 KB Output is correct
84 Correct 259 ms 20824 KB Output is correct
85 Correct 362 ms 20828 KB Output is correct
86 Correct 311 ms 20940 KB Output is correct
87 Correct 42 ms 2140 KB Output is correct
88 Correct 8 ms 860 KB Output is correct
89 Correct 89 ms 8284 KB Output is correct
90 Correct 14 ms 1884 KB Output is correct
91 Correct 3 ms 860 KB Output is correct
92 Correct 5 ms 1064 KB Output is correct
93 Correct 11 ms 1372 KB Output is correct
94 Correct 3 ms 860 KB Output is correct
95 Correct 3 ms 732 KB Output is correct
96 Correct 3 ms 860 KB Output is correct
97 Correct 77 ms 6140 KB Output is correct
98 Correct 28 ms 3160 KB Output is correct

Subtask #8
0.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 436 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 436 KB Output is correct
13 Correct 0 ms 440 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 432 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 440 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 344 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 277 ms 20824 KB Output is correct
26 Correct 289 ms 20936 KB Output is correct
27 Correct 282 ms 20932 KB Output is correct
28 Correct 315 ms 20824 KB Output is correct
29 Correct 260 ms 20828 KB Output is correct
30 Correct 27 ms 2908 KB Output is correct
31 Correct 5 ms 860 KB Output is correct
32 Correct 5 ms 860 KB Output is correct
33 Correct 11 ms 1116 KB Output is correct
34 Correct 6 ms 860 KB Output is correct
35 Correct 4 ms 860 KB Output is correct
36 Correct 3 ms 860 KB Output is correct
37 Correct 78 ms 6072 KB Output is correct
38 Correct 29 ms 3416 KB Output is correct
39 Runtime error 1647 ms 2097152 KB Execution killed with signal 9
40 Halted 0 ms 0 KB -

Subtask #9
0.0 / 12.0

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