oj.uz

Submission #114337

# Submission time Handle Problem Language Result Execution time Memory
114337 2019-05-31T23:45:20 Z sebinkim Iqea (innopolis2018_final_C) C++14
100 / 100
 551 ms 49896 KB 
#include <bits/stdc++.h>

using namespace std;

typedef pair <int, int> pii;

struct cpnt{
	int p, y, d;
	cpnt() {}
	cpnt(int p, int y, int d) : p(p), y(y), d(d) {}
};

struct minseg{
	int T[303030];
	int sz = 1 << 17;
	
	minseg()
	{
		int i;
		
		for(i=0; i<sz+sz; i++){
			T[i] = 1e9;
		}
	}
	
	void update(int p, int v)
	{
		p += sz;
		T[p] = min(T[p], v);
		
		for(p>>=1; p; p>>=1){
			T[p] = min(T[p << 1], T[p << 1 | 1]);
		}
	}
	
	int get_min(int l, int r)
	{
		int ret = 1e9;
		
		l += sz; r += sz;
		
		for(; l<r; ){
			if(l & 1) ret = min(ret, T[l]);
			if(~r & 1) ret = min(ret, T[r]);
			l = l + 1 >> 1;
			r = r - 1 >> 1;
		}
		
		if(l == r){
			ret = min(ret, T[l]);
		}
		
		return ret;
	}
};

vector <pii> P;
vector <int> V[101010];
vector <cpnt> K[101010];
minseg T1, T2;
int L[101010], R[101010], H[101010];
int S[101010], D[101010];
bool chk[101010];
int n, k;

int dfs1(int p, int r)
{
	S[p] = 1;
	
	for(int &t: V[p]){
		if(t != r && !chk[t]){
			S[p] += dfs1(t, p);
		}
	}
	
	return S[p];
}

void dfs2(int c, int p, int r, vector <cpnt> &X)
{
	vector <cpnt> Y;
	int i, x, y;
	
	for(i=L[p]; i<=R[p]; i++){
		K[H[p] + i - L[p]].push_back(X[i - L[p]]);
	}
	
	for(int &t: V[p]){
		if(t != r && !chk[t]){
			Y.clear();
			for(i=L[t]; i<=R[t]; i++){
				y = min(max(P[H[t] + i - L[t]].second, L[p]), R[p]);
				x = abs(y - P[H[t] + i - L[t]].second) + X[y - L[p]].d + 1;
				Y.emplace_back(c, X[y - L[p]].y, x);
			}
			dfs2(c, t, p, Y);
		}
	}
}

void dnc(int p)
{
	vector <cpnt> X;
	int i, s;
	
	s = dfs1(p, 0);
	
	for(; ; ){
		for(i=0; i<V[p].size(); i++){
			if(S[V[p][i]] < S[p] && S[V[p][i]] * 2 >= s){
				break;
			}
		}
		if(i == V[p].size()) break;
		else p = V[p][i];
	}
	
	chk[p] = 1;
	
	for(i=L[p]; i<=R[p]; i++){
		X.emplace_back(p, i, 0);
	}
			
	dfs2(p, p, 0, X);
	
	for(int &t: V[p]){
		if(!chk[t]){
			dnc(t);
		}
	}
}

void query1(int p)
{
	int y;
	
	for(cpnt &t: K[p]){
		T1.update(H[t.p] + t.y - L[t.p], t.d - t.y);
		T2.update(H[t.p] + t.y - L[t.p], t.d + t.y);
	}
}

int query2(int p)
{
	int ret;
	
	ret = 1e9;
	
	for(cpnt &t: K[p]){
		ret = min(ret, t.d + T1.get_min(H[t.p], H[t.p] + t.y - L[t.p]) + t.y);
		ret = min(ret, t.d + T2.get_min(H[t.p] + t.y - L[t.p], H[t.p] + R[t.p] - L[t.p]) - t.y);
	}
	
	return ret < 1e8? ret : -1;
}

int main()
{
	vector <int> X, Y;
	int q, i, j, l, x, y, t;
	
	scanf("%d", &n);
	
	for(i=0; i<n; i++){
		scanf("%d%d", &x, &y);
		P.emplace_back(x, y);
	}
	
	sort(P.begin(), P.end());
	
	for(i=0; i<n; ){
		for(j=i; j<n && P[i].first == P[j].first; j=l){
			k ++;
			for(l=j; l<n && P[j].first == P[l].first && P[j].second == P[l].second - l + j; l++){
				D[l] = k;
			}
			L[k] = P[j].second; R[k] = P[l - 1].second; H[k] = j;
			X.push_back(k);
		}
		
		i = j;
		
		for(j=0, l=0; j<X.size() && l<Y.size(); ){
			if(max(L[X[j]], L[Y[l]]) <= min(R[X[j]], R[Y[l]])){
				V[X[j]].push_back(Y[l]);
				V[Y[l]].push_back(X[j]);
			}
			
			if(R[X[j]] < R[Y[l]]) j ++;
			else l ++;
		}
		
		swap(X, Y); X.clear();
	}
	
	dnc(1);
	
	scanf("%d", &q);
	
	for(; q--; ){
		scanf("%d%d%d", &t, &x, &y);
		i = lower_bound(P.begin(), P.end(), pii(x, y)) - P.begin();
		if(t == 1) query1(i);
		else printf("%d\n", query2(i));
	}
	
	return 0;
}

Compilation message

C.cpp: In member function 'int minseg::get_min(int, int)':
C.cpp:45:10: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
    l = l + 1 >> 1;
        ~~^~~
C.cpp:46:10: warning: suggest parentheses around '-' inside '>>' [-Wparentheses]
    r = r - 1 >> 1;
        ~~^~~
C.cpp: In function 'void dnc(int)':
C.cpp:109:13: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(i=0; i<V[p].size(); i++){
            ~^~~~~~~~~~~~
C.cpp:114:8: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   if(i == V[p].size()) break;
      ~~^~~~~~~~~~~~~~
C.cpp: In function 'void query1(int)':
C.cpp:135:6: warning: unused variable 'y' [-Wunused-variable]
  int y;
      ^
C.cpp: In function 'int main()':
C.cpp:183:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(j=0, l=0; j<X.size() && l<Y.size(); ){
                 ~^~~~~~~~~
C.cpp:183:32: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(j=0, l=0; j<X.size() && l<Y.size(); ){
                               ~^~~~~~~~~
C.cpp:162:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &n);
  ~~~~~^~~~~~~~~~
C.cpp:165:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d", &x, &y);
   ~~~~~^~~~~~~~~~~~~~~~
C.cpp:198:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &q);
  ~~~~~^~~~~~~~~~
C.cpp:201:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d%d", &t, &x, &y);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 7168 KB Output is correct
2 Correct 8 ms 7168 KB Output is correct
3 Correct 8 ms 7168 KB Output is correct
4 Correct 14 ms 7808 KB Output is correct
5 Correct 15 ms 7808 KB Output is correct
6 Correct 15 ms 7808 KB Output is correct
7 Correct 20 ms 8312 KB Output is correct
8 Correct 20 ms 8320 KB Output is correct
9 Correct 19 ms 8320 KB Output is correct
10 Correct 17 ms 7936 KB Output is correct
11 Correct 17 ms 8064 KB Output is correct
12 Correct 17 ms 8064 KB Output is correct
13 Correct 19 ms 8192 KB Output is correct
14 Correct 18 ms 8192 KB Output is correct
15 Correct 19 ms 8192 KB Output is correct
16 Correct 19 ms 8320 KB Output is correct
17 Correct 18 ms 8320 KB Output is correct
18 Correct 19 ms 8064 KB Output is correct
19 Correct 17 ms 8064 KB Output is correct
20 Correct 19 ms 8192 KB Output is correct
21 Correct 19 ms 8320 KB Output is correct
22 Correct 20 ms 8568 KB Output is correct
23 Correct 19 ms 8576 KB Output is correct
24 Correct 20 ms 8704 KB Output is correct
25 Correct 21 ms 8960 KB Output is correct
26 Correct 14 ms 7680 KB Output is correct
27 Correct 12 ms 7552 KB Output is correct
28 Correct 20 ms 8704 KB Output is correct
29 Correct 20 ms 8704 KB Output is correct
30 Correct 20 ms 8704 KB Output is correct
31 Correct 21 ms 8832 KB Output is correct
32 Correct 19 ms 8448 KB Output is correct
33 Correct 18 ms 8440 KB Output is correct
34 Correct 20 ms 8832 KB Output is correct
35 Correct 19 ms 8576 KB Output is correct
36 Correct 20 ms 8960 KB Output is correct
37 Correct 18 ms 8420 KB Output is correct
38 Correct 19 ms 8448 KB Output is correct
39 Correct 19 ms 8576 KB Output is correct
40 Correct 18 ms 8576 KB Output is correct
41 Correct 20 ms 8576 KB Output is correct
42 Correct 19 ms 8588 KB Output is correct
43 Correct 21 ms 8828 KB Output is correct
44 Correct 19 ms 8320 KB Output is correct
45 Correct 20 ms 8448 KB Output is correct
46 Correct 12 ms 7552 KB Output is correct
47 Correct 18 ms 8192 KB Output is correct
48 Correct 17 ms 8064 KB Output is correct
49 Correct 17 ms 8064 KB Output is correct
50 Correct 16 ms 7936 KB Output is correct
51 Correct 17 ms 7936 KB Output is correct
52 Correct 17 ms 8064 KB Output is correct
53 Correct 19 ms 8412 KB Output is correct
54 Correct 19 ms 8320 KB Output is correct
55 Correct 19 ms 8292 KB Output is correct

Subtask #2
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 7168 KB Output is correct
2 Correct 8 ms 7168 KB Output is correct
3 Correct 8 ms 7168 KB Output is correct
4 Correct 14 ms 7808 KB Output is correct
5 Correct 15 ms 7808 KB Output is correct
6 Correct 15 ms 7808 KB Output is correct
7 Correct 20 ms 8312 KB Output is correct
8 Correct 20 ms 8320 KB Output is correct
9 Correct 19 ms 8320 KB Output is correct
10 Correct 17 ms 7936 KB Output is correct
11 Correct 17 ms 8064 KB Output is correct
12 Correct 17 ms 8064 KB Output is correct
13 Correct 19 ms 8192 KB Output is correct
14 Correct 18 ms 8192 KB Output is correct
15 Correct 19 ms 8192 KB Output is correct
16 Correct 19 ms 8320 KB Output is correct
17 Correct 18 ms 8320 KB Output is correct
18 Correct 19 ms 8064 KB Output is correct
19 Correct 17 ms 8064 KB Output is correct
20 Correct 19 ms 8192 KB Output is correct
21 Correct 19 ms 8320 KB Output is correct
22 Correct 20 ms 8568 KB Output is correct
23 Correct 19 ms 8576 KB Output is correct
24 Correct 20 ms 8704 KB Output is correct
25 Correct 21 ms 8960 KB Output is correct
26 Correct 14 ms 7680 KB Output is correct
27 Correct 12 ms 7552 KB Output is correct
28 Correct 20 ms 8704 KB Output is correct
29 Correct 20 ms 8704 KB Output is correct
30 Correct 20 ms 8704 KB Output is correct
31 Correct 21 ms 8832 KB Output is correct
32 Correct 19 ms 8448 KB Output is correct
33 Correct 18 ms 8440 KB Output is correct
34 Correct 20 ms 8832 KB Output is correct
35 Correct 19 ms 8576 KB Output is correct
36 Correct 20 ms 8960 KB Output is correct
37 Correct 18 ms 8420 KB Output is correct
38 Correct 19 ms 8448 KB Output is correct
39 Correct 19 ms 8576 KB Output is correct
40 Correct 18 ms 8576 KB Output is correct
41 Correct 20 ms 8576 KB Output is correct
42 Correct 19 ms 8588 KB Output is correct
43 Correct 21 ms 8828 KB Output is correct
44 Correct 19 ms 8320 KB Output is correct
45 Correct 20 ms 8448 KB Output is correct
46 Correct 12 ms 7552 KB Output is correct
47 Correct 18 ms 8192 KB Output is correct
48 Correct 17 ms 8064 KB Output is correct
49 Correct 17 ms 8064 KB Output is correct
50 Correct 16 ms 7936 KB Output is correct
51 Correct 17 ms 7936 KB Output is correct
52 Correct 17 ms 8064 KB Output is correct
53 Correct 19 ms 8412 KB Output is correct
54 Correct 19 ms 8320 KB Output is correct
55 Correct 19 ms 8292 KB Output is correct
56 Correct 99 ms 8240 KB Output is correct
57 Correct 99 ms 8356 KB Output is correct
58 Correct 96 ms 8312 KB Output is correct
59 Correct 87 ms 8696 KB Output is correct
60 Correct 82 ms 8796 KB Output is correct
61 Correct 85 ms 8788 KB Output is correct
62 Correct 81 ms 8484 KB Output is correct
63 Correct 82 ms 8568 KB Output is correct
64 Correct 87 ms 8700 KB Output is correct
65 Correct 84 ms 8712 KB Output is correct
66 Correct 82 ms 8696 KB Output is correct
67 Correct 79 ms 8696 KB Output is correct
68 Correct 86 ms 8824 KB Output is correct
69 Correct 78 ms 8696 KB Output is correct
70 Correct 82 ms 8568 KB Output is correct
71 Correct 81 ms 8484 KB Output is correct
72 Correct 85 ms 8660 KB Output is correct
73 Correct 83 ms 8700 KB Output is correct
74 Correct 81 ms 9308 KB Output is correct
75 Correct 72 ms 8184 KB Output is correct
76 Correct 69 ms 8056 KB Output is correct
77 Correct 92 ms 9400 KB Output is correct
78 Correct 88 ms 9208 KB Output is correct
79 Correct 82 ms 9476 KB Output is correct
80 Correct 94 ms 8952 KB Output is correct
81 Correct 89 ms 8928 KB Output is correct
82 Correct 83 ms 9080 KB Output is correct
83 Correct 83 ms 9180 KB Output is correct
84 Correct 79 ms 9320 KB Output is correct
85 Correct 88 ms 8824 KB Output is correct
86 Correct 85 ms 8956 KB Output is correct
87 Correct 69 ms 8056 KB Output is correct
88 Correct 84 ms 8568 KB Output is correct
89 Correct 85 ms 8540 KB Output is correct
90 Correct 86 ms 8572 KB Output is correct
91 Correct 82 ms 8440 KB Output is correct
92 Correct 87 ms 8340 KB Output is correct
93 Correct 83 ms 8440 KB Output is correct
94 Correct 88 ms 8952 KB Output is correct
95 Correct 97 ms 8824 KB Output is correct
96 Correct 92 ms 8776 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 137 ms 14292 KB Output is correct
2 Correct 360 ms 48528 KB Output is correct
3 Correct 364 ms 34412 KB Output is correct
4 Correct 362 ms 34284 KB Output is correct
5 Correct 479 ms 38632 KB Output is correct
6 Correct 377 ms 38380 KB Output is correct
7 Correct 277 ms 28648 KB Output is correct
8 Correct 155 ms 17640 KB Output is correct
9 Correct 125 ms 12776 KB Output is correct
10 Correct 317 ms 28624 KB Output is correct
11 Correct 184 ms 17632 KB Output is correct
12 Correct 141 ms 12776 KB Output is correct
13 Correct 115 ms 12644 KB Output is correct
14 Correct 137 ms 12712 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 375 ms 31576 KB Output is correct
2 Correct 382 ms 33772 KB Output is correct
3 Correct 419 ms 33656 KB Output is correct
4 Correct 331 ms 32288 KB Output is correct
5 Correct 347 ms 31592 KB Output is correct
6 Correct 329 ms 31336 KB Output is correct
7 Correct 355 ms 32488 KB Output is correct
8 Correct 347 ms 32492 KB Output is correct
9 Correct 398 ms 32680 KB Output is correct
10 Correct 497 ms 38888 KB Output is correct
11 Correct 408 ms 38120 KB Output is correct
12 Correct 551 ms 39788 KB Output is correct
13 Correct 424 ms 45364 KB Output is correct
14 Correct 174 ms 18572 KB Output is correct
15 Correct 123 ms 14408 KB Output is correct
16 Correct 398 ms 40228 KB Output is correct
17 Correct 394 ms 40004 KB Output is correct
18 Correct 395 ms 40808 KB Output is correct
19 Correct 381 ms 40656 KB Output is correct
20 Correct 426 ms 35740 KB Output is correct
21 Correct 377 ms 36120 KB Output is correct
22 Correct 419 ms 38664 KB Output is correct
23 Correct 427 ms 36212 KB Output is correct
24 Correct 396 ms 49896 KB Output is correct
25 Correct 358 ms 36072 KB Output is correct
26 Correct 373 ms 36204 KB Output is correct
27 Correct 378 ms 36588 KB Output is correct
28 Correct 392 ms 36332 KB Output is correct

Subtask #5
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 7168 KB Output is correct
2 Correct 8 ms 7168 KB Output is correct
3 Correct 8 ms 7168 KB Output is correct
4 Correct 14 ms 7808 KB Output is correct
5 Correct 15 ms 7808 KB Output is correct
6 Correct 15 ms 7808 KB Output is correct
7 Correct 20 ms 8312 KB Output is correct
8 Correct 20 ms 8320 KB Output is correct
9 Correct 19 ms 8320 KB Output is correct
10 Correct 17 ms 7936 KB Output is correct
11 Correct 17 ms 8064 KB Output is correct
12 Correct 17 ms 8064 KB Output is correct
13 Correct 19 ms 8192 KB Output is correct
14 Correct 18 ms 8192 KB Output is correct
15 Correct 19 ms 8192 KB Output is correct
16 Correct 19 ms 8320 KB Output is correct
17 Correct 18 ms 8320 KB Output is correct
18 Correct 19 ms 8064 KB Output is correct
19 Correct 17 ms 8064 KB Output is correct
20 Correct 19 ms 8192 KB Output is correct
21 Correct 19 ms 8320 KB Output is correct
22 Correct 20 ms 8568 KB Output is correct
23 Correct 19 ms 8576 KB Output is correct
24 Correct 20 ms 8704 KB Output is correct
25 Correct 21 ms 8960 KB Output is correct
26 Correct 14 ms 7680 KB Output is correct
27 Correct 12 ms 7552 KB Output is correct
28 Correct 20 ms 8704 KB Output is correct
29 Correct 20 ms 8704 KB Output is correct
30 Correct 20 ms 8704 KB Output is correct
31 Correct 21 ms 8832 KB Output is correct
32 Correct 19 ms 8448 KB Output is correct
33 Correct 18 ms 8440 KB Output is correct
34 Correct 20 ms 8832 KB Output is correct
35 Correct 19 ms 8576 KB Output is correct
36 Correct 20 ms 8960 KB Output is correct
37 Correct 18 ms 8420 KB Output is correct
38 Correct 19 ms 8448 KB Output is correct
39 Correct 19 ms 8576 KB Output is correct
40 Correct 18 ms 8576 KB Output is correct
41 Correct 20 ms 8576 KB Output is correct
42 Correct 19 ms 8588 KB Output is correct
43 Correct 21 ms 8828 KB Output is correct
44 Correct 19 ms 8320 KB Output is correct
45 Correct 20 ms 8448 KB Output is correct
46 Correct 12 ms 7552 KB Output is correct
47 Correct 18 ms 8192 KB Output is correct
48 Correct 17 ms 8064 KB Output is correct
49 Correct 17 ms 8064 KB Output is correct
50 Correct 16 ms 7936 KB Output is correct
51 Correct 17 ms 7936 KB Output is correct
52 Correct 17 ms 8064 KB Output is correct
53 Correct 19 ms 8412 KB Output is correct
54 Correct 19 ms 8320 KB Output is correct
55 Correct 19 ms 8292 KB Output is correct
56 Correct 99 ms 8240 KB Output is correct
57 Correct 99 ms 8356 KB Output is correct
58 Correct 96 ms 8312 KB Output is correct
59 Correct 87 ms 8696 KB Output is correct
60 Correct 82 ms 8796 KB Output is correct
61 Correct 85 ms 8788 KB Output is correct
62 Correct 81 ms 8484 KB Output is correct
63 Correct 82 ms 8568 KB Output is correct
64 Correct 87 ms 8700 KB Output is correct
65 Correct 84 ms 8712 KB Output is correct
66 Correct 82 ms 8696 KB Output is correct
67 Correct 79 ms 8696 KB Output is correct
68 Correct 86 ms 8824 KB Output is correct
69 Correct 78 ms 8696 KB Output is correct
70 Correct 82 ms 8568 KB Output is correct
71 Correct 81 ms 8484 KB Output is correct
72 Correct 85 ms 8660 KB Output is correct
73 Correct 83 ms 8700 KB Output is correct
74 Correct 81 ms 9308 KB Output is correct
75 Correct 72 ms 8184 KB Output is correct
76 Correct 69 ms 8056 KB Output is correct
77 Correct 92 ms 9400 KB Output is correct
78 Correct 88 ms 9208 KB Output is correct
79 Correct 82 ms 9476 KB Output is correct
80 Correct 94 ms 8952 KB Output is correct
81 Correct 89 ms 8928 KB Output is correct
82 Correct 83 ms 9080 KB Output is correct
83 Correct 83 ms 9180 KB Output is correct
84 Correct 79 ms 9320 KB Output is correct
85 Correct 88 ms 8824 KB Output is correct
86 Correct 85 ms 8956 KB Output is correct
87 Correct 69 ms 8056 KB Output is correct
88 Correct 84 ms 8568 KB Output is correct
89 Correct 85 ms 8540 KB Output is correct
90 Correct 86 ms 8572 KB Output is correct
91 Correct 82 ms 8440 KB Output is correct
92 Correct 87 ms 8340 KB Output is correct
93 Correct 83 ms 8440 KB Output is correct
94 Correct 88 ms 8952 KB Output is correct
95 Correct 97 ms 8824 KB Output is correct
96 Correct 92 ms 8776 KB Output is correct
97 Correct 137 ms 14292 KB Output is correct
98 Correct 360 ms 48528 KB Output is correct
99 Correct 364 ms 34412 KB Output is correct
100 Correct 362 ms 34284 KB Output is correct
101 Correct 479 ms 38632 KB Output is correct
102 Correct 377 ms 38380 KB Output is correct
103 Correct 277 ms 28648 KB Output is correct
104 Correct 155 ms 17640 KB Output is correct
105 Correct 125 ms 12776 KB Output is correct
106 Correct 317 ms 28624 KB Output is correct
107 Correct 184 ms 17632 KB Output is correct
108 Correct 141 ms 12776 KB Output is correct
109 Correct 115 ms 12644 KB Output is correct
110 Correct 137 ms 12712 KB Output is correct
111 Correct 375 ms 31576 KB Output is correct
112 Correct 382 ms 33772 KB Output is correct
113 Correct 419 ms 33656 KB Output is correct
114 Correct 331 ms 32288 KB Output is correct
115 Correct 347 ms 31592 KB Output is correct
116 Correct 329 ms 31336 KB Output is correct
117 Correct 355 ms 32488 KB Output is correct
118 Correct 347 ms 32492 KB Output is correct
119 Correct 398 ms 32680 KB Output is correct
120 Correct 497 ms 38888 KB Output is correct
121 Correct 408 ms 38120 KB Output is correct
122 Correct 551 ms 39788 KB Output is correct
123 Correct 424 ms 45364 KB Output is correct
124 Correct 174 ms 18572 KB Output is correct
125 Correct 123 ms 14408 KB Output is correct
126 Correct 398 ms 40228 KB Output is correct
127 Correct 394 ms 40004 KB Output is correct
128 Correct 395 ms 40808 KB Output is correct
129 Correct 381 ms 40656 KB Output is correct
130 Correct 426 ms 35740 KB Output is correct
131 Correct 377 ms 36120 KB Output is correct
132 Correct 419 ms 38664 KB Output is correct
133 Correct 427 ms 36212 KB Output is correct
134 Correct 396 ms 49896 KB Output is correct
135 Correct 358 ms 36072 KB Output is correct
136 Correct 373 ms 36204 KB Output is correct
137 Correct 378 ms 36588 KB Output is correct
138 Correct 392 ms 36332 KB Output is correct
139 Correct 204 ms 18984 KB Output is correct
140 Correct 258 ms 25580 KB Output is correct
141 Correct 248 ms 25184 KB Output is correct
142 Correct 318 ms 26388 KB Output is correct
143 Correct 406 ms 31848 KB Output is correct
144 Correct 369 ms 31472 KB Output is correct
145 Correct 306 ms 29648 KB Output is correct
146 Correct 286 ms 28308 KB Output is correct
147 Correct 382 ms 32616 KB Output is correct
148 Correct 371 ms 32360 KB Output is correct
149 Correct 408 ms 38220 KB Output is correct
150 Correct 367 ms 36552 KB Output is correct
151 Correct 340 ms 42272 KB Output is correct
152 Correct 359 ms 34644 KB Output is correct
153 Correct 333 ms 33184 KB Output is correct
154 Correct 117 ms 13372 KB Output is correct
155 Correct 362 ms 32076 KB Output is correct
156 Correct 320 ms 31312 KB Output is correct
157 Correct 302 ms 31340 KB Output is correct
158 Correct 282 ms 29680 KB Output is correct
159 Correct 307 ms 29532 KB Output is correct
160 Correct 324 ms 31872 KB Output is correct
161 Correct 356 ms 35692 KB Output is correct
162 Correct 325 ms 34112 KB Output is correct
163 Correct 338 ms 34152 KB Output is correct