oj.uz

Submission #595268

# Submission time Handle Problem Language Result Execution time Memory
595268 2022-07-13T14:02:25 Z MadokaMagicaFan Werewolf (IOI18_werewolf) C++17
100 / 100
 864 ms 87960 KB 
#include "bits/stdc++.h"

using namespace std;

using ll = long long;
using vi = vector<int>;

#define all(v)                      v.begin(), v.end()
#define sz(v)                       ((int)v.size())

#define pb                          push_back
#define endl                        '\n'

#define fst                         first
#define scn                         second

const int N = 2e5;
const int K = 21;
vi adj[N];

struct dsu{
    int s[N];
    int in[N];
    vector<array<int,K>> p;
    vector<vi> dch;
    int n;

    dsu(int _n) {
        n = _n;
        p.resize(n);
        dch.resize(n);
        for (int i = 0; i < n; ++i) {
            p[i][0] = i;
            p[i][1] = i;
            s[i] = 1;
        }
    }

    int
    getp(int x)
    {
        return p[x][1] = (x == p[x][1]) ? x : getp(p[x][1]) ;
    }

    void
    conc(int a, int b)
    {
        b = getp(b);
        if (a == b) return;

        dch[a].pb(b);
        p[b][0] = a;
        p[b][1] = a;
        s[a] += s[b];
        return;
    }

    int
    dfs(int x, int cnt)
    {
        in[x] = cnt++;
        for(int u : dch[x])
            cnt = dfs(u, cnt);
        return cnt;
    }

    void
    gen()
    {
        dfs(n-1,0);
        for (int j = 1; j < K; ++j) {
            for (int i = 0; i < n; ++i) {
                p[i][j] = p[p[i][j-1]][j-1];
            }
        }
        return;
    }

    void
    query(int& x1, int& x2, int st, int v)
    {
        ++v;
        for (int j = K-1; j >= 0; --j) {
            if (p[st][j] < v) st = p[st][j];
        }

        x1 = in[st];
        x2 = x1 + s[st]-1;
        return;
    }
};

struct aib{
    vi tr;
    int n;

    aib(int _n) {
        n = _n;
        tr.assign(n,0);
    }

    void
    add(int x, int v)
    {
        for(; x < n; x |= (x+1))
            tr[x] += v;
        return;
    }

    int
    query(int x)
    {
        int res = 0;
        for (; x >= 0; x = (x&(x+1))-1)
            res += tr[x];
        return res;
    }

    int
    query(int l, int r)
    {
        return query(r) - query(l-1);
    }
};


vector<int> 
check_validity(int n, vector<int> x, vector<int> y, 
        vector<int> b, vector<int> e, vector<int> l, vector<int> r) {
    for (int i = 0; i < sz(x); ++i) {
        adj[x[i]].pb(y[i]);
        adj[y[i]].pb(x[i]);
    }

    dsu up(n), dn(n);


    for (int i = 0; i < n; ++i) {
        for (int u : adj[i])
            if (u < i) up.conc(i, u);
    }

    for (int i = n-1; i >= 0; --i) {
        for (int u : adj[i])
            if (u > i) dn.conc(n-1-i, n-1-u);
    }

    up.gen();
    dn.gen();

    int q = sz(l);
    vi ans(q,0);
    vector<pair<int,int>> in, out;


    vi y1(q) ,y2(q), pos(n);

    for (int i = 0; i < q; ++i) {
        int x1, x2, x3, x4;

        up.query(x1,x2, e[i], r[i]);
        dn.query(x3,x4, n-1-b[i], n-1-l[i]);

        in.pb({x1,i});
        out.pb({x2,i});

        y1[i] = x3;
        y2[i] = x4;
    }

    sort(in.begin(), in.end());
    sort(out.begin(), out.end());

    for (int i = 0; i < n; ++i) pos[up.in[i]] = n-i-1;

    int pi, po;
    pi = po = 0;

    aib tr(n);

    for (int i = 0; i < n; ++i) {
        while(pi < q) {
            if (i < in[pi].fst) break;

            ans[in[pi].scn] -= tr.query(y1[in[pi].scn], y2[in[pi].scn]);
            ++pi;
        }

        tr.add(dn.in[pos[i]],1);

        while(po < q) {
            if (i < out[po].fst) break;

            ans[out[po].scn] += tr.query(y1[out[po].scn], y2[out[po].scn]);
            ++po;
        }
    }

    for (int i = 0; i < q; ++i)
        if (ans[i]) ans[i] = 1;


    return ans;
}

#ifdef ONPC
void
solve()
{
    int n, m, q;
    cin >> n >> m >> q;

    vector<int> x(m), y(m), s(q), e(q), l(q), r(q);
    for (int i = 0; i < m; ++i) cin >> x[i];
    for (int i = 0; i < m; ++i) cin >> y[i];
    for (int i = 0; i < q; ++i) cin >> s[i];
    for (int i = 0; i < q; ++i) cin >> e[i];
    for (int i = 0; i < q; ++i) cin >> l[i];
    for (int i = 0; i < q; ++i) cin >> r[i];

    vector<int> ans = check_validity(n,x,y,s,e,l,r);

    for (int a : ans) {
        cout << a << ' ';
    }
    cout << endl;
}

int32_t
main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);
    freopen("in", "r", stdin);
    int t = 1;
    /* cin >> t; */
    while(t--)
        solve();
}
#endif

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 8148 KB Output is correct
2 Correct 4 ms 8148 KB Output is correct
3 Correct 4 ms 8020 KB Output is correct
4 Correct 4 ms 8020 KB Output is correct
5 Correct 4 ms 8148 KB Output is correct
6 Correct 4 ms 8148 KB Output is correct
7 Correct 4 ms 8148 KB Output is correct
8 Correct 4 ms 8148 KB Output is correct
9 Correct 4 ms 8148 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 8148 KB Output is correct
2 Correct 4 ms 8148 KB Output is correct
3 Correct 4 ms 8020 KB Output is correct
4 Correct 4 ms 8020 KB Output is correct
5 Correct 4 ms 8148 KB Output is correct
6 Correct 4 ms 8148 KB Output is correct
7 Correct 4 ms 8148 KB Output is correct
8 Correct 4 ms 8148 KB Output is correct
9 Correct 4 ms 8148 KB Output is correct
10 Correct 9 ms 9172 KB Output is correct
11 Correct 9 ms 9164 KB Output is correct
12 Correct 9 ms 9172 KB Output is correct
13 Correct 8 ms 9300 KB Output is correct
14 Correct 8 ms 9300 KB Output is correct
15 Correct 13 ms 9308 KB Output is correct

Subtask #3
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 579 ms 81576 KB Output is correct
2 Correct 599 ms 82992 KB Output is correct
3 Correct 564 ms 81984 KB Output is correct
4 Correct 558 ms 81516 KB Output is correct
5 Correct 554 ms 81508 KB Output is correct
6 Correct 605 ms 81520 KB Output is correct
7 Correct 569 ms 81432 KB Output is correct
8 Correct 525 ms 82936 KB Output is correct
9 Correct 541 ms 82160 KB Output is correct
10 Correct 519 ms 81484 KB Output is correct
11 Correct 508 ms 81540 KB Output is correct
12 Correct 513 ms 81484 KB Output is correct
13 Correct 701 ms 87576 KB Output is correct
14 Correct 650 ms 87532 KB Output is correct
15 Correct 646 ms 87568 KB Output is correct
16 Correct 670 ms 87540 KB Output is correct
17 Correct 574 ms 81580 KB Output is correct

Subtask #4
51.0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 8148 KB Output is correct
2 Correct 4 ms 8148 KB Output is correct
3 Correct 4 ms 8020 KB Output is correct
4 Correct 4 ms 8020 KB Output is correct
5 Correct 4 ms 8148 KB Output is correct
6 Correct 4 ms 8148 KB Output is correct
7 Correct 4 ms 8148 KB Output is correct
8 Correct 4 ms 8148 KB Output is correct
9 Correct 4 ms 8148 KB Output is correct
10 Correct 9 ms 9172 KB Output is correct
11 Correct 9 ms 9164 KB Output is correct
12 Correct 9 ms 9172 KB Output is correct
13 Correct 8 ms 9300 KB Output is correct
14 Correct 8 ms 9300 KB Output is correct
15 Correct 13 ms 9308 KB Output is correct
16 Correct 579 ms 81576 KB Output is correct
17 Correct 599 ms 82992 KB Output is correct
18 Correct 564 ms 81984 KB Output is correct
19 Correct 558 ms 81516 KB Output is correct
20 Correct 554 ms 81508 KB Output is correct
21 Correct 605 ms 81520 KB Output is correct
22 Correct 569 ms 81432 KB Output is correct
23 Correct 525 ms 82936 KB Output is correct
24 Correct 541 ms 82160 KB Output is correct
25 Correct 519 ms 81484 KB Output is correct
26 Correct 508 ms 81540 KB Output is correct
27 Correct 513 ms 81484 KB Output is correct
28 Correct 701 ms 87576 KB Output is correct
29 Correct 650 ms 87532 KB Output is correct
30 Correct 646 ms 87568 KB Output is correct
31 Correct 670 ms 87540 KB Output is correct
32 Correct 574 ms 81580 KB Output is correct
33 Correct 681 ms 81436 KB Output is correct
34 Correct 274 ms 32952 KB Output is correct
35 Correct 748 ms 82828 KB Output is correct
36 Correct 616 ms 81768 KB Output is correct
37 Correct 686 ms 82376 KB Output is correct
38 Correct 620 ms 82332 KB Output is correct
39 Correct 623 ms 86624 KB Output is correct
40 Correct 843 ms 87960 KB Output is correct
41 Correct 602 ms 82040 KB Output is correct
42 Correct 591 ms 81776 KB Output is correct
43 Correct 797 ms 86040 KB Output is correct
44 Correct 615 ms 82376 KB Output is correct
45 Correct 551 ms 86948 KB Output is correct
46 Correct 561 ms 86704 KB Output is correct
47 Correct 708 ms 87608 KB Output is correct
48 Correct 665 ms 87644 KB Output is correct
49 Correct 644 ms 87628 KB Output is correct
50 Correct 686 ms 87544 KB Output is correct
51 Correct 785 ms 87844 KB Output is correct
52 Correct 864 ms 87840 KB Output is correct