oj.uz

Submission #676384

# Submission time Handle Problem Language Result Execution time Memory
676384 2022-12-30T15:05:14 Z flashhh Railway (BOI17_railway) C++17
100 / 100
 201 ms 42196 KB 
#include <bits/stdc++.h>

using namespace std;

int numVertices, numPlans, minimumPlans;
vector<int> acceptedEdges;
vector<int> numVerticesOnPlan;
vector<vector<int> > plansOfVertice;
vector<vector<pair<int,int> > > adj;

void Read() {
    cin >> numVertices >> numPlans >> minimumPlans;

    numVerticesOnPlan.resize(numPlans);
    adj.resize(numVertices);
    plansOfVertice.resize(numVertices);
    
    for (int numEdge = 0; numEdge < numVertices - 1; ++numEdge) {
        int u,v; cin >> u >> v;
        --u; --v;

        adj[u].emplace_back(numEdge, v);
        adj[v].emplace_back(numEdge, u);
    }

    for (int numPlan = 0; numPlan < numPlans; ++numPlan) {
        int planQuantity; cin >> planQuantity;
        
        numVerticesOnPlan[numPlan] = planQuantity;

        while (planQuantity--) {
            int vertice; cin >> vertice;
            --vertice;

            plansOfVertice[vertice].push_back(numPlan);
        }
    }
}

void calculate() {
    vector<map<int,int> > myMap;

    myMap.resize(numVertices);

    auto dfs = [&] (int u, int cha, int prevEdge, auto&& dfs) -> void {
        for (int plan : plansOfVertice[u]) ++myMap[u][plan];

        for (auto [numEdge, v] : adj[u]) {
            if (v == cha) continue;
            dfs(v, u, numEdge, dfs);

            if (myMap[u].size() < myMap[v].size()) swap(myMap[u], myMap[v]);

            for (map<int,int> :: iterator it = myMap[v].begin(); it != myMap[v].end(); ++it) {
                int plan = it -> first; int quantity = it -> second;

                myMap[u][plan] += quantity;
                if (myMap[u][plan] == numVerticesOnPlan[plan]) myMap[u].erase(plan);
            }
        }
        
        if (myMap[u].size() >= minimumPlans) acceptedEdges.push_back(prevEdge);
    };

    dfs(0, -1, -1, dfs);

    sort(acceptedEdges.begin(), acceptedEdges.end());

    cout << acceptedEdges.size() <<'\n';
    for (auto numEdge : acceptedEdges) cout << numEdge + 1 <<" "; cout <<'\n';
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    Read();
    calculate();

    return 0;
}

Compilation message

railway.cpp: In function 'void calculate()':
railway.cpp:70:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   70 |     for (auto numEdge : acceptedEdges) cout << numEdge + 1 <<" "; cout <<'\n';
      |     ^~~
railway.cpp:70:67: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   70 |     for (auto numEdge : acceptedEdges) cout << numEdge + 1 <<" "; cout <<'\n';
      |                                                                   ^~~~
railway.cpp: In instantiation of 'calculate()::<lambda(int, int, int, auto:23&&)> [with auto:23 = calculate()::<lambda(int, int, int, auto:23&&)>&]':
railway.cpp:65:23:   required from here
railway.cpp:62:29: warning: comparison of integer expressions of different signedness: 'std::map<int, int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   62 |         if (myMap[u].size() >= minimumPlans) acceptedEdges.push_back(prevEdge);
      |             ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 4 ms 1748 KB Output is correct
3 Correct 4 ms 1748 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 7 ms 2696 KB Output is correct
7 Correct 4 ms 1876 KB Output is correct
8 Correct 4 ms 1856 KB Output is correct
9 Correct 4 ms 1876 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 4 ms 1748 KB Output is correct
3 Correct 4 ms 1748 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 7 ms 2696 KB Output is correct
7 Correct 4 ms 1876 KB Output is correct
8 Correct 4 ms 1856 KB Output is correct
9 Correct 4 ms 1876 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 35 ms 7708 KB Output is correct
16 Correct 35 ms 7716 KB Output is correct
17 Correct 35 ms 7756 KB Output is correct
18 Correct 6 ms 2772 KB Output is correct
19 Correct 4 ms 2004 KB Output is correct
20 Correct 39 ms 7028 KB Output is correct
21 Correct 40 ms 7112 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 7 ms 1748 KB Output is correct
24 Correct 5 ms 1748 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 5 ms 2644 KB Output is correct
28 Correct 4 ms 1876 KB Output is correct
29 Correct 4 ms 1876 KB Output is correct
30 Correct 4 ms 1876 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 0 ms 212 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 114 ms 38872 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 111 ms 40392 KB Output is correct
4 Correct 112 ms 39940 KB Output is correct
5 Correct 91 ms 39676 KB Output is correct
6 Correct 105 ms 42196 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 105 ms 29004 KB Output is correct
2 Correct 122 ms 23120 KB Output is correct
3 Correct 134 ms 28912 KB Output is correct
4 Correct 124 ms 29552 KB Output is correct
5 Correct 139 ms 29328 KB Output is correct
6 Correct 101 ms 29324 KB Output is correct
7 Correct 100 ms 29320 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 105 ms 29004 KB Output is correct
2 Correct 122 ms 23120 KB Output is correct
3 Correct 134 ms 28912 KB Output is correct
4 Correct 124 ms 29552 KB Output is correct
5 Correct 139 ms 29328 KB Output is correct
6 Correct 101 ms 29324 KB Output is correct
7 Correct 100 ms 29320 KB Output is correct
8 Correct 94 ms 28940 KB Output is correct
9 Correct 96 ms 28824 KB Output is correct
10 Correct 80 ms 37632 KB Output is correct
11 Correct 83 ms 37636 KB Output is correct
12 Correct 62 ms 20304 KB Output is correct
13 Correct 62 ms 20276 KB Output is correct
14 Correct 107 ms 24524 KB Output is correct
15 Correct 107 ms 24780 KB Output is correct
16 Correct 134 ms 30784 KB Output is correct
17 Correct 144 ms 31088 KB Output is correct
18 Correct 128 ms 28892 KB Output is correct
19 Correct 121 ms 24012 KB Output is correct
20 Correct 108 ms 29472 KB Output is correct
21 Correct 106 ms 29628 KB Output is correct
22 Correct 103 ms 29444 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 4 ms 1748 KB Output is correct
3 Correct 4 ms 1748 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 7 ms 2696 KB Output is correct
7 Correct 4 ms 1876 KB Output is correct
8 Correct 4 ms 1856 KB Output is correct
9 Correct 4 ms 1876 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 35 ms 7708 KB Output is correct
16 Correct 35 ms 7716 KB Output is correct
17 Correct 35 ms 7756 KB Output is correct
18 Correct 6 ms 2772 KB Output is correct
19 Correct 4 ms 2004 KB Output is correct
20 Correct 39 ms 7028 KB Output is correct
21 Correct 40 ms 7112 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 7 ms 1748 KB Output is correct
24 Correct 5 ms 1748 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 5 ms 2644 KB Output is correct
28 Correct 4 ms 1876 KB Output is correct
29 Correct 4 ms 1876 KB Output is correct
30 Correct 4 ms 1876 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 114 ms 38872 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 111 ms 40392 KB Output is correct
39 Correct 112 ms 39940 KB Output is correct
40 Correct 91 ms 39676 KB Output is correct
41 Correct 105 ms 42196 KB Output is correct
42 Correct 105 ms 29004 KB Output is correct
43 Correct 122 ms 23120 KB Output is correct
44 Correct 134 ms 28912 KB Output is correct
45 Correct 124 ms 29552 KB Output is correct
46 Correct 139 ms 29328 KB Output is correct
47 Correct 101 ms 29324 KB Output is correct
48 Correct 100 ms 29320 KB Output is correct
49 Correct 94 ms 28940 KB Output is correct
50 Correct 96 ms 28824 KB Output is correct
51 Correct 80 ms 37632 KB Output is correct
52 Correct 83 ms 37636 KB Output is correct
53 Correct 62 ms 20304 KB Output is correct
54 Correct 62 ms 20276 KB Output is correct
55 Correct 107 ms 24524 KB Output is correct
56 Correct 107 ms 24780 KB Output is correct
57 Correct 134 ms 30784 KB Output is correct
58 Correct 144 ms 31088 KB Output is correct
59 Correct 128 ms 28892 KB Output is correct
60 Correct 121 ms 24012 KB Output is correct
61 Correct 108 ms 29472 KB Output is correct
62 Correct 106 ms 29628 KB Output is correct
63 Correct 103 ms 29444 KB Output is correct
64 Correct 110 ms 31108 KB Output is correct
65 Correct 201 ms 38304 KB Output is correct
66 Correct 158 ms 34808 KB Output is correct
67 Correct 130 ms 30284 KB Output is correct
68 Correct 59 ms 19536 KB Output is correct
69 Correct 62 ms 19460 KB Output is correct
70 Correct 106 ms 31960 KB Output is correct
71 Correct 94 ms 30688 KB Output is correct
72 Correct 0 ms 212 KB Output is correct
73 Correct 4 ms 1876 KB Output is correct
74 Correct 4 ms 1876 KB Output is correct
75 Correct 0 ms 212 KB Output is correct
76 Correct 1 ms 212 KB Output is correct
77 Correct 6 ms 2772 KB Output is correct
78 Correct 6 ms 2004 KB Output is correct
79 Correct 4 ms 1876 KB Output is correct
80 Correct 4 ms 1992 KB Output is correct
81 Correct 1 ms 212 KB Output is correct
82 Correct 0 ms 212 KB Output is correct
83 Correct 0 ms 212 KB Output is correct
84 Correct 1 ms 212 KB Output is correct
85 Correct 1 ms 212 KB Output is correct
86 Correct 36 ms 8128 KB Output is correct
87 Correct 35 ms 8248 KB Output is correct
88 Correct 37 ms 8216 KB Output is correct
89 Correct 7 ms 2892 KB Output is correct
90 Correct 5 ms 2124 KB Output is correct
91 Correct 38 ms 7688 KB Output is correct
92 Correct 37 ms 7672 KB Output is correct
93 Correct 1 ms 212 KB Output is correct
94 Correct 121 ms 40728 KB Output is correct
95 Correct 107 ms 40380 KB Output is correct
96 Correct 107 ms 39848 KB Output is correct
97 Correct 106 ms 39696 KB Output is correct
98 Correct 111 ms 42072 KB Output is correct
99 Correct 142 ms 35188 KB Output is correct
100 Correct 135 ms 32332 KB Output is correct
101 Correct 132 ms 32616 KB Output is correct
102 Correct 122 ms 25472 KB Output is correct
103 Correct 102 ms 31072 KB Output is correct
104 Correct 103 ms 31428 KB Output is correct
105 Correct 102 ms 30848 KB Output is correct
106 Correct 97 ms 31076 KB Output is correct
107 Correct 98 ms 31156 KB Output is correct
108 Correct 79 ms 39360 KB Output is correct
109 Correct 79 ms 39380 KB Output is correct
110 Correct 63 ms 21696 KB Output is correct
111 Correct 64 ms 21712 KB Output is correct
112 Correct 108 ms 26188 KB Output is correct
113 Correct 103 ms 26220 KB Output is correct