oj.uz

Submission #810630

# Submission time Handle Problem Language Result Execution time Memory
810630 2023-08-06T12:50:32 Z mrwang Werewolf (IOI18_werewolf) C++14
100 / 100
 570 ms 167972 KB 
#include<bits/stdc++.h>
#include "werewolf.h"
#define TASKNAME "codeforce"
#define pb push_back
#define pli pair<int,int>
#define fi first
#define se second
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL);
using namespace std;
using ll=long long;
const ll maxN=4e5+10;
const ll inf=1e18;
const ll mod=1e9+7;
ll n,m,q,u[maxN],v[maxN],l[maxN],r[maxN];
vector<ll>g[maxN],a[maxN],b[maxN],v1[maxN],v2[maxN];
ll lab[maxN],lead[maxN];

ll findset(ll u)
{
    return lab[u]<0?u:lab[u]=findset(lab[u]);
}
void unite(ll u,ll v)
{
    u=findset(u);
    v=findset(v);
    if(lab[u]>lab[v]) swap(u,v);
    lab[u]+=lab[v];
    lab[v]=u;
}
ll s[maxN],t[maxN],in[maxN],out[maxN],tg=0;
set<int>ss[maxN];
void dfs(ll u)
{
    in[u]=++tg;
    for(int v:a[u])
    {
        dfs(v);
    }
    out[u]=tg;
}
vector<int> ans;
vector<pli>quer[maxN];
set<int>::iterator it;
void DFS(ll u)
{
    ss[u].insert(in[u]);
    for(int v:b[u])
    {
        DFS(v);
        if(ss[u].size()<ss[v].size()) ss[u].swap(ss[v]);
        for(auto zz:ss[v])
        {
            ss[u].insert(zz);
        }
        ss[v].clear();
    }
    for(auto cc:quer[u])
    {
        ll id=cc.fi;
        ll v=cc.se;
        it=ss[u].lower_bound(in[v]);
        if(it!=ss[u].end()&&*it<=out[v]) ans[id]=1;
        else ans[id]=0;
    }
}
vector<int> check_validity(int N, vector<int> X, vector<int> Y, vector<int> S, vector<int> E, vector<int> L, vector<int> R)
{
    n=N;
    m=X.size();
    for(int i=0;i<m;i++)
    {
        X[i]++;
        Y[i]++;
        g[X[i]].pb(Y[i]);
        g[Y[i]].pb(X[i]);
    }
    q=S.size();
    for(int i=0;i<q;i++)
    {
        u[i+1]=S[i]+1;
        v[i+1]=E[i]+1;
        l[i+1]=L[i];
        r[i+1]=R[i];
        l[i+1]++;
        r[i+1]++;
    }

    ans.resize(q+1);
    for(int i=1;i<=q;i++)
    {
        if(u[i]>=l[i]&&v[i]<=r[i])
        {
            v1[l[i]].pb(i);
            v2[r[i]].pb(i);
            continue;
        }
        ans[i]=0;
    }
    for(int i=1;i<=n;i++) lab[i]=-1,lead[i]=i;
    for(int i=1;i<=n;i++)
    {
        for(int j:g[i])
        {
            if(j>i) continue;
            if(findset(i)==findset(j)) continue;
            j=findset(j);
            ll x=lead[j];
            a[i].pb(x);
            unite(i,j);
        }
        lead[findset(i)]=i;
        for(auto id:v2[i])
        {
            t[id]=lead[findset(v[id])];
        }
    }
    for(int i=1;i<=n;i++) lab[i]=-1,lead[i]=i;
    for(int i=n;i>=1;i--)
    {
        for(int j:g[i])
        {
            if(j<i) continue;
            if(findset(i)==findset(j)) continue;
            j=findset(j);
            ll x=lead[j];
            b[i].pb(x);
            unite(i,j);
        }
        lead[findset(i)]=i;
        for(auto id:v1[i])
        {
            s[id]=lead[findset(u[id])];
        }
    }
    for(int i=1;i<=q;i++)
    {
        if(s[i]==0||t[i]==0) continue;
        quer[s[i]].pb({i,t[i]});
    }
    dfs(n);
    DFS(1);
    ans.erase(ans.begin());
    return ans;
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 75468 KB Output is correct
2 Correct 34 ms 75532 KB Output is correct
3 Correct 33 ms 75540 KB Output is correct
4 Correct 34 ms 75444 KB Output is correct
5 Correct 37 ms 75456 KB Output is correct
6 Correct 34 ms 75420 KB Output is correct
7 Correct 33 ms 75532 KB Output is correct
8 Correct 34 ms 75500 KB Output is correct
9 Correct 33 ms 75476 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 75468 KB Output is correct
2 Correct 34 ms 75532 KB Output is correct
3 Correct 33 ms 75540 KB Output is correct
4 Correct 34 ms 75444 KB Output is correct
5 Correct 37 ms 75456 KB Output is correct
6 Correct 34 ms 75420 KB Output is correct
7 Correct 33 ms 75532 KB Output is correct
8 Correct 34 ms 75500 KB Output is correct
9 Correct 33 ms 75476 KB Output is correct
10 Correct 36 ms 76704 KB Output is correct
11 Correct 36 ms 76540 KB Output is correct
12 Correct 38 ms 76456 KB Output is correct
13 Correct 35 ms 76688 KB Output is correct
14 Correct 36 ms 76600 KB Output is correct
15 Correct 37 ms 76748 KB Output is correct

Subtask #3
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 522 ms 148096 KB Output is correct
2 Correct 403 ms 147088 KB Output is correct
3 Correct 420 ms 144792 KB Output is correct
4 Correct 521 ms 144580 KB Output is correct
5 Correct 451 ms 145108 KB Output is correct
6 Correct 508 ms 146736 KB Output is correct
7 Correct 469 ms 144748 KB Output is correct
8 Correct 419 ms 147108 KB Output is correct
9 Correct 425 ms 143324 KB Output is correct
10 Correct 415 ms 142996 KB Output is correct
11 Correct 416 ms 143324 KB Output is correct
12 Correct 482 ms 145084 KB Output is correct
13 Correct 417 ms 167504 KB Output is correct
14 Correct 441 ms 167568 KB Output is correct
15 Correct 444 ms 167484 KB Output is correct
16 Correct 427 ms 167584 KB Output is correct
17 Correct 467 ms 144812 KB Output is correct

Subtask #4
51.0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 75468 KB Output is correct
2 Correct 34 ms 75532 KB Output is correct
3 Correct 33 ms 75540 KB Output is correct
4 Correct 34 ms 75444 KB Output is correct
5 Correct 37 ms 75456 KB Output is correct
6 Correct 34 ms 75420 KB Output is correct
7 Correct 33 ms 75532 KB Output is correct
8 Correct 34 ms 75500 KB Output is correct
9 Correct 33 ms 75476 KB Output is correct
10 Correct 36 ms 76704 KB Output is correct
11 Correct 36 ms 76540 KB Output is correct
12 Correct 38 ms 76456 KB Output is correct
13 Correct 35 ms 76688 KB Output is correct
14 Correct 36 ms 76600 KB Output is correct
15 Correct 37 ms 76748 KB Output is correct
16 Correct 522 ms 148096 KB Output is correct
17 Correct 403 ms 147088 KB Output is correct
18 Correct 420 ms 144792 KB Output is correct
19 Correct 521 ms 144580 KB Output is correct
20 Correct 451 ms 145108 KB Output is correct
21 Correct 508 ms 146736 KB Output is correct
22 Correct 469 ms 144748 KB Output is correct
23 Correct 419 ms 147108 KB Output is correct
24 Correct 425 ms 143324 KB Output is correct
25 Correct 415 ms 142996 KB Output is correct
26 Correct 416 ms 143324 KB Output is correct
27 Correct 482 ms 145084 KB Output is correct
28 Correct 417 ms 167504 KB Output is correct
29 Correct 441 ms 167568 KB Output is correct
30 Correct 444 ms 167484 KB Output is correct
31 Correct 427 ms 167584 KB Output is correct
32 Correct 467 ms 144812 KB Output is correct
33 Correct 487 ms 149052 KB Output is correct
34 Correct 212 ms 129200 KB Output is correct
35 Correct 496 ms 155912 KB Output is correct
36 Correct 506 ms 147384 KB Output is correct
37 Correct 517 ms 154100 KB Output is correct
38 Correct 523 ms 148912 KB Output is correct
39 Correct 495 ms 153676 KB Output is correct
40 Correct 496 ms 164656 KB Output is correct
41 Correct 471 ms 151620 KB Output is correct
42 Correct 449 ms 144528 KB Output is correct
43 Correct 570 ms 164700 KB Output is correct
44 Correct 488 ms 153244 KB Output is correct
45 Correct 469 ms 151408 KB Output is correct
46 Correct 487 ms 151192 KB Output is correct
47 Correct 449 ms 167972 KB Output is correct
48 Correct 431 ms 167532 KB Output is correct
49 Correct 538 ms 167844 KB Output is correct
50 Correct 421 ms 167552 KB Output is correct
51 Correct 453 ms 163228 KB Output is correct
52 Correct 502 ms 163204 KB Output is correct