oj.uz

Submission #957473

# Submission time Handle Problem Language Result Execution time Memory
957473 2024-04-03T20:42:28 Z n3rm1n Railway (BOI17_railway) C++17
23 / 100
 422 ms 524288 KB 
#include<bits/stdc++.h>
#define endl '\n'
using namespace std;
const int MAXN = 1e5 + 1, 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;
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.clear();
        que.push_back(xx);
        for (int j = 2; j <= s; ++ j)
        {
            cin >> xx;
            que.push_back(xx);
            lcaa = lca(lcaa, xx);
        }
        startpoints[lcaa].push_back(i);
        for (int j = 0; j < que.size(); ++ j)
        {
            endpoints[que[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<100001> 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:97:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   97 |     for (int i = 0; i < startpoints[beg].size(); ++ i)
      |                     ~~^~~~~~~~~~~~~~~~~~~~~~~~~
railway.cpp: In function 'void read_queries()':
railway.cpp:117:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  117 |         for (int j = 0; j < que.size(); ++ j)
      |                         ~~^~~~~~~~~~~~
railway.cpp: In function 'int main()':
railway.cpp:142:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  142 |     for (int i = 0; i < anss.size(); ++ i)
      |                     ~~^~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 10844 KB Output is correct
2 Correct 68 ms 11836 KB Output is correct
3 Correct 65 ms 11876 KB Output is correct
4 Correct 2 ms 11352 KB Output is correct
5 Correct 2 ms 11356 KB Output is correct
6 Correct 118 ms 134228 KB Output is correct
7 Correct 77 ms 36040 KB Output is correct
8 Correct 49 ms 11612 KB Output is correct
9 Correct 51 ms 11612 KB Output is correct
10 Correct 2 ms 11100 KB Output is correct
11 Correct 2 ms 11100 KB Output is correct
12 Correct 2 ms 11096 KB Output is correct
13 Correct 2 ms 11176 KB Output is correct
14 Correct 3 ms 11100 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 10844 KB Output is correct
2 Correct 68 ms 11836 KB Output is correct
3 Correct 65 ms 11876 KB Output is correct
4 Correct 2 ms 11352 KB Output is correct
5 Correct 2 ms 11356 KB Output is correct
6 Correct 118 ms 134228 KB Output is correct
7 Correct 77 ms 36040 KB Output is correct
8 Correct 49 ms 11612 KB Output is correct
9 Correct 51 ms 11612 KB Output is correct
10 Correct 2 ms 11100 KB Output is correct
11 Correct 2 ms 11100 KB Output is correct
12 Correct 2 ms 11096 KB Output is correct
13 Correct 2 ms 11176 KB Output is correct
14 Correct 3 ms 11100 KB Output is correct
15 Correct 63 ms 12636 KB Output is correct
16 Correct 59 ms 12448 KB Output is correct
17 Correct 63 ms 12376 KB Output is correct
18 Correct 123 ms 134224 KB Output is correct
19 Correct 65 ms 36056 KB Output is correct
20 Correct 62 ms 12344 KB Output is correct
21 Correct 63 ms 12320 KB Output is correct
22 Correct 2 ms 11096 KB Output is correct
23 Correct 53 ms 11868 KB Output is correct
24 Correct 55 ms 11868 KB Output is correct
25 Correct 2 ms 11352 KB Output is correct
26 Correct 2 ms 11356 KB Output is correct
27 Correct 126 ms 134464 KB Output is correct
28 Correct 66 ms 36108 KB Output is correct
29 Correct 50 ms 11356 KB Output is correct
30 Correct 51 ms 11732 KB Output is correct
31 Correct 2 ms 11100 KB Output is correct
32 Correct 2 ms 11100 KB Output is correct
33 Correct 3 ms 11100 KB Output is correct
34 Correct 2 ms 11100 KB Output is correct
35 Correct 3 ms 11100 KB Output is correct

Subtask #3
0 / 7.0

# Verdict Execution time Memory Grader output
1 Runtime error 422 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 303 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 303 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 2 ms 10844 KB Output is correct
2 Correct 68 ms 11836 KB Output is correct
3 Correct 65 ms 11876 KB Output is correct
4 Correct 2 ms 11352 KB Output is correct
5 Correct 2 ms 11356 KB Output is correct
6 Correct 118 ms 134228 KB Output is correct
7 Correct 77 ms 36040 KB Output is correct
8 Correct 49 ms 11612 KB Output is correct
9 Correct 51 ms 11612 KB Output is correct
10 Correct 2 ms 11100 KB Output is correct
11 Correct 2 ms 11100 KB Output is correct
12 Correct 2 ms 11096 KB Output is correct
13 Correct 2 ms 11176 KB Output is correct
14 Correct 3 ms 11100 KB Output is correct
15 Correct 63 ms 12636 KB Output is correct
16 Correct 59 ms 12448 KB Output is correct
17 Correct 63 ms 12376 KB Output is correct
18 Correct 123 ms 134224 KB Output is correct
19 Correct 65 ms 36056 KB Output is correct
20 Correct 62 ms 12344 KB Output is correct
21 Correct 63 ms 12320 KB Output is correct
22 Correct 2 ms 11096 KB Output is correct
23 Correct 53 ms 11868 KB Output is correct
24 Correct 55 ms 11868 KB Output is correct
25 Correct 2 ms 11352 KB Output is correct
26 Correct 2 ms 11356 KB Output is correct
27 Correct 126 ms 134464 KB Output is correct
28 Correct 66 ms 36108 KB Output is correct
29 Correct 50 ms 11356 KB Output is correct
30 Correct 51 ms 11732 KB Output is correct
31 Correct 2 ms 11100 KB Output is correct
32 Correct 2 ms 11100 KB Output is correct
33 Correct 3 ms 11100 KB Output is correct
34 Correct 2 ms 11100 KB Output is correct
35 Correct 3 ms 11100 KB Output is correct
36 Runtime error 422 ms 524288 KB Execution killed with signal 9
37 Halted 0 ms 0 KB -