oj.uz

답안 #1005136

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1005136 2024-06-22T07:44:47 Z vjudge1 Railway (BOI17_railway) C++17
100 / 100
 55 ms 40644 KB 
#pragma GCC optimize("-O3")
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define ll long long
#define ld long double
#define vl vector<ll>
#define vi vector<int>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define pb push_back
#define p_b pop_back
#define f first
#define s second
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
const ll sz = 1e5+5;
vl g[sz];
ll vis[sz], lev[sz], intime[sz], p[30][sz], dist[sz], tin = 1;
void dfs(ll node)
{
    vis[node] = 1;
    intime[node] = tin++;
    for(auto u : g[node])
    {
        if(vis[u])
            continue;
        lev[u] = lev[node] + 1;
        p[0][u] = node;
        dfs(u);
    }
}
ll jump(ll x, ll k)
{
    for(ll i = 0; i < 27; i++)
    {
        if((k >> i) & 1)
            x = p[i][x];
    }
    return x;
}
ll lca(ll x, ll y)
{
    if(lev[x] > lev[y])
        swap(x, y);
    ll d = lev[y] - lev[x];
    y = jump(y, d);
    if(x == y)
        return x;
    else
    {
        for(ll i = 26; i >= 0; i--)
        {
            if(p[i][x] != p[i][y])
            {
                x = p[i][x];
                y = p[i][y];
            }
        }
        return p[0][x];
    }
}
void dfs2(ll node)
{
    vis[node] = 1;
    for(auto u : g[node])
    {
        if(vis[u])
            continue;
        dfs2(u);
        dist[node] += dist[u];
    }
}
void solve()
{
    ll n, m, k, i, j;
    cin >> n >> m >> k;
    vector<pll>edges;
    for(i = 1; i <= n - 1; i++)
    {
        ll x, y;
        cin >> x >> y;
        edges.pb({x, y});
        g[x].pb(y);
        g[y].pb(x);
    }
    dfs(1);
    for(i = 1; i < 27; i++)
    {
        for(j = 1; j <= n; j++)
            p[i][j] = p[i-1][p[i-1][j]];
    }
    for(i = 1; i <= m; i++)
    {
        ll s;
        cin >> s;
        vector<pll>vect;
        for(j = 1; j <= s; j++)
        {
            ll x;
            cin >> x;
            vect.pb({intime[x], x});
        }
        sort(all(vect));
        vect.pb({vect[0].f, vect[0].s});
        for(j = 0; j < s; j++)
        {
            ll x = vect[j].s, y = vect[j+1].s;
            ll a = lca(x, y);
            dist[x]++;
            dist[y]++;
            dist[a] -= 2;
        }
    }
    for(i = 1; i <= n; i++)
        vis[i] = 0;
    dfs2(1);
    vl f;
    for(i = 0; i < edges.size(); i++)
    {
        ll x = edges[i].f, y = edges[i].s;
        if(p[0][x] != y)
            swap(x, y);
        if(dist[x] >= 2 * k)
            f.pb(i+1);
    }
    cout << f.size() << "\n";
    for(auto u : f)
        cout << u << ' ';
    cout << "\n";
}
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    ll tests = 1;
    //cin >> tests;
    while(tests--)
    {
        solve();
    }
}

Compilation message

railway.cpp: In function 'void solve()':
railway.cpp:122:18: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  122 |     for(i = 0; i < edges.size(); i++)
      |                ~~^~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 29020 KB Output is correct
2 Correct 6 ms 29800 KB Output is correct
3 Correct 6 ms 29804 KB Output is correct
4 Correct 3 ms 29020 KB Output is correct
5 Correct 3 ms 29208 KB Output is correct
6 Correct 6 ms 30168 KB Output is correct
7 Correct 5 ms 29796 KB Output is correct
8 Correct 5 ms 29912 KB Output is correct
9 Correct 5 ms 30044 KB Output is correct
10 Correct 4 ms 29020 KB Output is correct
11 Correct 3 ms 29112 KB Output is correct
12 Correct 3 ms 29020 KB Output is correct
13 Correct 3 ms 29020 KB Output is correct
14 Correct 3 ms 29016 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 29020 KB Output is correct
2 Correct 6 ms 29800 KB Output is correct
3 Correct 6 ms 29804 KB Output is correct
4 Correct 3 ms 29020 KB Output is correct
5 Correct 3 ms 29208 KB Output is correct
6 Correct 6 ms 30168 KB Output is correct
7 Correct 5 ms 29796 KB Output is correct
8 Correct 5 ms 29912 KB Output is correct
9 Correct 5 ms 30044 KB Output is correct
10 Correct 4 ms 29020 KB Output is correct
11 Correct 3 ms 29112 KB Output is correct
12 Correct 3 ms 29020 KB Output is correct
13 Correct 3 ms 29020 KB Output is correct
14 Correct 3 ms 29016 KB Output is correct
15 Correct 16 ms 30168 KB Output is correct
16 Correct 17 ms 30288 KB Output is correct
17 Correct 17 ms 30424 KB Output is correct
18 Correct 6 ms 30168 KB Output is correct
19 Correct 5 ms 29792 KB Output is correct
20 Correct 18 ms 30404 KB Output is correct
21 Correct 19 ms 30276 KB Output is correct
22 Correct 3 ms 29020 KB Output is correct
23 Correct 5 ms 29848 KB Output is correct
24 Correct 6 ms 29912 KB Output is correct
25 Correct 3 ms 29020 KB Output is correct
26 Correct 3 ms 29020 KB Output is correct
27 Correct 6 ms 30168 KB Output is correct
28 Correct 6 ms 29908 KB Output is correct
29 Correct 5 ms 29912 KB Output is correct
30 Correct 7 ms 29912 KB Output is correct
31 Correct 3 ms 29020 KB Output is correct
32 Correct 3 ms 29020 KB Output is correct
33 Correct 3 ms 29020 KB Output is correct
34 Correct 3 ms 29020 KB Output is correct
35 Correct 3 ms 29020 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 43 ms 40644 KB Output is correct
2 Correct 3 ms 29016 KB Output is correct
3 Correct 48 ms 39104 KB Output is correct
4 Correct 40 ms 38092 KB Output is correct
5 Correct 45 ms 39872 KB Output is correct
6 Correct 47 ms 40388 KB Output is correct

Subtask #4
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 41 ms 37056 KB Output is correct
2 Correct 38 ms 35784 KB Output is correct
3 Correct 48 ms 35656 KB Output is correct
4 Correct 48 ms 35644 KB Output is correct
5 Correct 45 ms 35660 KB Output is correct
6 Correct 40 ms 37316 KB Output is correct
7 Correct 42 ms 37316 KB Output is correct

Subtask #5
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 41 ms 37056 KB Output is correct
2 Correct 38 ms 35784 KB Output is correct
3 Correct 48 ms 35656 KB Output is correct
4 Correct 48 ms 35644 KB Output is correct
5 Correct 45 ms 35660 KB Output is correct
6 Correct 40 ms 37316 KB Output is correct
7 Correct 42 ms 37316 KB Output is correct
8 Correct 42 ms 37292 KB Output is correct
9 Correct 47 ms 37288 KB Output is correct
10 Correct 43 ms 40128 KB Output is correct
11 Correct 45 ms 40128 KB Output is correct
12 Correct 46 ms 35976 KB Output is correct
13 Correct 37 ms 35788 KB Output is correct
14 Correct 41 ms 35660 KB Output is correct
15 Correct 44 ms 35664 KB Output is correct
16 Correct 49 ms 35664 KB Output is correct
17 Correct 49 ms 35652 KB Output is correct
18 Correct 46 ms 35652 KB Output is correct
19 Correct 40 ms 35776 KB Output is correct
20 Correct 37 ms 37828 KB Output is correct
21 Correct 41 ms 38076 KB Output is correct
22 Correct 47 ms 37564 KB Output is correct

Subtask #6
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 29020 KB Output is correct
2 Correct 6 ms 29800 KB Output is correct
3 Correct 6 ms 29804 KB Output is correct
4 Correct 3 ms 29020 KB Output is correct
5 Correct 3 ms 29208 KB Output is correct
6 Correct 6 ms 30168 KB Output is correct
7 Correct 5 ms 29796 KB Output is correct
8 Correct 5 ms 29912 KB Output is correct
9 Correct 5 ms 30044 KB Output is correct
10 Correct 4 ms 29020 KB Output is correct
11 Correct 3 ms 29112 KB Output is correct
12 Correct 3 ms 29020 KB Output is correct
13 Correct 3 ms 29020 KB Output is correct
14 Correct 3 ms 29016 KB Output is correct
15 Correct 16 ms 30168 KB Output is correct
16 Correct 17 ms 30288 KB Output is correct
17 Correct 17 ms 30424 KB Output is correct
18 Correct 6 ms 30168 KB Output is correct
19 Correct 5 ms 29792 KB Output is correct
20 Correct 18 ms 30404 KB Output is correct
21 Correct 19 ms 30276 KB Output is correct
22 Correct 3 ms 29020 KB Output is correct
23 Correct 5 ms 29848 KB Output is correct
24 Correct 6 ms 29912 KB Output is correct
25 Correct 3 ms 29020 KB Output is correct
26 Correct 3 ms 29020 KB Output is correct
27 Correct 6 ms 30168 KB Output is correct
28 Correct 6 ms 29908 KB Output is correct
29 Correct 5 ms 29912 KB Output is correct
30 Correct 7 ms 29912 KB Output is correct
31 Correct 3 ms 29020 KB Output is correct
32 Correct 3 ms 29020 KB Output is correct
33 Correct 3 ms 29020 KB Output is correct
34 Correct 3 ms 29020 KB Output is correct
35 Correct 3 ms 29020 KB Output is correct
36 Correct 43 ms 40644 KB Output is correct
37 Correct 3 ms 29016 KB Output is correct
38 Correct 48 ms 39104 KB Output is correct
39 Correct 40 ms 38092 KB Output is correct
40 Correct 45 ms 39872 KB Output is correct
41 Correct 47 ms 40388 KB Output is correct
42 Correct 41 ms 37056 KB Output is correct
43 Correct 38 ms 35784 KB Output is correct
44 Correct 48 ms 35656 KB Output is correct
45 Correct 48 ms 35644 KB Output is correct
46 Correct 45 ms 35660 KB Output is correct
47 Correct 40 ms 37316 KB Output is correct
48 Correct 42 ms 37316 KB Output is correct
49 Correct 42 ms 37292 KB Output is correct
50 Correct 47 ms 37288 KB Output is correct
51 Correct 43 ms 40128 KB Output is correct
52 Correct 45 ms 40128 KB Output is correct
53 Correct 46 ms 35976 KB Output is correct
54 Correct 37 ms 35788 KB Output is correct
55 Correct 41 ms 35660 KB Output is correct
56 Correct 44 ms 35664 KB Output is correct
57 Correct 49 ms 35664 KB Output is correct
58 Correct 49 ms 35652 KB Output is correct
59 Correct 46 ms 35652 KB Output is correct
60 Correct 40 ms 35776 KB Output is correct
61 Correct 37 ms 37828 KB Output is correct
62 Correct 41 ms 38076 KB Output is correct
63 Correct 47 ms 37564 KB Output is correct
64 Correct 45 ms 37564 KB Output is correct
65 Correct 51 ms 35920 KB Output is correct
66 Correct 55 ms 35664 KB Output is correct
67 Correct 49 ms 35664 KB Output is correct
68 Correct 34 ms 35784 KB Output is correct
69 Correct 35 ms 35664 KB Output is correct
70 Correct 49 ms 38236 KB Output is correct
71 Correct 45 ms 36808 KB Output is correct
72 Correct 3 ms 29020 KB Output is correct
73 Correct 5 ms 29800 KB Output is correct
74 Correct 6 ms 29912 KB Output is correct
75 Correct 3 ms 29232 KB Output is correct
76 Correct 3 ms 29020 KB Output is correct
77 Correct 6 ms 30012 KB Output is correct
78 Correct 6 ms 29912 KB Output is correct
79 Correct 5 ms 29968 KB Output is correct
80 Correct 5 ms 29912 KB Output is correct
81 Correct 3 ms 29108 KB Output is correct
82 Correct 3 ms 29200 KB Output is correct
83 Correct 3 ms 29196 KB Output is correct
84 Correct 3 ms 29020 KB Output is correct
85 Correct 3 ms 29020 KB Output is correct
86 Correct 17 ms 30168 KB Output is correct
87 Correct 17 ms 30168 KB Output is correct
88 Correct 17 ms 30252 KB Output is correct
89 Correct 6 ms 30164 KB Output is correct
90 Correct 6 ms 29912 KB Output is correct
91 Correct 17 ms 30300 KB Output is correct
92 Correct 19 ms 30168 KB Output is correct
93 Correct 3 ms 29020 KB Output is correct
94 Correct 48 ms 40128 KB Output is correct
95 Correct 49 ms 39104 KB Output is correct
96 Correct 55 ms 38092 KB Output is correct
97 Correct 45 ms 39868 KB Output is correct
98 Correct 46 ms 40388 KB Output is correct
99 Correct 48 ms 35664 KB Output is correct
100 Correct 47 ms 35652 KB Output is correct
101 Correct 54 ms 35548 KB Output is correct
102 Correct 47 ms 35896 KB Output is correct
103 Correct 45 ms 37344 KB Output is correct
104 Correct 41 ms 38084 KB Output is correct
105 Correct 44 ms 37128 KB Output is correct
106 Correct 48 ms 37572 KB Output is correct
107 Correct 47 ms 36284 KB Output is correct
108 Correct 47 ms 39104 KB Output is correct
109 Correct 50 ms 39100 KB Output is correct
110 Correct 38 ms 34760 KB Output is correct
111 Correct 35 ms 34764 KB Output is correct
112 Correct 49 ms 35300 KB Output is correct
113 Correct 50 ms 34632 KB Output is correct