oj.uz

Submission #138079

# Submission time Handle Problem Language Result Execution time Memory
138079 2019-07-29T09:46:46 Z evpipis Werewolf (IOI18_werewolf) C++14
100 / 100
 2021 ms 216584 KB 
#include "werewolf.h"
#include <bits/stdc++.h>
using namespace std;

#define fi first
#define se second
#define pb push_back
#define mp make_pair
typedef pair<int, int> ii;

const int len = 2e5+5, lg = 18;
int ord[2][len], par[2][len], st[2][len], en[2][len], dp[2][lg][len];
int anc[len], cnt;
vector<int> adj[2][len], nex[len];

struct node{
    int sum;
    node *lef, *rig;

    node(int s = 0, node *l = NULL, node *r = NULL){
        sum = s;
        lef = l;
        rig = r;
    }
};

typedef node* pnode;
pnode null = new node(), root[len];

pnode upd(pnode t, int l, int r, int i){
    if (l == r)
        return new node(t->sum+1, null, null);

    int mid = (l+r)/2;
    if (i <= mid)
        return new node(t->sum+1, upd(t->lef, l, mid, i), t->rig);
    return new node(t->sum+1, t->lef, upd(t->rig, mid+1, r, i));
}

int ask(pnode a, pnode b, int l, int r, int i, int j){
    if (r < i || j < l)
        return 0;
    if (i <= l && r <= j)
        return (a->sum-b->sum);

    int mid = (l+r)/2;
    return ask(a->lef, b->lef, l, mid, i, j) + ask(a->rig, b->rig, mid+1, r, i, j);
}

int fin(int i){
    if (anc[i] == i) return i;
    return anc[i] = fin(anc[i]);
}

void dfs(int u, int t){
    ord[t][++cnt] = u;
    st[t][u] = cnt;

    for (int j = 0; j < adj[t][u].size(); j++){
        int v = adj[t][u][j];
        dfs(v, t);
        par[t][v] = u;
    }

    en[t][u] = cnt;
}

ii sub(int u, int x, int t){
    if (t == 0){
        for (int j = lg-1; j >= 0; j--)
            if (dp[t][j][u] > 0 && dp[t][j][u] >= x)
                u = dp[t][j][u];
    }
    else{
        for (int j = lg-1; j >= 0; j--)
            if (dp[t][j][u] > 0 && dp[t][j][u] <= x)
                u = dp[t][j][u];
    }

    return mp(st[t][u], en[t][u]);
}

vector<int> check_validity(int n, vector<int> X, vector<int> Y,
                                vector<int> S, vector<int> E,
                                vector<int> L, vector<int> R){
    int m = X.size(), q = S.size();

    for (int i = 0; i < m; i++){
        int a = X[i]+1, b = Y[i]+1;
        if (a > b)
            swap(a, b);

        nex[a].pb(b);
        nex[b].pb(a);
    }

    for (int i = 1; i <= n; i++)
        anc[i] = i;
    for (int l = n; l >= 1; l--){
        for (int j = 0; j < nex[l].size(); j++){
            int v = nex[l][j];
            if (l <= v && fin(v) != l)
                adj[0][l].pb(fin(v)), anc[fin(v)] = l;
        }
    }

    //for (int i = 1; i <= n; i++)
      //  printf("i = %d, fin = %d\n", i, fin(i));

    for (int i = 1; i <= n; i++)
        anc[i] = i;
    for (int r = 1; r <= n; r++){
        for (int j = 0; j < nex[r].size(); j++){
            int v = nex[r][j];
            if (r >= v && fin(v) != r)
                adj[1][r].pb(fin(v)), anc[fin(v)] = r;
        }
    }

    cnt = 0, dfs(1, 0);
    cnt = 0, dfs(n, 1);

    /*printf("ord0 =\n");
    for (int i = 1; i <= n; i++)
        printf("%d ", ord[0][i]);
    printf("\n");

    printf("ord1 =\n");
    for (int i = 1; i <= n; i++)
        printf("%d ", ord[1][i]);
    printf("\n");*/

    root[0] = null->lef = null->rig = null;
    for (int i = 1; i <= n; i++)
        root[i] = upd(root[i-1], 1, n, st[0][ord[1][i]]);

    for (int t = 0; t < 2; t++)
        for (int i = 1; i <= n; i++)
            dp[t][0][i] = par[t][i];
    for (int t = 0; t < 2; t++)
        for (int j = 1; (1<<j) < n; j++)
            for (int i = 1; i <= n; i++)
                if (dp[t][j-1][i])
                    dp[t][j][i] = dp[t][j-1][dp[t][j-1][i]];

    vector<int> out;
    for (int i = 0; i < q; i++){
        int s = S[i]+1, t = E[i]+1, l = L[i]+1, r = R[i]+1;
        ii ra0 = sub(s, l, 0), ra1 = sub(t, r, 1);
        if (ask(root[ra1.se], root[ra1.fi-1], 1, n, ra0.fi, ra0.se) > 0)
            out.pb(1);
        else
            out.pb(0);
    }
    return out;
}
/*
6 6 3
5 1
1 2
1 3
3 4
3 0
5 2
4 2 1 2
4 2 2 2
5 4 3 4
*/

Compilation message

werewolf.cpp: In function 'void dfs(int, int)':
werewolf.cpp:59:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int j = 0; j < adj[t][u].size(); j++){
                     ~~^~~~~~~~~~~~~~~~~~
werewolf.cpp: In function 'std::vector<int> check_validity(int, std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
werewolf.cpp:100:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (int j = 0; j < nex[l].size(); j++){
                         ~~^~~~~~~~~~~~~~~
werewolf.cpp:113:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (int j = 0; j < nex[r].size(); j++){
                         ~~^~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 14584 KB Output is correct
2 Correct 15 ms 14584 KB Output is correct
3 Correct 16 ms 14588 KB Output is correct
4 Correct 15 ms 14588 KB Output is correct
5 Correct 16 ms 14712 KB Output is correct
6 Correct 15 ms 14584 KB Output is correct
7 Correct 15 ms 14584 KB Output is correct
8 Correct 15 ms 14584 KB Output is correct
9 Correct 15 ms 14580 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 14584 KB Output is correct
2 Correct 15 ms 14584 KB Output is correct
3 Correct 16 ms 14588 KB Output is correct
4 Correct 15 ms 14588 KB Output is correct
5 Correct 16 ms 14712 KB Output is correct
6 Correct 15 ms 14584 KB Output is correct
7 Correct 15 ms 14584 KB Output is correct
8 Correct 15 ms 14584 KB Output is correct
9 Correct 15 ms 14580 KB Output is correct
10 Correct 25 ms 16760 KB Output is correct
11 Correct 24 ms 16636 KB Output is correct
12 Correct 24 ms 16552 KB Output is correct
13 Correct 25 ms 16988 KB Output is correct
14 Correct 24 ms 16888 KB Output is correct
15 Correct 25 ms 16892 KB Output is correct

Subtask #3
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 1192 ms 184828 KB Output is correct
2 Correct 1414 ms 203636 KB Output is correct
3 Correct 1208 ms 195704 KB Output is correct
4 Correct 1154 ms 189476 KB Output is correct
5 Correct 1131 ms 188720 KB Output is correct
6 Correct 1169 ms 187636 KB Output is correct
7 Correct 1020 ms 184432 KB Output is correct
8 Correct 1294 ms 203640 KB Output is correct
9 Correct 881 ms 195860 KB Output is correct
10 Correct 777 ms 189428 KB Output is correct
11 Correct 834 ms 188840 KB Output is correct
12 Correct 821 ms 187684 KB Output is correct
13 Correct 1459 ms 212012 KB Output is correct
14 Correct 1367 ms 211956 KB Output is correct
15 Correct 1475 ms 211984 KB Output is correct
16 Correct 1387 ms 212048 KB Output is correct
17 Correct 1093 ms 184560 KB Output is correct

Subtask #4
51.0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 14584 KB Output is correct
2 Correct 15 ms 14584 KB Output is correct
3 Correct 16 ms 14588 KB Output is correct
4 Correct 15 ms 14588 KB Output is correct
5 Correct 16 ms 14712 KB Output is correct
6 Correct 15 ms 14584 KB Output is correct
7 Correct 15 ms 14584 KB Output is correct
8 Correct 15 ms 14584 KB Output is correct
9 Correct 15 ms 14580 KB Output is correct
10 Correct 25 ms 16760 KB Output is correct
11 Correct 24 ms 16636 KB Output is correct
12 Correct 24 ms 16552 KB Output is correct
13 Correct 25 ms 16988 KB Output is correct
14 Correct 24 ms 16888 KB Output is correct
15 Correct 25 ms 16892 KB Output is correct
16 Correct 1192 ms 184828 KB Output is correct
17 Correct 1414 ms 203636 KB Output is correct
18 Correct 1208 ms 195704 KB Output is correct
19 Correct 1154 ms 189476 KB Output is correct
20 Correct 1131 ms 188720 KB Output is correct
21 Correct 1169 ms 187636 KB Output is correct
22 Correct 1020 ms 184432 KB Output is correct
23 Correct 1294 ms 203640 KB Output is correct
24 Correct 881 ms 195860 KB Output is correct
25 Correct 777 ms 189428 KB Output is correct
26 Correct 834 ms 188840 KB Output is correct
27 Correct 821 ms 187684 KB Output is correct
28 Correct 1459 ms 212012 KB Output is correct
29 Correct 1367 ms 211956 KB Output is correct
30 Correct 1475 ms 211984 KB Output is correct
31 Correct 1387 ms 212048 KB Output is correct
32 Correct 1093 ms 184560 KB Output is correct
33 Correct 1765 ms 198688 KB Output is correct
34 Correct 398 ms 46520 KB Output is correct
35 Correct 1966 ms 205172 KB Output is correct
36 Correct 1692 ms 198324 KB Output is correct
37 Correct 1851 ms 203788 KB Output is correct
38 Correct 1759 ms 200516 KB Output is correct
39 Correct 1762 ms 213744 KB Output is correct
40 Correct 1289 ms 211192 KB Output is correct
41 Correct 1301 ms 202916 KB Output is correct
42 Correct 859 ms 198160 KB Output is correct
43 Correct 2021 ms 212268 KB Output is correct
44 Correct 1807 ms 203716 KB Output is correct
45 Correct 1372 ms 216584 KB Output is correct
46 Correct 1497 ms 213264 KB Output is correct
47 Correct 1423 ms 212220 KB Output is correct
48 Correct 1355 ms 212236 KB Output is correct
49 Correct 1393 ms 212316 KB Output is correct
50 Correct 1382 ms 211912 KB Output is correct
51 Correct 1195 ms 211604 KB Output is correct
52 Correct 1169 ms 211500 KB Output is correct