oj.uz

Submission #957472

# Submission time Handle Problem Language Result Execution time Memory
957472 2024-04-03T20:40:00 Z n3rm1n Railway (BOI17_railway) C++17
23 / 100
 319 ms 524288 KB 
#include<bits/stdc++.h>
#define endl '\n'
using namespace std;
const int MAXN = 1e5 + 10, MAXLOG = 21;
void speed()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
}
int n, m, k;
vector < pair < int, int > > g[MAXN];
void read_graph()
{
    cin >> n >> m >> k;
    int from, to;
    for (int i = 1; i < n; ++ i)
    {
        cin >> from >> to;
        g[from].push_back({to, i});
        g[to].push_back({from, i});
    }
}

int p[MAXN], lvl[MAXN];
void dfs(int beg, int par, int depth)
{
    p[beg] = par;
    lvl[beg] = depth;
    int nb;
    for (int i = 0; i < g[beg].size(); ++ i)
    {
        nb = g[beg][i].first;
        if(lvl[nb] == 0)dfs(nb, beg, depth+1);
    }
}
int jump[MAXN][MAXLOG];
void fill_jump()
{
    for (int i = 1; i <= n; ++ i)
        jump[i][0] = p[i];
    for (int j = 1; j < MAXLOG; ++ j)
        for (int i = 1; i <= n; ++ i)
            jump[i][j] = jump[jump[i][j-1]][j-1];
}
int move_up(int v, int dist)
{
    for (int i = 0; (1 << i) <= dist; ++ i)
    {
        if((1 << i) & dist)
            v = jump[v][i];
    }
    return v;
}
int lca(int u, int v)
{
    if(lvl[u] > lvl[v])swap(u, v);
    int diff = lvl[v] - lvl[u];
    v = move_up(v, diff);
    if(u == v)return u;
    for (int i = MAXLOG - 1; i >= 0; -- i)
    {
        if(jump[u][i] != jump[v][i])
        {
            u = jump[u][i];
            v = jump[v][i];
        }
    }
    return p[u];
}
int s;
vector < int > que[MAXN];
vector < int > endpoints[MAXN], startpoints[MAXN];
int used[MAXN];
int ans[MAXN];
bitset < MAXN > dfs2(int beg)
{
    used[beg] = 1;
    /// add

    int nb, id;
    bitset < MAXN > bs, vs;
    for (int i = 0; i < g[beg].size(); ++ i)
    {
        nb = g[beg][i].first;
        id = g[beg][i].second;

        if(!used[nb])
        {
            vs = dfs2(nb);
            bs = (bs | vs);
            ans[id] += vs.count();
        }
    }
    for (int i = 0; i < endpoints[beg].size(); ++ i)
    {
        bs[endpoints[beg][i]] = 1;
    }
    for (int i = 0; i < startpoints[beg].size(); ++ i)
    {
        bs[startpoints[beg][i]] = 0;
    }
    return bs;
}
void read_queries()
{
    int xx;
    for (int i = 1; i <= m; ++ i)
    {
        cin >> s >> xx;
        int lcaa = xx;
        que[i].push_back(xx);
        for (int j = 2; j <= s; ++ j)
        {
            cin >> xx;
            que[i].push_back(xx);
            lcaa = lca(lcaa, xx);
        }
        startpoints[lcaa].push_back(i);
        for (int j = 0; j < que[i].size(); ++ j)
        {
            endpoints[que[i][j]].push_back(i);
        }
    }

}
int main()
{
    speed();

    read_graph();
    dfs(1, 0, 1);
    fill_jump();
    read_queries();
    dfs2(1);


    vector < int > anss;
    for (int i = 1; i <= n; ++ i)
    {
        if(ans[i] >= k)anss.push_back(i);
    }

    cout << anss.size() << endl;
    for (int i = 0; i < anss.size(); ++ i)
        cout << anss[i] << " ";
    cout << endl;
    return 0;
}

Compilation message

railway.cpp: In function 'void dfs(int, int, int)':
railway.cpp:31:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   31 |     for (int i = 0; i < g[beg].size(); ++ i)
      |                     ~~^~~~~~~~~~~~~~~
railway.cpp: In function 'std::bitset<100010> dfs2(int)':
railway.cpp:83:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   83 |     for (int i = 0; i < g[beg].size(); ++ i)
      |                     ~~^~~~~~~~~~~~~~~
railway.cpp:95:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   95 |     for (int i = 0; i < endpoints[beg].size(); ++ i)
      |                     ~~^~~~~~~~~~~~~~~~~~~~~~~
railway.cpp:99:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   99 |     for (int i = 0; i < startpoints[beg].size(); ++ i)
      |                     ~~^~~~~~~~~~~~~~~~~~~~~~~~~
railway.cpp: In function 'void read_queries()':
railway.cpp:120:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  120 |         for (int j = 0; j < que[i].size(); ++ j)
      |                         ~~^~~~~~~~~~~~~~~
railway.cpp: In function 'int main()':
railway.cpp:145:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  145 |     for (int i = 0; i < anss.size(); ++ i)
      |                     ~~^~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 13400 KB Output is correct
2 Correct 50 ms 16252 KB Output is correct
3 Correct 50 ms 16284 KB Output is correct
4 Correct 3 ms 13660 KB Output is correct
5 Correct 3 ms 13660 KB Output is correct
6 Correct 116 ms 138792 KB Output is correct
7 Correct 65 ms 40280 KB Output is correct
8 Correct 51 ms 16028 KB Output is correct
9 Correct 49 ms 16144 KB Output is correct
10 Correct 3 ms 13400 KB Output is correct
11 Correct 3 ms 13404 KB Output is correct
12 Correct 3 ms 13404 KB Output is correct
13 Correct 3 ms 13404 KB Output is correct
14 Correct 3 ms 13404 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 13400 KB Output is correct
2 Correct 50 ms 16252 KB Output is correct
3 Correct 50 ms 16284 KB Output is correct
4 Correct 3 ms 13660 KB Output is correct
5 Correct 3 ms 13660 KB Output is correct
6 Correct 116 ms 138792 KB Output is correct
7 Correct 65 ms 40280 KB Output is correct
8 Correct 51 ms 16028 KB Output is correct
9 Correct 49 ms 16144 KB Output is correct
10 Correct 3 ms 13400 KB Output is correct
11 Correct 3 ms 13404 KB Output is correct
12 Correct 3 ms 13404 KB Output is correct
13 Correct 3 ms 13404 KB Output is correct
14 Correct 3 ms 13404 KB Output is correct
15 Correct 58 ms 17500 KB Output is correct
16 Correct 59 ms 17240 KB Output is correct
17 Correct 76 ms 17488 KB Output is correct
18 Correct 120 ms 138776 KB Output is correct
19 Correct 71 ms 40512 KB Output is correct
20 Correct 76 ms 17212 KB Output is correct
21 Correct 58 ms 17256 KB Output is correct
22 Correct 3 ms 13400 KB Output is correct
23 Correct 51 ms 16220 KB Output is correct
24 Correct 52 ms 16220 KB Output is correct
25 Correct 3 ms 13660 KB Output is correct
26 Correct 3 ms 13656 KB Output is correct
27 Correct 115 ms 138604 KB Output is correct
28 Correct 64 ms 40284 KB Output is correct
29 Correct 48 ms 15960 KB Output is correct
30 Correct 48 ms 15960 KB Output is correct
31 Correct 3 ms 13404 KB Output is correct
32 Correct 3 ms 13528 KB Output is correct
33 Correct 3 ms 13404 KB Output is correct
34 Correct 3 ms 13404 KB Output is correct
35 Correct 3 ms 13404 KB Output is correct

Subtask #3
0 / 7.0

# Verdict Execution time Memory Grader output
1 Runtime error 319 ms 524288 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Runtime error 294 ms 524288 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #5
0 / 16.0

# Verdict Execution time Memory Grader output
1 Runtime error 294 ms 524288 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #6
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 13400 KB Output is correct
2 Correct 50 ms 16252 KB Output is correct
3 Correct 50 ms 16284 KB Output is correct
4 Correct 3 ms 13660 KB Output is correct
5 Correct 3 ms 13660 KB Output is correct
6 Correct 116 ms 138792 KB Output is correct
7 Correct 65 ms 40280 KB Output is correct
8 Correct 51 ms 16028 KB Output is correct
9 Correct 49 ms 16144 KB Output is correct
10 Correct 3 ms 13400 KB Output is correct
11 Correct 3 ms 13404 KB Output is correct
12 Correct 3 ms 13404 KB Output is correct
13 Correct 3 ms 13404 KB Output is correct
14 Correct 3 ms 13404 KB Output is correct
15 Correct 58 ms 17500 KB Output is correct
16 Correct 59 ms 17240 KB Output is correct
17 Correct 76 ms 17488 KB Output is correct
18 Correct 120 ms 138776 KB Output is correct
19 Correct 71 ms 40512 KB Output is correct
20 Correct 76 ms 17212 KB Output is correct
21 Correct 58 ms 17256 KB Output is correct
22 Correct 3 ms 13400 KB Output is correct
23 Correct 51 ms 16220 KB Output is correct
24 Correct 52 ms 16220 KB Output is correct
25 Correct 3 ms 13660 KB Output is correct
26 Correct 3 ms 13656 KB Output is correct
27 Correct 115 ms 138604 KB Output is correct
28 Correct 64 ms 40284 KB Output is correct
29 Correct 48 ms 15960 KB Output is correct
30 Correct 48 ms 15960 KB Output is correct
31 Correct 3 ms 13404 KB Output is correct
32 Correct 3 ms 13528 KB Output is correct
33 Correct 3 ms 13404 KB Output is correct
34 Correct 3 ms 13404 KB Output is correct
35 Correct 3 ms 13404 KB Output is correct
36 Runtime error 319 ms 524288 KB Execution killed with signal 9
37 Halted 0 ms 0 KB -