oj.uz

Submission #952967

# Submission time Handle Problem Language Result Execution time Memory
952967 2024-03-25T08:03:01 Z vjudge1 Railway (BOI17_railway) C++17
100 / 100
 143 ms 72952 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 10 ms 41048 KB Output is correct
2 Correct 17 ms 41820 KB Output is correct
3 Correct 13 ms 41816 KB Output is correct
4 Correct 10 ms 41052 KB Output is correct
5 Correct 11 ms 41052 KB Output is correct
6 Correct 14 ms 42556 KB Output is correct
7 Correct 13 ms 42076 KB Output is correct
8 Correct 13 ms 42076 KB Output is correct
9 Correct 13 ms 42148 KB Output is correct
10 Correct 10 ms 41052 KB Output is correct
11 Correct 11 ms 41224 KB Output is correct
12 Correct 10 ms 41048 KB Output is correct
13 Correct 11 ms 41048 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 10 ms 41048 KB Output is correct
2 Correct 17 ms 41820 KB Output is correct
3 Correct 13 ms 41816 KB Output is correct
4 Correct 10 ms 41052 KB Output is correct
5 Correct 11 ms 41052 KB Output is correct
6 Correct 14 ms 42556 KB Output is correct
7 Correct 13 ms 42076 KB Output is correct
8 Correct 13 ms 42076 KB Output is correct
9 Correct 13 ms 42148 KB Output is correct
10 Correct 10 ms 41052 KB Output is correct
11 Correct 11 ms 41224 KB Output is correct
12 Correct 10 ms 41048 KB Output is correct
13 Correct 11 ms 41048 KB Output is correct
14 Correct 11 ms 41052 KB Output is correct
15 Correct 34 ms 46940 KB Output is correct
16 Correct 38 ms 47256 KB Output is correct
17 Correct 35 ms 47184 KB Output is correct
18 Correct 15 ms 42588 KB Output is correct
19 Correct 14 ms 42076 KB Output is correct
20 Correct 31 ms 46288 KB Output is correct
21 Correct 35 ms 46168 KB Output is correct
22 Correct 10 ms 41048 KB Output is correct
23 Correct 13 ms 41816 KB Output is correct
24 Correct 13 ms 41960 KB Output is correct
25 Correct 10 ms 41052 KB Output is correct
26 Correct 10 ms 41052 KB Output is correct
27 Correct 14 ms 42788 KB Output is correct
28 Correct 14 ms 42272 KB Output is correct
29 Correct 14 ms 42076 KB Output is correct
30 Correct 16 ms 42084 KB Output is correct
31 Correct 11 ms 41304 KB Output is correct
32 Correct 10 ms 41304 KB Output is correct
33 Correct 11 ms 41052 KB Output is correct
34 Correct 11 ms 41052 KB Output is correct
35 Correct 11 ms 41052 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 97 ms 72860 KB Output is correct
2 Correct 10 ms 41052 KB Output is correct
3 Correct 92 ms 72552 KB Output is correct
4 Correct 85 ms 71892 KB Output is correct
5 Correct 92 ms 69856 KB Output is correct
6 Correct 91 ms 70148 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 77 ms 61612 KB Output is correct
2 Correct 91 ms 57660 KB Output is correct
3 Correct 97 ms 62844 KB Output is correct
4 Correct 101 ms 63072 KB Output is correct
5 Correct 104 ms 62764 KB Output is correct
6 Correct 84 ms 61836 KB Output is correct
7 Correct 78 ms 61768 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 77 ms 61612 KB Output is correct
2 Correct 91 ms 57660 KB Output is correct
3 Correct 97 ms 62844 KB Output is correct
4 Correct 101 ms 63072 KB Output is correct
5 Correct 104 ms 62764 KB Output is correct
6 Correct 84 ms 61836 KB Output is correct
7 Correct 78 ms 61768 KB Output is correct
8 Correct 100 ms 64364 KB Output is correct
9 Correct 85 ms 64432 KB Output is correct
10 Correct 83 ms 69320 KB Output is correct
11 Correct 84 ms 69536 KB Output is correct
12 Correct 63 ms 56100 KB Output is correct
13 Correct 68 ms 56084 KB Output is correct
14 Correct 78 ms 56444 KB Output is correct
15 Correct 82 ms 56404 KB Output is correct
16 Correct 104 ms 64052 KB Output is correct
17 Correct 133 ms 64136 KB Output is correct
18 Correct 99 ms 62088 KB Output is correct
19 Correct 89 ms 58372 KB Output is correct
20 Correct 88 ms 62044 KB Output is correct
21 Correct 79 ms 62604 KB Output is correct
22 Correct 80 ms 62304 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 41048 KB Output is correct
2 Correct 17 ms 41820 KB Output is correct
3 Correct 13 ms 41816 KB Output is correct
4 Correct 10 ms 41052 KB Output is correct
5 Correct 11 ms 41052 KB Output is correct
6 Correct 14 ms 42556 KB Output is correct
7 Correct 13 ms 42076 KB Output is correct
8 Correct 13 ms 42076 KB Output is correct
9 Correct 13 ms 42148 KB Output is correct
10 Correct 10 ms 41052 KB Output is correct
11 Correct 11 ms 41224 KB Output is correct
12 Correct 10 ms 41048 KB Output is correct
13 Correct 11 ms 41048 KB Output is correct
14 Correct 11 ms 41052 KB Output is correct
15 Correct 34 ms 46940 KB Output is correct
16 Correct 38 ms 47256 KB Output is correct
17 Correct 35 ms 47184 KB Output is correct
18 Correct 15 ms 42588 KB Output is correct
19 Correct 14 ms 42076 KB Output is correct
20 Correct 31 ms 46288 KB Output is correct
21 Correct 35 ms 46168 KB Output is correct
22 Correct 10 ms 41048 KB Output is correct
23 Correct 13 ms 41816 KB Output is correct
24 Correct 13 ms 41960 KB Output is correct
25 Correct 10 ms 41052 KB Output is correct
26 Correct 10 ms 41052 KB Output is correct
27 Correct 14 ms 42788 KB Output is correct
28 Correct 14 ms 42272 KB Output is correct
29 Correct 14 ms 42076 KB Output is correct
30 Correct 16 ms 42084 KB Output is correct
31 Correct 11 ms 41304 KB Output is correct
32 Correct 10 ms 41304 KB Output is correct
33 Correct 11 ms 41052 KB Output is correct
34 Correct 11 ms 41052 KB Output is correct
35 Correct 11 ms 41052 KB Output is correct
36 Correct 97 ms 72860 KB Output is correct
37 Correct 10 ms 41052 KB Output is correct
38 Correct 92 ms 72552 KB Output is correct
39 Correct 85 ms 71892 KB Output is correct
40 Correct 92 ms 69856 KB Output is correct
41 Correct 91 ms 70148 KB Output is correct
42 Correct 77 ms 61612 KB Output is correct
43 Correct 91 ms 57660 KB Output is correct
44 Correct 97 ms 62844 KB Output is correct
45 Correct 101 ms 63072 KB Output is correct
46 Correct 104 ms 62764 KB Output is correct
47 Correct 84 ms 61836 KB Output is correct
48 Correct 78 ms 61768 KB Output is correct
49 Correct 100 ms 64364 KB Output is correct
50 Correct 85 ms 64432 KB Output is correct
51 Correct 83 ms 69320 KB Output is correct
52 Correct 84 ms 69536 KB Output is correct
53 Correct 63 ms 56100 KB Output is correct
54 Correct 68 ms 56084 KB Output is correct
55 Correct 78 ms 56444 KB Output is correct
56 Correct 82 ms 56404 KB Output is correct
57 Correct 104 ms 64052 KB Output is correct
58 Correct 133 ms 64136 KB Output is correct
59 Correct 99 ms 62088 KB Output is correct
60 Correct 89 ms 58372 KB Output is correct
61 Correct 88 ms 62044 KB Output is correct
62 Correct 79 ms 62604 KB Output is correct
63 Correct 80 ms 62304 KB Output is correct
64 Correct 86 ms 63452 KB Output is correct
65 Correct 143 ms 72952 KB Output is correct
66 Correct 123 ms 67668 KB Output is correct
67 Correct 111 ms 62232 KB Output is correct
68 Correct 58 ms 53076 KB Output is correct
69 Correct 57 ms 52948 KB Output is correct
70 Correct 88 ms 64428 KB Output is correct
71 Correct 81 ms 64220 KB Output is correct
72 Correct 10 ms 41052 KB Output is correct
73 Correct 14 ms 41820 KB Output is correct
74 Correct 13 ms 41820 KB Output is correct
75 Correct 11 ms 41052 KB Output is correct
76 Correct 10 ms 41052 KB Output is correct
77 Correct 14 ms 42780 KB Output is correct
78 Correct 13 ms 42208 KB Output is correct
79 Correct 13 ms 42072 KB Output is correct
80 Correct 14 ms 42076 KB Output is correct
81 Correct 10 ms 41048 KB Output is correct
82 Correct 11 ms 41292 KB Output is correct
83 Correct 10 ms 41052 KB Output is correct
84 Correct 11 ms 41292 KB Output is correct
85 Correct 11 ms 41048 KB Output is correct
86 Correct 34 ms 47188 KB Output is correct
87 Correct 34 ms 47196 KB Output is correct
88 Correct 34 ms 47188 KB Output is correct
89 Correct 15 ms 42584 KB Output is correct
90 Correct 16 ms 42076 KB Output is correct
91 Correct 33 ms 46336 KB Output is correct
92 Correct 35 ms 46168 KB Output is correct
93 Correct 11 ms 41048 KB Output is correct
94 Correct 102 ms 72748 KB Output is correct
95 Correct 97 ms 72516 KB Output is correct
96 Correct 87 ms 71856 KB Output is correct
97 Correct 87 ms 69868 KB Output is correct
98 Correct 97 ms 70100 KB Output is correct
99 Correct 122 ms 66844 KB Output is correct
100 Correct 128 ms 63700 KB Output is correct
101 Correct 119 ms 65100 KB Output is correct
102 Correct 92 ms 59492 KB Output is correct
103 Correct 84 ms 63072 KB Output is correct
104 Correct 88 ms 63840 KB Output is correct
105 Correct 89 ms 62896 KB Output is correct
106 Correct 95 ms 65580 KB Output is correct
107 Correct 95 ms 65292 KB Output is correct
108 Correct 86 ms 70408 KB Output is correct
109 Correct 97 ms 70524 KB Output is correct
110 Correct 65 ms 57044 KB Output is correct
111 Correct 72 ms 57036 KB Output is correct
112 Correct 84 ms 57168 KB Output is correct
113 Correct 98 ms 57376 KB Output is correct