oj.uz

답안 #282933

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
282933 2020-08-25T07:31:16 Z 최은수(#5745) Iqea (innopolis2018_final_C) C++17
36 / 100
 1583 ms 196004 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<pair<unsigned int,unsigned char> >sv1[100010];
vector<pair<unsigned int,unsigned char> >sv2[100010];
vector<vector<int> >ind[100010];
int sz1[100010],sz2[100010];
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%32768*131072,i/32768);
        sz1[i]=cp1.size();
        sz2[i]=cp2.size();
    }
    for(int i=0;i<n;i++)
    {
        for(auto&t:sv1[i])
        {
            int fi=t.fi%131072;
            int se=t.se*32768+t.fi/131072;
            sv2[fi].eb(i+se%32768*131072,se/32768);
        }
        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++)
        {
            auto&t=sv2[i][j];
            int fi=t.fi%131072;
            int cid=t.se*32768+t.fi/131072;
            if(ind[cid].empty())
                ind[cid].resize(sz1[cid],vector<int>(sz2[cid],0));
            ind[cid][cdep[fi]][cdep[i+n]]=ct;
            if(j==(int)sv2[i].size()-1||fi!=(int)sv2[i][j+1].fi%131072)
                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 12928 KB Output is correct
2 Correct 9 ms 12928 KB Output is correct
3 Correct 9 ms 12928 KB Output is correct
4 Correct 28 ms 16488 KB Output is correct
5 Correct 28 ms 16324 KB Output is correct
6 Correct 30 ms 17048 KB Output is correct
7 Correct 40 ms 18152 KB Output is correct
8 Correct 43 ms 18404 KB Output is correct
9 Correct 50 ms 18552 KB Output is correct
10 Correct 45 ms 18404 KB Output is correct
11 Correct 43 ms 18532 KB Output is correct
12 Correct 48 ms 18368 KB Output is correct
13 Correct 43 ms 18672 KB Output is correct
14 Correct 41 ms 18032 KB Output is correct
15 Correct 43 ms 18260 KB Output is correct
16 Correct 42 ms 18144 KB Output is correct
17 Correct 42 ms 18168 KB Output is correct
18 Correct 44 ms 18116 KB Output is correct
19 Correct 40 ms 17584 KB Output is correct
20 Correct 46 ms 19844 KB Output is correct
21 Correct 41 ms 18372 KB Output is correct
22 Correct 54 ms 20456 KB Output is correct
23 Correct 50 ms 19896 KB Output is correct
24 Correct 53 ms 20840 KB Output is correct
25 Correct 28 ms 17532 KB Output is correct
26 Correct 27 ms 15476 KB Output is correct
27 Correct 21 ms 15100 KB Output is correct
28 Correct 53 ms 20808 KB Output is correct
29 Correct 54 ms 20716 KB Output is correct
30 Correct 54 ms 21196 KB Output is correct
31 Correct 54 ms 20836 KB Output is correct
32 Correct 54 ms 20904 KB Output is correct
33 Correct 54 ms 21096 KB Output is correct
34 Correct 54 ms 20952 KB Output is correct
35 Correct 59 ms 20976 KB Output is correct
36 Correct 26 ms 17528 KB Output is correct
37 Correct 54 ms 20896 KB Output is correct
38 Correct 65 ms 20744 KB Output is correct
39 Correct 54 ms 21008 KB Output is correct
40 Correct 54 ms 21008 KB Output is correct
41 Correct 49 ms 20100 KB Output is correct
42 Correct 52 ms 20364 KB Output is correct
43 Correct 27 ms 17276 KB Output is correct
44 Correct 50 ms 20172 KB Output is correct
45 Correct 50 ms 20292 KB Output is correct
46 Correct 23 ms 15164 KB Output is correct
47 Correct 41 ms 18808 KB Output is correct
48 Correct 40 ms 17628 KB Output is correct
49 Correct 38 ms 17792 KB Output is correct
50 Correct 36 ms 17276 KB Output is correct
51 Correct 36 ms 17648 KB Output is correct
52 Correct 45 ms 18400 KB Output is correct
53 Correct 49 ms 18840 KB Output is correct
54 Correct 44 ms 19100 KB Output is correct
55 Correct 46 ms 19328 KB Output is correct

Subtask #2
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 12928 KB Output is correct
2 Correct 9 ms 12928 KB Output is correct
3 Correct 9 ms 12928 KB Output is correct
4 Correct 28 ms 16488 KB Output is correct
5 Correct 28 ms 16324 KB Output is correct
6 Correct 30 ms 17048 KB Output is correct
7 Correct 40 ms 18152 KB Output is correct
8 Correct 43 ms 18404 KB Output is correct
9 Correct 50 ms 18552 KB Output is correct
10 Correct 45 ms 18404 KB Output is correct
11 Correct 43 ms 18532 KB Output is correct
12 Correct 48 ms 18368 KB Output is correct
13 Correct 43 ms 18672 KB Output is correct
14 Correct 41 ms 18032 KB Output is correct
15 Correct 43 ms 18260 KB Output is correct
16 Correct 42 ms 18144 KB Output is correct
17 Correct 42 ms 18168 KB Output is correct
18 Correct 44 ms 18116 KB Output is correct
19 Correct 40 ms 17584 KB Output is correct
20 Correct 46 ms 19844 KB Output is correct
21 Correct 41 ms 18372 KB Output is correct
22 Correct 54 ms 20456 KB Output is correct
23 Correct 50 ms 19896 KB Output is correct
24 Correct 53 ms 20840 KB Output is correct
25 Correct 28 ms 17532 KB Output is correct
26 Correct 27 ms 15476 KB Output is correct
27 Correct 21 ms 15100 KB Output is correct
28 Correct 53 ms 20808 KB Output is correct
29 Correct 54 ms 20716 KB Output is correct
30 Correct 54 ms 21196 KB Output is correct
31 Correct 54 ms 20836 KB Output is correct
32 Correct 54 ms 20904 KB Output is correct
33 Correct 54 ms 21096 KB Output is correct
34 Correct 54 ms 20952 KB Output is correct
35 Correct 59 ms 20976 KB Output is correct
36 Correct 26 ms 17528 KB Output is correct
37 Correct 54 ms 20896 KB Output is correct
38 Correct 65 ms 20744 KB Output is correct
39 Correct 54 ms 21008 KB Output is correct
40 Correct 54 ms 21008 KB Output is correct
41 Correct 49 ms 20100 KB Output is correct
42 Correct 52 ms 20364 KB Output is correct
43 Correct 27 ms 17276 KB Output is correct
44 Correct 50 ms 20172 KB Output is correct
45 Correct 50 ms 20292 KB Output is correct
46 Correct 23 ms 15164 KB Output is correct
47 Correct 41 ms 18808 KB Output is correct
48 Correct 40 ms 17628 KB Output is correct
49 Correct 38 ms 17792 KB Output is correct
50 Correct 36 ms 17276 KB Output is correct
51 Correct 36 ms 17648 KB Output is correct
52 Correct 45 ms 18400 KB Output is correct
53 Correct 49 ms 18840 KB Output is correct
54 Correct 44 ms 19100 KB Output is correct
55 Correct 46 ms 19328 KB Output is correct
56 Correct 90 ms 16988 KB Output is correct
57 Correct 93 ms 17824 KB Output is correct
58 Correct 97 ms 16700 KB Output is correct
59 Correct 120 ms 18384 KB Output is correct
60 Correct 119 ms 18856 KB Output is correct
61 Correct 127 ms 19504 KB Output is correct
62 Correct 122 ms 18248 KB Output is correct
63 Correct 120 ms 18788 KB Output is correct
64 Correct 125 ms 19100 KB Output is correct
65 Correct 118 ms 18708 KB Output is correct
66 Correct 124 ms 19720 KB Output is correct
67 Correct 122 ms 18656 KB Output is correct
68 Correct 130 ms 19504 KB Output is correct
69 Correct 116 ms 18900 KB Output is correct
70 Correct 125 ms 18884 KB Output is correct
71 Correct 111 ms 17492 KB Output is correct
72 Correct 124 ms 18640 KB Output is correct
73 Correct 124 ms 18776 KB Output is correct
74 Correct 95 ms 17600 KB Output is correct
75 Correct 90 ms 15984 KB Output is correct
76 Correct 85 ms 15148 KB Output is correct
77 Correct 154 ms 21076 KB Output is correct
78 Correct 159 ms 21188 KB Output is correct
79 Correct 97 ms 17504 KB Output is correct
80 Correct 152 ms 21156 KB Output is correct
81 Correct 155 ms 21024 KB Output is correct
82 Correct 155 ms 20356 KB Output is correct
83 Correct 146 ms 20608 KB Output is correct
84 Correct 114 ms 17352 KB Output is correct
85 Correct 150 ms 20612 KB Output is correct
86 Correct 142 ms 20416 KB Output is correct
87 Correct 95 ms 15232 KB Output is correct
88 Correct 119 ms 18524 KB Output is correct
89 Correct 117 ms 18484 KB Output is correct
90 Correct 113 ms 18408 KB Output is correct
91 Correct 109 ms 17920 KB Output is correct
92 Correct 95 ms 17428 KB Output is correct
93 Correct 132 ms 19008 KB Output is correct
94 Correct 129 ms 19856 KB Output is correct
95 Correct 128 ms 19260 KB Output is correct
96 Correct 139 ms 19376 KB Output is correct

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 485 ms 76628 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1583 ms 196004 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 12928 KB Output is correct
2 Correct 9 ms 12928 KB Output is correct
3 Correct 9 ms 12928 KB Output is correct
4 Correct 28 ms 16488 KB Output is correct
5 Correct 28 ms 16324 KB Output is correct
6 Correct 30 ms 17048 KB Output is correct
7 Correct 40 ms 18152 KB Output is correct
8 Correct 43 ms 18404 KB Output is correct
9 Correct 50 ms 18552 KB Output is correct
10 Correct 45 ms 18404 KB Output is correct
11 Correct 43 ms 18532 KB Output is correct
12 Correct 48 ms 18368 KB Output is correct
13 Correct 43 ms 18672 KB Output is correct
14 Correct 41 ms 18032 KB Output is correct
15 Correct 43 ms 18260 KB Output is correct
16 Correct 42 ms 18144 KB Output is correct
17 Correct 42 ms 18168 KB Output is correct
18 Correct 44 ms 18116 KB Output is correct
19 Correct 40 ms 17584 KB Output is correct
20 Correct 46 ms 19844 KB Output is correct
21 Correct 41 ms 18372 KB Output is correct
22 Correct 54 ms 20456 KB Output is correct
23 Correct 50 ms 19896 KB Output is correct
24 Correct 53 ms 20840 KB Output is correct
25 Correct 28 ms 17532 KB Output is correct
26 Correct 27 ms 15476 KB Output is correct
27 Correct 21 ms 15100 KB Output is correct
28 Correct 53 ms 20808 KB Output is correct
29 Correct 54 ms 20716 KB Output is correct
30 Correct 54 ms 21196 KB Output is correct
31 Correct 54 ms 20836 KB Output is correct
32 Correct 54 ms 20904 KB Output is correct
33 Correct 54 ms 21096 KB Output is correct
34 Correct 54 ms 20952 KB Output is correct
35 Correct 59 ms 20976 KB Output is correct
36 Correct 26 ms 17528 KB Output is correct
37 Correct 54 ms 20896 KB Output is correct
38 Correct 65 ms 20744 KB Output is correct
39 Correct 54 ms 21008 KB Output is correct
40 Correct 54 ms 21008 KB Output is correct
41 Correct 49 ms 20100 KB Output is correct
42 Correct 52 ms 20364 KB Output is correct
43 Correct 27 ms 17276 KB Output is correct
44 Correct 50 ms 20172 KB Output is correct
45 Correct 50 ms 20292 KB Output is correct
46 Correct 23 ms 15164 KB Output is correct
47 Correct 41 ms 18808 KB Output is correct
48 Correct 40 ms 17628 KB Output is correct
49 Correct 38 ms 17792 KB Output is correct
50 Correct 36 ms 17276 KB Output is correct
51 Correct 36 ms 17648 KB Output is correct
52 Correct 45 ms 18400 KB Output is correct
53 Correct 49 ms 18840 KB Output is correct
54 Correct 44 ms 19100 KB Output is correct
55 Correct 46 ms 19328 KB Output is correct
56 Correct 90 ms 16988 KB Output is correct
57 Correct 93 ms 17824 KB Output is correct
58 Correct 97 ms 16700 KB Output is correct
59 Correct 120 ms 18384 KB Output is correct
60 Correct 119 ms 18856 KB Output is correct
61 Correct 127 ms 19504 KB Output is correct
62 Correct 122 ms 18248 KB Output is correct
63 Correct 120 ms 18788 KB Output is correct
64 Correct 125 ms 19100 KB Output is correct
65 Correct 118 ms 18708 KB Output is correct
66 Correct 124 ms 19720 KB Output is correct
67 Correct 122 ms 18656 KB Output is correct
68 Correct 130 ms 19504 KB Output is correct
69 Correct 116 ms 18900 KB Output is correct
70 Correct 125 ms 18884 KB Output is correct
71 Correct 111 ms 17492 KB Output is correct
72 Correct 124 ms 18640 KB Output is correct
73 Correct 124 ms 18776 KB Output is correct
74 Correct 95 ms 17600 KB Output is correct
75 Correct 90 ms 15984 KB Output is correct
76 Correct 85 ms 15148 KB Output is correct
77 Correct 154 ms 21076 KB Output is correct
78 Correct 159 ms 21188 KB Output is correct
79 Correct 97 ms 17504 KB Output is correct
80 Correct 152 ms 21156 KB Output is correct
81 Correct 155 ms 21024 KB Output is correct
82 Correct 155 ms 20356 KB Output is correct
83 Correct 146 ms 20608 KB Output is correct
84 Correct 114 ms 17352 KB Output is correct
85 Correct 150 ms 20612 KB Output is correct
86 Correct 142 ms 20416 KB Output is correct
87 Correct 95 ms 15232 KB Output is correct
88 Correct 119 ms 18524 KB Output is correct
89 Correct 117 ms 18484 KB Output is correct
90 Correct 113 ms 18408 KB Output is correct
91 Correct 109 ms 17920 KB Output is correct
92 Correct 95 ms 17428 KB Output is correct
93 Correct 132 ms 19008 KB Output is correct
94 Correct 129 ms 19856 KB Output is correct
95 Correct 128 ms 19260 KB Output is correct
96 Correct 139 ms 19376 KB Output is correct
97 Incorrect 485 ms 76628 KB Output isn't correct
98 Halted 0 ms 0 KB -