oj.uz

답안 #1081421

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1081421 2024-08-30T04:32:54 Z thelegendary08 The Ties That Guide Us (CEOI23_incursion) C++17
100 / 100
 293 ms 14528 KB 
#include <bits/stdc++.h>
#include "incursion.h"
#define f0r(i,n) for(int i = 0;i<n;i++)
#define vi vector<int>
#define pb push_back
using namespace std;
const int mxn = 45005;
int n;
int sts[mxn];
vector<int>adj[mxn];
int dfs(int x, int p){
    int cur = 1;
    for(auto u : adj[x]){
        if(u != p){
            cur += dfs(u, x);
        }
    }
    sts[x] = cur;
    return cur;
}
int centroid(int x, int p){
    for(auto u : adj[x]){
        if(u != p && sts[u] > n/2)return centroid(u, x);
    }
    return x;
}

int sts2[mxn];
vector<int>adj2[mxn];

int dfs2(int x, int p){
    int cur = 1;
    for(auto u : adj2[x]){
        if(u != p){
            cur += dfs2(u, x);
        }
    }
    sts2[x] = cur;
    return cur;
}
int centroid2(int x, int p){
    for(auto u : adj2[x]){
        if(u != p && sts2[u] > n/2)return centroid2(u, x);
    }
    return x;
}

int stsc[mxn];
int dfs3(int x, int p){
    int cur = 1;
    for(auto u : adj2[x]){
        if(u != p){
            cur += dfs3(u, x);
        }
    }
    stsc[x] = cur;
    return cur;
}
std::vector<int> mark(std::vector<std::pair<int, int>> F, int safe) {

    safe--;

	int two;
	n = F.size() + 1;
	vector<int>dist(n);
	dist[safe] = 0;

	vi deg(n, 0);
	vi degcnt(4, 0);
	f0r(i, n-1){
		adj[--F[i].first].push_back(--F[i].second);
		adj[F[i].second].push_back(F[i].first);
		deg[F[i].first]++;
		deg[F[i].second]++;
	}
	//f0r(i,n)cout<<deg[i]<<' ';
	//cout<<'\n';
    dfs(0, -1);
    //f0r(i,n)cout<<sts[i]<<' ';
    //cout<<'\n';
    int centroid1 = centroid(0, -1);
    vi centroids = {centroid1};
    for(auto u : adj[centroid1]){
        dfs(u, -1);
        int thing = centroid(u, -1);
        //cout<<u<<' '<<thing<<'\n';
        if(thing != centroid1){
            centroids.pb(thing);
            break;
        }
    }
    //for(auto u : centroids)cout<<u<<' ';
    //cout<<'\n';

    if(centroids.size() == 1){
        two = centroids[0];
        vi col(n,0);
        vi par(n);
        par[two] = -1;
        queue<int>q;
        q.push(two);
        while(!q.empty()){
            int cur = q.front();
            q.pop();
            for(auto u : adj[cur]){
                if(u != par[cur]){
                    par[u] = cur;
                    q.push(u);
                }
            }
        }
        //f0r(i,n)cout<<par[i]<<' ';
        //cout<<'\n';

        int now = safe;
        while(now != -1){
            //cout<<now<<'\n';
            col[now] = 1;
            now = par[now];
        }
        //cout<<cur<<'\n';
        //cout<<par[cur]<<'\n';

        //cout<<par[par[par[cur]]]<<'\n';
        return col;
    }
    else{
        vi col(n,0);
        vi par(n);
        par[centroids[0]] = centroids[1];
        par[centroids[1]] = centroids[0];
        queue<int>q;
        q.push(centroids[0]);
        while(!q.empty()){
            int cur = q.front();
            q.pop();
            for(auto u : adj[cur]){
                if(u != par[cur]){
                    par[u] = cur;
                    q.push(u);
                }
            }
        }
        q.push(centroids[1]);
        while(!q.empty()){
            int cur = q.front();
            q.pop();
            for(auto u : adj[cur]){
                if(u != par[cur]){
                    par[u] = cur;
                    q.push(u);
                }
            }
        }
        //f0r(i,n)cout<<par[i]<<' ';
        //cout<<'\n';

        int now = safe;
        int cnt = 0;
        while(cnt == 0){

            //cout<<now<<'\n';
            col[now] = 1;
            if(now == centroids[0] || now == centroids[1])cnt++;
            now = par[now];
        }

        return col;
    }

    return {};
    /*
	f0r(i,n){
	    if(deg[i] == 2)two = i;
        degcnt[deg[i]]++;
	}

	if(degcnt[3] == 0){
        vi col(n, 0);
        queue<int>q;
        q.push(safe);
        vector<bool>vis(n,0);
        vis[safe] = 1;

        col[safe] = 0;
        while(!q.empty()){
            int cur = q.front();
            q.pop();
            for(auto u : adj[cur]){
                if(vis[u])continue;
                vis[u] = 1;
                dist[u] = dist[cur] + 1;
                col[u] = (col[cur] + 1) % 3;
                q.push(u);
            }
        }
        return col;
	}
	else{
	    vi col(n,0);
        vi par(n);
        par[two] = -1;
        queue<int>q;
        q.push(two);
        while(!q.empty()){
            int cur = q.front();
            q.pop();
            for(auto u : adj[cur]){
                if(u != par[cur]){
                    par[u] = cur;
                    q.push(u);
                }
            }
        }
        //f0r(i,n)cout<<par[i]<<' ';
        //cout<<'\n';

        int now = safe;
        while(now != -1){
            //cout<<now<<'\n';
            col[now] = 1;
            now = par[now];
        }
        //cout<<cur<<'\n';
        //cout<<par[cur]<<'\n';

        //cout<<par[par[par[cur]]]<<'\n';
        return col;


	}
    */

}

void locate(std::vector<std::pair<int, int>> F, int curr, int t) {
	int x;
	vector<int>nxt = {2, 0, 1};
	n = F.size() + 1;
	vi deg(n+1);
	vi degcnt(4, 0);
	f0r(i, n-1){
		adj2[F[i].first].push_back(F[i].second);
		adj2[F[i].second].push_back(F[i].first);
		deg[F[i].first]++;
		deg[F[i].second]++;
	}
	dfs2(1, -1);
    //for(int i = 1; i<=n;i++)cout<<sts2[i]<<' ';
    //cout<<'\n';
    int centroid1 = centroid2(1, -1);
    vi centroids = {centroid1};
    for(auto u : adj2[centroid1]){
        dfs2(u, -1);
        int thing = centroid2(u, -1);
        if(thing != centroid1){
            centroids.pb(thing);
            break;
        }
    }
    //for(auto u : centroids)cout<<u<<' ';
    //cout<<'\n';
    int two;
    /*

	for(int i = 1; i<=n; i++){
        if(deg[i]==2)two = i;
        degcnt[deg[i]]++;
	}
	*/
	if(centroids.size() == 2){
        vi par(n+1);
        dfs3(centroids[0], centroids[1]);
        dfs3(centroids[1], centroids[0]);
        par[centroids[0]] = centroids[1];
        par[centroids[1]] = centroids[0];
        queue<int>q;
        q.push(centroids[0]);
        while(!q.empty()){
            int cur = q.front();
            q.pop();
            for(auto u : adj2[cur]){
                if(u != par[cur]){
                    par[u] = cur;
                    q.push(u);
                }
            }
        }
        q.push(centroids[1]);
        while(!q.empty()){
            int cur = q.front();
            q.pop();
            for(auto u : adj2[cur]){
                if(u != par[cur]){
                    par[u] = cur;
                    q.push(u);
                }
            }
        }
        vi vis(n+1, 0);
        int cur = curr;
        int col = t;
        int x;
        vis[cur] = 1;
        while(col == 0){
            cur = par[cur];
            vis[cur] = 1;
            x = visit(cur);
            col = x;
        }
        bool found = 0;
        while(!found){
            vector<pair<int,int>>thing;
            for(auto u : adj2[cur]){
                if(!vis[u] && u != par[cur])thing.push_back({stsc[u], u});
            }
            sort(thing.rbegin(), thing.rend());
            bool ok =0;
            for(auto u : thing){
                x = visit(u.second);
                if(x == 0){
                    visit(cur);
                }
                else{
                    cur = u.second;
                    vis[cur] = 1;
                    col = x;
                    ok = 1;
                    break;
                }
            }
            if(!ok)return;
        }
	}
	else{
        two = centroids[0];
        //cout<<two<<'\n';
        vi par(n+1);
        par[two] = -1;
        vi d(n+1, 0);

        queue<int>q;
        q.push(two);
        while(!q.empty()){
            int cur = q.front();
            q.pop();
            for(auto u : adj2[cur]){
                if(u != par[cur]){
                    par[u] = cur;
                    d[u] = d[cur] + 1;
                    q.push(u);
                }
            }
        }
        //for(int i = 1; i<=n; i++)cout<<d[i]<<' ';
        //cout<<'\n';
        vector<bool>viss(n+1, 0);
        vi sts(n+1, 0);


        priority_queue<pair<int,int>>pq;
        for(int i=1; i<=n;i++){
            if(deg[i] == 1){
                pq.push({d[i], i});
                sts[i] = 1;
                viss[i] = 1;
            }
        }
        while(!pq.empty()){
            int cur = pq.top().second;
            pq.pop();
            //cout<<cur<<'\n';
            //if(par[cur] != -1)sts[par[cur]] += sts[cur];
            if(par[cur] != -1 && !viss[par[cur]]){
                viss[par[cur]] = 1;
                for(auto u : adj2[par[cur]]){
                    if(u != par[par[cur]]){
                        sts[par[cur]] += sts[u];
                    }
                }
                pq.push({d[par[cur]], par[cur]});
            }
        }
        //for(int i = 1; i<=n; i++)cout<<sts[i]<<' ';
        //cout<<'\n';
        vi vis(n+1, 0);
        int cur = curr;
        int col = t;
        int x;
        vis[cur] = 1;
        while(col == 0){
            cur = par[cur];
            vis[cur] = 1;
            x = visit(cur);
            col = x;
        }
        bool found = 0;
        while(!found){
            vector<pair<int,int>>thing;
            for(auto u : adj2[cur]){
                if(!vis[u] && u != par[cur])thing.push_back({sts[u], u});
            }
            sort(thing.rbegin(), thing.rend());
            bool ok =0;
            for(auto u : thing){
                x = visit(u.second);
                if(x == 0){
                    visit(cur);
                }
                else{
                    cur = u.second;
                    vis[cur] = 1;
                    col = x;
                    ok = 1;
                    break;
                }
            }
            if(!ok)return;
        }

	}



}

Compilation message

incursion.cpp: In function 'void locate(std::vector<std::pair<int, int> >, int, int)':
incursion.cpp:237:6: warning: unused variable 'x' [-Wunused-variable]
  237 |  int x;
      |      ^
interface.cpp: In function 'int main()':
interface.cpp:44:55: warning: comparison of integer expressions of different signedness: 'size_t' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   44 |     if(fread(T.data(), sizeof(int), 2 * N - 2, stdin) != 2 * N - 2) exit(0);
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
interface.cpp:50:33: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   50 |         int l = (numbers.size() == N ? N : 0);
      |                  ~~~~~~~~~~~~~~~^~~~

Subtask #0
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 5380 KB Correct

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 220 ms 13436 KB Correct
2 Correct 250 ms 13540 KB Correct
3 Correct 131 ms 13988 KB Correct
4 Correct 115 ms 13980 KB Correct
5 Correct 206 ms 13860 KB Correct
6 Correct 87 ms 13924 KB Correct
7 Correct 87 ms 13468 KB Correct
8 Correct 235 ms 13744 KB Correct
9 Correct 221 ms 14004 KB Correct
10 Correct 157 ms 13452 KB Correct
11 Correct 119 ms 13956 KB Correct
12 Correct 293 ms 13428 KB Correct
13 Correct 76 ms 13092 KB Correct
14 Correct 101 ms 13532 KB Correct
15 Correct 240 ms 14024 KB Correct
16 Correct 238 ms 14528 KB Correct
17 Correct 120 ms 13068 KB Correct
18 Correct 105 ms 13080 KB Correct
19 Correct 172 ms 12876 KB Correct
20 Correct 97 ms 13928 KB Correct
21 Correct 88 ms 13656 KB Correct
22 Correct 226 ms 13516 KB Correct
23 Correct 238 ms 13784 KB Correct
24 Correct 97 ms 13416 KB Correct
25 Correct 103 ms 13680 KB Correct
26 Correct 95 ms 13216 KB Correct
27 Correct 95 ms 13256 KB Correct
28 Correct 87 ms 13724 KB Correct
29 Correct 223 ms 13780 KB Correct
30 Correct 226 ms 13408 KB Correct
31 Correct 86 ms 14176 KB Correct
32 Correct 246 ms 13428 KB Correct
33 Correct 249 ms 13772 KB Correct
34 Correct 96 ms 12968 KB Correct
35 Correct 92 ms 13164 KB Correct
36 Correct 249 ms 13728 KB Correct
37 Correct 206 ms 13756 KB Correct
38 Correct 274 ms 13928 KB Correct
39 Correct 156 ms 13916 KB Correct
40 Correct 199 ms 13768 KB Correct
41 Correct 91 ms 13724 KB Correct
42 Correct 95 ms 13724 KB Correct
43 Correct 229 ms 13796 KB Correct
44 Correct 215 ms 13108 KB Correct
45 Correct 102 ms 13212 KB Correct
46 Correct 109 ms 13472 KB Correct
47 Correct 109 ms 13608 KB Correct
48 Correct 92 ms 12900 KB Correct
49 Correct 90 ms 13788 KB Correct

Subtask #2
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 101 ms 11608 KB Correct
2 Correct 91 ms 11684 KB Correct
3 Correct 90 ms 11680 KB Correct
4 Correct 114 ms 12936 KB Correct
5 Correct 149 ms 12724 KB Correct
6 Correct 183 ms 12884 KB Correct
7 Correct 102 ms 11348 KB Correct
8 Correct 88 ms 11548 KB Correct
9 Correct 86 ms 11288 KB Correct
10 Correct 99 ms 11608 KB Correct
11 Correct 90 ms 11764 KB Correct
12 Correct 94 ms 11700 KB Correct
13 Correct 91 ms 11316 KB Correct
14 Correct 51 ms 9720 KB Correct
15 Correct 68 ms 9544 KB Correct
16 Correct 92 ms 11320 KB Correct
17 Correct 88 ms 11484 KB Correct
18 Correct 84 ms 11564 KB Correct
19 Correct 94 ms 11340 KB Correct
20 Correct 67 ms 9560 KB Correct
21 Correct 69 ms 9572 KB Correct
22 Correct 64 ms 9616 KB Correct
23 Correct 66 ms 10048 KB Correct
24 Correct 61 ms 9804 KB Correct
25 Correct 69 ms 9544 KB Correct
26 Correct 96 ms 11432 KB Correct
27 Correct 95 ms 11548 KB Correct
28 Correct 84 ms 11508 KB Correct
29 Correct 91 ms 11580 KB Correct
30 Correct 100 ms 11588 KB Correct
31 Correct 97 ms 11348 KB Correct
32 Correct 94 ms 11420 KB Correct
33 Correct 94 ms 11284 KB Correct
34 Correct 91 ms 11348 KB Correct
35 Correct 102 ms 11564 KB Correct
36 Correct 97 ms 11676 KB Correct
37 Correct 94 ms 11524 KB Correct
38 Correct 102 ms 11692 KB Correct
39 Correct 94 ms 11536 KB Correct
40 Correct 98 ms 11324 KB Correct
41 Correct 111 ms 11336 KB Correct
42 Correct 97 ms 11580 KB Correct
43 Correct 91 ms 11620 KB Correct
44 Correct 98 ms 11348 KB Correct
45 Correct 86 ms 11324 KB Correct
46 Correct 93 ms 11604 KB Correct
47 Correct 101 ms 11460 KB Correct
48 Correct 86 ms 11840 KB Correct
49 Correct 92 ms 11524 KB Correct
50 Correct 94 ms 11324 KB Correct
51 Correct 106 ms 11352 KB Correct
52 Correct 93 ms 11836 KB Correct
53 Correct 94 ms 11324 KB Correct
54 Correct 93 ms 11460 KB Correct
55 Correct 96 ms 11680 KB Correct
56 Correct 102 ms 11676 KB Correct
57 Correct 90 ms 11468 KB Correct
58 Correct 101 ms 11604 KB Correct
59 Correct 91 ms 11804 KB Correct
60 Correct 96 ms 11480 KB Correct
61 Correct 98 ms 11488 KB Correct
62 Correct 97 ms 11736 KB Correct
63 Correct 84 ms 11752 KB Correct
64 Correct 105 ms 11300 KB Correct
65 Correct 82 ms 11468 KB Correct

Subtask #3
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 5380 KB Correct
2 Correct 220 ms 13436 KB Correct
3 Correct 250 ms 13540 KB Correct
4 Correct 131 ms 13988 KB Correct
5 Correct 115 ms 13980 KB Correct
6 Correct 206 ms 13860 KB Correct
7 Correct 87 ms 13924 KB Correct
8 Correct 87 ms 13468 KB Correct
9 Correct 235 ms 13744 KB Correct
10 Correct 221 ms 14004 KB Correct
11 Correct 157 ms 13452 KB Correct
12 Correct 119 ms 13956 KB Correct
13 Correct 293 ms 13428 KB Correct
14 Correct 76 ms 13092 KB Correct
15 Correct 101 ms 13532 KB Correct
16 Correct 240 ms 14024 KB Correct
17 Correct 238 ms 14528 KB Correct
18 Correct 120 ms 13068 KB Correct
19 Correct 105 ms 13080 KB Correct
20 Correct 172 ms 12876 KB Correct
21 Correct 97 ms 13928 KB Correct
22 Correct 88 ms 13656 KB Correct
23 Correct 226 ms 13516 KB Correct
24 Correct 238 ms 13784 KB Correct
25 Correct 97 ms 13416 KB Correct
26 Correct 103 ms 13680 KB Correct
27 Correct 95 ms 13216 KB Correct
28 Correct 95 ms 13256 KB Correct
29 Correct 87 ms 13724 KB Correct
30 Correct 223 ms 13780 KB Correct
31 Correct 226 ms 13408 KB Correct
32 Correct 86 ms 14176 KB Correct
33 Correct 246 ms 13428 KB Correct
34 Correct 249 ms 13772 KB Correct
35 Correct 96 ms 12968 KB Correct
36 Correct 92 ms 13164 KB Correct
37 Correct 249 ms 13728 KB Correct
38 Correct 206 ms 13756 KB Correct
39 Correct 274 ms 13928 KB Correct
40 Correct 156 ms 13916 KB Correct
41 Correct 199 ms 13768 KB Correct
42 Correct 91 ms 13724 KB Correct
43 Correct 95 ms 13724 KB Correct
44 Correct 229 ms 13796 KB Correct
45 Correct 215 ms 13108 KB Correct
46 Correct 102 ms 13212 KB Correct
47 Correct 109 ms 13472 KB Correct
48 Correct 109 ms 13608 KB Correct
49 Correct 92 ms 12900 KB Correct
50 Correct 90 ms 13788 KB Correct
51 Correct 101 ms 11608 KB Correct
52 Correct 91 ms 11684 KB Correct
53 Correct 90 ms 11680 KB Correct
54 Correct 114 ms 12936 KB Correct
55 Correct 149 ms 12724 KB Correct
56 Correct 183 ms 12884 KB Correct
57 Correct 102 ms 11348 KB Correct
58 Correct 88 ms 11548 KB Correct
59 Correct 86 ms 11288 KB Correct
60 Correct 99 ms 11608 KB Correct
61 Correct 90 ms 11764 KB Correct
62 Correct 94 ms 11700 KB Correct
63 Correct 91 ms 11316 KB Correct
64 Correct 51 ms 9720 KB Correct
65 Correct 68 ms 9544 KB Correct
66 Correct 92 ms 11320 KB Correct
67 Correct 88 ms 11484 KB Correct
68 Correct 84 ms 11564 KB Correct
69 Correct 94 ms 11340 KB Correct
70 Correct 67 ms 9560 KB Correct
71 Correct 69 ms 9572 KB Correct
72 Correct 64 ms 9616 KB Correct
73 Correct 66 ms 10048 KB Correct
74 Correct 61 ms 9804 KB Correct
75 Correct 69 ms 9544 KB Correct
76 Correct 96 ms 11432 KB Correct
77 Correct 95 ms 11548 KB Correct
78 Correct 84 ms 11508 KB Correct
79 Correct 91 ms 11580 KB Correct
80 Correct 100 ms 11588 KB Correct
81 Correct 97 ms 11348 KB Correct
82 Correct 94 ms 11420 KB Correct
83 Correct 94 ms 11284 KB Correct
84 Correct 91 ms 11348 KB Correct
85 Correct 102 ms 11564 KB Correct
86 Correct 97 ms 11676 KB Correct
87 Correct 94 ms 11524 KB Correct
88 Correct 102 ms 11692 KB Correct
89 Correct 94 ms 11536 KB Correct
90 Correct 98 ms 11324 KB Correct
91 Correct 111 ms 11336 KB Correct
92 Correct 97 ms 11580 KB Correct
93 Correct 91 ms 11620 KB Correct
94 Correct 98 ms 11348 KB Correct
95 Correct 86 ms 11324 KB Correct
96 Correct 93 ms 11604 KB Correct
97 Correct 101 ms 11460 KB Correct
98 Correct 86 ms 11840 KB Correct
99 Correct 92 ms 11524 KB Correct
100 Correct 94 ms 11324 KB Correct
101 Correct 106 ms 11352 KB Correct
102 Correct 93 ms 11836 KB Correct
103 Correct 94 ms 11324 KB Correct
104 Correct 93 ms 11460 KB Correct
105 Correct 96 ms 11680 KB Correct
106 Correct 102 ms 11676 KB Correct
107 Correct 90 ms 11468 KB Correct
108 Correct 101 ms 11604 KB Correct
109 Correct 91 ms 11804 KB Correct
110 Correct 96 ms 11480 KB Correct
111 Correct 98 ms 11488 KB Correct
112 Correct 97 ms 11736 KB Correct
113 Correct 84 ms 11752 KB Correct
114 Correct 105 ms 11300 KB Correct
115 Correct 82 ms 11468 KB Correct
116 Correct 104 ms 11164 KB Correct
117 Correct 110 ms 11684 KB Correct
118 Correct 99 ms 11260 KB Correct
119 Correct 111 ms 11236 KB Correct
120 Correct 93 ms 11312 KB Correct
121 Correct 97 ms 11548 KB Correct
122 Correct 98 ms 11564 KB Correct
123 Correct 120 ms 12840 KB Correct
124 Correct 158 ms 12576 KB Correct
125 Correct 187 ms 12632 KB Correct
126 Correct 92 ms 11284 KB Correct
127 Correct 91 ms 11236 KB Correct
128 Correct 89 ms 11436 KB Correct
129 Correct 102 ms 11536 KB Correct
130 Correct 88 ms 11600 KB Correct
131 Correct 88 ms 11312 KB Correct
132 Correct 81 ms 11260 KB Correct
133 Correct 64 ms 9800 KB Correct
134 Correct 63 ms 9564 KB Correct
135 Correct 76 ms 11580 KB Correct
136 Correct 94 ms 11516 KB Correct
137 Correct 86 ms 11304 KB Correct
138 Correct 88 ms 11336 KB Correct
139 Correct 61 ms 9892 KB Correct
140 Correct 66 ms 9564 KB Correct
141 Correct 61 ms 9556 KB Correct
142 Correct 67 ms 9540 KB Correct
143 Correct 67 ms 9628 KB Correct
144 Correct 56 ms 9552 KB Correct
145 Correct 92 ms 11324 KB Correct
146 Correct 96 ms 11520 KB Correct
147 Correct 83 ms 11584 KB Correct
148 Correct 94 ms 11580 KB Correct
149 Correct 92 ms 11776 KB Correct
150 Correct 92 ms 11772 KB Correct
151 Correct 100 ms 11680 KB Correct
152 Correct 95 ms 11532 KB Correct
153 Correct 93 ms 11684 KB Correct
154 Correct 98 ms 11700 KB Correct
155 Correct 97 ms 11584 KB Correct
156 Correct 91 ms 11780 KB Correct
157 Correct 85 ms 11628 KB Correct
158 Correct 89 ms 11664 KB Correct
159 Correct 91 ms 11528 KB Correct
160 Correct 89 ms 11592 KB Correct
161 Correct 81 ms 11528 KB Correct
162 Correct 93 ms 11888 KB Correct
163 Correct 98 ms 11676 KB Correct
164 Correct 91 ms 11788 KB Correct
165 Correct 95 ms 11788 KB Correct
166 Correct 84 ms 11632 KB Correct
167 Correct 90 ms 11720 KB Correct
168 Correct 81 ms 11476 KB Correct
169 Correct 91 ms 11776 KB Correct
170 Correct 90 ms 11760 KB Correct
171 Correct 91 ms 11596 KB Correct
172 Correct 90 ms 11452 KB Correct
173 Correct 86 ms 11728 KB Correct
174 Correct 80 ms 11784 KB Correct
175 Correct 95 ms 11812 KB Correct
176 Correct 93 ms 11744 KB Correct
177 Correct 87 ms 11692 KB Correct
178 Correct 93 ms 11756 KB Correct
179 Correct 92 ms 11480 KB Correct
180 Correct 92 ms 11664 KB Correct
181 Correct 84 ms 11740 KB Correct
182 Correct 90 ms 11804 KB Correct
183 Correct 95 ms 11564 KB Correct
184 Correct 90 ms 11304 KB Correct
185 Correct 238 ms 13164 KB Correct
186 Correct 225 ms 13528 KB Correct
187 Correct 121 ms 14024 KB Correct
188 Correct 109 ms 13912 KB Correct
189 Correct 239 ms 14076 KB Correct
190 Correct 97 ms 13928 KB Correct
191 Correct 90 ms 13468 KB Correct
192 Correct 213 ms 13492 KB Correct
193 Correct 243 ms 13912 KB Correct
194 Correct 182 ms 13440 KB Correct
195 Correct 117 ms 13924 KB Correct
196 Correct 290 ms 13424 KB Correct
197 Correct 92 ms 13052 KB Correct
198 Correct 88 ms 13344 KB Correct
199 Correct 244 ms 14028 KB Correct
200 Correct 215 ms 14520 KB Correct
201 Correct 132 ms 12972 KB Correct
202 Correct 107 ms 13216 KB Correct
203 Correct 161 ms 12880 KB Correct
204 Correct 81 ms 13680 KB Correct
205 Correct 94 ms 13420 KB Correct
206 Correct 228 ms 13660 KB Correct
207 Correct 239 ms 13560 KB Correct
208 Correct 112 ms 13732 KB Correct
209 Correct 95 ms 13672 KB Correct
210 Correct 95 ms 13180 KB Correct
211 Correct 96 ms 13676 KB Correct
212 Correct 93 ms 13724 KB Correct
213 Correct 236 ms 13568 KB Correct
214 Correct 258 ms 13476 KB Correct
215 Correct 96 ms 14180 KB Correct
216 Correct 264 ms 13616 KB Correct
217 Correct 266 ms 13936 KB Correct
218 Correct 90 ms 12912 KB Correct
219 Correct 89 ms 13212 KB Correct
220 Correct 224 ms 13564 KB Correct
221 Correct 235 ms 13928 KB Correct
222 Correct 263 ms 14132 KB Correct
223 Correct 163 ms 13672 KB Correct
224 Correct 204 ms 14080 KB Correct
225 Correct 81 ms 13724 KB Correct
226 Correct 95 ms 13724 KB Correct
227 Correct 226 ms 13804 KB Correct
228 Correct 242 ms 13212 KB Correct
229 Correct 100 ms 13216 KB Correct
230 Correct 98 ms 13496 KB Correct
231 Correct 101 ms 13588 KB Correct
232 Correct 91 ms 12904 KB Correct
233 Correct 86 ms 13924 KB Correct
234 Correct 105 ms 12736 KB Correct
235 Correct 112 ms 13032 KB Correct
236 Correct 65 ms 10044 KB Correct
237 Correct 59 ms 9884 KB Correct
238 Correct 61 ms 9628 KB Correct
239 Correct 49 ms 8656 KB Correct
240 Correct 98 ms 11736 KB Correct
241 Correct 101 ms 11684 KB Correct
242 Correct 88 ms 11684 KB Correct
243 Correct 91 ms 11592 KB Correct
244 Correct 89 ms 11624 KB Correct
245 Correct 91 ms 11420 KB Correct
246 Correct 88 ms 11700 KB Correct
247 Correct 87 ms 11696 KB Correct
248 Correct 92 ms 11628 KB Correct
249 Correct 94 ms 11604 KB Correct
250 Correct 92 ms 11564 KB Correct
251 Correct 87 ms 11676 KB Correct
252 Correct 91 ms 11676 KB Correct
253 Correct 88 ms 11676 KB Correct
254 Correct 95 ms 11528 KB Correct
255 Correct 90 ms 11676 KB Correct
256 Correct 83 ms 11676 KB Correct
257 Correct 98 ms 11636 KB Correct
258 Correct 92 ms 11592 KB Correct
259 Correct 96 ms 11420 KB Correct
260 Correct 95 ms 11420 KB Correct
261 Correct 90 ms 11676 KB Correct
262 Correct 92 ms 11760 KB Correct
263 Correct 100 ms 11776 KB Correct
264 Correct 96 ms 11676 KB Correct
265 Correct 62 ms 9752 KB Correct
266 Correct 60 ms 9740 KB Correct
267 Correct 65 ms 9704 KB Correct
268 Correct 61 ms 9640 KB Correct
269 Correct 67 ms 9588 KB Correct
270 Correct 57 ms 9612 KB Correct
271 Correct 59 ms 9640 KB Correct
272 Correct 57 ms 9488 KB Correct
273 Correct 60 ms 9744 KB Correct
274 Correct 64 ms 9496 KB Correct
275 Correct 62 ms 9728 KB Correct
276 Correct 60 ms 9712 KB Correct
277 Correct 62 ms 9596 KB Correct
278 Correct 61 ms 9560 KB Correct
279 Correct 56 ms 9640 KB Correct
280 Correct 90 ms 10908 KB Correct
281 Correct 88 ms 11116 KB Correct
282 Correct 88 ms 11092 KB Correct
283 Correct 82 ms 11168 KB Correct
284 Correct 89 ms 10936 KB Correct
285 Correct 84 ms 11164 KB Correct
286 Correct 91 ms 11184 KB Correct
287 Correct 88 ms 11164 KB Correct
288 Correct 89 ms 11056 KB Correct
289 Correct 90 ms 11168 KB Correct