oj.uz

Submission #120116

# Submission time Handle Problem Language Result Execution time Memory
120116 2019-06-23T12:09:38 Z Meloric Werewolf (IOI18_werewolf) C++14
100 / 100
 2448 ms 169576 KB 
#include "werewolf.h"
#include <bits/stdc++.h>

#define pb push_back
#define pii pair<int, int>
#define X first
#define Y second
#define ub upper_bound
#define lb lower_bound

using namespace std;

struct disj{
    vector<int> par;
    disj(int n){
        for(int i = 0; i<n; i++)par.pb(i);
    }
    int fi(int a){return (a == par[a]) ? a : par[a] = fi(par[a]);}
    void me(int a, int b){
        a = fi(a);
        b = fi(b);
        par[b] = a;
    }
};
struct ft{
    vector<int> fen;
    ft(int n){
        fen.assign(n+1, 0);
    }
    int qer(int a){
        a++;
        int ans = 0;
        for(; a > 0; a-=a&(-a))ans+=fen[a];
        return ans;
    }
    void upd(int a, int b){
        a++;
        for(; a < fen.size(); a+=a&(-a))fen[a]+=b;
    }
};
void print(vector<vector<int>>& g2){
    int k = 0;
    for(auto i : g2){
        cout << k <<':';k++;
        for(auto j : i){
            cout << j << ' ';
        }
        cout << '\n';
    }
}
void dfs(int v, int p, int& counter, vector<vector<int>>& g, vector<vector<int>>& up, vector<pii>& time){
    up[v][0] = p;
    time[v].X = counter++;
    for(int i = 1; i < 30; i++){
        up[v][i] = up[up[v][i-1]][i-1];
    }
    for(auto ch : g[v])dfs(ch, v, counter, g, up, time);
    time[v].Y = counter++;
}
int jump1(int v, int val, vector<vector<int>>& up){
    for(int i = 29; i >= 0; i--){
        if(up[v][i] <= val){
            v = up[v][i];
        }
    }
    return v;
}
int jump2(int v, int val, vector<vector<int>>& up){
    for(int i = 29; i >= 0; i--){
        if(up[v][i] >= val){
            v = up[v][i];
        }
    }
    return v;
}
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 Q = S.size(); int M = X.size();
    vector<vector<int>> g;
    g.assign(N, vector<int>());
    for(int i = 0; i<M; i++){
        g[X[i]].pb(Y[i]);
        g[Y[i]].pb(X[i]);
    }
    disj sml(N), big(N);
    vector<vector<int>> g1, g2, up1, up2;
    vector<pii> time1, time2;
    g1.assign(N, vector<int>());
    g2.assign(N, vector<int>());
    up1.assign(N, vector<int>(30));
    up2.assign(N, vector<int>(30));
    time1.assign(N, {0, 0});
    time2.assign(N, {0, 0});
    for(int i = 0; i < N; i++){
        for(auto j : g[i]){
            if(j < i && big.fi(i) != big.fi(j)){
                g1[i].pb(big.fi(j));
                big.me(i, j);
            }
        }
    }
    for(int i = N-1; i >= 0; i--){
        for(auto j : g[i]){
            if(j > i && sml.fi(i) != sml.fi(j)){
                g2[i].pb(sml.fi(j));
                sml.me(i, j);
            }
        }
    }
    int counter = 0;
    dfs(N-1, N-1, counter, g1, up1, time1);counter = 0;
    dfs(0, 0, counter, g2, up2, time2);
    vector<vector<int>> events;
    for(int i = 0; i< N; i++){
        events.pb({time1[i].X, 0, time2[i].X, -1, -1});
    }
    for(int i = 0; i< Q; i++){
        int tmp1 = jump1(E[i], R[i], up1);
        int tmp2 = jump2(S[i], L[i], up2);
        events.pb({time1[tmp1].X, -1, time2[tmp2].X, time2[tmp2].Y, i});
        events.pb({time1[tmp1].Y, 1, time2[tmp2].X, time2[tmp2].Y, i});
    }
    //print(events);
    sort(events.begin(), events.end());
    ft fen(2*N+5);
    vector<int> A(Q);
    for(auto i : events){
        if(i[1] == 0){
            fen.upd(i[2], 1);
        }else{
            int ans = fen.qer(i[3])-fen.qer(i[2]-1);
            A[i[4]] += ans*i[1];
        }
    }
    //for(auto i : A)cout << i << ' ';
    for (int i = 0; i < Q; ++i){
        if(A[i]>0)A[i] = 1;
    }
    return A;
}

Compilation message

werewolf.cpp: In member function 'void ft::upd(int, int)':
werewolf.cpp:38:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(; a < fen.size(); a+=a&(-a))fen[a]+=b;
               ~~^~~~~~~~~~~~

Subtask #1
7.0 / 7.0

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

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 11 ms 2688 KB Output is correct
11 Correct 11 ms 2552 KB Output is correct
12 Correct 11 ms 2560 KB Output is correct
13 Correct 12 ms 2816 KB Output is correct
14 Correct 12 ms 2816 KB Output is correct
15 Correct 13 ms 2688 KB Output is correct

Subtask #3
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 1463 ms 152216 KB Output is correct
2 Correct 2068 ms 157896 KB Output is correct
3 Correct 1531 ms 154056 KB Output is correct
4 Correct 1407 ms 152500 KB Output is correct
5 Correct 1553 ms 152580 KB Output is correct
6 Correct 1423 ms 152380 KB Output is correct
7 Correct 1499 ms 152220 KB Output is correct
8 Correct 1786 ms 157836 KB Output is correct
9 Correct 1310 ms 154056 KB Output is correct
10 Correct 1073 ms 152556 KB Output is correct
11 Correct 1169 ms 152340 KB Output is correct
12 Correct 1390 ms 152228 KB Output is correct
13 Correct 2087 ms 164256 KB Output is correct
14 Correct 2105 ms 164300 KB Output is correct
15 Correct 2012 ms 164180 KB Output is correct
16 Correct 2012 ms 164292 KB Output is correct
17 Correct 1476 ms 152116 KB Output is correct

Subtask #4
51.0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 11 ms 2688 KB Output is correct
11 Correct 11 ms 2552 KB Output is correct
12 Correct 11 ms 2560 KB Output is correct
13 Correct 12 ms 2816 KB Output is correct
14 Correct 12 ms 2816 KB Output is correct
15 Correct 13 ms 2688 KB Output is correct
16 Correct 1463 ms 152216 KB Output is correct
17 Correct 2068 ms 157896 KB Output is correct
18 Correct 1531 ms 154056 KB Output is correct
19 Correct 1407 ms 152500 KB Output is correct
20 Correct 1553 ms 152580 KB Output is correct
21 Correct 1423 ms 152380 KB Output is correct
22 Correct 1499 ms 152220 KB Output is correct
23 Correct 1786 ms 157836 KB Output is correct
24 Correct 1310 ms 154056 KB Output is correct
25 Correct 1073 ms 152556 KB Output is correct
26 Correct 1169 ms 152340 KB Output is correct
27 Correct 1390 ms 152228 KB Output is correct
28 Correct 2087 ms 164256 KB Output is correct
29 Correct 2105 ms 164300 KB Output is correct
30 Correct 2012 ms 164180 KB Output is correct
31 Correct 2012 ms 164292 KB Output is correct
32 Correct 1476 ms 152116 KB Output is correct
33 Correct 1610 ms 153176 KB Output is correct
34 Correct 680 ms 53644 KB Output is correct
35 Correct 2440 ms 157160 KB Output is correct
36 Correct 1518 ms 153228 KB Output is correct
37 Correct 1882 ms 156136 KB Output is correct
38 Correct 1680 ms 154052 KB Output is correct
39 Correct 1774 ms 169292 KB Output is correct
40 Correct 2448 ms 164420 KB Output is correct
41 Correct 1567 ms 155196 KB Output is correct
42 Correct 1318 ms 153268 KB Output is correct
43 Correct 2205 ms 163412 KB Output is correct
44 Correct 1840 ms 155908 KB Output is correct
45 Correct 1542 ms 169576 KB Output is correct
46 Correct 1452 ms 169160 KB Output is correct
47 Correct 2049 ms 164556 KB Output is correct
48 Correct 2204 ms 164244 KB Output is correct
49 Correct 2167 ms 164304 KB Output is correct
50 Correct 2101 ms 164240 KB Output is correct
51 Correct 2001 ms 164552 KB Output is correct
52 Correct 1918 ms 164424 KB Output is correct