oj.uz

답안 #282989

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
282989 2020-08-25T08:18:17 Z 문홍윤(#5763) Iqea (innopolis2018_final_C) C++17
36 / 100
 2000 ms 112272 KB 
#include <bits/stdc++.h>
#define eb emplace_back
#define mp make_pair
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define svec(x) sort(x.begin(), x.end())
#define press(x) x.erase(unique(x.begin(), x.end()), x.end())
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
typedef pair<LL, LL> pll;
typedef pair<int, LL> pil;
typedef pair<LL, int> pli;
const LL llinf=2e18;
const int inf=1e9;

int n, rex, rey;
unordered_map<int, int> mx[100010], my[100010];
pii p[100010];

vector<int> lx[100010], ly[100010];

bool cmp(pii a, pii b){return mp(a.S, a.F)<mp(b.S, b.F);}
void make_tree(){
    sort(p+1, p+n+1);
    for(int i=1; i<=n; i++){
        if(p[i].F!=p[i-1].F||p[i].S!=p[i-1].S+1)rex++;
        mx[p[i].F][p[i].S]=rex;
    }
    sort(p+1, p+n+1, cmp);
    for(int i=1; i<=n; i++){
        if(p[i].S!=p[i-1].S||p[i].F!=p[i-1].F+1)rey++;
        my[p[i].F][p[i].S]=rey;
    }
    for(int i=1; i<=n; i++){
        if(mx[p[i].F+1][p[i].S]){
            lx[mx[p[i].F][p[i].S]].eb(mx[p[i].F+1][p[i].S]);
            lx[mx[p[i].F+1][p[i].S]].eb(mx[p[i].F][p[i].S]);
        }
        if(my[p[i].F][p[i].S+1]){
            ly[my[p[i].F][p[i].S]].eb(my[p[i].F][p[i].S+1]);
            ly[my[p[i].F][p[i].S+1]].eb(my[p[i].F][p[i].S]);
        }
    }
    for(int i=1; i<=rex; i++){
        svec(lx[i]);
        press(lx[i]);
    }
    for(int i=1; i<=rey; i++){
        svec(ly[i]);
        press(ly[i]);
    }
}

int sz[100010];
bool ch[100010];
void dfs_x(int num, int par){
    sz[num]=1;
    for(auto i:lx[num]){
        if(i==par||ch[i])continue;
        dfs_x(i, num);
        sz[num]+=sz[i];
    }
}
int get_cen_x(int num, int siz){
    int ov=0;
    for(auto i:lx[num]){
        if(ch[i])continue;
        if(sz[i]>siz/2){
            ov=i;
            break;
        }
    }
    if(!ov)return num;
    sz[num]=siz-sz[ov];
    sz[ov]=siz;
    return get_cen_x(ov, siz);
}
void dfs_y(int num, int par){
    sz[num]=1;
    for(auto i:ly[num]){
        if(i==par||ch[i])continue;
        dfs_y(i, num);
        sz[num]+=sz[i];
    }
}
int get_cen_y(int num, int siz){
    int ov=0;
    for(auto i:ly[num]){
        if(ch[i])continue;
        if(sz[i]>siz/2){
            ov=i;
            break;
        }
    }
    if(!ov)return num;
    sz[num]=siz-sz[ov];
    sz[ov]=siz;
    return get_cen_y(ov, siz);
}

int cpar_x[100010], cpar_y[100010];
int d_x[100010][20], d_y[100010][20];

void make_cen_x(int num, int par){
    dfs_x(num, par);
    int cen=get_cen_x(num, sz[num]);
    cpar_x[cen]=par;
    ch[cen]=true;
    for(auto i:lx[cen]){
        if(ch[i])continue;
        make_cen_x(i, cen);
    }
}
void make_cen_y(int num, int par){
    dfs_y(num, par);
    int cen=get_cen_y(num, sz[num]);
    cpar_y[cen]=par;
    ch[cen]=true;
    for(auto i:ly[cen]){
        if(ch[i])continue;
        make_cen_y(i, cen);
    }
}

int dep_x[100010], dep_y[100010];
int sp_x[100010][20], sp_y[100010][20];
void dfs2_x(int num, int par){
    dep_x[num]=dep_x[par]+1;
    sp_x[num][0]=par;
    for(auto i:lx[num]){
        if(i==par)continue;
        dfs2_x(i, num);
    }
}
void dfs2_y(int num, int par){
    dep_y[num]=dep_y[par]+1;
    sp_y[num][0]=par;
    for(auto i:ly[num]){
        if(i==par)continue;
        dfs2_y(i, num);
    }
}

int lca_x(int x, int y){
    if(dep_x[x]>dep_x[y])swap(x, y);
    for(int i=19; i>=0; i--){
        if(dep_x[y]-dep_x[x]>=(1<<i))y=sp_x[y][i];
    }
    if(x==y)return x;
    for(int i=19; i>=0; i--){
        if(sp_x[x][i]!=sp_x[y][i]){
            x=sp_x[x][i];
            y=sp_x[y][i];
        }
    }
    return sp_x[x][0];
}
int lca_y(int x, int y){
    if(dep_y[x]>dep_y[y])swap(x, y);
    for(int i=19; i>=0; i--){
        if(dep_y[y]-dep_y[x]>=(1<<i))y=sp_y[y][i];
    }
    if(x==y)return x;
    for(int i=19; i>=0; i--){
        if(sp_y[x][i]!=sp_y[y][i]){
            x=sp_y[x][i];
            y=sp_y[y][i];
        }
    }
    return sp_y[x][0];
}
int getd_x(int x, int y){return dep_x[x]+dep_x[y]-2*dep_x[lca_x(x, y)];}
int getd_y(int x, int y){return dep_y[x]+dep_y[y]-2*dep_y[lca_y(x, y)];}

void get_cend_x(){
    for(int i=1; i<=rex; i++){
        int nw=cpar_x[i];
        for(int j=1; nw; j++, nw=cpar_x[nw])d_x[i][j]=getd_x(i, nw);
    }
}
void get_cend_y(){
    for(int i=1; i<=rey; i++){
        int nw=cpar_y[i];
        for(int j=1; nw; j++, nw=cpar_y[nw])d_y[i][j]=getd_y(i, nw);
    }
}

unordered_map<int, int> arr[100010];

void upd(int x, int y){
    int nx=mx[x][y], ny=my[x][y];
    int tx=nx, ty=ny;
    for(int i=0; tx; i++, tx=cpar_x[tx]){
        ty=ny;
        for(int j=0; ty; j++, ty=cpar_y[ty]){
            int tmp=d_x[nx][i]+d_y[ny][j]+1;
            if(!arr[tx][ty])arr[tx][ty]=inf;
            arr[tx][ty]=min(tmp, arr[tx][ty]);
        }
    }
}

int query(int x, int y){
    int nx=mx[x][y], ny=my[x][y], ret=inf;
    int tx=nx, ty=ny;
    for(int i=0; tx; i++, tx=cpar_x[tx]){
        ty=ny;
        for(int j=0; ty; j++, ty=cpar_y[ty]){
            if(!arr[tx][ty])continue;
            int tmp=d_x[nx][i]+d_y[ny][j];
            ret=min(ret, arr[tx][ty]+tmp-1);
        }
    }
    return ret==inf?-1:ret;
}

int main(){
    scanf("%d", &n);
    for(int i=1; i<=n; i++)scanf("%d %d", &p[i].F, &p[i].S);
    make_tree();
    make_cen_x(1, 0);
    memset(ch, 0, sizeof ch);
    make_cen_y(1, 0);
    dfs2_x(1, 0);
    dfs2_y(1, 0);
    for(int j=1; j<20; j++){
        for(int i=1; i<=rex; i++)sp_x[i][j]=sp_x[sp_x[i][j-1]][j-1];
        for(int i=1; i<=rey; i++)sp_y[i][j]=sp_y[sp_y[i][j-1]][j-1];
    }
    get_cend_x();
    get_cend_y();
    int q;
    scanf("%d", &q);
    for(int i=1; i<=q; i++){
        int a, b, c;
        scanf("%d %d %d", &a, &b, &c);
        if(a==1)upd(b, c);
        else printf("%d\n", query(b, c));
    }
}


/*
7
1 2
1 3
2 3
3 1
3 2
3 3
4 2
5
2 3 2
1 4 2
2 1 2
1 3 3
2 2 3
*/

Compilation message

C.cpp: In function 'int main()':
C.cpp:220:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  220 |     scanf("%d", &n);
      |     ~~~~~^~~~~~~~~~
C.cpp:221:33: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  221 |     for(int i=1; i<=n; i++)scanf("%d %d", &p[i].F, &p[i].S);
      |                            ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
C.cpp:235:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  235 |     scanf("%d", &q);
      |     ~~~~~^~~~~~~~~~
C.cpp:238:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  238 |         scanf("%d %d %d", &a, &b, &c);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 21632 KB Output is correct
2 Correct 15 ms 21632 KB Output is correct
3 Correct 15 ms 21632 KB Output is correct
4 Correct 27 ms 22656 KB Output is correct
5 Correct 28 ms 22656 KB Output is correct
6 Correct 28 ms 22656 KB Output is correct
7 Correct 46 ms 24444 KB Output is correct
8 Correct 44 ms 24568 KB Output is correct
9 Correct 43 ms 24568 KB Output is correct
10 Correct 40 ms 24440 KB Output is correct
11 Correct 44 ms 24576 KB Output is correct
12 Correct 50 ms 24696 KB Output is correct
13 Correct 42 ms 24696 KB Output is correct
14 Correct 43 ms 24572 KB Output is correct
15 Correct 45 ms 24824 KB Output is correct
16 Correct 41 ms 24448 KB Output is correct
17 Correct 40 ms 24320 KB Output is correct
18 Correct 42 ms 24440 KB Output is correct
19 Correct 40 ms 24184 KB Output is correct
20 Correct 45 ms 24696 KB Output is correct
21 Correct 42 ms 24576 KB Output is correct
22 Correct 48 ms 24952 KB Output is correct
23 Correct 47 ms 24952 KB Output is correct
24 Correct 53 ms 25336 KB Output is correct
25 Correct 32 ms 24192 KB Output is correct
26 Correct 32 ms 24448 KB Output is correct
27 Correct 29 ms 23936 KB Output is correct
28 Correct 51 ms 25284 KB Output is correct
29 Correct 49 ms 25340 KB Output is correct
30 Correct 51 ms 25464 KB Output is correct
31 Correct 49 ms 25368 KB Output is correct
32 Correct 50 ms 25448 KB Output is correct
33 Correct 56 ms 25336 KB Output is correct
34 Correct 74 ms 25336 KB Output is correct
35 Correct 59 ms 25592 KB Output is correct
36 Correct 30 ms 24064 KB Output is correct
37 Correct 49 ms 25336 KB Output is correct
38 Correct 49 ms 25336 KB Output is correct
39 Correct 51 ms 25464 KB Output is correct
40 Correct 60 ms 25464 KB Output is correct
41 Correct 48 ms 25080 KB Output is correct
42 Correct 55 ms 24952 KB Output is correct
43 Correct 31 ms 24064 KB Output is correct
44 Correct 48 ms 25000 KB Output is correct
45 Correct 48 ms 25080 KB Output is correct
46 Correct 29 ms 23928 KB Output is correct
47 Correct 39 ms 23936 KB Output is correct
48 Correct 35 ms 23544 KB Output is correct
49 Correct 35 ms 23288 KB Output is correct
50 Correct 34 ms 23168 KB Output is correct
51 Correct 30 ms 22904 KB Output is correct
52 Correct 37 ms 23928 KB Output is correct
53 Correct 40 ms 24056 KB Output is correct
54 Correct 40 ms 24088 KB Output is correct
55 Correct 41 ms 24000 KB Output is correct

Subtask #2
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 21632 KB Output is correct
2 Correct 15 ms 21632 KB Output is correct
3 Correct 15 ms 21632 KB Output is correct
4 Correct 27 ms 22656 KB Output is correct
5 Correct 28 ms 22656 KB Output is correct
6 Correct 28 ms 22656 KB Output is correct
7 Correct 46 ms 24444 KB Output is correct
8 Correct 44 ms 24568 KB Output is correct
9 Correct 43 ms 24568 KB Output is correct
10 Correct 40 ms 24440 KB Output is correct
11 Correct 44 ms 24576 KB Output is correct
12 Correct 50 ms 24696 KB Output is correct
13 Correct 42 ms 24696 KB Output is correct
14 Correct 43 ms 24572 KB Output is correct
15 Correct 45 ms 24824 KB Output is correct
16 Correct 41 ms 24448 KB Output is correct
17 Correct 40 ms 24320 KB Output is correct
18 Correct 42 ms 24440 KB Output is correct
19 Correct 40 ms 24184 KB Output is correct
20 Correct 45 ms 24696 KB Output is correct
21 Correct 42 ms 24576 KB Output is correct
22 Correct 48 ms 24952 KB Output is correct
23 Correct 47 ms 24952 KB Output is correct
24 Correct 53 ms 25336 KB Output is correct
25 Correct 32 ms 24192 KB Output is correct
26 Correct 32 ms 24448 KB Output is correct
27 Correct 29 ms 23936 KB Output is correct
28 Correct 51 ms 25284 KB Output is correct
29 Correct 49 ms 25340 KB Output is correct
30 Correct 51 ms 25464 KB Output is correct
31 Correct 49 ms 25368 KB Output is correct
32 Correct 50 ms 25448 KB Output is correct
33 Correct 56 ms 25336 KB Output is correct
34 Correct 74 ms 25336 KB Output is correct
35 Correct 59 ms 25592 KB Output is correct
36 Correct 30 ms 24064 KB Output is correct
37 Correct 49 ms 25336 KB Output is correct
38 Correct 49 ms 25336 KB Output is correct
39 Correct 51 ms 25464 KB Output is correct
40 Correct 60 ms 25464 KB Output is correct
41 Correct 48 ms 25080 KB Output is correct
42 Correct 55 ms 24952 KB Output is correct
43 Correct 31 ms 24064 KB Output is correct
44 Correct 48 ms 25000 KB Output is correct
45 Correct 48 ms 25080 KB Output is correct
46 Correct 29 ms 23928 KB Output is correct
47 Correct 39 ms 23936 KB Output is correct
48 Correct 35 ms 23544 KB Output is correct
49 Correct 35 ms 23288 KB Output is correct
50 Correct 34 ms 23168 KB Output is correct
51 Correct 30 ms 22904 KB Output is correct
52 Correct 37 ms 23928 KB Output is correct
53 Correct 40 ms 24056 KB Output is correct
54 Correct 40 ms 24088 KB Output is correct
55 Correct 41 ms 24000 KB Output is correct
56 Correct 145 ms 23716 KB Output is correct
57 Correct 151 ms 23676 KB Output is correct
58 Correct 150 ms 23676 KB Output is correct
59 Correct 266 ms 26360 KB Output is correct
60 Correct 279 ms 26104 KB Output is correct
61 Correct 269 ms 26744 KB Output is correct
62 Correct 282 ms 26264 KB Output is correct
63 Correct 269 ms 26428 KB Output is correct
64 Correct 279 ms 26616 KB Output is correct
65 Correct 282 ms 26108 KB Output is correct
66 Correct 277 ms 26104 KB Output is correct
67 Correct 265 ms 25976 KB Output is correct
68 Correct 314 ms 26356 KB Output is correct
69 Correct 251 ms 25592 KB Output is correct
70 Correct 336 ms 26364 KB Output is correct
71 Correct 248 ms 25848 KB Output is correct
72 Correct 286 ms 26436 KB Output is correct
73 Correct 285 ms 26104 KB Output is correct
74 Correct 145 ms 25976 KB Output is correct
75 Correct 133 ms 25848 KB Output is correct
76 Correct 100 ms 25720 KB Output is correct
77 Correct 336 ms 27256 KB Output is correct
78 Correct 346 ms 27384 KB Output is correct
79 Correct 117 ms 25976 KB Output is correct
80 Correct 356 ms 27384 KB Output is correct
81 Correct 392 ms 27256 KB Output is correct
82 Correct 310 ms 26616 KB Output is correct
83 Correct 311 ms 27000 KB Output is correct
84 Correct 131 ms 25848 KB Output is correct
85 Correct 329 ms 26676 KB Output is correct
86 Correct 328 ms 26488 KB Output is correct
87 Correct 106 ms 25208 KB Output is correct
88 Correct 238 ms 25596 KB Output is correct
89 Correct 212 ms 25336 KB Output is correct
90 Correct 216 ms 24952 KB Output is correct
91 Correct 198 ms 24312 KB Output is correct
92 Correct 156 ms 23800 KB Output is correct
93 Correct 222 ms 25208 KB Output is correct
94 Correct 248 ms 25732 KB Output is correct
95 Correct 255 ms 25848 KB Output is correct
96 Correct 251 ms 25848 KB Output is correct

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 513 ms 68708 KB Output is correct
2 Correct 534 ms 72272 KB Output is correct
3 Execution timed out 2055 ms 112272 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1400 ms 90616 KB Output is correct
2 Correct 1415 ms 91668 KB Output is correct
3 Correct 1518 ms 91640 KB Output is correct
4 Correct 1685 ms 93052 KB Output is correct
5 Correct 1752 ms 92504 KB Output is correct
6 Correct 1759 ms 92676 KB Output is correct
7 Correct 1530 ms 91396 KB Output is correct
8 Correct 1582 ms 91268 KB Output is correct
9 Correct 1581 ms 92296 KB Output is correct
10 Correct 1753 ms 105656 KB Output is correct
11 Correct 1804 ms 105976 KB Output is correct
12 Execution timed out 2061 ms 111172 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #5
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 21632 KB Output is correct
2 Correct 15 ms 21632 KB Output is correct
3 Correct 15 ms 21632 KB Output is correct
4 Correct 27 ms 22656 KB Output is correct
5 Correct 28 ms 22656 KB Output is correct
6 Correct 28 ms 22656 KB Output is correct
7 Correct 46 ms 24444 KB Output is correct
8 Correct 44 ms 24568 KB Output is correct
9 Correct 43 ms 24568 KB Output is correct
10 Correct 40 ms 24440 KB Output is correct
11 Correct 44 ms 24576 KB Output is correct
12 Correct 50 ms 24696 KB Output is correct
13 Correct 42 ms 24696 KB Output is correct
14 Correct 43 ms 24572 KB Output is correct
15 Correct 45 ms 24824 KB Output is correct
16 Correct 41 ms 24448 KB Output is correct
17 Correct 40 ms 24320 KB Output is correct
18 Correct 42 ms 24440 KB Output is correct
19 Correct 40 ms 24184 KB Output is correct
20 Correct 45 ms 24696 KB Output is correct
21 Correct 42 ms 24576 KB Output is correct
22 Correct 48 ms 24952 KB Output is correct
23 Correct 47 ms 24952 KB Output is correct
24 Correct 53 ms 25336 KB Output is correct
25 Correct 32 ms 24192 KB Output is correct
26 Correct 32 ms 24448 KB Output is correct
27 Correct 29 ms 23936 KB Output is correct
28 Correct 51 ms 25284 KB Output is correct
29 Correct 49 ms 25340 KB Output is correct
30 Correct 51 ms 25464 KB Output is correct
31 Correct 49 ms 25368 KB Output is correct
32 Correct 50 ms 25448 KB Output is correct
33 Correct 56 ms 25336 KB Output is correct
34 Correct 74 ms 25336 KB Output is correct
35 Correct 59 ms 25592 KB Output is correct
36 Correct 30 ms 24064 KB Output is correct
37 Correct 49 ms 25336 KB Output is correct
38 Correct 49 ms 25336 KB Output is correct
39 Correct 51 ms 25464 KB Output is correct
40 Correct 60 ms 25464 KB Output is correct
41 Correct 48 ms 25080 KB Output is correct
42 Correct 55 ms 24952 KB Output is correct
43 Correct 31 ms 24064 KB Output is correct
44 Correct 48 ms 25000 KB Output is correct
45 Correct 48 ms 25080 KB Output is correct
46 Correct 29 ms 23928 KB Output is correct
47 Correct 39 ms 23936 KB Output is correct
48 Correct 35 ms 23544 KB Output is correct
49 Correct 35 ms 23288 KB Output is correct
50 Correct 34 ms 23168 KB Output is correct
51 Correct 30 ms 22904 KB Output is correct
52 Correct 37 ms 23928 KB Output is correct
53 Correct 40 ms 24056 KB Output is correct
54 Correct 40 ms 24088 KB Output is correct
55 Correct 41 ms 24000 KB Output is correct
56 Correct 145 ms 23716 KB Output is correct
57 Correct 151 ms 23676 KB Output is correct
58 Correct 150 ms 23676 KB Output is correct
59 Correct 266 ms 26360 KB Output is correct
60 Correct 279 ms 26104 KB Output is correct
61 Correct 269 ms 26744 KB Output is correct
62 Correct 282 ms 26264 KB Output is correct
63 Correct 269 ms 26428 KB Output is correct
64 Correct 279 ms 26616 KB Output is correct
65 Correct 282 ms 26108 KB Output is correct
66 Correct 277 ms 26104 KB Output is correct
67 Correct 265 ms 25976 KB Output is correct
68 Correct 314 ms 26356 KB Output is correct
69 Correct 251 ms 25592 KB Output is correct
70 Correct 336 ms 26364 KB Output is correct
71 Correct 248 ms 25848 KB Output is correct
72 Correct 286 ms 26436 KB Output is correct
73 Correct 285 ms 26104 KB Output is correct
74 Correct 145 ms 25976 KB Output is correct
75 Correct 133 ms 25848 KB Output is correct
76 Correct 100 ms 25720 KB Output is correct
77 Correct 336 ms 27256 KB Output is correct
78 Correct 346 ms 27384 KB Output is correct
79 Correct 117 ms 25976 KB Output is correct
80 Correct 356 ms 27384 KB Output is correct
81 Correct 392 ms 27256 KB Output is correct
82 Correct 310 ms 26616 KB Output is correct
83 Correct 311 ms 27000 KB Output is correct
84 Correct 131 ms 25848 KB Output is correct
85 Correct 329 ms 26676 KB Output is correct
86 Correct 328 ms 26488 KB Output is correct
87 Correct 106 ms 25208 KB Output is correct
88 Correct 238 ms 25596 KB Output is correct
89 Correct 212 ms 25336 KB Output is correct
90 Correct 216 ms 24952 KB Output is correct
91 Correct 198 ms 24312 KB Output is correct
92 Correct 156 ms 23800 KB Output is correct
93 Correct 222 ms 25208 KB Output is correct
94 Correct 248 ms 25732 KB Output is correct
95 Correct 255 ms 25848 KB Output is correct
96 Correct 251 ms 25848 KB Output is correct
97 Correct 513 ms 68708 KB Output is correct
98 Correct 534 ms 72272 KB Output is correct
99 Execution timed out 2055 ms 112272 KB Time limit exceeded
100 Halted 0 ms 0 KB -