oj.uz

답안 #311659

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
311659 2020-10-10T22:17:47 Z ant101 Building Skyscrapers (CEOI19_skyscrapers) C++14
100 / 100
 1811 ms 388276 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
using ii = pair<int, int>;
using ll = long long;
 
#define X first
#define Y second
 
int n, t, cnt;
unordered_map<ll, int> M;
ii cor[1500007];
int skynum[150007], sky[1500007];
int component[1500007];
bool engaged[1500007];
vector<int> incomp[1500007];
vector<int> G4[1500007], G8[1500007];
bool vis[1500007];
int ecnt;
int infty;
set<int, greater<int> > to_use;
bool hlp[1500007];
int turn, hlp2[1500007];
 
constexpr inline ll key(ii p) {
	return (ll)p.X * 1000696969LL + p.Y;
}
 
void add_point(int x, int y) {
	ii p = {x, y};
	if(!M.count(key(p))) {
		M[key(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) {
	bool c = check(skynum[i]);
	
	if(c && !hlp[i])
		to_use.insert(i);
	else if(!c && hlp[i])
		to_use.erase(i);
		
	hlp[i] = c;
}
 
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;
	}
	
	if(upd) {
		turn++;
		for(int x : incomp[b]) {
			for(int y : G8[x]) {
				if(engaged[y] && hlp2[y] < turn) {
					upd_check(sky[y]);
					hlp2[y] = turn;
				}
			}
		}
	}
	
	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);
	
	M.reserve(262144);
	M.max_load_factor(0.25);
	
	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[key({r, c})]] = 1;
		skynum[i] = M[key({r, c})];
		sky[M[key({r, c})]] = i;
		minp = min(minp, {r, c});
	}
	
	infty = M[key({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(key(p2)) == 0)
					continue;
				int num = M[key(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:133:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  133 |  scanf("%d%d", &n, &t);
      |  ~~~~~^~~~~~~~~~~~~~~~
skyscrapers.cpp:142:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  142 |   scanf("%d%d", &r, &c);
      |   ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 65 ms 108152 KB ans=YES N=1
2 Correct 66 ms 108152 KB ans=YES N=4
3 Correct 66 ms 108152 KB ans=NO N=4
4 Correct 65 ms 108280 KB ans=YES N=5
5 Correct 66 ms 108280 KB ans=YES N=9
6 Correct 66 ms 108280 KB ans=YES N=5
7 Correct 65 ms 108280 KB ans=NO N=9
8 Correct 66 ms 108280 KB ans=NO N=10
9 Correct 67 ms 108280 KB ans=YES N=10
10 Correct 67 ms 108152 KB ans=YES N=10
11 Correct 66 ms 108280 KB ans=YES N=10
12 Correct 65 ms 108184 KB ans=YES N=9
13 Correct 66 ms 108152 KB ans=YES N=9
14 Correct 67 ms 108280 KB ans=YES N=8
15 Correct 67 ms 108152 KB ans=YES N=8
16 Correct 65 ms 108152 KB ans=NO N=2

Subtask #2
14.0 / 14.0

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

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 65 ms 108152 KB ans=YES N=1
2 Correct 66 ms 108152 KB ans=YES N=4
3 Correct 66 ms 108152 KB ans=NO N=4
4 Correct 65 ms 108280 KB ans=YES N=5
5 Correct 66 ms 108280 KB ans=YES N=9
6 Correct 66 ms 108280 KB ans=YES N=5
7 Correct 65 ms 108280 KB ans=NO N=9
8 Correct 66 ms 108280 KB ans=NO N=10
9 Correct 67 ms 108280 KB ans=YES N=10
10 Correct 67 ms 108152 KB ans=YES N=10
11 Correct 66 ms 108280 KB ans=YES N=10
12 Correct 65 ms 108184 KB ans=YES N=9
13 Correct 66 ms 108152 KB ans=YES N=9
14 Correct 67 ms 108280 KB ans=YES N=8
15 Correct 67 ms 108152 KB ans=YES N=8
16 Correct 65 ms 108152 KB ans=NO N=2
17 Correct 66 ms 108280 KB ans=YES N=17
18 Correct 67 ms 108280 KB ans=YES N=25
19 Correct 66 ms 108200 KB ans=YES N=100
20 Correct 66 ms 108280 KB ans=YES N=185
21 Correct 67 ms 108408 KB ans=NO N=174
22 Correct 66 ms 108284 KB ans=YES N=90
23 Correct 66 ms 108280 KB ans=YES N=63
24 Correct 66 ms 108280 KB ans=YES N=87
25 Correct 66 ms 108280 KB ans=YES N=183
26 Correct 66 ms 108280 KB ans=YES N=188
27 Correct 66 ms 108284 KB ans=YES N=183
28 Correct 66 ms 108280 KB ans=YES N=189
29 Correct 66 ms 108280 KB ans=YES N=200
30 Correct 66 ms 108280 KB ans=YES N=190
31 Correct 66 ms 108280 KB ans=YES N=187
32 Correct 67 ms 108280 KB ans=YES N=187
33 Correct 67 ms 108280 KB ans=YES N=182
34 Correct 67 ms 108408 KB ans=YES N=184
35 Correct 67 ms 108284 KB ans=YES N=188
36 Correct 66 ms 108280 KB ans=YES N=181
37 Correct 67 ms 108408 KB ans=YES N=188
38 Correct 67 ms 108408 KB ans=YES N=191
39 Correct 67 ms 108280 KB ans=YES N=196
40 Correct 67 ms 108280 KB ans=YES N=196
41 Correct 66 ms 108280 KB ans=YES N=196
42 Correct 67 ms 108280 KB ans=YES N=196
43 Correct 66 ms 108408 KB ans=YES N=195
44 Correct 85 ms 110840 KB ans=NO N=1934
45 Correct 73 ms 109176 KB ans=NO N=1965
46 Correct 71 ms 108664 KB ans=YES N=1824
47 Correct 73 ms 108920 KB ans=YES N=1981
48 Correct 71 ms 108664 KB ans=YES N=1814
49 Correct 73 ms 108796 KB ans=YES N=1854
50 Correct 72 ms 108796 KB ans=YES N=1831
51 Correct 74 ms 108920 KB ans=YES N=2000
52 Correct 75 ms 108920 KB ans=YES N=1847
53 Correct 75 ms 109048 KB ans=YES N=1819
54 Correct 73 ms 108792 KB ans=YES N=1986
55 Correct 76 ms 109304 KB ans=YES N=2000
56 Correct 78 ms 109432 KB ans=YES N=1834
57 Correct 79 ms 109560 KB ans=YES N=1860
58 Correct 78 ms 109432 KB ans=YES N=1898
59 Correct 75 ms 109176 KB ans=YES N=1832
60 Correct 80 ms 109688 KB ans=YES N=1929
61 Correct 73 ms 108920 KB ans=YES N=1919
62 Correct 75 ms 109304 KB ans=YES N=1882
63 Correct 78 ms 109688 KB ans=YES N=1922
64 Correct 76 ms 109048 KB ans=YES N=1989
65 Correct 75 ms 109176 KB ans=YES N=1978
66 Correct 74 ms 109432 KB ans=YES N=1867
67 Correct 75 ms 109176 KB ans=YES N=1942

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 84 ms 110980 KB ans=NO N=1934
2 Correct 76 ms 109176 KB ans=NO N=1965
3 Correct 71 ms 108664 KB ans=YES N=1824
4 Correct 72 ms 108792 KB ans=YES N=1981
5 Correct 72 ms 108732 KB ans=YES N=1814
6 Correct 73 ms 108920 KB ans=YES N=1854
7 Correct 73 ms 108664 KB ans=YES N=1831
8 Correct 72 ms 108792 KB ans=YES N=2000
9 Correct 75 ms 108920 KB ans=YES N=1847
10 Correct 75 ms 109048 KB ans=YES N=1819
11 Correct 73 ms 108792 KB ans=YES N=1986
12 Correct 76 ms 109336 KB ans=YES N=2000
13 Correct 76 ms 109432 KB ans=YES N=1834
14 Correct 76 ms 109432 KB ans=YES N=1860
15 Correct 78 ms 109432 KB ans=YES N=1898
16 Correct 74 ms 109176 KB ans=YES N=1832
17 Correct 77 ms 109688 KB ans=YES N=1929
18 Correct 72 ms 108884 KB ans=YES N=1919
19 Correct 79 ms 109304 KB ans=YES N=1882
20 Correct 77 ms 109688 KB ans=YES N=1922
21 Correct 73 ms 109048 KB ans=YES N=1989
22 Correct 76 ms 109176 KB ans=YES N=1978
23 Correct 75 ms 109304 KB ans=YES N=1867

Subtask #5
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 65 ms 108152 KB ans=YES N=1
2 Correct 66 ms 108152 KB ans=YES N=4
3 Correct 66 ms 108152 KB ans=NO N=4
4 Correct 65 ms 108280 KB ans=YES N=5
5 Correct 66 ms 108280 KB ans=YES N=9
6 Correct 66 ms 108280 KB ans=YES N=5
7 Correct 65 ms 108280 KB ans=NO N=9
8 Correct 66 ms 108280 KB ans=NO N=10
9 Correct 67 ms 108280 KB ans=YES N=10
10 Correct 67 ms 108152 KB ans=YES N=10
11 Correct 66 ms 108280 KB ans=YES N=10
12 Correct 65 ms 108184 KB ans=YES N=9
13 Correct 66 ms 108152 KB ans=YES N=9
14 Correct 67 ms 108280 KB ans=YES N=8
15 Correct 67 ms 108152 KB ans=YES N=8
16 Correct 65 ms 108152 KB ans=NO N=2
17 Correct 66 ms 108280 KB ans=YES N=17
18 Correct 67 ms 108280 KB ans=YES N=25
19 Correct 66 ms 108200 KB ans=YES N=100
20 Correct 66 ms 108280 KB ans=YES N=185
21 Correct 67 ms 108408 KB ans=NO N=174
22 Correct 66 ms 108284 KB ans=YES N=90
23 Correct 66 ms 108280 KB ans=YES N=63
24 Correct 66 ms 108280 KB ans=YES N=87
25 Correct 66 ms 108280 KB ans=YES N=183
26 Correct 66 ms 108280 KB ans=YES N=188
27 Correct 66 ms 108284 KB ans=YES N=183
28 Correct 66 ms 108280 KB ans=YES N=189
29 Correct 66 ms 108280 KB ans=YES N=200
30 Correct 66 ms 108280 KB ans=YES N=190
31 Correct 66 ms 108280 KB ans=YES N=187
32 Correct 67 ms 108280 KB ans=YES N=187
33 Correct 67 ms 108280 KB ans=YES N=182
34 Correct 67 ms 108408 KB ans=YES N=184
35 Correct 67 ms 108284 KB ans=YES N=188
36 Correct 66 ms 108280 KB ans=YES N=181
37 Correct 67 ms 108408 KB ans=YES N=188
38 Correct 67 ms 108408 KB ans=YES N=191
39 Correct 67 ms 108280 KB ans=YES N=196
40 Correct 67 ms 108280 KB ans=YES N=196
41 Correct 66 ms 108280 KB ans=YES N=196
42 Correct 67 ms 108280 KB ans=YES N=196
43 Correct 66 ms 108408 KB ans=YES N=195
44 Correct 85 ms 110840 KB ans=NO N=1934
45 Correct 73 ms 109176 KB ans=NO N=1965
46 Correct 71 ms 108664 KB ans=YES N=1824
47 Correct 73 ms 108920 KB ans=YES N=1981
48 Correct 71 ms 108664 KB ans=YES N=1814
49 Correct 73 ms 108796 KB ans=YES N=1854
50 Correct 72 ms 108796 KB ans=YES N=1831
51 Correct 74 ms 108920 KB ans=YES N=2000
52 Correct 75 ms 108920 KB ans=YES N=1847
53 Correct 75 ms 109048 KB ans=YES N=1819
54 Correct 73 ms 108792 KB ans=YES N=1986
55 Correct 76 ms 109304 KB ans=YES N=2000
56 Correct 78 ms 109432 KB ans=YES N=1834
57 Correct 79 ms 109560 KB ans=YES N=1860
58 Correct 78 ms 109432 KB ans=YES N=1898
59 Correct 75 ms 109176 KB ans=YES N=1832
60 Correct 80 ms 109688 KB ans=YES N=1929
61 Correct 73 ms 108920 KB ans=YES N=1919
62 Correct 75 ms 109304 KB ans=YES N=1882
63 Correct 78 ms 109688 KB ans=YES N=1922
64 Correct 76 ms 109048 KB ans=YES N=1989
65 Correct 75 ms 109176 KB ans=YES N=1978
66 Correct 74 ms 109432 KB ans=YES N=1867
67 Correct 75 ms 109176 KB ans=YES N=1942
68 Correct 300 ms 129660 KB ans=NO N=66151
69 Correct 727 ms 197608 KB ans=NO N=64333
70 Correct 361 ms 127736 KB ans=YES N=69316
71 Correct 349 ms 124008 KB ans=YES N=66695
72 Correct 346 ms 127484 KB ans=YES N=68436
73 Correct 377 ms 127964 KB ans=YES N=70000
74 Correct 370 ms 127996 KB ans=YES N=68501
75 Correct 381 ms 129044 KB ans=YES N=70000
76 Correct 418 ms 129532 KB ans=YES N=65009
77 Correct 603 ms 146244 KB ans=YES N=67007
78 Correct 673 ms 152388 KB ans=YES N=66357
79 Correct 706 ms 156228 KB ans=YES N=65430
80 Correct 683 ms 154308 KB ans=YES N=65790
81 Correct 666 ms 151620 KB ans=YES N=66020
82 Correct 646 ms 148612 KB ans=YES N=65809
83 Correct 469 ms 132860 KB ans=YES N=65651
84 Correct 784 ms 167236 KB ans=YES N=68040
85 Correct 738 ms 160192 KB ans=YES N=66570
86 Correct 381 ms 128268 KB ans=YES N=65421
87 Correct 411 ms 129276 KB ans=YES N=68351
88 Correct 351 ms 123876 KB ans=YES N=67027
89 Correct 439 ms 138876 KB ans=YES N=68879
90 Correct 398 ms 130916 KB ans=YES N=67256
91 Correct 845 ms 153128 KB ans=YES N=148315
92 Correct 1668 ms 320340 KB ans=NO N=142745
93 Correct 1788 ms 388276 KB ans=NO N=148443
94 Correct 852 ms 153156 KB ans=YES N=148328
95 Correct 872 ms 153156 KB ans=YES N=147855
96 Correct 873 ms 153668 KB ans=YES N=150000
97 Correct 828 ms 152256 KB ans=YES N=144725
98 Correct 869 ms 153412 KB ans=YES N=149445
99 Correct 847 ms 152772 KB ans=YES N=144455
100 Correct 835 ms 152320 KB ans=YES N=143487
101 Correct 887 ms 154048 KB ans=YES N=149688
102 Correct 1465 ms 194640 KB ans=YES N=141481
103 Correct 1759 ms 231188 KB ans=YES N=147430
104 Correct 1256 ms 170180 KB ans=YES N=142247
105 Correct 1507 ms 191544 KB ans=YES N=149941
106 Correct 1673 ms 223952 KB ans=YES N=141635
107 Correct 1635 ms 211276 KB ans=YES N=142896
108 Correct 1672 ms 220956 KB ans=YES N=142069
109 Correct 1026 ms 158912 KB ans=YES N=142378
110 Correct 1334 ms 200612 KB ans=YES N=150000
111 Correct 1739 ms 261080 KB ans=YES N=141452
112 Correct 1526 ms 236624 KB ans=YES N=134453
113 Correct 1619 ms 263252 KB ans=YES N=144172

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 297 ms 129660 KB ans=NO N=66151
2 Correct 747 ms 197556 KB ans=NO N=64333
3 Correct 357 ms 127612 KB ans=YES N=69316
4 Correct 342 ms 124140 KB ans=YES N=66695
5 Correct 386 ms 127740 KB ans=YES N=68436
6 Correct 363 ms 128140 KB ans=YES N=70000
7 Correct 365 ms 127996 KB ans=YES N=68501
8 Correct 373 ms 128856 KB ans=YES N=70000
9 Correct 411 ms 129528 KB ans=YES N=65009
10 Correct 621 ms 146372 KB ans=YES N=67007
11 Correct 707 ms 152256 KB ans=YES N=66357
12 Correct 727 ms 156352 KB ans=YES N=65430
13 Correct 699 ms 154492 KB ans=YES N=65790
14 Correct 671 ms 151620 KB ans=YES N=66020
15 Correct 652 ms 148420 KB ans=YES N=65809
16 Correct 475 ms 132732 KB ans=YES N=65651
17 Correct 793 ms 167236 KB ans=YES N=68040
18 Correct 744 ms 160196 KB ans=YES N=66570
19 Correct 380 ms 128252 KB ans=YES N=65421
20 Correct 422 ms 129476 KB ans=YES N=68351
21 Correct 328 ms 123880 KB ans=YES N=67027
22 Correct 439 ms 138876 KB ans=YES N=68879
23 Correct 399 ms 130940 KB ans=YES N=67256

Subtask #7
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 84 ms 110980 KB ans=NO N=1934
2 Correct 76 ms 109176 KB ans=NO N=1965
3 Correct 71 ms 108664 KB ans=YES N=1824
4 Correct 72 ms 108792 KB ans=YES N=1981
5 Correct 72 ms 108732 KB ans=YES N=1814
6 Correct 73 ms 108920 KB ans=YES N=1854
7 Correct 73 ms 108664 KB ans=YES N=1831
8 Correct 72 ms 108792 KB ans=YES N=2000
9 Correct 75 ms 108920 KB ans=YES N=1847
10 Correct 75 ms 109048 KB ans=YES N=1819
11 Correct 73 ms 108792 KB ans=YES N=1986
12 Correct 76 ms 109336 KB ans=YES N=2000
13 Correct 76 ms 109432 KB ans=YES N=1834
14 Correct 76 ms 109432 KB ans=YES N=1860
15 Correct 78 ms 109432 KB ans=YES N=1898
16 Correct 74 ms 109176 KB ans=YES N=1832
17 Correct 77 ms 109688 KB ans=YES N=1929
18 Correct 72 ms 108884 KB ans=YES N=1919
19 Correct 79 ms 109304 KB ans=YES N=1882
20 Correct 77 ms 109688 KB ans=YES N=1922
21 Correct 73 ms 109048 KB ans=YES N=1989
22 Correct 76 ms 109176 KB ans=YES N=1978
23 Correct 75 ms 109304 KB ans=YES N=1867
24 Correct 297 ms 129660 KB ans=NO N=66151
25 Correct 747 ms 197556 KB ans=NO N=64333
26 Correct 357 ms 127612 KB ans=YES N=69316
27 Correct 342 ms 124140 KB ans=YES N=66695
28 Correct 386 ms 127740 KB ans=YES N=68436
29 Correct 363 ms 128140 KB ans=YES N=70000
30 Correct 365 ms 127996 KB ans=YES N=68501
31 Correct 373 ms 128856 KB ans=YES N=70000
32 Correct 411 ms 129528 KB ans=YES N=65009
33 Correct 621 ms 146372 KB ans=YES N=67007
34 Correct 707 ms 152256 KB ans=YES N=66357
35 Correct 727 ms 156352 KB ans=YES N=65430
36 Correct 699 ms 154492 KB ans=YES N=65790
37 Correct 671 ms 151620 KB ans=YES N=66020
38 Correct 652 ms 148420 KB ans=YES N=65809
39 Correct 475 ms 132732 KB ans=YES N=65651
40 Correct 793 ms 167236 KB ans=YES N=68040
41 Correct 744 ms 160196 KB ans=YES N=66570
42 Correct 380 ms 128252 KB ans=YES N=65421
43 Correct 422 ms 129476 KB ans=YES N=68351
44 Correct 328 ms 123880 KB ans=YES N=67027
45 Correct 439 ms 138876 KB ans=YES N=68879
46 Correct 399 ms 130940 KB ans=YES N=67256
47 Correct 864 ms 153064 KB ans=YES N=148315
48 Correct 1681 ms 320456 KB ans=NO N=142745
49 Correct 1811 ms 388224 KB ans=NO N=148443
50 Correct 863 ms 153028 KB ans=YES N=148328
51 Correct 864 ms 153284 KB ans=YES N=147855
52 Correct 892 ms 153800 KB ans=YES N=150000
53 Correct 834 ms 152320 KB ans=YES N=144725
54 Correct 873 ms 153360 KB ans=YES N=149445
55 Correct 850 ms 153028 KB ans=YES N=144455
56 Correct 857 ms 152260 KB ans=YES N=143487
57 Correct 887 ms 154052 KB ans=YES N=149688
58 Correct 1477 ms 194764 KB ans=YES N=141481
59 Correct 1768 ms 231116 KB ans=YES N=147430
60 Correct 1288 ms 170120 KB ans=YES N=142247
61 Correct 1476 ms 191436 KB ans=YES N=149941
62 Correct 1689 ms 224236 KB ans=YES N=141635
63 Correct 1651 ms 211192 KB ans=YES N=142896
64 Correct 1676 ms 220872 KB ans=YES N=142069
65 Correct 1029 ms 159040 KB ans=YES N=142378
66 Correct 1346 ms 200804 KB ans=YES N=150000
67 Correct 1709 ms 260948 KB ans=YES N=141452
68 Correct 1502 ms 236680 KB ans=YES N=134453
69 Correct 1619 ms 263124 KB ans=YES N=144172