oj.uz

Submission #987403

# Submission time Handle Problem Language Result Execution time Memory
987403 2024-05-22T17:05:46 Z yeediot Werewolf (IOI18_werewolf) C++17
100 / 100
 1280 ms 103624 KB 
#pragma GCC optimize("O2")
#include<bits/stdc++.h>
#include "werewolf.h"
using namespace std;
#define F first
#define S second
#define all(x) x.begin(),x.end()
#define pii pair<int,int>
#define pb push_back
#define sz(x) (int)(x.size())
#define vi vector<int>
#define why_TOI_is_so_de ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
const int mxn=2e5+5;
int n;
vector<int>adj2[mxn];
struct DSU{
    int to[mxn];
    void init(){
        for(int i=0;i<=n;i++){
            to[i]=i;
        }
    }
    int find(int x){
        return x==to[x]?x:to[x]=find(to[x]);
    }
}d;
struct tree{
    vector<vector<int>>adj,jump;
    int flg, timer, in[mxn], out[mxn], ord[mxn];
    void init(int f){
        adj.resize(n+1);
        flg=f;
        jump.resize(20,vector<int>(n+1));
    }
    void dfs(int v,int pa){
        in[v]=++timer;
        ord[timer]=v;
        jump[0][v]=pa;
        for(auto u:adj[v]){
            if(u!=pa)dfs(u,v);
        }
        out[v]=timer;
    }
    void build(){
        for(int i=1;i<20;i++){
            for(int j=1;j<=n;j++){
                jump[i][j]=jump[i-1][jump[i-1][j]];
            }
        }
    }
    int find(int st,int x){
        if(flg){
            for(int i=19;i>=0;i--){
                if(jump[i][st]<=x){
                    st=jump[i][st];
                }
            }
        }
        else{
            for(int i=19;i>=0;i--){
                if(jump[i][st]>=x){
                    st=jump[i][st];
                }
            }
        }
        return st;
    }
}mn, mx;
vector<int>upd,ans;
vector<vector<pair<int,int>>>in;
int bit[mxn];
void modify(int p){
    for(;p<=n;p+=p&-p){
        bit[p]++;
    }
}
int query(int p){
    int res=0;
    for(;p;p-=p&-p){
        res+=bit[p];
    }
    return res;
}
vi check_validity(int N,vi X,vi Y,vi S,vi E,vi L,vi R){
    why_TOI_is_so_de;
    n=N;
    ans.resize(sz(E));
    for(int i=0;i<sz(X);i++){
        int a=X[i],b=Y[i];
        a++;
        b++;
        adj2[a].pb(b);
        adj2[b].pb(a);
    }
    mn.init(1);
    mx.init(0);
    d.init();
    for(int x=n;x>=1;x--){
        for(auto y:adj2[x]){
            if(y<x)continue;
            int fx=d.find(y),fy=d.find(x);
            if(fx==fy)continue;
            mx.adj[fy].pb(fx);
            d.to[fx]=fy;
        }
    }
    d.init();
    for(int x=1;x<=n;x++){
        for(auto y:adj2[x]){
            if(y>x)continue;
            int fx=d.find(y),fy=d.find(x);
            if(fx==fy)continue;
            mn.adj[fy].pb(fx);
            d.to[fx]=fy;
        }
    }
    mn.dfs(n,n);
    mx.dfs(1,1);
    mn.build();
    mx.build();
    upd.resize(n+1);
    for(int i=1;i<=n;i++)upd[i]=mn.in[mx.ord[i]];
    in.resize(n+1);
    for(int i=0;i<sz(S);i++){
        int fs=mx.find(S[i]+1,L[i]+1),se=mn.find(E[i]+1,R[i]+1);
        S[i]=se;
        in[mx.in[fs]-1].pb({i,-1});
        in[mx.out[fs]].pb({i,1});
    }
    for(int i=1;i<=n;i++){
        modify(upd[i]);
        for(auto [id,flg]:in[i]){
            ans[id]+=flg*(query(mn.out[S[id]])-query(mn.in[S[id]]-1));
            if(flg==1 and ans[id])ans[id]=1;
        }
    }
    return ans;
}

Subtask #1
7.0 / 7.0

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

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5208 KB Output is correct
2 Correct 3 ms 5212 KB Output is correct
3 Correct 3 ms 5212 KB Output is correct
4 Correct 3 ms 5212 KB Output is correct
5 Correct 3 ms 5208 KB Output is correct
6 Correct 4 ms 5212 KB Output is correct
7 Correct 3 ms 5208 KB Output is correct
8 Correct 3 ms 5208 KB Output is correct
9 Correct 3 ms 5212 KB Output is correct
10 Correct 7 ms 6492 KB Output is correct
11 Correct 7 ms 6492 KB Output is correct
12 Correct 7 ms 6492 KB Output is correct
13 Correct 8 ms 6620 KB Output is correct
14 Correct 7 ms 6492 KB Output is correct
15 Correct 8 ms 6488 KB Output is correct

Subtask #3
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 1278 ms 94184 KB Output is correct
2 Correct 918 ms 95516 KB Output is correct
3 Correct 955 ms 93356 KB Output is correct
4 Correct 890 ms 92628 KB Output is correct
5 Correct 904 ms 92636 KB Output is correct
6 Correct 1077 ms 93700 KB Output is correct
7 Correct 1077 ms 92400 KB Output is correct
8 Correct 506 ms 95104 KB Output is correct
9 Correct 312 ms 92484 KB Output is correct
10 Correct 326 ms 91792 KB Output is correct
11 Correct 328 ms 91892 KB Output is correct
12 Correct 345 ms 91968 KB Output is correct
13 Correct 941 ms 100212 KB Output is correct
14 Correct 1036 ms 100164 KB Output is correct
15 Correct 956 ms 100536 KB Output is correct
16 Correct 990 ms 100276 KB Output is correct
17 Correct 1035 ms 92496 KB Output is correct

Subtask #4
51.0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5208 KB Output is correct
2 Correct 3 ms 5212 KB Output is correct
3 Correct 3 ms 5212 KB Output is correct
4 Correct 3 ms 5212 KB Output is correct
5 Correct 3 ms 5208 KB Output is correct
6 Correct 4 ms 5212 KB Output is correct
7 Correct 3 ms 5208 KB Output is correct
8 Correct 3 ms 5208 KB Output is correct
9 Correct 3 ms 5212 KB Output is correct
10 Correct 7 ms 6492 KB Output is correct
11 Correct 7 ms 6492 KB Output is correct
12 Correct 7 ms 6492 KB Output is correct
13 Correct 8 ms 6620 KB Output is correct
14 Correct 7 ms 6492 KB Output is correct
15 Correct 8 ms 6488 KB Output is correct
16 Correct 1278 ms 94184 KB Output is correct
17 Correct 918 ms 95516 KB Output is correct
18 Correct 955 ms 93356 KB Output is correct
19 Correct 890 ms 92628 KB Output is correct
20 Correct 904 ms 92636 KB Output is correct
21 Correct 1077 ms 93700 KB Output is correct
22 Correct 1077 ms 92400 KB Output is correct
23 Correct 506 ms 95104 KB Output is correct
24 Correct 312 ms 92484 KB Output is correct
25 Correct 326 ms 91792 KB Output is correct
26 Correct 328 ms 91892 KB Output is correct
27 Correct 345 ms 91968 KB Output is correct
28 Correct 941 ms 100212 KB Output is correct
29 Correct 1036 ms 100164 KB Output is correct
30 Correct 956 ms 100536 KB Output is correct
31 Correct 990 ms 100276 KB Output is correct
32 Correct 1035 ms 92496 KB Output is correct
33 Correct 1201 ms 94088 KB Output is correct
34 Correct 204 ms 35592 KB Output is correct
35 Correct 1280 ms 96472 KB Output is correct
36 Correct 1242 ms 94212 KB Output is correct
37 Correct 1136 ms 95776 KB Output is correct
38 Correct 1263 ms 94980 KB Output is correct
39 Correct 1132 ms 101604 KB Output is correct
40 Correct 936 ms 101356 KB Output is correct
41 Correct 468 ms 93664 KB Output is correct
42 Correct 326 ms 91948 KB Output is correct
43 Correct 600 ms 99984 KB Output is correct
44 Correct 541 ms 94528 KB Output is correct
45 Correct 341 ms 100416 KB Output is correct
46 Correct 387 ms 100092 KB Output is correct
47 Correct 1167 ms 102516 KB Output is correct
48 Correct 853 ms 102412 KB Output is correct
49 Correct 968 ms 102744 KB Output is correct
50 Correct 965 ms 102976 KB Output is correct
51 Correct 439 ms 103492 KB Output is correct
52 Correct 470 ms 103624 KB Output is correct