oj.uz

답안 #987394

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
987394 2024-05-22T16:59:15 Z yeediot 늑대인간 (IOI18_werewolf) C++17
100 / 100
 1346 ms 97060 KB 
#pragma GCC optimize("O2")
#include<bits/stdc++.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 chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
#define vi vector<int>
#define vp vector<pii>
#define vvi vector<vi>
#define ykh mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count())
#define __lg(x) 63-__builtin_clzll(x)
#define pow2(x) (1LL<<x)
#ifdef local
void setio(){freopen("/Users/iantsai/Library/Mobile Documents/com~apple~CloudDocs/cpp/Empty.md","r",stdin);}
#else
#include "werewolf.h"
void setio(){}
#endif
#define why_TOI_is_so_de ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);setio();
const int mxn=2e5+5;
int n;
vector<int>adj2[mxn];
struct DSU{
    vector<int>to;
    void init(){
        to.resize(n+1);
        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<pair<int,int>>in[mxn];
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]];
    }
    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));
        }
    }
    for(int i=0;i<sz(E);i++){
        if(ans[i])ans[i]=1;
    }
    return ans;
}
/*
input:
 [fx,fy] = [2, 3]
[fx,fy] = [3, 4]
[fx,fy] = [1, 4]
[fx,fy] = [4, 5]
[fx,fy] = [5, 6]
[fx,fy] = [5, 4]
[fx,fy] = [6, 3]
[fx,fy] = [3, 2]
[fx,fy] = [4, 2]
[fx,fy] = [2, 1]
*/

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 15964 KB Output is correct
2 Correct 4 ms 15960 KB Output is correct
3 Correct 4 ms 15964 KB Output is correct
4 Correct 6 ms 15924 KB Output is correct
5 Correct 5 ms 15960 KB Output is correct
6 Correct 4 ms 15964 KB Output is correct
7 Correct 5 ms 15964 KB Output is correct
8 Correct 5 ms 15964 KB Output is correct
9 Correct 4 ms 15960 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 15964 KB Output is correct
2 Correct 4 ms 15960 KB Output is correct
3 Correct 4 ms 15964 KB Output is correct
4 Correct 6 ms 15924 KB Output is correct
5 Correct 5 ms 15960 KB Output is correct
6 Correct 4 ms 15964 KB Output is correct
7 Correct 5 ms 15964 KB Output is correct
8 Correct 5 ms 15964 KB Output is correct
9 Correct 4 ms 15960 KB Output is correct
10 Correct 9 ms 16984 KB Output is correct
11 Correct 9 ms 16988 KB Output is correct
12 Correct 8 ms 16984 KB Output is correct
13 Correct 8 ms 16984 KB Output is correct
14 Correct 8 ms 17240 KB Output is correct
15 Correct 9 ms 16988 KB Output is correct

Subtask #3
34.0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1346 ms 89148 KB Output is correct
2 Correct 1000 ms 90360 KB Output is correct
3 Correct 856 ms 88452 KB Output is correct
4 Correct 750 ms 87716 KB Output is correct
5 Correct 748 ms 88044 KB Output is correct
6 Correct 1125 ms 88792 KB Output is correct
7 Correct 1103 ms 87932 KB Output is correct
8 Correct 515 ms 90268 KB Output is correct
9 Correct 316 ms 87872 KB Output is correct
10 Correct 284 ms 87360 KB Output is correct
11 Correct 281 ms 87460 KB Output is correct
12 Correct 277 ms 87644 KB Output is correct
13 Correct 943 ms 95728 KB Output is correct
14 Correct 999 ms 95884 KB Output is correct
15 Correct 1068 ms 95812 KB Output is correct
16 Correct 890 ms 95652 KB Output is correct
17 Correct 733 ms 87872 KB Output is correct

Subtask #4
51.0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 15964 KB Output is correct
2 Correct 4 ms 15960 KB Output is correct
3 Correct 4 ms 15964 KB Output is correct
4 Correct 6 ms 15924 KB Output is correct
5 Correct 5 ms 15960 KB Output is correct
6 Correct 4 ms 15964 KB Output is correct
7 Correct 5 ms 15964 KB Output is correct
8 Correct 5 ms 15964 KB Output is correct
9 Correct 4 ms 15960 KB Output is correct
10 Correct 9 ms 16984 KB Output is correct
11 Correct 9 ms 16988 KB Output is correct
12 Correct 8 ms 16984 KB Output is correct
13 Correct 8 ms 16984 KB Output is correct
14 Correct 8 ms 17240 KB Output is correct
15 Correct 9 ms 16988 KB Output is correct
16 Correct 1346 ms 89148 KB Output is correct
17 Correct 1000 ms 90360 KB Output is correct
18 Correct 856 ms 88452 KB Output is correct
19 Correct 750 ms 87716 KB Output is correct
20 Correct 748 ms 88044 KB Output is correct
21 Correct 1125 ms 88792 KB Output is correct
22 Correct 1103 ms 87932 KB Output is correct
23 Correct 515 ms 90268 KB Output is correct
24 Correct 316 ms 87872 KB Output is correct
25 Correct 284 ms 87360 KB Output is correct
26 Correct 281 ms 87460 KB Output is correct
27 Correct 277 ms 87644 KB Output is correct
28 Correct 943 ms 95728 KB Output is correct
29 Correct 999 ms 95884 KB Output is correct
30 Correct 1068 ms 95812 KB Output is correct
31 Correct 890 ms 95652 KB Output is correct
32 Correct 733 ms 87872 KB Output is correct
33 Correct 1146 ms 89600 KB Output is correct
34 Correct 179 ms 40140 KB Output is correct
35 Correct 1124 ms 91536 KB Output is correct
36 Correct 1215 ms 89716 KB Output is correct
37 Correct 1316 ms 90964 KB Output is correct
38 Correct 1194 ms 90092 KB Output is correct
39 Correct 1016 ms 97060 KB Output is correct
40 Correct 808 ms 94780 KB Output is correct
41 Correct 394 ms 89092 KB Output is correct
42 Correct 305 ms 87448 KB Output is correct
43 Correct 593 ms 94360 KB Output is correct
44 Correct 623 ms 89924 KB Output is correct
45 Correct 383 ms 95552 KB Output is correct
46 Correct 388 ms 95376 KB Output is correct
47 Correct 1211 ms 95736 KB Output is correct
48 Correct 1184 ms 95948 KB Output is correct
49 Correct 1158 ms 95664 KB Output is correct
50 Correct 1163 ms 95496 KB Output is correct
51 Correct 820 ms 94368 KB Output is correct
52 Correct 504 ms 94092 KB Output is correct