oj.uz

Submission #111454

# Submission time Handle Problem Language Result Execution time Memory
111454 2019-05-15T11:54:32 Z JustasZ Werewolf (IOI18_werewolf) C++14
100 / 100
 1291 ms 106804 KB 
#include "werewolf.h"
#include <bits/stdc++.h>
#define pb push_back
#define x first
#define y second
#define all(a) a.begin(), a.end()
#define sz(a) (int)a.size()
#define rd() abs((int)rng())
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
const int maxn = 2e5 + 100;
const int mod = 1e9 + 7;
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
vector<int>g[maxn];
int par[maxn];
int root(int v)
{
    return v == par[v] ? v : par[v] = root(par[v]);
}
struct tree
{
    int tin[maxn], tout[maxn], tim, anc[maxn][20], to_v[maxn];
    vector<int>adj[maxn];
    tree() = default;
    void add_edge(int fr, int to)
    {
        adj[fr].pb(to);
    }
    void dfs(int v)
    {
        tin[v] = ++tim;
        to_v[tim] = v;
        for(int i = 1; i < 20; i++)
            anc[v][i] = anc[anc[v][i - 1]][i - 1];
        for(int to : adj[v])
        {
            anc[to][0] = v;
            dfs(to);
        }
        tout[v] = tim;
    }
} man, wolf;
int f[maxn];
void add(int i)
{
    for(; i < maxn; i += i & -i)
        f[i]++;
}
int get(int i)
{
    int ret = 0;
    for(; i > 0; i -= i & -i)
        ret += f[i];
    return ret;
}
int get(int l, int r)
{
    return get(r) - get(l - 1);
}
vector<int>check_validity(int n, vector<int>X, vector<int>Y, vector<int>S, vector<int>E, vector<int>L, vector<int>R)
{
    for(int i = 0; i < sz(S); i++)
        ++S[i], ++E[i], ++L[i], ++R[i];
    for(int i = 0; i < sz(X); i++)
    {
        ++X[i], ++Y[i];
        g[X[i]].pb(Y[i]);
        g[Y[i]].pb(X[i]);
    }
    for(int i = 1; i <= n; i++)
        par[i] = i;
    for(int i = 1; i <= n; i++)
    {
        for(int to : g[i])
        {
            if(to < i && root(to) != i)
            {
                wolf.add_edge(i, root(to));
                par[root(to)] = i;
            }
        }
    }
    for(int i = 1; i <= n; i++)
        par[i] = i;
    for(int i = n; i >= 1; i--)
    {
        for(int to : g[i])
        {
            if(to > i && root(to) != i)
            {
                man.add_edge(i, root(to));
                par[root(to)] = i;
            }
        }
    }
    man.dfs(1);
    wolf.dfs(n);
    for(int i = 0; i < sz(S); i++)
    {
        int v = S[i];
        for(int j = 19; j >= 0; j--)
        {
            if(man.anc[v][j] != 0 && man.anc[v][j] >= L[i])
                v = man.anc[v][j];
        }
        S[i] = v;
        v = E[i];
        for(int j = 19; j >= 0; j--)
        {
            if(wolf.anc[v][j] != 0 && wolf.anc[v][j] <= R[i])
                v = wolf.anc[v][j];
        }
        E[i] = v;
    }
    vector<tuple<int, int, int, int> >que[n + 1];
    vector<int>ans(sz(S));
    for(int i = 0; i < sz(S); i++)
    {
        que[wolf.tin[E[i]] - 1].pb(make_tuple(i, -1, man.tin[S[i]], man.tout[S[i]]));
        que[wolf.tout[E[i]]].pb(make_tuple(i, +1, man.tin[S[i]], man.tout[S[i]]));
    }
    for(int i = 1; i <= n; i++)
    {
        add(man.tin[wolf.to_v[i]]);
        for(auto aa : que[i])
        {
            int id, delta, l, r;
            tie(id, delta, l, r) = aa;
            ans[id] += delta * get(l, r);
        }
    }
    for(int i = 0; i < sz(ans); i++)
        ans[i] = (ans[i] > 0);
    return ans;
}

Subtask #1
7.0 / 7.0

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

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 14592 KB Output is correct
2 Correct 15 ms 14592 KB Output is correct
3 Correct 14 ms 14464 KB Output is correct
4 Correct 14 ms 14592 KB Output is correct
5 Correct 14 ms 14592 KB Output is correct
6 Correct 15 ms 14592 KB Output is correct
7 Correct 16 ms 14584 KB Output is correct
8 Correct 14 ms 14592 KB Output is correct
9 Correct 16 ms 14592 KB Output is correct
10 Correct 23 ms 15812 KB Output is correct
11 Correct 21 ms 15708 KB Output is correct
12 Correct 21 ms 15852 KB Output is correct
13 Correct 24 ms 15868 KB Output is correct
14 Correct 21 ms 15852 KB Output is correct
15 Correct 23 ms 15864 KB Output is correct

Subtask #3
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 893 ms 99924 KB Output is correct
2 Correct 997 ms 99580 KB Output is correct
3 Correct 823 ms 99616 KB Output is correct
4 Correct 785 ms 99212 KB Output is correct
5 Correct 865 ms 99164 KB Output is correct
6 Correct 776 ms 99292 KB Output is correct
7 Correct 751 ms 97744 KB Output is correct
8 Correct 860 ms 99808 KB Output is correct
9 Correct 694 ms 99536 KB Output is correct
10 Correct 619 ms 97676 KB Output is correct
11 Correct 546 ms 98932 KB Output is correct
12 Correct 666 ms 98800 KB Output is correct
13 Correct 1040 ms 102348 KB Output is correct
14 Correct 1158 ms 102332 KB Output is correct
15 Correct 1125 ms 102476 KB Output is correct
16 Correct 985 ms 102380 KB Output is correct
17 Correct 763 ms 97428 KB Output is correct

Subtask #4
51.0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 14592 KB Output is correct
2 Correct 15 ms 14592 KB Output is correct
3 Correct 14 ms 14464 KB Output is correct
4 Correct 14 ms 14592 KB Output is correct
5 Correct 14 ms 14592 KB Output is correct
6 Correct 15 ms 14592 KB Output is correct
7 Correct 16 ms 14584 KB Output is correct
8 Correct 14 ms 14592 KB Output is correct
9 Correct 16 ms 14592 KB Output is correct
10 Correct 23 ms 15812 KB Output is correct
11 Correct 21 ms 15708 KB Output is correct
12 Correct 21 ms 15852 KB Output is correct
13 Correct 24 ms 15868 KB Output is correct
14 Correct 21 ms 15852 KB Output is correct
15 Correct 23 ms 15864 KB Output is correct
16 Correct 893 ms 99924 KB Output is correct
17 Correct 997 ms 99580 KB Output is correct
18 Correct 823 ms 99616 KB Output is correct
19 Correct 785 ms 99212 KB Output is correct
20 Correct 865 ms 99164 KB Output is correct
21 Correct 776 ms 99292 KB Output is correct
22 Correct 751 ms 97744 KB Output is correct
23 Correct 860 ms 99808 KB Output is correct
24 Correct 694 ms 99536 KB Output is correct
25 Correct 619 ms 97676 KB Output is correct
26 Correct 546 ms 98932 KB Output is correct
27 Correct 666 ms 98800 KB Output is correct
28 Correct 1040 ms 102348 KB Output is correct
29 Correct 1158 ms 102332 KB Output is correct
30 Correct 1125 ms 102476 KB Output is correct
31 Correct 985 ms 102380 KB Output is correct
32 Correct 763 ms 97428 KB Output is correct
33 Correct 1032 ms 99312 KB Output is correct
34 Correct 397 ms 53424 KB Output is correct
35 Correct 1088 ms 100380 KB Output is correct
36 Correct 876 ms 99872 KB Output is correct
37 Correct 979 ms 99828 KB Output is correct
38 Correct 951 ms 100008 KB Output is correct
39 Correct 1032 ms 101216 KB Output is correct
40 Correct 1291 ms 106260 KB Output is correct
41 Correct 826 ms 98104 KB Output is correct
42 Correct 742 ms 98568 KB Output is correct
43 Correct 1140 ms 103928 KB Output is correct
44 Correct 1047 ms 99716 KB Output is correct
45 Correct 818 ms 102048 KB Output is correct
46 Correct 872 ms 101548 KB Output is correct
47 Correct 1004 ms 102548 KB Output is correct
48 Correct 1045 ms 102444 KB Output is correct
49 Correct 1117 ms 102452 KB Output is correct
50 Correct 989 ms 102488 KB Output is correct
51 Correct 984 ms 106804 KB Output is correct
52 Correct 982 ms 106532 KB Output is correct