oj.uz

Submission #952965

# Submission time Handle Problem Language Result Execution time Memory
952965 2024-03-25T08:00:33 Z Whisper Railway (BOI17_railway) C++17
100 / 100
 146 ms 74956 KB 
#include <bits/stdc++.h>

using namespace std;
using ll = long long;

#define int long long
#define FOR(i, a, b) for (int i = a; i <= b; i++)
#define FORD(i, a, b) for (int i = b; i >= a; i --)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPD(i, n) for (int i = n - 1; i >= 0; --i)

#define MASK(i) (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)

constexpr ll LINF = (1ll << 60);
constexpr int INF = (1ll << 30);
constexpr int Mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

void setupIO(){
    #define name "Whisper"
    //Phu Trong from Nguyen Tat Thanh High School for gifted student
    srand(time(NULL));
    cin.tie(nullptr)->sync_with_stdio(false); cout.tie(nullptr);
    //freopen(name".inp", "r", stdin);
    //freopen(name".out", "w", stdout);
    cout << fixed << setprecision(10);
}

template <class X, class Y>
    bool minimize(X &x, const Y &y){
        X eps = 1e-9;
        if (x > y + eps) {x = y; return 1;}
        return 0;
    }

template <class X, class Y>
    bool maximize(X &x, const Y &y){
        X eps = 1e-9;
        if (x + eps < y) {x = y; return 1;}
        return 0;
    }
const int MAX = 5e5 + 5;

int numNode, numQuery, numNeed;
vector<pair<int, int>> G[MAX];
unordered_map<int, int> cnt[MAX];
vector<int> ans;

int n[MAX];
void dfs(int u, int p, int edgeId){
    for (pair<int, int>&x : G[u]){
        int v = x.first, id = x.second;
        if(v ^ p){
            dfs(v, u, id);
            if ((int)cnt[u].size() < (int)cnt[v].size()) swap(cnt[u], cnt[v]);
            for (auto&[x, c] : cnt[v]){
                cnt[u][x] += c;
                if (cnt[u][x] == n[x]) cnt[u].erase(x);
            }
        }
    }
    if (cnt[u].size() >= numNeed)
        ans.push_back(edgeId);
}
void Whisper(){
    cin >> numNode >> numQuery >> numNeed;
    for(int i = 1; i < numNode; ++i){
        int u, v; cin >> u >> v;
        G[u].emplace_back(v, i);
        G[v].emplace_back(u, i);
    }
    for (int i = 1; i <= numQuery; ++i){
        cin >> n[i];
        for (int v = 1; v <= n[i]; ++v){
            int x; cin >> x;
            cnt[x][i]++;
        }
    }
    dfs(1, 0, 0);
    cout << ans.size() << '\n';
    sort(ans.begin(), ans.end());
    for (int&v : ans) cout << v << ' ';
}


signed main(){
    setupIO();
    int Test = 1;
//    cin >> Test;
    for ( int i = 1 ; i <= Test ; i++ ){
        Whisper();
        if (i < Test) cout << '\n';
    }
}

Compilation message

railway.cpp: In function 'void dfs(long long int, long long int, long long int)':
railway.cpp:63:23: warning: comparison of integer expressions of different signedness: 'std::unordered_map<long long int, long long int>::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
   63 |     if (cnt[u].size() >= numNeed)
      |         ~~~~~~~~~~~~~~^~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 41040 KB Output is correct
2 Correct 15 ms 42016 KB Output is correct
3 Correct 15 ms 41864 KB Output is correct
4 Correct 10 ms 41052 KB Output is correct
5 Correct 11 ms 41052 KB Output is correct
6 Correct 15 ms 42900 KB Output is correct
7 Correct 14 ms 42264 KB Output is correct
8 Correct 16 ms 42076 KB Output is correct
9 Correct 14 ms 42236 KB Output is correct
10 Correct 11 ms 41048 KB Output is correct
11 Correct 10 ms 41288 KB Output is correct
12 Correct 11 ms 41052 KB Output is correct
13 Correct 11 ms 41052 KB Output is correct
14 Correct 11 ms 41052 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 41040 KB Output is correct
2 Correct 15 ms 42016 KB Output is correct
3 Correct 15 ms 41864 KB Output is correct
4 Correct 10 ms 41052 KB Output is correct
5 Correct 11 ms 41052 KB Output is correct
6 Correct 15 ms 42900 KB Output is correct
7 Correct 14 ms 42264 KB Output is correct
8 Correct 16 ms 42076 KB Output is correct
9 Correct 14 ms 42236 KB Output is correct
10 Correct 11 ms 41048 KB Output is correct
11 Correct 10 ms 41288 KB Output is correct
12 Correct 11 ms 41052 KB Output is correct
13 Correct 11 ms 41052 KB Output is correct
14 Correct 11 ms 41052 KB Output is correct
15 Correct 41 ms 47520 KB Output is correct
16 Correct 35 ms 47696 KB Output is correct
17 Correct 38 ms 47704 KB Output is correct
18 Correct 18 ms 42840 KB Output is correct
19 Correct 14 ms 42332 KB Output is correct
20 Correct 32 ms 46808 KB Output is correct
21 Correct 35 ms 46520 KB Output is correct
22 Correct 10 ms 41048 KB Output is correct
23 Correct 16 ms 42076 KB Output is correct
24 Correct 15 ms 41820 KB Output is correct
25 Correct 12 ms 41048 KB Output is correct
26 Correct 10 ms 41052 KB Output is correct
27 Correct 14 ms 42844 KB Output is correct
28 Correct 17 ms 42072 KB Output is correct
29 Correct 13 ms 42076 KB Output is correct
30 Correct 15 ms 42072 KB Output is correct
31 Correct 11 ms 41052 KB Output is correct
32 Correct 10 ms 41292 KB Output is correct
33 Correct 10 ms 41048 KB Output is correct
34 Correct 10 ms 41052 KB Output is correct
35 Correct 10 ms 41052 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 95 ms 74640 KB Output is correct
2 Correct 11 ms 41256 KB Output is correct
3 Correct 88 ms 74512 KB Output is correct
4 Correct 92 ms 73680 KB Output is correct
5 Correct 94 ms 71668 KB Output is correct
6 Correct 92 ms 72264 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 76 ms 63316 KB Output is correct
2 Correct 90 ms 59292 KB Output is correct
3 Correct 99 ms 64612 KB Output is correct
4 Correct 104 ms 64868 KB Output is correct
5 Correct 105 ms 64608 KB Output is correct
6 Correct 76 ms 63584 KB Output is correct
7 Correct 76 ms 63588 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 76 ms 63316 KB Output is correct
2 Correct 90 ms 59292 KB Output is correct
3 Correct 99 ms 64612 KB Output is correct
4 Correct 104 ms 64868 KB Output is correct
5 Correct 105 ms 64608 KB Output is correct
6 Correct 76 ms 63584 KB Output is correct
7 Correct 76 ms 63588 KB Output is correct
8 Correct 85 ms 66076 KB Output is correct
9 Correct 85 ms 66224 KB Output is correct
10 Correct 88 ms 71112 KB Output is correct
11 Correct 85 ms 71104 KB Output is correct
12 Correct 71 ms 57300 KB Output is correct
13 Correct 65 ms 57292 KB Output is correct
14 Correct 80 ms 58044 KB Output is correct
15 Correct 97 ms 58196 KB Output is correct
16 Correct 106 ms 65892 KB Output is correct
17 Correct 105 ms 66068 KB Output is correct
18 Correct 102 ms 63844 KB Output is correct
19 Correct 108 ms 60048 KB Output is correct
20 Correct 80 ms 63840 KB Output is correct
21 Correct 82 ms 64352 KB Output is correct
22 Correct 83 ms 63968 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 41040 KB Output is correct
2 Correct 15 ms 42016 KB Output is correct
3 Correct 15 ms 41864 KB Output is correct
4 Correct 10 ms 41052 KB Output is correct
5 Correct 11 ms 41052 KB Output is correct
6 Correct 15 ms 42900 KB Output is correct
7 Correct 14 ms 42264 KB Output is correct
8 Correct 16 ms 42076 KB Output is correct
9 Correct 14 ms 42236 KB Output is correct
10 Correct 11 ms 41048 KB Output is correct
11 Correct 10 ms 41288 KB Output is correct
12 Correct 11 ms 41052 KB Output is correct
13 Correct 11 ms 41052 KB Output is correct
14 Correct 11 ms 41052 KB Output is correct
15 Correct 41 ms 47520 KB Output is correct
16 Correct 35 ms 47696 KB Output is correct
17 Correct 38 ms 47704 KB Output is correct
18 Correct 18 ms 42840 KB Output is correct
19 Correct 14 ms 42332 KB Output is correct
20 Correct 32 ms 46808 KB Output is correct
21 Correct 35 ms 46520 KB Output is correct
22 Correct 10 ms 41048 KB Output is correct
23 Correct 16 ms 42076 KB Output is correct
24 Correct 15 ms 41820 KB Output is correct
25 Correct 12 ms 41048 KB Output is correct
26 Correct 10 ms 41052 KB Output is correct
27 Correct 14 ms 42844 KB Output is correct
28 Correct 17 ms 42072 KB Output is correct
29 Correct 13 ms 42076 KB Output is correct
30 Correct 15 ms 42072 KB Output is correct
31 Correct 11 ms 41052 KB Output is correct
32 Correct 10 ms 41292 KB Output is correct
33 Correct 10 ms 41048 KB Output is correct
34 Correct 10 ms 41052 KB Output is correct
35 Correct 10 ms 41052 KB Output is correct
36 Correct 95 ms 74640 KB Output is correct
37 Correct 11 ms 41256 KB Output is correct
38 Correct 88 ms 74512 KB Output is correct
39 Correct 92 ms 73680 KB Output is correct
40 Correct 94 ms 71668 KB Output is correct
41 Correct 92 ms 72264 KB Output is correct
42 Correct 76 ms 63316 KB Output is correct
43 Correct 90 ms 59292 KB Output is correct
44 Correct 99 ms 64612 KB Output is correct
45 Correct 104 ms 64868 KB Output is correct
46 Correct 105 ms 64608 KB Output is correct
47 Correct 76 ms 63584 KB Output is correct
48 Correct 76 ms 63588 KB Output is correct
49 Correct 85 ms 66076 KB Output is correct
50 Correct 85 ms 66224 KB Output is correct
51 Correct 88 ms 71112 KB Output is correct
52 Correct 85 ms 71104 KB Output is correct
53 Correct 71 ms 57300 KB Output is correct
54 Correct 65 ms 57292 KB Output is correct
55 Correct 80 ms 58044 KB Output is correct
56 Correct 97 ms 58196 KB Output is correct
57 Correct 106 ms 65892 KB Output is correct
58 Correct 105 ms 66068 KB Output is correct
59 Correct 102 ms 63844 KB Output is correct
60 Correct 108 ms 60048 KB Output is correct
61 Correct 80 ms 63840 KB Output is correct
62 Correct 82 ms 64352 KB Output is correct
63 Correct 83 ms 63968 KB Output is correct
64 Correct 85 ms 65196 KB Output is correct
65 Correct 146 ms 74956 KB Output is correct
66 Correct 127 ms 69368 KB Output is correct
67 Correct 105 ms 63980 KB Output is correct
68 Correct 57 ms 54348 KB Output is correct
69 Correct 56 ms 54120 KB Output is correct
70 Correct 86 ms 66220 KB Output is correct
71 Correct 82 ms 66024 KB Output is correct
72 Correct 10 ms 41048 KB Output is correct
73 Correct 14 ms 41820 KB Output is correct
74 Correct 13 ms 41820 KB Output is correct
75 Correct 10 ms 41376 KB Output is correct
76 Correct 11 ms 41052 KB Output is correct
77 Correct 15 ms 42896 KB Output is correct
78 Correct 14 ms 42072 KB Output is correct
79 Correct 13 ms 42076 KB Output is correct
80 Correct 14 ms 42072 KB Output is correct
81 Correct 11 ms 41052 KB Output is correct
82 Correct 12 ms 41228 KB Output is correct
83 Correct 10 ms 41052 KB Output is correct
84 Correct 11 ms 41296 KB Output is correct
85 Correct 11 ms 41052 KB Output is correct
86 Correct 34 ms 47444 KB Output is correct
87 Correct 34 ms 47708 KB Output is correct
88 Correct 34 ms 47708 KB Output is correct
89 Correct 15 ms 42844 KB Output is correct
90 Correct 14 ms 42328 KB Output is correct
91 Correct 34 ms 46808 KB Output is correct
92 Correct 35 ms 46684 KB Output is correct
93 Correct 10 ms 41052 KB Output is correct
94 Correct 95 ms 74596 KB Output is correct
95 Correct 92 ms 74332 KB Output is correct
96 Correct 88 ms 73724 KB Output is correct
97 Correct 88 ms 71648 KB Output is correct
98 Correct 90 ms 72140 KB Output is correct
99 Correct 120 ms 68452 KB Output is correct
100 Correct 108 ms 65584 KB Output is correct
101 Correct 140 ms 65888 KB Output is correct
102 Correct 86 ms 59988 KB Output is correct
103 Correct 77 ms 63620 KB Output is correct
104 Correct 87 ms 64356 KB Output is correct
105 Correct 78 ms 63404 KB Output is correct
106 Correct 82 ms 66388 KB Output is correct
107 Correct 80 ms 66168 KB Output is correct
108 Correct 84 ms 71268 KB Output is correct
109 Correct 85 ms 71116 KB Output is correct
110 Correct 68 ms 57348 KB Output is correct
111 Correct 62 ms 57292 KB Output is correct
112 Correct 79 ms 57940 KB Output is correct
113 Correct 81 ms 57932 KB Output is correct