oj.uz

답안 #282921

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
282921 2020-08-25T07:21:34 Z 최은수(#5745) Iqea (innopolis2018_final_C) C++17
36 / 100
 677 ms 262148 KB 
#include<iostream>
#include<vector>
#include<algorithm>
#define ep emplace
#define eb emplace_back
#define fi first
#define se second
#define all(x) (x).begin(),(x).end()
using namespace std;
typedef long long ll;
typedef pair<int,int>pi;
typedef pair<ll,ll>pl;
const int inf=1e9+7;
const ll INF=1e18;
struct dsu
{
    int pa[100010];
    inline void init()
    {
        fill(pa,pa+100010,-1);
        return;
    }
    dsu(){init();}
    int par(int x)
    {
        if(pa[x]==-1)
            return x;
        return pa[x]=par(pa[x]);
    }
    inline void uni(int x,int y)
    {
        x=par(x);
        y=par(y);
        if(x==y)
            return;
        pa[x]=y;
        return;
    }
}uf1,uf2;
vector<int>adj[200010];
int sz[200010];
void sdfs(int x,int p)
{
    sz[x]=1;
    for(int&t:adj[x])
        if(t!=p)
            sdfs(t,x),sz[x]+=sz[t];
    return;
}
bool chk[200010];
int dis[200010][18];
void dfs(int x,int p,int d,int cd)
{
    dis[x][cd]=d;
    sz[x]=1;
    for(int&t:adj[x])
        if(!chk[t]&&t!=p)
            dfs(t,x,d+1,cd),sz[x]+=sz[t];
    return;
}
int get(int x,int p,int z)
{
    int ms=-1,mi=-1;
    for(int&t:adj[x])
        if(!chk[t]&&t!=p&&sz[t]>ms)
            ms=sz[t],mi=t;
    if(ms<=sz[z]/2)
        return x;
    return get(mi,x,z);
}
int cdep[200010];
int cpa[200010];
void dnc(int x)
{
    chk[x]=1;
    for(int&t:adj[x])
    {
        if(chk[t])
            continue;
        dfs(t,x,1,cdep[x]);
        int nc=get(t,x,t);
        cpa[nc]=x;
        cdep[nc]=cdep[x]+1;
        dnc(nc);
    }
    return;
}
vector<pi>sv1[100010];
vector<pi>sv2[100010];
int ind[100010][17][17];
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int n;
    cin>>n;
    vector<pi>p(n);
    for(pi&t:p)
        cin>>t.fi>>t.se;
    vector<pi>sxv=p,syv=p;
    auto cmp1=[](const pi&x,const pi&y){return x<y;};
    auto cmp2=[](const pi&x,const pi&y){return pi(x.se,x.fi)<pi(y.se,y.fi);};
    sort(all(sxv),cmp1);
    sort(all(syv),cmp2);
    for(int i=1;i<n;i++)
        if(sxv[i].fi==sxv[i-1].fi&&sxv[i].se==sxv[i-1].se+1)
            uf1.uni(i,i-1);
    for(int i=1;i<n;i++)
        if(syv[i].fi==syv[i-1].fi+1&&syv[i].se==syv[i-1].se)
            uf2.uni(i,i-1);
    for(int i=1;i<n;i++)
    {
        if(sxv[i].fi==sxv[i-1].fi&&sxv[i].se==sxv[i-1].se+1)
        {
            int p1=uf2.par(lower_bound(all(syv),sxv[i-1],cmp2)-syv.begin())+n;
            int p2=uf2.par(lower_bound(all(syv),sxv[i],cmp2)-syv.begin())+n;
            adj[p1].eb(p2);
            adj[p2].eb(p1);
        }
    }
    for(int i=1;i<n;i++)
    {
        if(syv[i].fi==syv[i-1].fi+1&&syv[i].se==syv[i-1].se)
        {
            int p1=uf1.par(lower_bound(all(sxv),syv[i-1],cmp1)-sxv.begin());
            int p2=uf1.par(lower_bound(all(sxv),syv[i],cmp1)-sxv.begin());
            adj[p1].eb(p2);
            adj[p2].eb(p1);
        }
    }
    for(int i=0;i<n*2;i++)
    {
        sort(all(adj[i]));
        adj[i].erase(unique(all(adj[i])),adj[i].end());
    }
    sdfs(uf1.par(0),-1);
    int c1=get(uf1.par(0),-1,uf1.par(0));
    cpa[c1]=-1;
    dnc(c1);
    sdfs(uf2.par(0)+n,-1);
    int c2=get(uf2.par(0)+n,-1,uf2.par(0)+n);
    cpa[c2]=-1;
    dnc(c2);
    for(int i=0;i<n;i++)
    {
        auto&t=sxv[i];
        int p1=uf1.par(i);
        int p2=uf2.par(lower_bound(all(syv),t,cmp2)-syv.begin())+n;
        vector<int>cp1,cp2;
        while(p1!=-1)
            cp1.eb(p1),p1=cpa[p1];
        while(p2!=-1)
            cp2.eb(p2),p2=cpa[p2];
        for(int&u:cp1)
            for(int&v:cp2)
                sv1[u].eb(v-n,i);
    }
    for(int i=0;i<n;i++)
        for(pi&t:sv1[i])
            sv2[t.fi].eb(i,t.se);
    for(int i=0;i<n;i++)
        sv1[i].clear(),sv1[i].shrink_to_fit();
    int ct=0;
    for(int i=0;i<n;i++)
    {
        for(int j=0;j<(int)sv2[i].size();j++)
        {
            ind[sv2[i][j].se][cdep[sv2[i][j].fi]][cdep[i+n]]=ct;
            if(j==(int)sv2[i].size()-1||sv2[i][j].fi!=sv2[i][j+1].fi)
                ct++;
        }
        sv2[i].clear(),sv2[i].shrink_to_fit();
    }
    vector<int>arr(ct,0);
    int q;
    cin>>q;
    for(int qi=0;qi<q;qi++)
    {
        int t,x,y;
        cin>>t>>x>>y;
        int id=lower_bound(all(sxv),pi(x,y),cmp1)-sxv.begin();
        int p1=uf1.par(id);
        int p2=uf2.par(lower_bound(all(syv),pi(x,y),cmp2)-syv.begin())+n;
        if(t==1)
            for(int i=cdep[p1];i>=0;i--)
                for(int j=cdep[p2];j>=0;j--)
                    arr[ind[id][i][j]]=min(arr[ind[id][i][j]],dis[p1][i]+dis[p2][j]-inf);
        else
        {
            int ans=0;
            for(int i=cdep[p1];i>=0;i--)
                for(int j=cdep[p2];j>=0;j--)
                    ans=min(ans,arr[ind[id][i][j]]+dis[p1][i]+dis[p2][j]);
            if(ans==0)
                ans=-1;
            else
                ans+=inf;
            cout<<ans<<'\n';
        }
    }
    return 0;
}

Subtask #1
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 10496 KB Output is correct
2 Correct 7 ms 10624 KB Output is correct
3 Correct 8 ms 10752 KB Output is correct
4 Correct 26 ms 19272 KB Output is correct
5 Correct 26 ms 19392 KB Output is correct
6 Correct 28 ms 20504 KB Output is correct
7 Correct 35 ms 21872 KB Output is correct
8 Correct 37 ms 22756 KB Output is correct
9 Correct 37 ms 22776 KB Output is correct
10 Correct 34 ms 21612 KB Output is correct
11 Correct 35 ms 22360 KB Output is correct
12 Correct 37 ms 22720 KB Output is correct
13 Correct 37 ms 22504 KB Output is correct
14 Correct 36 ms 22264 KB Output is correct
15 Correct 37 ms 22868 KB Output is correct
16 Correct 36 ms 22496 KB Output is correct
17 Correct 35 ms 22396 KB Output is correct
18 Correct 35 ms 22216 KB Output is correct
19 Correct 35 ms 21800 KB Output is correct
20 Correct 39 ms 23348 KB Output is correct
21 Correct 37 ms 22596 KB Output is correct
22 Correct 52 ms 24560 KB Output is correct
23 Correct 42 ms 25304 KB Output is correct
24 Correct 46 ms 26468 KB Output is correct
25 Correct 24 ms 18608 KB Output is correct
26 Correct 26 ms 19068 KB Output is correct
27 Correct 21 ms 17856 KB Output is correct
28 Correct 45 ms 26464 KB Output is correct
29 Correct 45 ms 25784 KB Output is correct
30 Correct 49 ms 26956 KB Output is correct
31 Correct 46 ms 24856 KB Output is correct
32 Correct 52 ms 25676 KB Output is correct
33 Correct 45 ms 26532 KB Output is correct
34 Correct 45 ms 26320 KB Output is correct
35 Correct 47 ms 26756 KB Output is correct
36 Correct 24 ms 18424 KB Output is correct
37 Correct 49 ms 26524 KB Output is correct
38 Correct 45 ms 25636 KB Output is correct
39 Correct 44 ms 26776 KB Output is correct
40 Correct 45 ms 24960 KB Output is correct
41 Correct 42 ms 25612 KB Output is correct
42 Correct 42 ms 25612 KB Output is correct
43 Correct 24 ms 18224 KB Output is correct
44 Correct 42 ms 25420 KB Output is correct
45 Correct 45 ms 25676 KB Output is correct
46 Correct 23 ms 18060 KB Output is correct
47 Correct 37 ms 22396 KB Output is correct
48 Correct 34 ms 21852 KB Output is correct
49 Correct 34 ms 21888 KB Output is correct
50 Correct 32 ms 21620 KB Output is correct
51 Correct 30 ms 21232 KB Output is correct
52 Correct 36 ms 23016 KB Output is correct
53 Correct 39 ms 23072 KB Output is correct
54 Correct 38 ms 24080 KB Output is correct
55 Correct 39 ms 23432 KB Output is correct

Subtask #2
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 10496 KB Output is correct
2 Correct 7 ms 10624 KB Output is correct
3 Correct 8 ms 10752 KB Output is correct
4 Correct 26 ms 19272 KB Output is correct
5 Correct 26 ms 19392 KB Output is correct
6 Correct 28 ms 20504 KB Output is correct
7 Correct 35 ms 21872 KB Output is correct
8 Correct 37 ms 22756 KB Output is correct
9 Correct 37 ms 22776 KB Output is correct
10 Correct 34 ms 21612 KB Output is correct
11 Correct 35 ms 22360 KB Output is correct
12 Correct 37 ms 22720 KB Output is correct
13 Correct 37 ms 22504 KB Output is correct
14 Correct 36 ms 22264 KB Output is correct
15 Correct 37 ms 22868 KB Output is correct
16 Correct 36 ms 22496 KB Output is correct
17 Correct 35 ms 22396 KB Output is correct
18 Correct 35 ms 22216 KB Output is correct
19 Correct 35 ms 21800 KB Output is correct
20 Correct 39 ms 23348 KB Output is correct
21 Correct 37 ms 22596 KB Output is correct
22 Correct 52 ms 24560 KB Output is correct
23 Correct 42 ms 25304 KB Output is correct
24 Correct 46 ms 26468 KB Output is correct
25 Correct 24 ms 18608 KB Output is correct
26 Correct 26 ms 19068 KB Output is correct
27 Correct 21 ms 17856 KB Output is correct
28 Correct 45 ms 26464 KB Output is correct
29 Correct 45 ms 25784 KB Output is correct
30 Correct 49 ms 26956 KB Output is correct
31 Correct 46 ms 24856 KB Output is correct
32 Correct 52 ms 25676 KB Output is correct
33 Correct 45 ms 26532 KB Output is correct
34 Correct 45 ms 26320 KB Output is correct
35 Correct 47 ms 26756 KB Output is correct
36 Correct 24 ms 18424 KB Output is correct
37 Correct 49 ms 26524 KB Output is correct
38 Correct 45 ms 25636 KB Output is correct
39 Correct 44 ms 26776 KB Output is correct
40 Correct 45 ms 24960 KB Output is correct
41 Correct 42 ms 25612 KB Output is correct
42 Correct 42 ms 25612 KB Output is correct
43 Correct 24 ms 18224 KB Output is correct
44 Correct 42 ms 25420 KB Output is correct
45 Correct 45 ms 25676 KB Output is correct
46 Correct 23 ms 18060 KB Output is correct
47 Correct 37 ms 22396 KB Output is correct
48 Correct 34 ms 21852 KB Output is correct
49 Correct 34 ms 21888 KB Output is correct
50 Correct 32 ms 21620 KB Output is correct
51 Correct 30 ms 21232 KB Output is correct
52 Correct 36 ms 23016 KB Output is correct
53 Correct 39 ms 23072 KB Output is correct
54 Correct 38 ms 24080 KB Output is correct
55 Correct 39 ms 23432 KB Output is correct
56 Correct 97 ms 20080 KB Output is correct
57 Correct 93 ms 20508 KB Output is correct
58 Correct 96 ms 20008 KB Output is correct
59 Correct 118 ms 22108 KB Output is correct
60 Correct 115 ms 23232 KB Output is correct
61 Correct 117 ms 22976 KB Output is correct
62 Correct 114 ms 22360 KB Output is correct
63 Correct 113 ms 22384 KB Output is correct
64 Correct 118 ms 22956 KB Output is correct
65 Correct 113 ms 23000 KB Output is correct
66 Correct 112 ms 23200 KB Output is correct
67 Correct 112 ms 23032 KB Output is correct
68 Correct 120 ms 22724 KB Output is correct
69 Correct 114 ms 22380 KB Output is correct
70 Correct 118 ms 22356 KB Output is correct
71 Correct 118 ms 20580 KB Output is correct
72 Correct 121 ms 22888 KB Output is correct
73 Correct 114 ms 22768 KB Output is correct
74 Correct 92 ms 18484 KB Output is correct
75 Correct 93 ms 19060 KB Output is correct
76 Correct 93 ms 18220 KB Output is correct
77 Correct 135 ms 26468 KB Output is correct
78 Correct 139 ms 24992 KB Output is correct
79 Correct 88 ms 18424 KB Output is correct
80 Correct 128 ms 26404 KB Output is correct
81 Correct 134 ms 24452 KB Output is correct
82 Correct 124 ms 25364 KB Output is correct
83 Correct 135 ms 25612 KB Output is correct
84 Correct 90 ms 18228 KB Output is correct
85 Correct 125 ms 25552 KB Output is correct
86 Correct 132 ms 25424 KB Output is correct
87 Correct 82 ms 18320 KB Output is correct
88 Correct 116 ms 22636 KB Output is correct
89 Correct 114 ms 22344 KB Output is correct
90 Correct 108 ms 22260 KB Output is correct
91 Correct 107 ms 21808 KB Output is correct
92 Correct 96 ms 20508 KB Output is correct
93 Correct 113 ms 23500 KB Output is correct
94 Correct 115 ms 22940 KB Output is correct
95 Correct 122 ms 23632 KB Output is correct
96 Correct 122 ms 22996 KB Output is correct

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 459 ms 174604 KB Output is correct
2 Correct 480 ms 167008 KB Output is correct
3 Runtime error 550 ms 262144 KB Execution killed with signal 9
4 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 677 ms 262148 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #5
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 10496 KB Output is correct
2 Correct 7 ms 10624 KB Output is correct
3 Correct 8 ms 10752 KB Output is correct
4 Correct 26 ms 19272 KB Output is correct
5 Correct 26 ms 19392 KB Output is correct
6 Correct 28 ms 20504 KB Output is correct
7 Correct 35 ms 21872 KB Output is correct
8 Correct 37 ms 22756 KB Output is correct
9 Correct 37 ms 22776 KB Output is correct
10 Correct 34 ms 21612 KB Output is correct
11 Correct 35 ms 22360 KB Output is correct
12 Correct 37 ms 22720 KB Output is correct
13 Correct 37 ms 22504 KB Output is correct
14 Correct 36 ms 22264 KB Output is correct
15 Correct 37 ms 22868 KB Output is correct
16 Correct 36 ms 22496 KB Output is correct
17 Correct 35 ms 22396 KB Output is correct
18 Correct 35 ms 22216 KB Output is correct
19 Correct 35 ms 21800 KB Output is correct
20 Correct 39 ms 23348 KB Output is correct
21 Correct 37 ms 22596 KB Output is correct
22 Correct 52 ms 24560 KB Output is correct
23 Correct 42 ms 25304 KB Output is correct
24 Correct 46 ms 26468 KB Output is correct
25 Correct 24 ms 18608 KB Output is correct
26 Correct 26 ms 19068 KB Output is correct
27 Correct 21 ms 17856 KB Output is correct
28 Correct 45 ms 26464 KB Output is correct
29 Correct 45 ms 25784 KB Output is correct
30 Correct 49 ms 26956 KB Output is correct
31 Correct 46 ms 24856 KB Output is correct
32 Correct 52 ms 25676 KB Output is correct
33 Correct 45 ms 26532 KB Output is correct
34 Correct 45 ms 26320 KB Output is correct
35 Correct 47 ms 26756 KB Output is correct
36 Correct 24 ms 18424 KB Output is correct
37 Correct 49 ms 26524 KB Output is correct
38 Correct 45 ms 25636 KB Output is correct
39 Correct 44 ms 26776 KB Output is correct
40 Correct 45 ms 24960 KB Output is correct
41 Correct 42 ms 25612 KB Output is correct
42 Correct 42 ms 25612 KB Output is correct
43 Correct 24 ms 18224 KB Output is correct
44 Correct 42 ms 25420 KB Output is correct
45 Correct 45 ms 25676 KB Output is correct
46 Correct 23 ms 18060 KB Output is correct
47 Correct 37 ms 22396 KB Output is correct
48 Correct 34 ms 21852 KB Output is correct
49 Correct 34 ms 21888 KB Output is correct
50 Correct 32 ms 21620 KB Output is correct
51 Correct 30 ms 21232 KB Output is correct
52 Correct 36 ms 23016 KB Output is correct
53 Correct 39 ms 23072 KB Output is correct
54 Correct 38 ms 24080 KB Output is correct
55 Correct 39 ms 23432 KB Output is correct
56 Correct 97 ms 20080 KB Output is correct
57 Correct 93 ms 20508 KB Output is correct
58 Correct 96 ms 20008 KB Output is correct
59 Correct 118 ms 22108 KB Output is correct
60 Correct 115 ms 23232 KB Output is correct
61 Correct 117 ms 22976 KB Output is correct
62 Correct 114 ms 22360 KB Output is correct
63 Correct 113 ms 22384 KB Output is correct
64 Correct 118 ms 22956 KB Output is correct
65 Correct 113 ms 23000 KB Output is correct
66 Correct 112 ms 23200 KB Output is correct
67 Correct 112 ms 23032 KB Output is correct
68 Correct 120 ms 22724 KB Output is correct
69 Correct 114 ms 22380 KB Output is correct
70 Correct 118 ms 22356 KB Output is correct
71 Correct 118 ms 20580 KB Output is correct
72 Correct 121 ms 22888 KB Output is correct
73 Correct 114 ms 22768 KB Output is correct
74 Correct 92 ms 18484 KB Output is correct
75 Correct 93 ms 19060 KB Output is correct
76 Correct 93 ms 18220 KB Output is correct
77 Correct 135 ms 26468 KB Output is correct
78 Correct 139 ms 24992 KB Output is correct
79 Correct 88 ms 18424 KB Output is correct
80 Correct 128 ms 26404 KB Output is correct
81 Correct 134 ms 24452 KB Output is correct
82 Correct 124 ms 25364 KB Output is correct
83 Correct 135 ms 25612 KB Output is correct
84 Correct 90 ms 18228 KB Output is correct
85 Correct 125 ms 25552 KB Output is correct
86 Correct 132 ms 25424 KB Output is correct
87 Correct 82 ms 18320 KB Output is correct
88 Correct 116 ms 22636 KB Output is correct
89 Correct 114 ms 22344 KB Output is correct
90 Correct 108 ms 22260 KB Output is correct
91 Correct 107 ms 21808 KB Output is correct
92 Correct 96 ms 20508 KB Output is correct
93 Correct 113 ms 23500 KB Output is correct
94 Correct 115 ms 22940 KB Output is correct
95 Correct 122 ms 23632 KB Output is correct
96 Correct 122 ms 22996 KB Output is correct
97 Correct 459 ms 174604 KB Output is correct
98 Correct 480 ms 167008 KB Output is correct
99 Runtime error 550 ms 262144 KB Execution killed with signal 9
100 Halted 0 ms 0 KB -