oj.uz

답안 #987399

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
987399 2024-05-22T17:01:17 Z yeediot 늑대인간 (IOI18_werewolf) C++17
100 / 100
 1426 ms 97100 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{
    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<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));
            if(flg==1 and ans[id])ans[id]=1;
        }
    }
    return ans;
}

Subtask #1
7.0 / 7.0

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

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 10840 KB Output is correct
2 Correct 6 ms 10588 KB Output is correct
3 Correct 7 ms 10588 KB Output is correct
4 Correct 6 ms 10588 KB Output is correct
5 Correct 6 ms 10676 KB Output is correct
6 Correct 7 ms 10588 KB Output is correct
7 Correct 6 ms 10588 KB Output is correct
8 Correct 5 ms 10588 KB Output is correct
9 Correct 6 ms 10588 KB Output is correct
10 Correct 11 ms 11864 KB Output is correct
11 Correct 11 ms 11868 KB Output is correct
12 Correct 11 ms 12120 KB Output is correct
13 Correct 10 ms 11864 KB Output is correct
14 Correct 9 ms 11868 KB Output is correct
15 Correct 11 ms 11868 KB Output is correct

Subtask #3
34.0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1426 ms 89224 KB Output is correct
2 Correct 915 ms 90612 KB Output is correct
3 Correct 867 ms 88644 KB Output is correct
4 Correct 696 ms 87620 KB Output is correct
5 Correct 827 ms 88244 KB Output is correct
6 Correct 1123 ms 88836 KB Output is correct
7 Correct 1006 ms 88132 KB Output is correct
8 Correct 513 ms 90276 KB Output is correct
9 Correct 313 ms 87828 KB Output is correct
10 Correct 290 ms 87272 KB Output is correct
11 Correct 289 ms 87292 KB Output is correct
12 Correct 310 ms 87360 KB Output is correct
13 Correct 966 ms 95676 KB Output is correct
14 Correct 1108 ms 95888 KB Output is correct
15 Correct 714 ms 95600 KB Output is correct
16 Correct 873 ms 95652 KB Output is correct
17 Correct 717 ms 87876 KB Output is correct

Subtask #4
51.0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 10840 KB Output is correct
2 Correct 6 ms 10588 KB Output is correct
3 Correct 7 ms 10588 KB Output is correct
4 Correct 6 ms 10588 KB Output is correct
5 Correct 6 ms 10676 KB Output is correct
6 Correct 7 ms 10588 KB Output is correct
7 Correct 6 ms 10588 KB Output is correct
8 Correct 5 ms 10588 KB Output is correct
9 Correct 6 ms 10588 KB Output is correct
10 Correct 11 ms 11864 KB Output is correct
11 Correct 11 ms 11868 KB Output is correct
12 Correct 11 ms 12120 KB Output is correct
13 Correct 10 ms 11864 KB Output is correct
14 Correct 9 ms 11868 KB Output is correct
15 Correct 11 ms 11868 KB Output is correct
16 Correct 1426 ms 89224 KB Output is correct
17 Correct 915 ms 90612 KB Output is correct
18 Correct 867 ms 88644 KB Output is correct
19 Correct 696 ms 87620 KB Output is correct
20 Correct 827 ms 88244 KB Output is correct
21 Correct 1123 ms 88836 KB Output is correct
22 Correct 1006 ms 88132 KB Output is correct
23 Correct 513 ms 90276 KB Output is correct
24 Correct 313 ms 87828 KB Output is correct
25 Correct 290 ms 87272 KB Output is correct
26 Correct 289 ms 87292 KB Output is correct
27 Correct 310 ms 87360 KB Output is correct
28 Correct 966 ms 95676 KB Output is correct
29 Correct 1108 ms 95888 KB Output is correct
30 Correct 714 ms 95600 KB Output is correct
31 Correct 873 ms 95652 KB Output is correct
32 Correct 717 ms 87876 KB Output is correct
33 Correct 1232 ms 89296 KB Output is correct
34 Correct 190 ms 35028 KB Output is correct
35 Correct 1220 ms 91236 KB Output is correct
36 Correct 1389 ms 89784 KB Output is correct
37 Correct 881 ms 90668 KB Output is correct
38 Correct 1151 ms 90092 KB Output is correct
39 Correct 1139 ms 97100 KB Output is correct
40 Correct 758 ms 94988 KB Output is correct
41 Correct 377 ms 88864 KB Output is correct
42 Correct 321 ms 87472 KB Output is correct
43 Correct 650 ms 94436 KB Output is correct
44 Correct 544 ms 90176 KB Output is correct
45 Correct 346 ms 95600 KB Output is correct
46 Correct 381 ms 95260 KB Output is correct
47 Correct 735 ms 95812 KB Output is correct
48 Correct 1029 ms 95900 KB Output is correct
49 Correct 1004 ms 96004 KB Output is correct
50 Correct 934 ms 95720 KB Output is correct
51 Correct 474 ms 94208 KB Output is correct
52 Correct 444 ms 94336 KB Output is correct