oj.uz

답안 #431932

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
431932 2021-06-17T17:28:49 Z Enkognit 늑대인간 (IOI18_werewolf) C++14
100 / 100
 1543 ms 158772 KB 
#include <bits/stdc++.h>
#define ll long long
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define pll pair<ll,ll>
#define pii pair<int,int>
#define all(v) v.begin(),v.end()
#include "werewolf.h"

using namespace std;

ll N;
vector<ll> c[200005], g1[200005], g2[200005];
ll in1[200005], out1[200005], in2[200005], out2[200005];
ll bn1[200005][20], bn2[200005][20];
vector<ll> v1, v2;

void dfs1(int h,int p)
{
    bn1[h][0]=p;
    for (int i = 1; i < 20; i++)
        if (bn1[h][i-1]!=N) bn1[h][i]=bn1[bn1[h][i-1]][i-1]; else bn1[h][i]=N;

    in1[h]=v1.size();

    v1.pb(h);

    for (int i = 0; i < g1[h].size(); i++)
        dfs1(g1[h][i], h);

    out1[h]=v1.size();

    v1.pb(h);
}

void dfs2(int h,int p=-1)
{
    bn2[h][0]=p;
    for (int i = 1; i < 20; i++)
        if (bn2[h][i-1]!=-1)bn2[h][i]=bn2[bn2[h][i-1]][i-1]; else bn2[h][i]=-1;

    in2[h]=v2.size();

    v2.pb(h);

    for (int i = 0; i < g2[h].size(); i++)
        dfs2(g2[h][i], h);

    out2[h]=v2.size();

    v2.pb(h);
}

    ll d[1600001];

    void build(int h,int l,int r)
    {
        if (l==r)
        {
            d[h]=-1;
            return;
        }
        int w=(l+r)/2;
        build(h*2,l,w);
        build(h*2+1,w+1,r);
        d[h]=max(d[h*2], d[h*2+1]);
    }

    ll get(int h,int l,int r,int x,int y)
    {
        if (x>y) return -1;
        if (l==x && y==r) return d[h];
        int w=(l+r)/2;
        return max(get(h*2,l,w,x,min(y,w)), get(h*2+1,w+1,r,max(x,w+1),y));
    }

    void update(int h,int l,int r,int x,int k)
    {
        if (l==r)
        {
            d[h]=k;
            return;
        }
        int w=(l+r)/2;
        if (x<=w) update(h*2,l,w,x,k); else update(h*2+1,w+1,r,x,k);
        d[h]=max(d[h*2], d[h*2+1]);
    }


struct dsu
{
    ll d[1000001];

    void make_sets(int h)
    {
        for (int i = 0; i <= h; i++)
            d[i]=i;
    }

    ll find_set(int h)
    {
        if (h==d[h]) return h; else return d[h]=find_set(d[h]);
    }

    bool unite_sets(int x,int y)
    {
        x=find_set(x);
        y=find_set(y);
        if (x!=y)
        {
            d[y]=x;
            return 1;
        }
        return 0;
    }
} gg;


std::vector<int> check_validity(int n, std::vector<int> x, std::vector<int> y,
                                std::vector<int> s, std::vector<int> e,
                                std::vector<int> l, std::vector<int> r) {
    for (int i = 0; i < x.size(); i++)
    {
        c[x[i]].pb(y[i]);
        c[y[i]].pb(x[i]);
    }

    N=n;

    vector<int> ans;
    ans.resize(s.size());

    gg.make_sets(n);

    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < c[i].size(); j++)
            if (c[i][j]<i)
            {
                ll to=gg.find_set(c[i][j]);
                if (gg.unite_sets(i, to))
                {
                    g1[i].pb(to);
                    //cout << " " << i << " " << to << "\n";
                }
            }
    }

    gg.make_sets(n);

    for (int i = n-1; i > -1; i--)
    {
        for (int j = 0; j < c[i].size(); j++)
            if (c[i][j]>i)
            {
                ll to=gg.find_set(c[i][j]);
                if (gg.unite_sets(i, to))
                {
                    g2[i].pb(to);
                    //cout << i << " " << to << "\n";
                }
            }
    }

    dfs1(n-1, n);
    dfs2(0, -1);

    ll m=s.size();

    vector<pair<pair<pll, pll>, ll> > zp;

    for (int i = 0; i < m; i++)
    {
        ll x, y;

        x=s[i];

        for (int j = 19; j > -1; j--)
            if (bn2[x][j]>=l[i]) x=bn2[x][j];

        y=e[i];

        for (int j = 19; j > -1; j--)
            if (bn1[y][j]<=r[i]) y=bn1[y][j];

        //cout << x << " " << y << " " << e[i] << "\n";

        zp.pb(mp(mp(mp(out2[x], in2[x]), mp(in1[y], out1[y])), i));
    }

    sort(all(zp));

    ll lr=-1;

    for (int i = 0; i < v2.size(); i++)
    {
        update(1,0,v1.size()-1,in1[v2[i]], i);
        update(1,0,v1.size()-1,out1[v2[i]], i);
        while (lr+1<zp.size() && i==zp[lr+1].fi.fi.fi)
        {
            lr++;
            if (get(1, 0, v1.size()-1, zp[lr].fi.se.fi, zp[lr].fi.se.se)>=zp[lr].fi.fi.se) ans[zp[lr].se]=1;
        }
    }

    return ans;
}
/*
6 6 3
5 1
1 2
1 3
3 4
3 0
5 2
4 2 1 2
4 2 2 2
5 4 3 4
*/

Compilation message

werewolf.cpp: In function 'void dfs1(int, int)':
werewolf.cpp:30:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   30 |     for (int i = 0; i < g1[h].size(); i++)
      |                     ~~^~~~~~~~~~~~~~
werewolf.cpp: In function 'void dfs2(int, int)':
werewolf.cpp:48:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   48 |     for (int i = 0; i < g2[h].size(); i++)
      |                     ~~^~~~~~~~~~~~~~
werewolf.cpp: In function 'std::vector<int> check_validity(int, std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
werewolf.cpp:124:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  124 |     for (int i = 0; i < x.size(); i++)
      |                     ~~^~~~~~~~~~
werewolf.cpp:139:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  139 |         for (int j = 0; j < c[i].size(); j++)
      |                         ~~^~~~~~~~~~~~~
werewolf.cpp:155:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  155 |         for (int j = 0; j < c[i].size(); j++)
      |                         ~~^~~~~~~~~~~~~
werewolf.cpp:197:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  197 |     for (int i = 0; i < v2.size(); i++)
      |                     ~~^~~~~~~~~~~
werewolf.cpp:201:20: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<std::pair<std::pair<long long int, long long int>, std::pair<long long int, long long int> >, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  201 |         while (lr+1<zp.size() && i==zp[lr+1].fi.fi.fi)
      |                ~~~~^~~~~~~~~~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 14464 KB Output is correct
2 Correct 11 ms 14460 KB Output is correct
3 Correct 11 ms 14412 KB Output is correct
4 Correct 12 ms 14400 KB Output is correct
5 Correct 12 ms 14512 KB Output is correct
6 Correct 11 ms 14400 KB Output is correct
7 Correct 11 ms 14396 KB Output is correct
8 Correct 11 ms 14400 KB Output is correct
9 Correct 11 ms 14412 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 14464 KB Output is correct
2 Correct 11 ms 14460 KB Output is correct
3 Correct 11 ms 14412 KB Output is correct
4 Correct 12 ms 14400 KB Output is correct
5 Correct 12 ms 14512 KB Output is correct
6 Correct 11 ms 14400 KB Output is correct
7 Correct 11 ms 14396 KB Output is correct
8 Correct 11 ms 14400 KB Output is correct
9 Correct 11 ms 14412 KB Output is correct
10 Correct 21 ms 16588 KB Output is correct
11 Correct 19 ms 16460 KB Output is correct
12 Correct 21 ms 16460 KB Output is correct
13 Correct 21 ms 16660 KB Output is correct
14 Correct 22 ms 16716 KB Output is correct
15 Correct 23 ms 16716 KB Output is correct

Subtask #3
34.0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1100 ms 142896 KB Output is correct
2 Correct 1299 ms 147464 KB Output is correct
3 Correct 1115 ms 144480 KB Output is correct
4 Correct 1128 ms 143240 KB Output is correct
5 Correct 1063 ms 143144 KB Output is correct
6 Correct 1171 ms 142924 KB Output is correct
7 Correct 1092 ms 142832 KB Output is correct
8 Correct 1184 ms 147556 KB Output is correct
9 Correct 919 ms 144512 KB Output is correct
10 Correct 777 ms 143164 KB Output is correct
11 Correct 855 ms 143064 KB Output is correct
12 Correct 916 ms 142988 KB Output is correct
13 Correct 1334 ms 153368 KB Output is correct
14 Correct 1291 ms 153376 KB Output is correct
15 Correct 1323 ms 153488 KB Output is correct
16 Correct 1311 ms 153372 KB Output is correct
17 Correct 1152 ms 142900 KB Output is correct

Subtask #4
51.0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 14464 KB Output is correct
2 Correct 11 ms 14460 KB Output is correct
3 Correct 11 ms 14412 KB Output is correct
4 Correct 12 ms 14400 KB Output is correct
5 Correct 12 ms 14512 KB Output is correct
6 Correct 11 ms 14400 KB Output is correct
7 Correct 11 ms 14396 KB Output is correct
8 Correct 11 ms 14400 KB Output is correct
9 Correct 11 ms 14412 KB Output is correct
10 Correct 21 ms 16588 KB Output is correct
11 Correct 19 ms 16460 KB Output is correct
12 Correct 21 ms 16460 KB Output is correct
13 Correct 21 ms 16660 KB Output is correct
14 Correct 22 ms 16716 KB Output is correct
15 Correct 23 ms 16716 KB Output is correct
16 Correct 1100 ms 142896 KB Output is correct
17 Correct 1299 ms 147464 KB Output is correct
18 Correct 1115 ms 144480 KB Output is correct
19 Correct 1128 ms 143240 KB Output is correct
20 Correct 1063 ms 143144 KB Output is correct
21 Correct 1171 ms 142924 KB Output is correct
22 Correct 1092 ms 142832 KB Output is correct
23 Correct 1184 ms 147556 KB Output is correct
24 Correct 919 ms 144512 KB Output is correct
25 Correct 777 ms 143164 KB Output is correct
26 Correct 855 ms 143064 KB Output is correct
27 Correct 916 ms 142988 KB Output is correct
28 Correct 1334 ms 153368 KB Output is correct
29 Correct 1291 ms 153376 KB Output is correct
30 Correct 1323 ms 153488 KB Output is correct
31 Correct 1311 ms 153372 KB Output is correct
32 Correct 1152 ms 142900 KB Output is correct
33 Correct 1254 ms 145296 KB Output is correct
34 Correct 439 ms 62888 KB Output is correct
35 Correct 1443 ms 148852 KB Output is correct
36 Correct 1209 ms 143968 KB Output is correct
37 Correct 1394 ms 147736 KB Output is correct
38 Correct 1273 ms 145052 KB Output is correct
39 Correct 1411 ms 158384 KB Output is correct
40 Correct 1470 ms 158696 KB Output is correct
41 Correct 1125 ms 147028 KB Output is correct
42 Correct 978 ms 144064 KB Output is correct
43 Correct 1543 ms 155600 KB Output is correct
44 Correct 1346 ms 147680 KB Output is correct
45 Correct 1319 ms 158772 KB Output is correct
46 Correct 1320 ms 158352 KB Output is correct
47 Correct 1353 ms 153632 KB Output is correct
48 Correct 1371 ms 153352 KB Output is correct
49 Correct 1355 ms 153608 KB Output is correct
50 Correct 1359 ms 153400 KB Output is correct
51 Correct 1383 ms 158252 KB Output is correct
52 Correct 1516 ms 158248 KB Output is correct