oj.uz

답안 #283014

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
283014 2020-08-25T08:37:04 Z mhy908 Iqea (innopolis2018_final_C) C++14
100 / 100
 1357 ms 168140 KB 
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#define eb emplace_back
#define mp make_pair
#define F first
#define S second
#define svec(x) sort(x.begin(), x.end())
#define press(x) x.erase(unique(x.begin(), x.end()), x.end())
using namespace std;
typedef pair<int, int> pii;
const int inf=1e9;

#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
typedef cc_hash_table<int, int, hash<int> > ht;

int n, rex, rey;
ht 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);}
inline 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);
    }
}

inline 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];
}
inline 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];
}
inline int getd_x(int x, int y){return dep_x[x]+dep_x[y]-2*dep_x[lca_x(x, y)];}
inline int getd_y(int x, int y){return dep_y[x]+dep_y[y]-2*dep_y[lca_y(x, y)];}

inline 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);
    }
}
inline 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);
    }
}

ht arr[100010];

inline 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]);
        }
    }
}
inline 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;
}

inline int readChar();
template<class T=int> inline T readInt();
static const int buf_size=4096;
inline int getChar(){
    static char buf[buf_size];
    static int len=0, pos=0;
    if(pos==len)pos=0, len=fread(buf, 1, buf_size, stdin);
    if(pos==len)return -1;
    return buf[pos++];
}
inline int readChar(){
    int c=getChar();
    while(c<=32)c=getChar();
    return c;
}
template <class T>
inline T readInt(){
    int s=1, c=readChar();
    T x=0;
    if(c=='-')s=-1, c=getChar();
    while('0'<= c&&c<='9')x=x*10+c-'0', c=getChar();
    return s==1?x:-x;
}

int main(){
    //scanf("%d", &n);
    n=readInt();
    for(int i=1; i<=n; i++){
        //scanf("%d %d", &p[i].F, &p[i].S);
        p[i].F=readInt(); p[i].S=readInt();
    }
    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);
    q=readInt();
    for(int i=1; i<=q; i++){
        int a, b, c;
        //scanf("%d %d %d", &a, &b, &c);
        a=readInt(); b=readInt(); c=readInt();
        if(a==1)upd(b, c);
        else printf("%d\n", query(b, c));
    }
}

Subtask #1
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 69 ms 59256 KB Output is correct
2 Correct 64 ms 59128 KB Output is correct
3 Correct 68 ms 59280 KB Output is correct
4 Correct 77 ms 60408 KB Output is correct
5 Correct 76 ms 60280 KB Output is correct
6 Correct 90 ms 60664 KB Output is correct
7 Correct 87 ms 62460 KB Output is correct
8 Correct 96 ms 62584 KB Output is correct
9 Correct 93 ms 62680 KB Output is correct
10 Correct 103 ms 62328 KB Output is correct
11 Correct 91 ms 62584 KB Output is correct
12 Correct 89 ms 62712 KB Output is correct
13 Correct 96 ms 62792 KB Output is correct
14 Correct 96 ms 62584 KB Output is correct
15 Correct 93 ms 62712 KB Output is correct
16 Correct 87 ms 62456 KB Output is correct
17 Correct 87 ms 62200 KB Output is correct
18 Correct 112 ms 62456 KB Output is correct
19 Correct 85 ms 62200 KB Output is correct
20 Correct 94 ms 62712 KB Output is correct
21 Correct 87 ms 62584 KB Output is correct
22 Correct 95 ms 63096 KB Output is correct
23 Correct 95 ms 62968 KB Output is correct
24 Correct 94 ms 63228 KB Output is correct
25 Correct 79 ms 61560 KB Output is correct
26 Correct 84 ms 62328 KB Output is correct
27 Correct 78 ms 61944 KB Output is correct
28 Correct 90 ms 63352 KB Output is correct
29 Correct 93 ms 63224 KB Output is correct
30 Correct 90 ms 63352 KB Output is correct
31 Correct 90 ms 63224 KB Output is correct
32 Correct 95 ms 63608 KB Output is correct
33 Correct 92 ms 63416 KB Output is correct
34 Correct 96 ms 63224 KB Output is correct
35 Correct 95 ms 63608 KB Output is correct
36 Correct 78 ms 61304 KB Output is correct
37 Correct 90 ms 63352 KB Output is correct
38 Correct 91 ms 63392 KB Output is correct
39 Correct 91 ms 63480 KB Output is correct
40 Correct 92 ms 63480 KB Output is correct
41 Correct 106 ms 63096 KB Output is correct
42 Correct 89 ms 62840 KB Output is correct
43 Correct 81 ms 61368 KB Output is correct
44 Correct 97 ms 63096 KB Output is correct
45 Correct 89 ms 63096 KB Output is correct
46 Correct 110 ms 61688 KB Output is correct
47 Correct 94 ms 61816 KB Output is correct
48 Correct 103 ms 61432 KB Output is correct
49 Correct 87 ms 61048 KB Output is correct
50 Correct 82 ms 61048 KB Output is correct
51 Correct 86 ms 60664 KB Output is correct
52 Correct 89 ms 61944 KB Output is correct
53 Correct 87 ms 61816 KB Output is correct
54 Correct 93 ms 61816 KB Output is correct
55 Correct 104 ms 61944 KB Output is correct

Subtask #2
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 69 ms 59256 KB Output is correct
2 Correct 64 ms 59128 KB Output is correct
3 Correct 68 ms 59280 KB Output is correct
4 Correct 77 ms 60408 KB Output is correct
5 Correct 76 ms 60280 KB Output is correct
6 Correct 90 ms 60664 KB Output is correct
7 Correct 87 ms 62460 KB Output is correct
8 Correct 96 ms 62584 KB Output is correct
9 Correct 93 ms 62680 KB Output is correct
10 Correct 103 ms 62328 KB Output is correct
11 Correct 91 ms 62584 KB Output is correct
12 Correct 89 ms 62712 KB Output is correct
13 Correct 96 ms 62792 KB Output is correct
14 Correct 96 ms 62584 KB Output is correct
15 Correct 93 ms 62712 KB Output is correct
16 Correct 87 ms 62456 KB Output is correct
17 Correct 87 ms 62200 KB Output is correct
18 Correct 112 ms 62456 KB Output is correct
19 Correct 85 ms 62200 KB Output is correct
20 Correct 94 ms 62712 KB Output is correct
21 Correct 87 ms 62584 KB Output is correct
22 Correct 95 ms 63096 KB Output is correct
23 Correct 95 ms 62968 KB Output is correct
24 Correct 94 ms 63228 KB Output is correct
25 Correct 79 ms 61560 KB Output is correct
26 Correct 84 ms 62328 KB Output is correct
27 Correct 78 ms 61944 KB Output is correct
28 Correct 90 ms 63352 KB Output is correct
29 Correct 93 ms 63224 KB Output is correct
30 Correct 90 ms 63352 KB Output is correct
31 Correct 90 ms 63224 KB Output is correct
32 Correct 95 ms 63608 KB Output is correct
33 Correct 92 ms 63416 KB Output is correct
34 Correct 96 ms 63224 KB Output is correct
35 Correct 95 ms 63608 KB Output is correct
36 Correct 78 ms 61304 KB Output is correct
37 Correct 90 ms 63352 KB Output is correct
38 Correct 91 ms 63392 KB Output is correct
39 Correct 91 ms 63480 KB Output is correct
40 Correct 92 ms 63480 KB Output is correct
41 Correct 106 ms 63096 KB Output is correct
42 Correct 89 ms 62840 KB Output is correct
43 Correct 81 ms 61368 KB Output is correct
44 Correct 97 ms 63096 KB Output is correct
45 Correct 89 ms 63096 KB Output is correct
46 Correct 110 ms 61688 KB Output is correct
47 Correct 94 ms 61816 KB Output is correct
48 Correct 103 ms 61432 KB Output is correct
49 Correct 87 ms 61048 KB Output is correct
50 Correct 82 ms 61048 KB Output is correct
51 Correct 86 ms 60664 KB Output is correct
52 Correct 89 ms 61944 KB Output is correct
53 Correct 87 ms 61816 KB Output is correct
54 Correct 93 ms 61816 KB Output is correct
55 Correct 104 ms 61944 KB Output is correct
56 Correct 121 ms 61432 KB Output is correct
57 Correct 129 ms 61560 KB Output is correct
58 Correct 146 ms 61432 KB Output is correct
59 Correct 177 ms 63996 KB Output is correct
60 Correct 194 ms 63992 KB Output is correct
61 Correct 189 ms 64248 KB Output is correct
62 Correct 182 ms 64120 KB Output is correct
63 Correct 177 ms 64248 KB Output is correct
64 Correct 195 ms 64376 KB Output is correct
65 Correct 187 ms 63992 KB Output is correct
66 Correct 198 ms 64120 KB Output is correct
67 Correct 189 ms 63992 KB Output is correct
68 Correct 181 ms 64120 KB Output is correct
69 Correct 176 ms 63480 KB Output is correct
70 Correct 176 ms 64120 KB Output is correct
71 Correct 172 ms 63608 KB Output is correct
72 Correct 187 ms 64248 KB Output is correct
73 Correct 188 ms 63864 KB Output is correct
74 Correct 128 ms 62968 KB Output is correct
75 Correct 132 ms 63888 KB Output is correct
76 Correct 106 ms 63352 KB Output is correct
77 Correct 231 ms 64888 KB Output is correct
78 Correct 242 ms 65016 KB Output is correct
79 Correct 120 ms 62712 KB Output is correct
80 Correct 209 ms 65016 KB Output is correct
81 Correct 251 ms 65016 KB Output is correct
82 Correct 207 ms 64376 KB Output is correct
83 Correct 235 ms 64632 KB Output is correct
84 Correct 164 ms 62840 KB Output is correct
85 Correct 246 ms 64632 KB Output is correct
86 Correct 213 ms 64632 KB Output is correct
87 Correct 117 ms 62968 KB Output is correct
88 Correct 167 ms 63224 KB Output is correct
89 Correct 158 ms 62968 KB Output is correct
90 Correct 160 ms 62584 KB Output is correct
91 Correct 144 ms 61968 KB Output is correct
92 Correct 130 ms 61560 KB Output is correct
93 Correct 159 ms 63096 KB Output is correct
94 Correct 172 ms 63224 KB Output is correct
95 Correct 167 ms 63300 KB Output is correct
96 Correct 170 ms 63352 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 411 ms 116556 KB Output is correct
2 Correct 423 ms 104244 KB Output is correct
3 Correct 1176 ms 165860 KB Output is correct
4 Correct 1264 ms 168140 KB Output is correct
5 Correct 1115 ms 159720 KB Output is correct
6 Correct 1145 ms 159212 KB Output is correct
7 Correct 419 ms 90540 KB Output is correct
8 Correct 349 ms 104832 KB Output is correct
9 Correct 362 ms 109152 KB Output is correct
10 Correct 497 ms 89976 KB Output is correct
11 Correct 400 ms 105444 KB Output is correct
12 Correct 360 ms 108900 KB Output is correct
13 Correct 363 ms 109156 KB Output is correct
14 Correct 362 ms 109028 KB Output is correct

Subtask #4
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1022 ms 140516 KB Output is correct
2 Correct 1022 ms 141296 KB Output is correct
3 Correct 1059 ms 140888 KB Output is correct
4 Correct 1113 ms 143076 KB Output is correct
5 Correct 1110 ms 142460 KB Output is correct
6 Correct 1158 ms 143248 KB Output is correct
7 Correct 1083 ms 141804 KB Output is correct
8 Correct 1077 ms 141308 KB Output is correct
9 Correct 1083 ms 143364 KB Output is correct
10 Correct 1300 ms 156920 KB Output is correct
11 Correct 1161 ms 153796 KB Output is correct
12 Correct 1243 ms 158236 KB Output is correct
13 Correct 488 ms 109428 KB Output is correct
14 Correct 567 ms 134252 KB Output is correct
15 Correct 385 ms 110820 KB Output is correct
16 Correct 1126 ms 157652 KB Output is correct
17 Correct 1133 ms 156784 KB Output is correct
18 Correct 1141 ms 158956 KB Output is correct
19 Correct 1098 ms 159080 KB Output is correct
20 Correct 1274 ms 164448 KB Output is correct
21 Correct 1357 ms 164580 KB Output is correct
22 Correct 1195 ms 156136 KB Output is correct
23 Correct 1263 ms 166856 KB Output is correct
24 Correct 403 ms 100600 KB Output is correct
25 Correct 1191 ms 163268 KB Output is correct
26 Correct 1175 ms 163300 KB Output is correct
27 Correct 1162 ms 166364 KB Output is correct
28 Correct 1189 ms 165732 KB Output is correct

Subtask #5
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 69 ms 59256 KB Output is correct
2 Correct 64 ms 59128 KB Output is correct
3 Correct 68 ms 59280 KB Output is correct
4 Correct 77 ms 60408 KB Output is correct
5 Correct 76 ms 60280 KB Output is correct
6 Correct 90 ms 60664 KB Output is correct
7 Correct 87 ms 62460 KB Output is correct
8 Correct 96 ms 62584 KB Output is correct
9 Correct 93 ms 62680 KB Output is correct
10 Correct 103 ms 62328 KB Output is correct
11 Correct 91 ms 62584 KB Output is correct
12 Correct 89 ms 62712 KB Output is correct
13 Correct 96 ms 62792 KB Output is correct
14 Correct 96 ms 62584 KB Output is correct
15 Correct 93 ms 62712 KB Output is correct
16 Correct 87 ms 62456 KB Output is correct
17 Correct 87 ms 62200 KB Output is correct
18 Correct 112 ms 62456 KB Output is correct
19 Correct 85 ms 62200 KB Output is correct
20 Correct 94 ms 62712 KB Output is correct
21 Correct 87 ms 62584 KB Output is correct
22 Correct 95 ms 63096 KB Output is correct
23 Correct 95 ms 62968 KB Output is correct
24 Correct 94 ms 63228 KB Output is correct
25 Correct 79 ms 61560 KB Output is correct
26 Correct 84 ms 62328 KB Output is correct
27 Correct 78 ms 61944 KB Output is correct
28 Correct 90 ms 63352 KB Output is correct
29 Correct 93 ms 63224 KB Output is correct
30 Correct 90 ms 63352 KB Output is correct
31 Correct 90 ms 63224 KB Output is correct
32 Correct 95 ms 63608 KB Output is correct
33 Correct 92 ms 63416 KB Output is correct
34 Correct 96 ms 63224 KB Output is correct
35 Correct 95 ms 63608 KB Output is correct
36 Correct 78 ms 61304 KB Output is correct
37 Correct 90 ms 63352 KB Output is correct
38 Correct 91 ms 63392 KB Output is correct
39 Correct 91 ms 63480 KB Output is correct
40 Correct 92 ms 63480 KB Output is correct
41 Correct 106 ms 63096 KB Output is correct
42 Correct 89 ms 62840 KB Output is correct
43 Correct 81 ms 61368 KB Output is correct
44 Correct 97 ms 63096 KB Output is correct
45 Correct 89 ms 63096 KB Output is correct
46 Correct 110 ms 61688 KB Output is correct
47 Correct 94 ms 61816 KB Output is correct
48 Correct 103 ms 61432 KB Output is correct
49 Correct 87 ms 61048 KB Output is correct
50 Correct 82 ms 61048 KB Output is correct
51 Correct 86 ms 60664 KB Output is correct
52 Correct 89 ms 61944 KB Output is correct
53 Correct 87 ms 61816 KB Output is correct
54 Correct 93 ms 61816 KB Output is correct
55 Correct 104 ms 61944 KB Output is correct
56 Correct 121 ms 61432 KB Output is correct
57 Correct 129 ms 61560 KB Output is correct
58 Correct 146 ms 61432 KB Output is correct
59 Correct 177 ms 63996 KB Output is correct
60 Correct 194 ms 63992 KB Output is correct
61 Correct 189 ms 64248 KB Output is correct
62 Correct 182 ms 64120 KB Output is correct
63 Correct 177 ms 64248 KB Output is correct
64 Correct 195 ms 64376 KB Output is correct
65 Correct 187 ms 63992 KB Output is correct
66 Correct 198 ms 64120 KB Output is correct
67 Correct 189 ms 63992 KB Output is correct
68 Correct 181 ms 64120 KB Output is correct
69 Correct 176 ms 63480 KB Output is correct
70 Correct 176 ms 64120 KB Output is correct
71 Correct 172 ms 63608 KB Output is correct
72 Correct 187 ms 64248 KB Output is correct
73 Correct 188 ms 63864 KB Output is correct
74 Correct 128 ms 62968 KB Output is correct
75 Correct 132 ms 63888 KB Output is correct
76 Correct 106 ms 63352 KB Output is correct
77 Correct 231 ms 64888 KB Output is correct
78 Correct 242 ms 65016 KB Output is correct
79 Correct 120 ms 62712 KB Output is correct
80 Correct 209 ms 65016 KB Output is correct
81 Correct 251 ms 65016 KB Output is correct
82 Correct 207 ms 64376 KB Output is correct
83 Correct 235 ms 64632 KB Output is correct
84 Correct 164 ms 62840 KB Output is correct
85 Correct 246 ms 64632 KB Output is correct
86 Correct 213 ms 64632 KB Output is correct
87 Correct 117 ms 62968 KB Output is correct
88 Correct 167 ms 63224 KB Output is correct
89 Correct 158 ms 62968 KB Output is correct
90 Correct 160 ms 62584 KB Output is correct
91 Correct 144 ms 61968 KB Output is correct
92 Correct 130 ms 61560 KB Output is correct
93 Correct 159 ms 63096 KB Output is correct
94 Correct 172 ms 63224 KB Output is correct
95 Correct 167 ms 63300 KB Output is correct
96 Correct 170 ms 63352 KB Output is correct
97 Correct 411 ms 116556 KB Output is correct
98 Correct 423 ms 104244 KB Output is correct
99 Correct 1176 ms 165860 KB Output is correct
100 Correct 1264 ms 168140 KB Output is correct
101 Correct 1115 ms 159720 KB Output is correct
102 Correct 1145 ms 159212 KB Output is correct
103 Correct 419 ms 90540 KB Output is correct
104 Correct 349 ms 104832 KB Output is correct
105 Correct 362 ms 109152 KB Output is correct
106 Correct 497 ms 89976 KB Output is correct
107 Correct 400 ms 105444 KB Output is correct
108 Correct 360 ms 108900 KB Output is correct
109 Correct 363 ms 109156 KB Output is correct
110 Correct 362 ms 109028 KB Output is correct
111 Correct 1022 ms 140516 KB Output is correct
112 Correct 1022 ms 141296 KB Output is correct
113 Correct 1059 ms 140888 KB Output is correct
114 Correct 1113 ms 143076 KB Output is correct
115 Correct 1110 ms 142460 KB Output is correct
116 Correct 1158 ms 143248 KB Output is correct
117 Correct 1083 ms 141804 KB Output is correct
118 Correct 1077 ms 141308 KB Output is correct
119 Correct 1083 ms 143364 KB Output is correct
120 Correct 1300 ms 156920 KB Output is correct
121 Correct 1161 ms 153796 KB Output is correct
122 Correct 1243 ms 158236 KB Output is correct
123 Correct 488 ms 109428 KB Output is correct
124 Correct 567 ms 134252 KB Output is correct
125 Correct 385 ms 110820 KB Output is correct
126 Correct 1126 ms 157652 KB Output is correct
127 Correct 1133 ms 156784 KB Output is correct
128 Correct 1141 ms 158956 KB Output is correct
129 Correct 1098 ms 159080 KB Output is correct
130 Correct 1274 ms 164448 KB Output is correct
131 Correct 1357 ms 164580 KB Output is correct
132 Correct 1195 ms 156136 KB Output is correct
133 Correct 1263 ms 166856 KB Output is correct
134 Correct 403 ms 100600 KB Output is correct
135 Correct 1191 ms 163268 KB Output is correct
136 Correct 1175 ms 163300 KB Output is correct
137 Correct 1162 ms 166364 KB Output is correct
138 Correct 1189 ms 165732 KB Output is correct
139 Correct 300 ms 73464 KB Output is correct
140 Correct 355 ms 80760 KB Output is correct
141 Correct 335 ms 79736 KB Output is correct
142 Correct 337 ms 81272 KB Output is correct
143 Correct 987 ms 136432 KB Output is correct
144 Correct 1008 ms 132928 KB Output is correct
145 Correct 1024 ms 137316 KB Output is correct
146 Correct 919 ms 126820 KB Output is correct
147 Correct 1074 ms 142052 KB Output is correct
148 Correct 1081 ms 139444 KB Output is correct
149 Correct 1059 ms 150628 KB Output is correct
150 Correct 1048 ms 145772 KB Output is correct
151 Correct 391 ms 98040 KB Output is correct
152 Correct 1103 ms 155488 KB Output is correct
153 Correct 1083 ms 151012 KB Output is correct
154 Correct 364 ms 109412 KB Output is correct
155 Correct 869 ms 119836 KB Output is correct
156 Correct 762 ms 109552 KB Output is correct
157 Correct 699 ms 103660 KB Output is correct
158 Correct 624 ms 98300 KB Output is correct
159 Correct 551 ms 89080 KB Output is correct
160 Correct 824 ms 125804 KB Output is correct
161 Correct 849 ms 122748 KB Output is correct
162 Correct 812 ms 124456 KB Output is correct
163 Correct 852 ms 124544 KB Output is correct