oj.uz

답안 #248390

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
248390 2020-07-12T10:46:29 Z mieszko11b Building Skyscrapers (CEOI19_skyscrapers) C++14
61 / 100
 1779 ms 369528 KB 
#include <bits/stdc++.h>

using namespace std;

using ii = pair<int, int>;

#define X first
#define Y second

int n, t, cnt;
map<ii, int> M;
ii cor[1000007];
int skynum[150007], sky[1000007];
int component[1000007];
bool engaged[1000007];
vector<int> incomp[1000007];
vector<int> G4[1000007], G8[1000007];
bool vis[1000007];
int ecnt;
int infty;
set<int, greater<int> > to_use;

void add_point(int x, int y) {
	ii p = {x, y};
	if(!M.count(p)) {
		M[p] = ++cnt;
		cor[cnt] = p;
		component[cnt] = cnt;
		incomp[cnt].push_back(cnt);
	}
}

bool check(int i) {
	bool eng[3][3];
	int comp[3][3];
	for(int w : G8[i]) {
		int x = cor[w].X - cor[i].X + 1;
		int y = cor[w].Y - cor[i].Y + 1;
		eng[x][y] = engaged[w];
		comp[x][y] = component[w];
	}
	
	if(!eng[0][1] && !eng[1][2] && comp[0][1] == comp[1][2] && eng[0][2]
		&& (eng[0][0] || eng[1][0] || eng[2][0] || eng[2][1] || eng[2][2]))
			return false;
	if(!eng[1][2] && !eng[2][1] && comp[1][2] == comp[2][1] && eng[2][2]
		&& (eng[2][0] || eng[1][0] || eng[0][0] || eng[0][1] || eng[0][2]))
			return false;
	if(!eng[2][1] && !eng[1][0] && comp[2][1] == comp[1][0] && eng[2][0]
		&& (eng[0][0] || eng[0][1] || eng[0][2] || eng[1][2] || eng[2][2]))
			return false;
	if(!eng[1][0] && !eng[0][1] && comp[1][0] == comp[0][1] && eng[0][0]
		&& (eng[0][2] || eng[1][2] || eng[2][2] || eng[2][1] || eng[2][0]))
			return false;
	if(!eng[0][1] && !eng[2][1] && comp[0][1] == comp[2][1]
		&& (eng[0][0] || eng[1][0] || eng[2][0]) && (eng[0][2] || eng[1][2] || eng[2][2]))
			return false;
	if(!eng[1][0] && !eng[1][2] && comp[1][0] == comp[1][2]
		&& (eng[0][0] || eng[0][1] || eng[0][2]) && (eng[2][0] || eng[2][1] || eng[2][2]))
			return false;
			
	if(comp[1][0] == component[infty] || comp[0][1] == component[infty]
		|| comp[2][1] == component[infty] || comp[1][2] == component[infty])	
			return true;

	return false;
}

void upd_check(int i) {
	if(check(skynum[i]))
		to_use.insert(i);
	else
		to_use.erase(i);
}

void merge(int a, int b, bool upd = false) {
	if(a == b)
		return ;
		
	if(incomp[b].size() > incomp[a].size())
		swap(a, b);
		
	for(int x : incomp[b]) {
		incomp[a].push_back(x);
		component[x] = a;
	}
	
	for(int x : incomp[b])
		for(int y : G8[x])
			if(engaged[y])
				upd_check(sky[y]);
	
	incomp[b].clear();
}

void erase(int w) {
	engaged[w] = 0;
	for(int u : G4[w])
		if(!engaged[u])
			merge(component[w], component[u], true);
}

void dfs(int w) {
	if(vis[w])
		return ;
	vis[w] = 1;
	ecnt++;
		
	for(int u : G8[w])
		if(engaged[u])
			dfs(u);
}

int main() {
	scanf("%d%d", &n, &t);
	
	ii minp = {1e9 + 7, 1e9 + 7};
	
	for(int i = 1 ; i <= n ; i++) {
		int r, c;
		scanf("%d%d", &r, &c);
		for(int x = -1 ; x <= 1 ; x++)
			for(int y = -1 ; y <= 1 ; y++)
				add_point(r + x, c + y);
		engaged[M[{r, c}]] = 1;
		skynum[i] = M[{r, c}];
		sky[M[{r, c}]] = i;
		minp = min(minp, {r, c});
	}
	
	infty = M[{minp.X - 1, minp.Y}];
	
	for(int i = 1 ; i <= cnt ; i++) {
		int x = cor[i].X;
		int y = cor[i].Y;
		
		for(int xo = -1 ; xo <= 1 ; xo++) {
			for(int yo = -1 ; yo <= 1 ; yo++) {
				ii p2 = {x + xo, y + yo};
				if(M.count(p2) == 0)
					continue;
				int num = M[p2];
				
				if(xo || yo)
					G8[i].push_back(num);
				if((xo || yo) && !(xo && yo)) {
					G4[i].push_back(num);
					if(!engaged[i] && !engaged[num])
						merge(component[i], component[num]);
				}
			}
		}
	}
	
	dfs(skynum[1]);
	if(ecnt != n) {
		printf("NO\n");
		return 0;
	}
	
	for(int i = 1 ; i <= n ; i++)
		upd_check(i);
	
	printf("YES\n");
	vector<int> res;
	for(int i = 0 ; i < n ; i++) {
		int s = *to_use.begin();
		to_use.erase(to_use.begin());
		res.push_back(s);
		erase(skynum[s]);
	}
	
	reverse(res.begin(), res.end());
	for(int x : res)
		printf("%d\n", x);
	
	return 0;
}

Compilation message

skyscrapers.cpp: In function 'int main()':
skyscrapers.cpp:115:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d", &n, &t);
  ~~~~~^~~~~~~~~~~~~~~~
skyscrapers.cpp:121:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d", &r, &c);
   ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 70776 KB ans=YES N=1
2 Correct 35 ms 70776 KB ans=YES N=4
3 Correct 38 ms 70776 KB ans=NO N=4
4 Correct 34 ms 70784 KB ans=YES N=5
5 Correct 35 ms 70776 KB ans=YES N=9
6 Correct 35 ms 70776 KB ans=YES N=5
7 Correct 35 ms 70784 KB ans=NO N=9
8 Correct 36 ms 70752 KB ans=NO N=10
9 Correct 35 ms 70776 KB ans=YES N=10
10 Correct 47 ms 70776 KB ans=YES N=10
11 Correct 38 ms 70904 KB ans=YES N=10
12 Correct 36 ms 70776 KB ans=YES N=9
13 Correct 35 ms 70784 KB ans=YES N=9
14 Correct 36 ms 70784 KB ans=YES N=8
15 Correct 36 ms 70784 KB ans=YES N=8
16 Correct 34 ms 70776 KB ans=NO N=2

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 70776 KB ans=YES N=1
2 Correct 35 ms 70776 KB ans=YES N=4
3 Correct 38 ms 70776 KB ans=NO N=4
4 Correct 34 ms 70784 KB ans=YES N=5
5 Correct 35 ms 70776 KB ans=YES N=9
6 Correct 35 ms 70776 KB ans=YES N=5
7 Correct 35 ms 70784 KB ans=NO N=9
8 Correct 36 ms 70752 KB ans=NO N=10
9 Correct 35 ms 70776 KB ans=YES N=10
10 Correct 47 ms 70776 KB ans=YES N=10
11 Correct 38 ms 70904 KB ans=YES N=10
12 Correct 36 ms 70776 KB ans=YES N=9
13 Correct 35 ms 70784 KB ans=YES N=9
14 Correct 36 ms 70784 KB ans=YES N=8
15 Correct 36 ms 70784 KB ans=YES N=8
16 Correct 34 ms 70776 KB ans=NO N=2
17 Correct 37 ms 70776 KB ans=YES N=17
18 Correct 36 ms 70776 KB ans=YES N=25
19 Correct 37 ms 70776 KB ans=YES N=100
20 Correct 36 ms 70904 KB ans=YES N=185
21 Correct 38 ms 71052 KB ans=NO N=174
22 Correct 37 ms 70784 KB ans=YES N=90
23 Correct 35 ms 70776 KB ans=YES N=63
24 Correct 35 ms 70776 KB ans=YES N=87
25 Correct 35 ms 70904 KB ans=YES N=183
26 Correct 36 ms 70904 KB ans=YES N=188
27 Correct 37 ms 70912 KB ans=YES N=183
28 Correct 36 ms 70912 KB ans=YES N=189
29 Correct 36 ms 70904 KB ans=YES N=200
30 Correct 36 ms 70904 KB ans=YES N=190
31 Correct 36 ms 70904 KB ans=YES N=187
32 Correct 37 ms 70904 KB ans=YES N=187
33 Correct 36 ms 70904 KB ans=YES N=182
34 Correct 37 ms 70904 KB ans=YES N=184
35 Correct 37 ms 70904 KB ans=YES N=188
36 Correct 37 ms 70912 KB ans=YES N=181
37 Correct 38 ms 70912 KB ans=YES N=188
38 Correct 37 ms 70904 KB ans=YES N=191
39 Correct 36 ms 70904 KB ans=YES N=196
40 Correct 36 ms 70912 KB ans=YES N=196
41 Correct 36 ms 70912 KB ans=YES N=196
42 Correct 36 ms 70904 KB ans=YES N=196
43 Correct 37 ms 70912 KB ans=YES N=195

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 70776 KB ans=YES N=1
2 Correct 35 ms 70776 KB ans=YES N=4
3 Correct 38 ms 70776 KB ans=NO N=4
4 Correct 34 ms 70784 KB ans=YES N=5
5 Correct 35 ms 70776 KB ans=YES N=9
6 Correct 35 ms 70776 KB ans=YES N=5
7 Correct 35 ms 70784 KB ans=NO N=9
8 Correct 36 ms 70752 KB ans=NO N=10
9 Correct 35 ms 70776 KB ans=YES N=10
10 Correct 47 ms 70776 KB ans=YES N=10
11 Correct 38 ms 70904 KB ans=YES N=10
12 Correct 36 ms 70776 KB ans=YES N=9
13 Correct 35 ms 70784 KB ans=YES N=9
14 Correct 36 ms 70784 KB ans=YES N=8
15 Correct 36 ms 70784 KB ans=YES N=8
16 Correct 34 ms 70776 KB ans=NO N=2
17 Correct 37 ms 70776 KB ans=YES N=17
18 Correct 36 ms 70776 KB ans=YES N=25
19 Correct 37 ms 70776 KB ans=YES N=100
20 Correct 36 ms 70904 KB ans=YES N=185
21 Correct 38 ms 71052 KB ans=NO N=174
22 Correct 37 ms 70784 KB ans=YES N=90
23 Correct 35 ms 70776 KB ans=YES N=63
24 Correct 35 ms 70776 KB ans=YES N=87
25 Correct 35 ms 70904 KB ans=YES N=183
26 Correct 36 ms 70904 KB ans=YES N=188
27 Correct 37 ms 70912 KB ans=YES N=183
28 Correct 36 ms 70912 KB ans=YES N=189
29 Correct 36 ms 70904 KB ans=YES N=200
30 Correct 36 ms 70904 KB ans=YES N=190
31 Correct 36 ms 70904 KB ans=YES N=187
32 Correct 37 ms 70904 KB ans=YES N=187
33 Correct 36 ms 70904 KB ans=YES N=182
34 Correct 37 ms 70904 KB ans=YES N=184
35 Correct 37 ms 70904 KB ans=YES N=188
36 Correct 37 ms 70912 KB ans=YES N=181
37 Correct 38 ms 70912 KB ans=YES N=188
38 Correct 37 ms 70904 KB ans=YES N=191
39 Correct 36 ms 70904 KB ans=YES N=196
40 Correct 36 ms 70912 KB ans=YES N=196
41 Correct 36 ms 70912 KB ans=YES N=196
42 Correct 36 ms 70904 KB ans=YES N=196
43 Correct 37 ms 70912 KB ans=YES N=195
44 Correct 70 ms 73976 KB ans=NO N=1934
45 Correct 55 ms 71928 KB ans=NO N=1965
46 Correct 45 ms 71288 KB ans=YES N=1824
47 Correct 46 ms 71416 KB ans=YES N=1981
48 Correct 44 ms 71296 KB ans=YES N=1814
49 Correct 47 ms 71416 KB ans=YES N=1854
50 Correct 45 ms 71288 KB ans=YES N=1831
51 Correct 51 ms 71416 KB ans=YES N=2000
52 Correct 49 ms 71544 KB ans=YES N=1847
53 Correct 52 ms 71672 KB ans=YES N=1819
54 Correct 46 ms 71544 KB ans=YES N=1986
55 Correct 57 ms 71928 KB ans=YES N=2000
56 Correct 69 ms 72184 KB ans=YES N=1834
57 Correct 67 ms 72056 KB ans=YES N=1860
58 Correct 59 ms 72184 KB ans=YES N=1898
59 Correct 56 ms 71928 KB ans=YES N=1832
60 Correct 64 ms 72440 KB ans=YES N=1929
61 Correct 48 ms 71416 KB ans=YES N=1919
62 Correct 56 ms 71932 KB ans=YES N=1882
63 Correct 64 ms 72440 KB ans=YES N=1922
64 Correct 50 ms 71672 KB ans=YES N=1989
65 Correct 55 ms 71936 KB ans=YES N=1978
66 Correct 53 ms 71928 KB ans=YES N=1867
67 Correct 54 ms 71928 KB ans=YES N=1942

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 72 ms 73976 KB ans=NO N=1934
2 Correct 53 ms 71928 KB ans=NO N=1965
3 Correct 48 ms 71288 KB ans=YES N=1824
4 Correct 44 ms 71416 KB ans=YES N=1981
5 Correct 45 ms 71288 KB ans=YES N=1814
6 Correct 47 ms 71416 KB ans=YES N=1854
7 Correct 45 ms 71288 KB ans=YES N=1831
8 Correct 46 ms 71472 KB ans=YES N=2000
9 Correct 50 ms 71544 KB ans=YES N=1847
10 Correct 53 ms 71672 KB ans=YES N=1819
11 Correct 46 ms 71416 KB ans=YES N=1986
12 Correct 56 ms 71928 KB ans=YES N=2000
13 Correct 57 ms 72184 KB ans=YES N=1834
14 Correct 60 ms 72056 KB ans=YES N=1860
15 Correct 58 ms 72184 KB ans=YES N=1898
16 Correct 54 ms 71928 KB ans=YES N=1832
17 Correct 63 ms 72440 KB ans=YES N=1929
18 Correct 49 ms 71416 KB ans=YES N=1919
19 Correct 56 ms 72056 KB ans=YES N=1882
20 Correct 63 ms 72440 KB ans=YES N=1922
21 Correct 49 ms 71672 KB ans=YES N=1989
22 Correct 54 ms 71928 KB ans=YES N=1978
23 Correct 54 ms 71928 KB ans=YES N=1867

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 70776 KB ans=YES N=1
2 Correct 35 ms 70776 KB ans=YES N=4
3 Correct 38 ms 70776 KB ans=NO N=4
4 Correct 34 ms 70784 KB ans=YES N=5
5 Correct 35 ms 70776 KB ans=YES N=9
6 Correct 35 ms 70776 KB ans=YES N=5
7 Correct 35 ms 70784 KB ans=NO N=9
8 Correct 36 ms 70752 KB ans=NO N=10
9 Correct 35 ms 70776 KB ans=YES N=10
10 Correct 47 ms 70776 KB ans=YES N=10
11 Correct 38 ms 70904 KB ans=YES N=10
12 Correct 36 ms 70776 KB ans=YES N=9
13 Correct 35 ms 70784 KB ans=YES N=9
14 Correct 36 ms 70784 KB ans=YES N=8
15 Correct 36 ms 70784 KB ans=YES N=8
16 Correct 34 ms 70776 KB ans=NO N=2
17 Correct 37 ms 70776 KB ans=YES N=17
18 Correct 36 ms 70776 KB ans=YES N=25
19 Correct 37 ms 70776 KB ans=YES N=100
20 Correct 36 ms 70904 KB ans=YES N=185
21 Correct 38 ms 71052 KB ans=NO N=174
22 Correct 37 ms 70784 KB ans=YES N=90
23 Correct 35 ms 70776 KB ans=YES N=63
24 Correct 35 ms 70776 KB ans=YES N=87
25 Correct 35 ms 70904 KB ans=YES N=183
26 Correct 36 ms 70904 KB ans=YES N=188
27 Correct 37 ms 70912 KB ans=YES N=183
28 Correct 36 ms 70912 KB ans=YES N=189
29 Correct 36 ms 70904 KB ans=YES N=200
30 Correct 36 ms 70904 KB ans=YES N=190
31 Correct 36 ms 70904 KB ans=YES N=187
32 Correct 37 ms 70904 KB ans=YES N=187
33 Correct 36 ms 70904 KB ans=YES N=182
34 Correct 37 ms 70904 KB ans=YES N=184
35 Correct 37 ms 70904 KB ans=YES N=188
36 Correct 37 ms 70912 KB ans=YES N=181
37 Correct 38 ms 70912 KB ans=YES N=188
38 Correct 37 ms 70904 KB ans=YES N=191
39 Correct 36 ms 70904 KB ans=YES N=196
40 Correct 36 ms 70912 KB ans=YES N=196
41 Correct 36 ms 70912 KB ans=YES N=196
42 Correct 36 ms 70904 KB ans=YES N=196
43 Correct 37 ms 70912 KB ans=YES N=195
44 Correct 70 ms 73976 KB ans=NO N=1934
45 Correct 55 ms 71928 KB ans=NO N=1965
46 Correct 45 ms 71288 KB ans=YES N=1824
47 Correct 46 ms 71416 KB ans=YES N=1981
48 Correct 44 ms 71296 KB ans=YES N=1814
49 Correct 47 ms 71416 KB ans=YES N=1854
50 Correct 45 ms 71288 KB ans=YES N=1831
51 Correct 51 ms 71416 KB ans=YES N=2000
52 Correct 49 ms 71544 KB ans=YES N=1847
53 Correct 52 ms 71672 KB ans=YES N=1819
54 Correct 46 ms 71544 KB ans=YES N=1986
55 Correct 57 ms 71928 KB ans=YES N=2000
56 Correct 69 ms 72184 KB ans=YES N=1834
57 Correct 67 ms 72056 KB ans=YES N=1860
58 Correct 59 ms 72184 KB ans=YES N=1898
59 Correct 56 ms 71928 KB ans=YES N=1832
60 Correct 64 ms 72440 KB ans=YES N=1929
61 Correct 48 ms 71416 KB ans=YES N=1919
62 Correct 56 ms 71932 KB ans=YES N=1882
63 Correct 64 ms 72440 KB ans=YES N=1922
64 Correct 50 ms 71672 KB ans=YES N=1989
65 Correct 55 ms 71936 KB ans=YES N=1978
66 Correct 53 ms 71928 KB ans=YES N=1867
67 Correct 54 ms 71928 KB ans=YES N=1942
68 Correct 620 ms 92884 KB ans=NO N=66151
69 Correct 1699 ms 157760 KB ans=NO N=64333
70 Correct 550 ms 88612 KB ans=YES N=69316
71 Correct 516 ms 88388 KB ans=YES N=66695
72 Correct 534 ms 89060 KB ans=YES N=68436
73 Correct 541 ms 89576 KB ans=YES N=70000
74 Correct 545 ms 89448 KB ans=YES N=68501
75 Correct 587 ms 90472 KB ans=YES N=70000
76 Correct 633 ms 91756 KB ans=YES N=65009
77 Correct 1077 ms 105964 KB ans=YES N=67007
78 Correct 1347 ms 112924 KB ans=YES N=66357
79 Correct 1473 ms 118124 KB ans=YES N=65430
80 Correct 1420 ms 115820 KB ans=YES N=65790
81 Correct 1291 ms 112308 KB ans=YES N=66020
82 Correct 1116 ms 108520 KB ans=YES N=65809
83 Correct 722 ms 95852 KB ans=YES N=65651
84 Correct 1738 ms 129900 KB ans=YES N=68040
85 Correct 1542 ms 122496 KB ans=YES N=66570
86 Correct 603 ms 90220 KB ans=YES N=65421
87 Correct 680 ms 91548 KB ans=YES N=68351
88 Correct 524 ms 88468 KB ans=YES N=67027
89 Correct 1158 ms 103840 KB ans=YES N=68879
90 Correct 692 ms 93112 KB ans=YES N=67256
91 Correct 1460 ms 111836 KB ans=YES N=148315
92 Runtime error 1000 ms 369528 KB Execution killed with signal 11 (could be triggered by violating memory limits)
93 Halted 0 ms 0 KB -

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 560 ms 92832 KB ans=NO N=66151
2 Correct 1674 ms 157816 KB ans=NO N=64333
3 Correct 524 ms 88520 KB ans=YES N=69316
4 Correct 551 ms 88428 KB ans=YES N=66695
5 Correct 522 ms 89064 KB ans=YES N=68436
6 Correct 539 ms 89572 KB ans=YES N=70000
7 Correct 553 ms 89576 KB ans=YES N=68501
8 Correct 566 ms 90472 KB ans=YES N=70000
9 Correct 621 ms 91916 KB ans=YES N=65009
10 Correct 1098 ms 105976 KB ans=YES N=67007
11 Correct 1464 ms 112984 KB ans=YES N=66357
12 Correct 1468 ms 117948 KB ans=YES N=65430
13 Correct 1352 ms 115688 KB ans=YES N=65790
14 Correct 1287 ms 112236 KB ans=YES N=66020
15 Correct 1139 ms 108508 KB ans=YES N=65809
16 Correct 730 ms 95980 KB ans=YES N=65651
17 Correct 1779 ms 129884 KB ans=YES N=68040
18 Correct 1635 ms 122404 KB ans=YES N=66570
19 Correct 572 ms 90192 KB ans=YES N=65421
20 Correct 676 ms 91628 KB ans=YES N=68351
21 Correct 505 ms 88312 KB ans=YES N=67027
22 Correct 1183 ms 103676 KB ans=YES N=68879
23 Correct 684 ms 93032 KB ans=YES N=67256

Subtask #7
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 72 ms 73976 KB ans=NO N=1934
2 Correct 53 ms 71928 KB ans=NO N=1965
3 Correct 48 ms 71288 KB ans=YES N=1824
4 Correct 44 ms 71416 KB ans=YES N=1981
5 Correct 45 ms 71288 KB ans=YES N=1814
6 Correct 47 ms 71416 KB ans=YES N=1854
7 Correct 45 ms 71288 KB ans=YES N=1831
8 Correct 46 ms 71472 KB ans=YES N=2000
9 Correct 50 ms 71544 KB ans=YES N=1847
10 Correct 53 ms 71672 KB ans=YES N=1819
11 Correct 46 ms 71416 KB ans=YES N=1986
12 Correct 56 ms 71928 KB ans=YES N=2000
13 Correct 57 ms 72184 KB ans=YES N=1834
14 Correct 60 ms 72056 KB ans=YES N=1860
15 Correct 58 ms 72184 KB ans=YES N=1898
16 Correct 54 ms 71928 KB ans=YES N=1832
17 Correct 63 ms 72440 KB ans=YES N=1929
18 Correct 49 ms 71416 KB ans=YES N=1919
19 Correct 56 ms 72056 KB ans=YES N=1882
20 Correct 63 ms 72440 KB ans=YES N=1922
21 Correct 49 ms 71672 KB ans=YES N=1989
22 Correct 54 ms 71928 KB ans=YES N=1978
23 Correct 54 ms 71928 KB ans=YES N=1867
24 Correct 560 ms 92832 KB ans=NO N=66151
25 Correct 1674 ms 157816 KB ans=NO N=64333
26 Correct 524 ms 88520 KB ans=YES N=69316
27 Correct 551 ms 88428 KB ans=YES N=66695
28 Correct 522 ms 89064 KB ans=YES N=68436
29 Correct 539 ms 89572 KB ans=YES N=70000
30 Correct 553 ms 89576 KB ans=YES N=68501
31 Correct 566 ms 90472 KB ans=YES N=70000
32 Correct 621 ms 91916 KB ans=YES N=65009
33 Correct 1098 ms 105976 KB ans=YES N=67007
34 Correct 1464 ms 112984 KB ans=YES N=66357
35 Correct 1468 ms 117948 KB ans=YES N=65430
36 Correct 1352 ms 115688 KB ans=YES N=65790
37 Correct 1287 ms 112236 KB ans=YES N=66020
38 Correct 1139 ms 108508 KB ans=YES N=65809
39 Correct 730 ms 95980 KB ans=YES N=65651
40 Correct 1779 ms 129884 KB ans=YES N=68040
41 Correct 1635 ms 122404 KB ans=YES N=66570
42 Correct 572 ms 90192 KB ans=YES N=65421
43 Correct 676 ms 91628 KB ans=YES N=68351
44 Correct 505 ms 88312 KB ans=YES N=67027
45 Correct 1183 ms 103676 KB ans=YES N=68879
46 Correct 684 ms 93032 KB ans=YES N=67256
47 Correct 1497 ms 111968 KB ans=YES N=148315
48 Runtime error 1004 ms 369400 KB Execution killed with signal 11 (could be triggered by violating memory limits)
49 Halted 0 ms 0 KB -