oj.uz

Submission #595251

# Submission time Handle Problem Language Result Execution time Memory
595251 2022-07-13T13:20:49 Z MadokaMagicaFan Werewolf (IOI18_werewolf) C++14
100 / 100
 1168 ms 121404 KB 
#include "bits/stdc++.h"

using namespace std;

using ll = long long;
using vi = vector<int>;
const ll inf = 1e9;

#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 = 23;
vi adj[N];

struct dsu{
    int s[N];
    int in[N];
    vector<vi> 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].assign(K,0);
            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)
    {
        a = getp(a);
        b = getp(b);
        if (a == b) return;
        if (a < b) swap(a,b);

        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();

    vi xpos(n), ypos(n);

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

    vi y1(q),y2(q);

    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;
    }

    vi pos(n);

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

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


    int pi, po;
    pi = po = 0;

    aib tr(n);

    for (int i = 0; i < n; ++i) {
        while(pi < sz(in)) {
            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 < sz(out)) {
            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 5 ms 8068 KB Output is correct
3 Correct 5 ms 8148 KB Output is correct
4 Correct 5 ms 8020 KB Output is correct
5 Correct 5 ms 8148 KB Output is correct
6 Correct 5 ms 8064 KB Output is correct
7 Correct 4 ms 8068 KB Output is correct
8 Correct 5 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 5 ms 8068 KB Output is correct
3 Correct 5 ms 8148 KB Output is correct
4 Correct 5 ms 8020 KB Output is correct
5 Correct 5 ms 8148 KB Output is correct
6 Correct 5 ms 8064 KB Output is correct
7 Correct 4 ms 8068 KB Output is correct
8 Correct 5 ms 8148 KB Output is correct
9 Correct 4 ms 8148 KB Output is correct
10 Correct 10 ms 9684 KB Output is correct
11 Correct 10 ms 9636 KB Output is correct
12 Correct 11 ms 9616 KB Output is correct
13 Correct 10 ms 9748 KB Output is correct
14 Correct 9 ms 9684 KB Output is correct
15 Correct 14 ms 9828 KB Output is correct

Subtask #3
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 742 ms 105784 KB Output is correct
2 Correct 861 ms 113248 KB Output is correct
3 Correct 772 ms 112228 KB Output is correct
4 Correct 688 ms 111884 KB Output is correct
5 Correct 683 ms 111900 KB Output is correct
6 Correct 743 ms 111792 KB Output is correct
7 Correct 729 ms 111816 KB Output is correct
8 Correct 776 ms 113156 KB Output is correct
9 Correct 601 ms 112212 KB Output is correct
10 Correct 526 ms 111912 KB Output is correct
11 Correct 585 ms 111864 KB Output is correct
12 Correct 610 ms 111808 KB Output is correct
13 Correct 902 ms 117828 KB Output is correct
14 Correct 893 ms 117856 KB Output is correct
15 Correct 864 ms 117828 KB Output is correct
16 Correct 875 ms 117916 KB Output is correct
17 Correct 743 ms 111804 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 5 ms 8068 KB Output is correct
3 Correct 5 ms 8148 KB Output is correct
4 Correct 5 ms 8020 KB Output is correct
5 Correct 5 ms 8148 KB Output is correct
6 Correct 5 ms 8064 KB Output is correct
7 Correct 4 ms 8068 KB Output is correct
8 Correct 5 ms 8148 KB Output is correct
9 Correct 4 ms 8148 KB Output is correct
10 Correct 10 ms 9684 KB Output is correct
11 Correct 10 ms 9636 KB Output is correct
12 Correct 11 ms 9616 KB Output is correct
13 Correct 10 ms 9748 KB Output is correct
14 Correct 9 ms 9684 KB Output is correct
15 Correct 14 ms 9828 KB Output is correct
16 Correct 742 ms 105784 KB Output is correct
17 Correct 861 ms 113248 KB Output is correct
18 Correct 772 ms 112228 KB Output is correct
19 Correct 688 ms 111884 KB Output is correct
20 Correct 683 ms 111900 KB Output is correct
21 Correct 743 ms 111792 KB Output is correct
22 Correct 729 ms 111816 KB Output is correct
23 Correct 776 ms 113156 KB Output is correct
24 Correct 601 ms 112212 KB Output is correct
25 Correct 526 ms 111912 KB Output is correct
26 Correct 585 ms 111864 KB Output is correct
27 Correct 610 ms 111808 KB Output is correct
28 Correct 902 ms 117828 KB Output is correct
29 Correct 893 ms 117856 KB Output is correct
30 Correct 864 ms 117828 KB Output is correct
31 Correct 875 ms 117916 KB Output is correct
32 Correct 743 ms 111804 KB Output is correct
33 Correct 837 ms 111728 KB Output is correct
34 Correct 320 ms 44384 KB Output is correct
35 Correct 941 ms 113360 KB Output is correct
36 Correct 794 ms 112224 KB Output is correct
37 Correct 899 ms 112788 KB Output is correct
38 Correct 878 ms 112532 KB Output is correct
39 Correct 886 ms 116968 KB Output is correct
40 Correct 1143 ms 121404 KB Output is correct
41 Correct 718 ms 112432 KB Output is correct
42 Correct 654 ms 112304 KB Output is correct
43 Correct 1014 ms 117744 KB Output is correct
44 Correct 825 ms 112764 KB Output is correct
45 Correct 777 ms 117424 KB Output is correct
46 Correct 783 ms 117040 KB Output is correct
47 Correct 844 ms 118072 KB Output is correct
48 Correct 890 ms 117816 KB Output is correct
49 Correct 966 ms 118280 KB Output is correct
50 Correct 921 ms 117988 KB Output is correct
51 Correct 1088 ms 121308 KB Output is correct
52 Correct 1168 ms 121312 KB Output is correct