oj.uz

답안 #207885

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
207885 2020-03-09T10:59:02 Z E869120 Building Skyscrapers (CEOI19_skyscrapers) C++14
54 / 100
 969 ms 94280 KB 
#include <iostream>
#include <map>
#include <queue>
#include <vector>
#include <algorithm>
#include <functional>
using namespace std;
#pragma warning (disable: 4996)

int N, T, X[1 << 18], Y[1 << 18];
map<pair<int, int>, int> Map;
vector<int> G[1 << 18];
bool used[1 << 18];

void solve_subtask1() {
	for (int i = 1; i <= N; i++) Map[make_pair(X[i], Y[i])] = i;
	for (int i = 1; i <= N; i++) {
		int dx[8] = { 1, 1, 1, 0, -1, -1, -1, 0 };
		int dy[8] = { -1, 0, 1, 1, 1, 0, -1, -1 };
		for (int j = 0; j < 8; j++) {
			int ex = X[i] + dx[j], ey = Y[i] + dy[j];
			if (Map[make_pair(ex, ey)] >= 1) {
				G[i].push_back(Map[make_pair(ex, ey)]);
			}
		}
	}

	priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> Q;
	Q.push(make_pair(X[1], Y[1])); vector<int> I;
	while (!Q.empty()) {
		pair<int, int> pos = Q.top(); Q.pop();
		int idx = Map[pos]; if (used[idx] == true) continue;
		used[idx] = true; I.push_back(idx);
		for (int i : G[idx]) {
			if (used[i] == true) continue;
			Q.push(make_pair(X[i], Y[i]));
		}
	}

	if ((int)I.size() != N) {
		printf("NO\n");
	}
	else {
		printf("YES\n");
		for (int i = 0; i < I.size(); i++) printf("%d\n", I[i]);
	}
}

void solve_subtask2() {

}

int main() {
	scanf("%d%d", &N, &T);
	for (int i = 1; i <= N; i++) scanf("%d%d", &X[i], &Y[i]);
	
	if (T == 1) {
		solve_subtask1();
	}
	else {
		solve_subtask2();
	}
	return 0;
}

Compilation message

skyscrapers.cpp:8:0: warning: ignoring #pragma warning  [-Wunknown-pragmas]
 #pragma warning (disable: 4996)
 
skyscrapers.cpp: In function 'void solve_subtask1()':
skyscrapers.cpp:45:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int i = 0; i < I.size(); i++) printf("%d\n", I[i]);
                   ~~^~~~~~~~~~
skyscrapers.cpp: In function 'int main()':
skyscrapers.cpp:54: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:55:36: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for (int i = 1; i <= N; i++) scanf("%d%d", &X[i], &Y[i]);
                               ~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

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

Subtask #2
14.0 / 14.0

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

Subtask #3
12.0 / 12.0

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

Subtask #4
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 8 ms 6520 KB Unexpected end of file - token expected
2 Halted 0 ms 0 KB -

Subtask #5
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 6520 KB ans=YES N=1
2 Correct 8 ms 6520 KB ans=YES N=4
3 Correct 8 ms 6520 KB ans=NO N=4
4 Correct 8 ms 6520 KB ans=YES N=5
5 Correct 8 ms 6520 KB ans=YES N=9
6 Correct 8 ms 6520 KB ans=YES N=5
7 Correct 8 ms 6520 KB ans=NO N=9
8 Correct 9 ms 6524 KB ans=NO N=10
9 Correct 9 ms 6520 KB ans=YES N=10
10 Correct 9 ms 6520 KB ans=YES N=10
11 Correct 9 ms 6520 KB ans=YES N=10
12 Correct 8 ms 6520 KB ans=YES N=9
13 Correct 8 ms 6520 KB ans=YES N=9
14 Correct 8 ms 6520 KB ans=YES N=8
15 Correct 8 ms 6524 KB ans=YES N=8
16 Correct 9 ms 6648 KB ans=NO N=2
17 Correct 8 ms 6520 KB ans=YES N=17
18 Correct 8 ms 6520 KB ans=YES N=25
19 Correct 9 ms 6520 KB ans=YES N=100
20 Correct 9 ms 6520 KB ans=YES N=185
21 Correct 9 ms 6520 KB ans=NO N=174
22 Correct 9 ms 6520 KB ans=YES N=90
23 Correct 8 ms 6520 KB ans=YES N=63
24 Correct 8 ms 6520 KB ans=YES N=87
25 Correct 9 ms 6520 KB ans=YES N=183
26 Correct 10 ms 6520 KB ans=YES N=188
27 Correct 9 ms 6524 KB ans=YES N=183
28 Correct 9 ms 6520 KB ans=YES N=189
29 Correct 9 ms 6520 KB ans=YES N=200
30 Correct 9 ms 6520 KB ans=YES N=190
31 Correct 9 ms 6520 KB ans=YES N=187
32 Correct 9 ms 6520 KB ans=YES N=187
33 Correct 9 ms 6520 KB ans=YES N=182
34 Correct 9 ms 6520 KB ans=YES N=184
35 Correct 9 ms 6520 KB ans=YES N=188
36 Correct 9 ms 6520 KB ans=YES N=181
37 Correct 9 ms 6520 KB ans=YES N=188
38 Correct 9 ms 6520 KB ans=YES N=191
39 Correct 9 ms 6520 KB ans=YES N=196
40 Correct 9 ms 6520 KB ans=YES N=196
41 Correct 9 ms 6520 KB ans=YES N=196
42 Correct 9 ms 6520 KB ans=YES N=196
43 Correct 9 ms 6520 KB ans=YES N=195
44 Correct 14 ms 7672 KB ans=NO N=1934
45 Correct 13 ms 6904 KB ans=NO N=1965
46 Correct 14 ms 6776 KB ans=YES N=1824
47 Correct 14 ms 6776 KB ans=YES N=1981
48 Correct 15 ms 6776 KB ans=YES N=1814
49 Correct 13 ms 6776 KB ans=YES N=1854
50 Correct 15 ms 6776 KB ans=YES N=1831
51 Correct 14 ms 6776 KB ans=YES N=2000
52 Correct 14 ms 6904 KB ans=YES N=1847
53 Correct 13 ms 6904 KB ans=YES N=1819
54 Correct 14 ms 6776 KB ans=YES N=1986
55 Correct 14 ms 7032 KB ans=YES N=2000
56 Correct 15 ms 7032 KB ans=YES N=1834
57 Correct 13 ms 7032 KB ans=YES N=1860
58 Correct 13 ms 7032 KB ans=YES N=1898
59 Correct 14 ms 6904 KB ans=YES N=1832
60 Correct 14 ms 7160 KB ans=YES N=1929
61 Correct 14 ms 6904 KB ans=YES N=1919
62 Correct 14 ms 7032 KB ans=YES N=1882
63 Correct 14 ms 7160 KB ans=YES N=1922
64 Correct 14 ms 6904 KB ans=YES N=1989
65 Correct 12 ms 6904 KB ans=YES N=1978
66 Correct 13 ms 7032 KB ans=YES N=1867
67 Correct 14 ms 6904 KB ans=YES N=1942
68 Correct 328 ms 17524 KB ans=NO N=66151
69 Correct 321 ms 36600 KB ans=NO N=64333
70 Correct 312 ms 16240 KB ans=YES N=69316
71 Correct 304 ms 15856 KB ans=YES N=66695
72 Correct 316 ms 16240 KB ans=YES N=68436
73 Correct 331 ms 16644 KB ans=YES N=70000
74 Correct 325 ms 16432 KB ans=YES N=68501
75 Correct 335 ms 16804 KB ans=YES N=70000
76 Correct 308 ms 16972 KB ans=YES N=65009
77 Correct 325 ms 20596 KB ans=YES N=67007
78 Correct 320 ms 22324 KB ans=YES N=66357
79 Correct 327 ms 23796 KB ans=YES N=65430
80 Correct 343 ms 23300 KB ans=YES N=65790
81 Correct 339 ms 22260 KB ans=YES N=66020
82 Correct 346 ms 21360 KB ans=YES N=65809
83 Correct 319 ms 17900 KB ans=YES N=65651
84 Correct 369 ms 27712 KB ans=YES N=68040
85 Correct 360 ms 25468 KB ans=YES N=66570
86 Correct 316 ms 16408 KB ans=YES N=65421
87 Correct 329 ms 17292 KB ans=YES N=68351
88 Correct 323 ms 15848 KB ans=YES N=67027
89 Correct 273 ms 19440 KB ans=YES N=68879
90 Correct 308 ms 17116 KB ans=YES N=67256
91 Correct 933 ms 27872 KB ans=YES N=148315
92 Correct 888 ms 80044 KB ans=NO N=142745
93 Correct 664 ms 94280 KB ans=NO N=148443
94 Correct 881 ms 28908 KB ans=YES N=148328
95 Correct 863 ms 29104 KB ans=YES N=147855
96 Correct 902 ms 29436 KB ans=YES N=150000
97 Correct 857 ms 28724 KB ans=YES N=144725
98 Correct 884 ms 29164 KB ans=YES N=149445
99 Correct 863 ms 28676 KB ans=YES N=144455
100 Correct 856 ms 28420 KB ans=YES N=143487
101 Correct 881 ms 29292 KB ans=YES N=149688
102 Correct 839 ms 38780 KB ans=YES N=141481
103 Correct 891 ms 49896 KB ans=YES N=147430
104 Correct 826 ms 33652 KB ans=YES N=142247
105 Correct 916 ms 38156 KB ans=YES N=149941
106 Correct 842 ms 47536 KB ans=YES N=141635
107 Correct 927 ms 44176 KB ans=YES N=142896
108 Correct 969 ms 47792 KB ans=YES N=142069
109 Correct 860 ms 30188 KB ans=YES N=142378
110 Correct 939 ms 42380 KB ans=YES N=150000
111 Correct 861 ms 53484 KB ans=YES N=141452
112 Correct 787 ms 51180 KB ans=YES N=134453
113 Correct 726 ms 53424 KB ans=YES N=144172

Subtask #6
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 24 ms 7032 KB Unexpected end of file - token expected
2 Halted 0 ms 0 KB -

Subtask #7
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 8 ms 6520 KB Unexpected end of file - token expected
2 Halted 0 ms 0 KB -