oj.uz

Submission #987402

# Submission time Handle Problem Language Result Execution time Memory
987402 2024-05-22T17:04:22 Z yeediot Werewolf (IOI18_werewolf) C++17
100 / 100
 1451 ms 97088 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(mxn),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();
    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 s=S[i]+1,e=E[i]+1,l=L[i]+1,r=R[i]+1;
        int fs=mx.find(s,l),se=mn.find(e,r);
        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 4 ms 5976 KB Output is correct
2 Correct 4 ms 5976 KB Output is correct
3 Correct 3 ms 5980 KB Output is correct
4 Correct 4 ms 5980 KB Output is correct
5 Correct 4 ms 5980 KB Output is correct
6 Correct 4 ms 5980 KB Output is correct
7 Correct 4 ms 5980 KB Output is correct
8 Correct 3 ms 5980 KB Output is correct
9 Correct 3 ms 5980 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5976 KB Output is correct
2 Correct 4 ms 5976 KB Output is correct
3 Correct 3 ms 5980 KB Output is correct
4 Correct 4 ms 5980 KB Output is correct
5 Correct 4 ms 5980 KB Output is correct
6 Correct 4 ms 5980 KB Output is correct
7 Correct 4 ms 5980 KB Output is correct
8 Correct 3 ms 5980 KB Output is correct
9 Correct 3 ms 5980 KB Output is correct
10 Correct 8 ms 7260 KB Output is correct
11 Correct 8 ms 7260 KB Output is correct
12 Correct 8 ms 7256 KB Output is correct
13 Correct 8 ms 7256 KB Output is correct
14 Correct 7 ms 7260 KB Output is correct
15 Correct 8 ms 7288 KB Output is correct

Subtask #3
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 1451 ms 89376 KB Output is correct
2 Correct 914 ms 90484 KB Output is correct
3 Correct 982 ms 88660 KB Output is correct
4 Correct 942 ms 87756 KB Output is correct
5 Correct 1052 ms 87944 KB Output is correct
6 Correct 1101 ms 89024 KB Output is correct
7 Correct 1153 ms 87876 KB Output is correct
8 Correct 648 ms 90264 KB Output is correct
9 Correct 354 ms 87912 KB Output is correct
10 Correct 305 ms 87196 KB Output is correct
11 Correct 328 ms 87476 KB Output is correct
12 Correct 338 ms 87432 KB Output is correct
13 Correct 734 ms 95552 KB Output is correct
14 Correct 1027 ms 95556 KB Output is correct
15 Correct 965 ms 96068 KB Output is correct
16 Correct 1024 ms 95812 KB Output is correct
17 Correct 887 ms 87876 KB Output is correct

Subtask #4
51.0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5976 KB Output is correct
2 Correct 4 ms 5976 KB Output is correct
3 Correct 3 ms 5980 KB Output is correct
4 Correct 4 ms 5980 KB Output is correct
5 Correct 4 ms 5980 KB Output is correct
6 Correct 4 ms 5980 KB Output is correct
7 Correct 4 ms 5980 KB Output is correct
8 Correct 3 ms 5980 KB Output is correct
9 Correct 3 ms 5980 KB Output is correct
10 Correct 8 ms 7260 KB Output is correct
11 Correct 8 ms 7260 KB Output is correct
12 Correct 8 ms 7256 KB Output is correct
13 Correct 8 ms 7256 KB Output is correct
14 Correct 7 ms 7260 KB Output is correct
15 Correct 8 ms 7288 KB Output is correct
16 Correct 1451 ms 89376 KB Output is correct
17 Correct 914 ms 90484 KB Output is correct
18 Correct 982 ms 88660 KB Output is correct
19 Correct 942 ms 87756 KB Output is correct
20 Correct 1052 ms 87944 KB Output is correct
21 Correct 1101 ms 89024 KB Output is correct
22 Correct 1153 ms 87876 KB Output is correct
23 Correct 648 ms 90264 KB Output is correct
24 Correct 354 ms 87912 KB Output is correct
25 Correct 305 ms 87196 KB Output is correct
26 Correct 328 ms 87476 KB Output is correct
27 Correct 338 ms 87432 KB Output is correct
28 Correct 734 ms 95552 KB Output is correct
29 Correct 1027 ms 95556 KB Output is correct
30 Correct 965 ms 96068 KB Output is correct
31 Correct 1024 ms 95812 KB Output is correct
32 Correct 887 ms 87876 KB Output is correct
33 Correct 1332 ms 89400 KB Output is correct
34 Correct 197 ms 30292 KB Output is correct
35 Correct 1209 ms 91196 KB Output is correct
36 Correct 1262 ms 89924 KB Output is correct
37 Correct 1248 ms 91012 KB Output is correct
38 Correct 1369 ms 90288 KB Output is correct
39 Correct 1203 ms 97088 KB Output is correct
40 Correct 713 ms 94720 KB Output is correct
41 Correct 375 ms 88940 KB Output is correct
42 Correct 312 ms 87360 KB Output is correct
43 Correct 705 ms 94452 KB Output is correct
44 Correct 553 ms 89980 KB Output is correct
45 Correct 386 ms 95704 KB Output is correct
46 Correct 349 ms 95376 KB Output is correct
47 Correct 925 ms 95580 KB Output is correct
48 Correct 979 ms 95696 KB Output is correct
49 Correct 1020 ms 95908 KB Output is correct
50 Correct 1125 ms 95748 KB Output is correct
51 Correct 564 ms 94296 KB Output is correct
52 Correct 462 ms 94532 KB Output is correct