oj.uz

Submission #282923

# Submission time Handle Problem Language Result Execution time Memory
282923 2020-08-25T07:22:41 Z 최은수(#5745) Iqea (innopolis2018_final_C) C++17
36 / 100
 757 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);
        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

# Verdict Execution time Memory Grader output
1 Correct 7 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 25 ms 18632 KB Output is correct
5 Correct 25 ms 18748 KB Output is correct
6 Correct 28 ms 19488 KB Output is correct
7 Correct 35 ms 20712 KB Output is correct
8 Correct 35 ms 21220 KB Output is correct
9 Correct 36 ms 21368 KB Output is correct
10 Correct 33 ms 19948 KB Output is correct
11 Correct 42 ms 20432 KB Output is correct
12 Correct 36 ms 21188 KB Output is correct
13 Correct 37 ms 21104 KB Output is correct
14 Correct 35 ms 20720 KB Output is correct
15 Correct 36 ms 21204 KB Output is correct
16 Correct 35 ms 20832 KB Output is correct
17 Correct 40 ms 21108 KB Output is correct
18 Correct 34 ms 20436 KB Output is correct
19 Correct 34 ms 20392 KB Output is correct
20 Correct 37 ms 21556 KB Output is correct
21 Correct 36 ms 20812 KB Output is correct
22 Correct 42 ms 23400 KB Output is correct
23 Correct 40 ms 22808 KB Output is correct
24 Correct 43 ms 23264 KB Output is correct
25 Correct 23 ms 18556 KB Output is correct
26 Correct 26 ms 18684 KB Output is correct
27 Correct 21 ms 17856 KB Output is correct
28 Correct 42 ms 23264 KB Output is correct
29 Correct 43 ms 23412 KB Output is correct
30 Correct 43 ms 23884 KB Output is correct
31 Correct 43 ms 23392 KB Output is correct
32 Correct 43 ms 23464 KB Output is correct
33 Correct 45 ms 23192 KB Output is correct
34 Correct 42 ms 22992 KB Output is correct
35 Correct 44 ms 23580 KB Output is correct
36 Correct 22 ms 18424 KB Output is correct
37 Correct 41 ms 23328 KB Output is correct
38 Correct 42 ms 23060 KB Output is correct
39 Correct 42 ms 23440 KB Output is correct
40 Correct 45 ms 23568 KB Output is correct
41 Correct 40 ms 22916 KB Output is correct
42 Correct 40 ms 22924 KB Output is correct
43 Correct 23 ms 18164 KB Output is correct
44 Correct 41 ms 22476 KB Output is correct
45 Correct 42 ms 22980 KB Output is correct
46 Correct 22 ms 17940 KB Output is correct
47 Correct 34 ms 20856 KB Output is correct
48 Correct 33 ms 20684 KB Output is correct
49 Correct 32 ms 20752 KB Output is correct
50 Correct 30 ms 20232 KB Output is correct
51 Correct 29 ms 19824 KB Output is correct
52 Correct 34 ms 21224 KB Output is correct
53 Correct 37 ms 21784 KB Output is correct
54 Correct 37 ms 22152 KB Output is correct
55 Correct 36 ms 21888 KB Output is correct

Subtask #2
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 7 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 25 ms 18632 KB Output is correct
5 Correct 25 ms 18748 KB Output is correct
6 Correct 28 ms 19488 KB Output is correct
7 Correct 35 ms 20712 KB Output is correct
8 Correct 35 ms 21220 KB Output is correct
9 Correct 36 ms 21368 KB Output is correct
10 Correct 33 ms 19948 KB Output is correct
11 Correct 42 ms 20432 KB Output is correct
12 Correct 36 ms 21188 KB Output is correct
13 Correct 37 ms 21104 KB Output is correct
14 Correct 35 ms 20720 KB Output is correct
15 Correct 36 ms 21204 KB Output is correct
16 Correct 35 ms 20832 KB Output is correct
17 Correct 40 ms 21108 KB Output is correct
18 Correct 34 ms 20436 KB Output is correct
19 Correct 34 ms 20392 KB Output is correct
20 Correct 37 ms 21556 KB Output is correct
21 Correct 36 ms 20812 KB Output is correct
22 Correct 42 ms 23400 KB Output is correct
23 Correct 40 ms 22808 KB Output is correct
24 Correct 43 ms 23264 KB Output is correct
25 Correct 23 ms 18556 KB Output is correct
26 Correct 26 ms 18684 KB Output is correct
27 Correct 21 ms 17856 KB Output is correct
28 Correct 42 ms 23264 KB Output is correct
29 Correct 43 ms 23412 KB Output is correct
30 Correct 43 ms 23884 KB Output is correct
31 Correct 43 ms 23392 KB Output is correct
32 Correct 43 ms 23464 KB Output is correct
33 Correct 45 ms 23192 KB Output is correct
34 Correct 42 ms 22992 KB Output is correct
35 Correct 44 ms 23580 KB Output is correct
36 Correct 22 ms 18424 KB Output is correct
37 Correct 41 ms 23328 KB Output is correct
38 Correct 42 ms 23060 KB Output is correct
39 Correct 42 ms 23440 KB Output is correct
40 Correct 45 ms 23568 KB Output is correct
41 Correct 40 ms 22916 KB Output is correct
42 Correct 40 ms 22924 KB Output is correct
43 Correct 23 ms 18164 KB Output is correct
44 Correct 41 ms 22476 KB Output is correct
45 Correct 42 ms 22980 KB Output is correct
46 Correct 22 ms 17940 KB Output is correct
47 Correct 34 ms 20856 KB Output is correct
48 Correct 33 ms 20684 KB Output is correct
49 Correct 32 ms 20752 KB Output is correct
50 Correct 30 ms 20232 KB Output is correct
51 Correct 29 ms 19824 KB Output is correct
52 Correct 34 ms 21224 KB Output is correct
53 Correct 37 ms 21784 KB Output is correct
54 Correct 37 ms 22152 KB Output is correct
55 Correct 36 ms 21888 KB Output is correct
56 Correct 89 ms 19304 KB Output is correct
57 Correct 96 ms 19612 KB Output is correct
58 Correct 91 ms 19224 KB Output is correct
59 Correct 116 ms 20700 KB Output is correct
60 Correct 118 ms 21304 KB Output is correct
61 Correct 134 ms 21320 KB Output is correct
62 Correct 118 ms 20576 KB Output is correct
63 Correct 117 ms 20728 KB Output is correct
64 Correct 124 ms 21428 KB Output is correct
65 Correct 133 ms 21336 KB Output is correct
66 Correct 137 ms 21784 KB Output is correct
67 Correct 114 ms 21104 KB Output is correct
68 Correct 119 ms 21180 KB Output is correct
69 Correct 114 ms 21092 KB Output is correct
70 Correct 111 ms 20700 KB Output is correct
71 Correct 107 ms 19180 KB Output is correct
72 Correct 118 ms 21216 KB Output is correct
73 Correct 112 ms 21224 KB Output is correct
74 Correct 94 ms 18428 KB Output is correct
75 Correct 92 ms 18556 KB Output is correct
76 Correct 102 ms 18216 KB Output is correct
77 Correct 131 ms 23272 KB Output is correct
78 Correct 136 ms 23508 KB Output is correct
79 Correct 100 ms 18416 KB Output is correct
80 Correct 130 ms 23196 KB Output is correct
81 Correct 145 ms 23088 KB Output is correct
82 Correct 129 ms 22676 KB Output is correct
83 Correct 129 ms 22924 KB Output is correct
84 Correct 89 ms 18300 KB Output is correct
85 Correct 124 ms 22736 KB Output is correct
86 Correct 126 ms 22624 KB Output is correct
87 Correct 81 ms 18308 KB Output is correct
88 Correct 116 ms 20980 KB Output is correct
89 Correct 111 ms 20800 KB Output is correct
90 Correct 108 ms 20988 KB Output is correct
91 Correct 108 ms 20492 KB Output is correct
92 Correct 99 ms 19484 KB Output is correct
93 Correct 112 ms 21452 KB Output is correct
94 Correct 113 ms 21404 KB Output is correct
95 Correct 119 ms 21712 KB Output is correct
96 Correct 121 ms 21832 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 452 ms 174596 KB Output is correct
2 Correct 462 ms 166876 KB Output is correct
3 Runtime error 639 ms 262148 KB Execution killed with signal 9
4 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Runtime error 757 ms 262148 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #5
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 7 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 25 ms 18632 KB Output is correct
5 Correct 25 ms 18748 KB Output is correct
6 Correct 28 ms 19488 KB Output is correct
7 Correct 35 ms 20712 KB Output is correct
8 Correct 35 ms 21220 KB Output is correct
9 Correct 36 ms 21368 KB Output is correct
10 Correct 33 ms 19948 KB Output is correct
11 Correct 42 ms 20432 KB Output is correct
12 Correct 36 ms 21188 KB Output is correct
13 Correct 37 ms 21104 KB Output is correct
14 Correct 35 ms 20720 KB Output is correct
15 Correct 36 ms 21204 KB Output is correct
16 Correct 35 ms 20832 KB Output is correct
17 Correct 40 ms 21108 KB Output is correct
18 Correct 34 ms 20436 KB Output is correct
19 Correct 34 ms 20392 KB Output is correct
20 Correct 37 ms 21556 KB Output is correct
21 Correct 36 ms 20812 KB Output is correct
22 Correct 42 ms 23400 KB Output is correct
23 Correct 40 ms 22808 KB Output is correct
24 Correct 43 ms 23264 KB Output is correct
25 Correct 23 ms 18556 KB Output is correct
26 Correct 26 ms 18684 KB Output is correct
27 Correct 21 ms 17856 KB Output is correct
28 Correct 42 ms 23264 KB Output is correct
29 Correct 43 ms 23412 KB Output is correct
30 Correct 43 ms 23884 KB Output is correct
31 Correct 43 ms 23392 KB Output is correct
32 Correct 43 ms 23464 KB Output is correct
33 Correct 45 ms 23192 KB Output is correct
34 Correct 42 ms 22992 KB Output is correct
35 Correct 44 ms 23580 KB Output is correct
36 Correct 22 ms 18424 KB Output is correct
37 Correct 41 ms 23328 KB Output is correct
38 Correct 42 ms 23060 KB Output is correct
39 Correct 42 ms 23440 KB Output is correct
40 Correct 45 ms 23568 KB Output is correct
41 Correct 40 ms 22916 KB Output is correct
42 Correct 40 ms 22924 KB Output is correct
43 Correct 23 ms 18164 KB Output is correct
44 Correct 41 ms 22476 KB Output is correct
45 Correct 42 ms 22980 KB Output is correct
46 Correct 22 ms 17940 KB Output is correct
47 Correct 34 ms 20856 KB Output is correct
48 Correct 33 ms 20684 KB Output is correct
49 Correct 32 ms 20752 KB Output is correct
50 Correct 30 ms 20232 KB Output is correct
51 Correct 29 ms 19824 KB Output is correct
52 Correct 34 ms 21224 KB Output is correct
53 Correct 37 ms 21784 KB Output is correct
54 Correct 37 ms 22152 KB Output is correct
55 Correct 36 ms 21888 KB Output is correct
56 Correct 89 ms 19304 KB Output is correct
57 Correct 96 ms 19612 KB Output is correct
58 Correct 91 ms 19224 KB Output is correct
59 Correct 116 ms 20700 KB Output is correct
60 Correct 118 ms 21304 KB Output is correct
61 Correct 134 ms 21320 KB Output is correct
62 Correct 118 ms 20576 KB Output is correct
63 Correct 117 ms 20728 KB Output is correct
64 Correct 124 ms 21428 KB Output is correct
65 Correct 133 ms 21336 KB Output is correct
66 Correct 137 ms 21784 KB Output is correct
67 Correct 114 ms 21104 KB Output is correct
68 Correct 119 ms 21180 KB Output is correct
69 Correct 114 ms 21092 KB Output is correct
70 Correct 111 ms 20700 KB Output is correct
71 Correct 107 ms 19180 KB Output is correct
72 Correct 118 ms 21216 KB Output is correct
73 Correct 112 ms 21224 KB Output is correct
74 Correct 94 ms 18428 KB Output is correct
75 Correct 92 ms 18556 KB Output is correct
76 Correct 102 ms 18216 KB Output is correct
77 Correct 131 ms 23272 KB Output is correct
78 Correct 136 ms 23508 KB Output is correct
79 Correct 100 ms 18416 KB Output is correct
80 Correct 130 ms 23196 KB Output is correct
81 Correct 145 ms 23088 KB Output is correct
82 Correct 129 ms 22676 KB Output is correct
83 Correct 129 ms 22924 KB Output is correct
84 Correct 89 ms 18300 KB Output is correct
85 Correct 124 ms 22736 KB Output is correct
86 Correct 126 ms 22624 KB Output is correct
87 Correct 81 ms 18308 KB Output is correct
88 Correct 116 ms 20980 KB Output is correct
89 Correct 111 ms 20800 KB Output is correct
90 Correct 108 ms 20988 KB Output is correct
91 Correct 108 ms 20492 KB Output is correct
92 Correct 99 ms 19484 KB Output is correct
93 Correct 112 ms 21452 KB Output is correct
94 Correct 113 ms 21404 KB Output is correct
95 Correct 119 ms 21712 KB Output is correct
96 Correct 121 ms 21832 KB Output is correct
97 Correct 452 ms 174596 KB Output is correct
98 Correct 462 ms 166876 KB Output is correct
99 Runtime error 639 ms 262148 KB Execution killed with signal 9
100 Halted 0 ms 0 KB -