oj.uz

답안 #928212

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
928212 2024-02-16T04:57:43 Z HuyQuang_re_Zero 늑대인간 (IOI18_werewolf) C++14
100 / 100
 693 ms 170344 KB 
#include <bits/stdc++.h>
#define ll long long
#define db long double
#define maxn 200005
#define II pair <ll,ll>
#define III pair <ll,II>
#define IV pair <vector <int>,vector <int> >
#define IDB pair <db,int>
#define TII pair <treap*,treap*>
#define fst first
#define snd second
#define BIT(x,i) ((x>>i)&1)
#define pi acos(-1)
#define to_radian(x) (x*pi/180.0)
#define to_degree(x) (x*180.0/pi)
#define Log(x) (31-__builtin_clz((int)x))
#define LogLL(x) (63-__builtin_clzll((ll)x)
using namespace std;
#include "werewolf.h"
int r[maxn],n,m,i,q,u,v,mi[maxn],ma[maxn],Begin[maxn],End[maxn],cnt,p_inc[maxn][21],p_dec[maxn][21];
set <int> s[maxn];
vector <int> a[maxn],a_inc[maxn],a_dec[maxn];
vector <II> query[maxn];
vector <int> check_validity(int n,vector <int> U,vector <int> V,vector <int> S,vector <int> T,vector <int> L,vector <int> R)
{
    m=U.size(); q=S.size();
    for(i=0;i<m;i++) U[i]++,V[i]++;
    for(i=0;i<q;i++) S[i]++,T[i]++,L[i]++,R[i]++;
    for(i=0;i<m;i++)
    {
        u=U[i]; v=V[i];
      //  cerr<<u<<" "<<v<<'\n';
        a[u].push_back(v); a[v].push_back(u);
    }


    ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
    // Build Inc_Tree
    function <int(int)> root=[&](int u)
    {
        return u==r[u] ? u : r[u]=root(r[u]);
    };
    auto join_inc=[&](int u,int v)
    {
        u=root(u); v=root(v);
        if(u==v) return ;
        if(mi[u]>mi[v]) swap(u,v);
        a_inc[mi[u]].push_back(mi[v]);
        mi[v]=mi[u];
        r[u]=v;
    };
    for(u=1;u<=n;u++) r[u]=mi[u]=u;
    for(u=n;u>=1;u--)
        for(int v:a[u])
            if(v>u) join_inc(u,v);


    auto join_dec=[&](int u,int v)
    {
        u=root(u); v=root(v);
        if(u==v) return ;
        if(ma[u]<ma[v]) swap(u,v);
        a_dec[ma[u]].push_back(ma[v]);
        ma[v]=ma[u];
        r[u]=v;
    };
    for(u=n;u>=1;u--) r[u]=ma[u]=u;
    for(u=1;u<=n;u++)
        for(int v:a[u])
            if(v<u) join_dec(u,v);


    function <void(int)> dfs_inc=[&](int u)
    {
        Begin[u]=++cnt;
        for(int i=1;(1<<i)<=n;i++)
            p_inc[u][i]=p_inc[p_inc[u][i-1]][i-1];
        for(int v:a_inc[u])
        {
         //   cerr<<u<<" "<<v<<'\n';
            p_inc[v][0]=u;
            dfs_inc(v);
        }
        End[u]=cnt;
    };

    function <void(int)> dfs_dec=[&](int u)
    {
        for(int i=1;(1<<i)<=n;i++)
            p_dec[u][i]=p_dec[p_dec[u][i-1]][i-1];
        for(int v:a_dec[u])
        {
          //  cerr<<u<<" "<<v<<'\n';
            p_dec[v][0]=u;
            dfs_dec(v);
        }
    };
    dfs_inc(1);
    dfs_dec(n);


    vector <int> res(q);
    function <void(int)> DFS=[&](int u)
    {
        s[u].insert(Begin[u]);
        for(int v:a_dec[u])
        {
            DFS(v);
            if(s[u].size()<s[v].size()) s[u].swap(s[v]);
            for(int k:s[v]) s[u].insert(k);
        }
        for(II x:query[u])
            res[x.snd]=(s[u].lower_bound(Begin[x.fst])!=s[u].upper_bound(End[x.fst]));
    };
    for(i=0;i<q;i++)
    {
        u=S[i]; v=T[i];
        for(int j=Log(n);j>=0;j--)
            if(p_inc[u][j]>=L[i]) u=p_inc[u][j];
        for(int j=Log(n);j>=0;j--)
            if(p_dec[v][j]>0 && p_dec[v][j]<=R[i]) v=p_dec[v][j];
       query[v].push_back({ u,i });
    }

    DFS(n);
    return res;
}
/*
int main()
{
    freopen("werewolf.inp","r",stdin);
    freopen("werewolf.out","w",stdout);
    int n,m,q,u,v,s,t,l,r,i;
    cin>>n>>m>>q;
    vector <int> U,V,S,T,L,R;
    for(i=1;i<=m;i++) cin>>u>>v,U.push_back(u),V.push_back(v);
    for(i=1;i<=q;i++) cin>>s>>t>>l>>r,S.push_back(s),T.push_back(t),L.push_back(l),R.push_back(r);
    vector <int> vec=check_validity(n,U,V,S,T,L,R);
    for(i=0;i<q;i++) cout<<vec[i]<<" ";
}
*/

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 31324 KB Output is correct
2 Correct 7 ms 31452 KB Output is correct
3 Correct 7 ms 31324 KB Output is correct
4 Correct 7 ms 31324 KB Output is correct
5 Correct 6 ms 31324 KB Output is correct
6 Correct 8 ms 31324 KB Output is correct
7 Correct 7 ms 31388 KB Output is correct
8 Correct 7 ms 31320 KB Output is correct
9 Correct 7 ms 31324 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 31324 KB Output is correct
2 Correct 7 ms 31452 KB Output is correct
3 Correct 7 ms 31324 KB Output is correct
4 Correct 7 ms 31324 KB Output is correct
5 Correct 6 ms 31324 KB Output is correct
6 Correct 8 ms 31324 KB Output is correct
7 Correct 7 ms 31388 KB Output is correct
8 Correct 7 ms 31320 KB Output is correct
9 Correct 7 ms 31324 KB Output is correct
10 Correct 13 ms 32604 KB Output is correct
11 Correct 12 ms 32604 KB Output is correct
12 Correct 12 ms 32860 KB Output is correct
13 Correct 12 ms 32672 KB Output is correct
14 Correct 11 ms 32860 KB Output is correct
15 Correct 13 ms 32868 KB Output is correct

Subtask #3
34.0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 688 ms 169972 KB Output is correct
2 Correct 533 ms 135012 KB Output is correct
3 Correct 500 ms 135144 KB Output is correct
4 Correct 506 ms 141204 KB Output is correct
5 Correct 544 ms 142672 KB Output is correct
6 Correct 541 ms 148820 KB Output is correct
7 Correct 673 ms 170344 KB Output is correct
8 Correct 512 ms 134996 KB Output is correct
9 Correct 397 ms 135224 KB Output is correct
10 Correct 393 ms 140232 KB Output is correct
11 Correct 426 ms 142212 KB Output is correct
12 Correct 459 ms 149212 KB Output is correct
13 Correct 553 ms 142164 KB Output is correct
14 Correct 588 ms 142076 KB Output is correct
15 Correct 586 ms 142244 KB Output is correct
16 Correct 619 ms 142132 KB Output is correct
17 Correct 617 ms 169376 KB Output is correct

Subtask #4
51.0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 31324 KB Output is correct
2 Correct 7 ms 31452 KB Output is correct
3 Correct 7 ms 31324 KB Output is correct
4 Correct 7 ms 31324 KB Output is correct
5 Correct 6 ms 31324 KB Output is correct
6 Correct 8 ms 31324 KB Output is correct
7 Correct 7 ms 31388 KB Output is correct
8 Correct 7 ms 31320 KB Output is correct
9 Correct 7 ms 31324 KB Output is correct
10 Correct 13 ms 32604 KB Output is correct
11 Correct 12 ms 32604 KB Output is correct
12 Correct 12 ms 32860 KB Output is correct
13 Correct 12 ms 32672 KB Output is correct
14 Correct 11 ms 32860 KB Output is correct
15 Correct 13 ms 32868 KB Output is correct
16 Correct 688 ms 169972 KB Output is correct
17 Correct 533 ms 135012 KB Output is correct
18 Correct 500 ms 135144 KB Output is correct
19 Correct 506 ms 141204 KB Output is correct
20 Correct 544 ms 142672 KB Output is correct
21 Correct 541 ms 148820 KB Output is correct
22 Correct 673 ms 170344 KB Output is correct
23 Correct 512 ms 134996 KB Output is correct
24 Correct 397 ms 135224 KB Output is correct
25 Correct 393 ms 140232 KB Output is correct
26 Correct 426 ms 142212 KB Output is correct
27 Correct 459 ms 149212 KB Output is correct
28 Correct 553 ms 142164 KB Output is correct
29 Correct 588 ms 142076 KB Output is correct
30 Correct 586 ms 142244 KB Output is correct
31 Correct 619 ms 142132 KB Output is correct
32 Correct 617 ms 169376 KB Output is correct
33 Correct 625 ms 140348 KB Output is correct
34 Correct 207 ms 67232 KB Output is correct
35 Correct 693 ms 137300 KB Output is correct
36 Correct 621 ms 143376 KB Output is correct
37 Correct 684 ms 136496 KB Output is correct
38 Correct 664 ms 140944 KB Output is correct
39 Correct 650 ms 145624 KB Output is correct
40 Correct 674 ms 144664 KB Output is correct
41 Correct 557 ms 135796 KB Output is correct
42 Correct 483 ms 141908 KB Output is correct
43 Correct 676 ms 142776 KB Output is correct
44 Correct 603 ms 136520 KB Output is correct
45 Correct 523 ms 146380 KB Output is correct
46 Correct 496 ms 146000 KB Output is correct
47 Correct 639 ms 142236 KB Output is correct
48 Correct 599 ms 142156 KB Output is correct
49 Correct 624 ms 142364 KB Output is correct
50 Correct 601 ms 142424 KB Output is correct
51 Correct 608 ms 144232 KB Output is correct
52 Correct 595 ms 144288 KB Output is correct