oj.uz

Submission #876465

# Submission time Handle Problem Language Result Execution time Memory
876465 2023-11-21T19:19:05 Z Ice_man Jail (JOI22_jail) C++14
61 / 100
 5000 ms 29012 KB 
#include <iostream>
#include <vector>
#include <cstring>
#include <stack>
#include <algorithm>

#define maxn 120005
#define maxlog 20
#define pb(x) push_back(x)

#pragma GCC optimize("O3" , "Ofast" , "unroll-loops")
#pragma GCC target(avx2)

using namespace std;

int n, m,  q;
vector <int> v[maxn];
int start[maxn], _final[maxn];
vector <int> new_tree[maxn];
int bin_lift[maxn][maxlog];
int pom1[maxn];
int pom2[maxn];

bool cmp(int a , int b)
{
    return start[a] < start[b];
}

bool cmp1(int a , int b)
{
    return _final[a] < _final[b];
}

int pomm1[120005] , pomm2[120005];

void read()
{
    cin >> n;

    for(int i = 1; i <= n; i++)
    {
        for(int j = 0; j < maxlog; j++) bin_lift[i][j] = 0;
    }

    for(int i = 1; i <= n; i++)
    {
        v[i].clear();
        new_tree[i].clear();
    }

    int from, to;
    for(int i = 1; i <= (n - 1); i++)
    {
        cin >> from >> to;

        v[from].pb(to);
        v[to].pb(from);
    }

    cin >> m;

    for(int i = 1; i <= m; i++)
    {
        pom1[i] = 0;
        pom2[i] = 0;
    }

    for(int i = 1; i <= m; i++) cin >> start[i] >> _final[i];

    if(m > 500)
    {
        for(int i = 1; i <= m; i++) pomm1[i] = pomm2[i] = i;
        sort(pomm1 + 1 , pomm1 + 1 + m , cmp);
        sort(pomm2 + 1 , pomm2 + 1 + m , cmp1);

        for(int i = 1; i <= m; i++)
        {
            if(pomm1[i] != pomm2[i])
            {
                cout << "No" << endl;
                return;
            }
        }

        cout << "Yes" << endl;
        return;

    }


}

///int bin_lift[maxn][maxlog];
int depth[maxn];

void calc_bin(int node, int parent)
{
    for(int nb : v[node])
    {
        if(nb != parent)
        {
            bin_lift[nb][0] = node;
            for(int i = 1; i < maxlog; i++) bin_lift[nb][i] = bin_lift[bin_lift[nb][i - 1]][i - 1];

            depth[nb] = depth[node] + 1;
            calc_bin(nb, node);
        }
    }

}


int get_lca(int a, int b)
{
    if(depth[a] < depth[b]) swap(a, b);

    ///cout << a << "-" << b << endl;

    int levels = depth[a] - depth[b];
    ///cout << "** " << levels << endl;;
    for(int i = maxlog - 1; i >= 0; i--)
    {
        if(levels >> i & 1)
        {
            ///cout  << ">< "<< (1 << i) << endl;
            a = bin_lift[a][i];
            ///levels -= (1 << i);
            ///cout << (1 << i) << endl;
        }
    }

    ///cout << a << "-" << b << endl;
    if(a == b) return a;

    for(int i = maxlog - 1; i >= 0; i--)
    {
        if(!bin_lift[a][i]) continue;
        if(!bin_lift[b][i]) continue;

        if(bin_lift[a][i] != bin_lift[b][i])
        {
            a = bin_lift[a][i];
            b = bin_lift[b][i];
        }

    }

    return bin_lift[a][0];

}

bool check(int a, int b, int c)
{
    int lca = get_lca(a, b);
    ///int pom = get_lca(lca , c);

    if(get_lca(lca, c) == lca && get_lca(c, a) == c) return true;
    if(get_lca(lca, c) == lca && get_lca(c, b) == c) return true;

    return false;

}

//vector <int> new_tree[maxn];

void solve()
{

    calc_bin(1, 0);

    for(int a = 1; a <= m; a++)
    {
        for(int b = 1; b <= m; b++)
        {
            if(a == b) continue;
            ///int lca1 = get_lca(start[a], _final[a]);

            if(check(start[a], _final[a], start[b]) == true) new_tree[b].pb(a);
            if(check(start[a], _final[a], _final[b]) == true) new_tree[a].pb(b);

            ///cout << check(start[a] , _final[a] , start[b]) << " " <<  check(start[a] , _final[a] , _final[b]) << endl;

        }
    }

    /**for(int i = 1; i <= n; i++)
    {
       cout << i << ": ";
       for(int nb : new_tree[i]) cout << nb << " ";
       cout << endl;
    }*/

}

stack <int> s;
///int pom1[maxn] , pom2[maxn];
int _time = 0;
int br = 0;

void count_ssc(int node, int parent)
{
    s.push(node);
    _time++;

    pom1[node] = _time;
    pom2[node] = _time;

    for(int nb : new_tree[node])
    {
        if(pom2[nb] == -1) continue;
        if(pom2[nb])
        {
            pom1[node] = min(pom1[node], pom1[nb]);
        }
        else
        {
            count_ssc(nb, node);
            pom1[node] = min(pom1[node], pom1[nb]);
        }
    }

    if(pom1[node] == pom2[node])
    {
        br++;
        while(!s.empty() && s.top() != node)
        {
            pom2[s.top()] = -1;
            s.pop();
        }
        pom2[node] = -1;
        s.pop();
    }


}

void combine()
{
    cin >> q;
    while(q--)
    {
        br = 0;
        _time = 0;

        read();
        solve();

        /**for(int i = 1; i <= n; i++)
        {
            cout << i << ": ";
            for(int power = 0; power < maxlog; power++)
            {
                cout << bin_lift[i][power] << " ";
            }
            cout << endl;
        }*/

        ///cout << "-> " << get_lca(1 , 5) << endl;
        while(s.size()) s.pop();
        for(int i = 1; i <= m; i++) if(!pom2[i]) count_ssc(i, -1);

        if(br == m) cout << "Yes" << endl;
        else cout << "No" << endl;

    }
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    combine();

    return 0;

}
/**

3
3
1 2
2 3
2
2 1
3 2
7
1 2
2 3
3 4
4 5
5 6
6 7
3
1 3
4 2
2 5
8
1 2
2 3
3 4
4 5
5 6
6 7
7 8
4
1 5
2 6
3 7
4 8


*/

Compilation message

jail.cpp:12:20: warning: '#pragma GCC option' is not a string [-Wpragmas]
   12 | #pragma GCC target(avx2)
      |                    ^~~~

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12380 KB Output is correct
2 Correct 3 ms 12452 KB Output is correct
3 Correct 2 ms 12380 KB Output is correct
4 Correct 11 ms 12380 KB Output is correct
5 Correct 21 ms 12380 KB Output is correct
6 Correct 4 ms 12376 KB Output is correct
7 Correct 4 ms 12376 KB Output is correct
8 Correct 33 ms 12380 KB Output is correct
9 Correct 1086 ms 14676 KB Output is correct
10 Correct 81 ms 29012 KB Output is correct
11 Correct 15 ms 12380 KB Output is correct
12 Correct 395 ms 13648 KB Output is correct
13 Execution timed out 5015 ms 28304 KB Time limit exceeded
14 Halted 0 ms 0 KB -

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12380 KB Output is correct
2 Correct 2 ms 12380 KB Output is correct
3 Correct 3 ms 12632 KB Output is correct
4 Correct 3 ms 12380 KB Output is correct
5 Correct 3 ms 12448 KB Output is correct
6 Correct 3 ms 12380 KB Output is correct
7 Correct 4 ms 12464 KB Output is correct
8 Correct 3 ms 12380 KB Output is correct
9 Correct 3 ms 12380 KB Output is correct
10 Correct 3 ms 12380 KB Output is correct
11 Correct 4 ms 12380 KB Output is correct
12 Correct 3 ms 12380 KB Output is correct
13 Correct 3 ms 12380 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12380 KB Output is correct
2 Correct 2 ms 12380 KB Output is correct
3 Correct 3 ms 12632 KB Output is correct
4 Correct 3 ms 12380 KB Output is correct
5 Correct 3 ms 12448 KB Output is correct
6 Correct 3 ms 12380 KB Output is correct
7 Correct 4 ms 12464 KB Output is correct
8 Correct 3 ms 12380 KB Output is correct
9 Correct 3 ms 12380 KB Output is correct
10 Correct 3 ms 12380 KB Output is correct
11 Correct 4 ms 12380 KB Output is correct
12 Correct 3 ms 12380 KB Output is correct
13 Correct 3 ms 12380 KB Output is correct
14 Correct 3 ms 12444 KB Output is correct
15 Correct 2 ms 12376 KB Output is correct
16 Correct 3 ms 12380 KB Output is correct
17 Correct 3 ms 12376 KB Output is correct
18 Correct 3 ms 12464 KB Output is correct
19 Correct 3 ms 12380 KB Output is correct
20 Correct 3 ms 12380 KB Output is correct
21 Correct 3 ms 12380 KB Output is correct
22 Correct 4 ms 12380 KB Output is correct
23 Correct 2 ms 12380 KB Output is correct
24 Correct 2 ms 12380 KB Output is correct
25 Correct 3 ms 12380 KB Output is correct
26 Correct 3 ms 12380 KB Output is correct
27 Correct 3 ms 12380 KB Output is correct
28 Correct 3 ms 12380 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12380 KB Output is correct
2 Correct 2 ms 12380 KB Output is correct
3 Correct 3 ms 12632 KB Output is correct
4 Correct 3 ms 12380 KB Output is correct
5 Correct 3 ms 12448 KB Output is correct
6 Correct 3 ms 12380 KB Output is correct
7 Correct 4 ms 12464 KB Output is correct
8 Correct 3 ms 12380 KB Output is correct
9 Correct 3 ms 12380 KB Output is correct
10 Correct 3 ms 12380 KB Output is correct
11 Correct 4 ms 12380 KB Output is correct
12 Correct 3 ms 12380 KB Output is correct
13 Correct 3 ms 12380 KB Output is correct
14 Correct 3 ms 12444 KB Output is correct
15 Correct 2 ms 12376 KB Output is correct
16 Correct 3 ms 12380 KB Output is correct
17 Correct 3 ms 12376 KB Output is correct
18 Correct 3 ms 12464 KB Output is correct
19 Correct 3 ms 12380 KB Output is correct
20 Correct 3 ms 12380 KB Output is correct
21 Correct 3 ms 12380 KB Output is correct
22 Correct 4 ms 12380 KB Output is correct
23 Correct 2 ms 12380 KB Output is correct
24 Correct 2 ms 12380 KB Output is correct
25 Correct 3 ms 12380 KB Output is correct
26 Correct 3 ms 12380 KB Output is correct
27 Correct 3 ms 12380 KB Output is correct
28 Correct 3 ms 12380 KB Output is correct
29 Correct 33 ms 12380 KB Output is correct
30 Correct 21 ms 12380 KB Output is correct
31 Correct 23 ms 12380 KB Output is correct
32 Correct 15 ms 12376 KB Output is correct
33 Correct 5 ms 12380 KB Output is correct
34 Correct 40 ms 12476 KB Output is correct
35 Correct 60 ms 12380 KB Output is correct
36 Correct 29 ms 12380 KB Output is correct
37 Correct 21 ms 12380 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12380 KB Output is correct
2 Correct 2 ms 12380 KB Output is correct
3 Correct 3 ms 12632 KB Output is correct
4 Correct 3 ms 12380 KB Output is correct
5 Correct 3 ms 12448 KB Output is correct
6 Correct 3 ms 12380 KB Output is correct
7 Correct 4 ms 12464 KB Output is correct
8 Correct 3 ms 12380 KB Output is correct
9 Correct 3 ms 12380 KB Output is correct
10 Correct 3 ms 12380 KB Output is correct
11 Correct 4 ms 12380 KB Output is correct
12 Correct 3 ms 12380 KB Output is correct
13 Correct 3 ms 12380 KB Output is correct
14 Correct 3 ms 12444 KB Output is correct
15 Correct 2 ms 12376 KB Output is correct
16 Correct 3 ms 12380 KB Output is correct
17 Correct 3 ms 12376 KB Output is correct
18 Correct 3 ms 12464 KB Output is correct
19 Correct 3 ms 12380 KB Output is correct
20 Correct 3 ms 12380 KB Output is correct
21 Correct 3 ms 12380 KB Output is correct
22 Correct 4 ms 12380 KB Output is correct
23 Correct 2 ms 12380 KB Output is correct
24 Correct 2 ms 12380 KB Output is correct
25 Correct 3 ms 12380 KB Output is correct
26 Correct 3 ms 12380 KB Output is correct
27 Correct 3 ms 12380 KB Output is correct
28 Correct 3 ms 12380 KB Output is correct
29 Correct 33 ms 12380 KB Output is correct
30 Correct 21 ms 12380 KB Output is correct
31 Correct 23 ms 12380 KB Output is correct
32 Correct 15 ms 12376 KB Output is correct
33 Correct 5 ms 12380 KB Output is correct
34 Correct 40 ms 12476 KB Output is correct
35 Correct 60 ms 12380 KB Output is correct
36 Correct 29 ms 12380 KB Output is correct
37 Correct 21 ms 12380 KB Output is correct
38 Correct 1096 ms 14652 KB Output is correct
39 Correct 81 ms 29008 KB Output is correct
40 Correct 1390 ms 15028 KB Output is correct
41 Correct 1035 ms 14160 KB Output is correct
42 Correct 991 ms 15348 KB Output is correct
43 Correct 34 ms 13656 KB Output is correct
44 Correct 920 ms 12884 KB Output is correct
45 Correct 134 ms 23984 KB Output is correct
46 Correct 130 ms 23888 KB Output is correct
47 Correct 176 ms 25680 KB Output is correct
48 Correct 172 ms 25820 KB Output is correct
49 Correct 151 ms 23900 KB Output is correct
50 Correct 154 ms 23888 KB Output is correct
51 Correct 49 ms 24404 KB Output is correct
52 Correct 55 ms 24396 KB Output is correct
53 Correct 608 ms 12976 KB Output is correct
54 Correct 101 ms 23944 KB Output is correct

Subtask #6
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12380 KB Output is correct
2 Correct 3 ms 12380 KB Output is correct
3 Correct 3 ms 12376 KB Output is correct
4 Correct 3 ms 12380 KB Output is correct
5 Correct 16 ms 12380 KB Output is correct
6 Correct 3 ms 12380 KB Output is correct
7 Correct 3 ms 12380 KB Output is correct
8 Correct 2 ms 12400 KB Output is correct
9 Correct 2 ms 12380 KB Output is correct
10 Correct 3 ms 12380 KB Output is correct
11 Correct 3 ms 12380 KB Output is correct
12 Correct 29 ms 12380 KB Output is correct
13 Correct 390 ms 12460 KB Output is correct
14 Correct 194 ms 12444 KB Output is correct
15 Correct 308 ms 12380 KB Output is correct
16 Execution timed out 5049 ms 23232 KB Time limit exceeded
17 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12380 KB Output is correct
2 Correct 3 ms 12452 KB Output is correct
3 Correct 2 ms 12380 KB Output is correct
4 Correct 11 ms 12380 KB Output is correct
5 Correct 21 ms 12380 KB Output is correct
6 Correct 4 ms 12376 KB Output is correct
7 Correct 4 ms 12376 KB Output is correct
8 Correct 33 ms 12380 KB Output is correct
9 Correct 1086 ms 14676 KB Output is correct
10 Correct 81 ms 29012 KB Output is correct
11 Correct 15 ms 12380 KB Output is correct
12 Correct 395 ms 13648 KB Output is correct
13 Execution timed out 5015 ms 28304 KB Time limit exceeded
14 Halted 0 ms 0 KB -