oj.uz

답안 #546552

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
546552 2022-04-07T19:20:47 Z LucaDantas Building Skyscrapers (CEOI19_skyscrapers) C++17
54 / 100
 363 ms 22612 KB 
#include <bits/stdc++.h>
using namespace std;

const int dx[] = {0, 0, 1, 1, 1, -1, -1, -1};
const int dy[] = {1, -1, 1, -1, 0, 1, -1, 0};

int main() {
    int n; scanf("%d", &n);
    int t; scanf("%d", &t);
    
    if(t == 2) return 0; // return to this subtask after coding t = 1

    vector<pair<int,int>> sk(n);
    for(auto& [x, y] : sk)
        scanf("%d %d", &x, &y);

    map<pair<int,int>, int> id;

    for(int i = 0; i < n; i++)
        id[sk[i]] = i+1;

    sort(sk.begin(), sk.end());

    set<pair<int,int>> mark;
    priority_queue<pair<int,int>> q;
    q.push(sk.back());
    mark.insert(sk.back());

    vector<int> ans;

    while(q.size()) {
        ans.push_back(id[q.top()]);
        auto [x, y] = q.top();
        q.pop();

        for(int k = 0; k < 8; k++)
            if(binary_search(sk.begin(), sk.end(), pair<int,int>(x+dx[k], y+dy[k])) && !mark.count(pair<int,int>(x+dx[k], y+dy[k])))
                q.push(pair<int,int>(x+dx[k], y+dy[k])), mark.insert(pair<int,int>(x+dx[k], y+dy[k]));
    }

    if(ans.size() == n) {
        puts("YES");
        for(int x : ans)
            printf("%d\n", x);
    } else {
        puts("NO");
    }
}

Compilation message

skyscrapers.cpp: In function 'int main()':
skyscrapers.cpp:41:19: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   41 |     if(ans.size() == n) {
      |        ~~~~~~~~~~~^~~~
skyscrapers.cpp:8:17: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    8 |     int n; scanf("%d", &n);
      |            ~~~~~^~~~~~~~~~
skyscrapers.cpp:9:17: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    9 |     int t; scanf("%d", &t);
      |            ~~~~~^~~~~~~~~~
skyscrapers.cpp:15:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   15 |         scanf("%d %d", &x, &y);
      |         ~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

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

Subtask #2
14.0 / 14.0

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

Subtask #3
12.0 / 12.0

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

Subtask #4
0 / 17.0

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

Subtask #5
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB ans=YES N=1
2 Correct 0 ms 212 KB ans=YES N=4
3 Correct 1 ms 296 KB ans=NO N=4
4 Correct 1 ms 212 KB ans=YES N=5
5 Correct 0 ms 212 KB ans=YES N=9
6 Correct 0 ms 212 KB ans=YES N=5
7 Correct 0 ms 212 KB ans=NO N=9
8 Correct 0 ms 304 KB ans=NO N=10
9 Correct 0 ms 212 KB ans=YES N=10
10 Correct 1 ms 212 KB ans=YES N=10
11 Correct 1 ms 212 KB ans=YES N=10
12 Correct 1 ms 212 KB ans=YES N=9
13 Correct 1 ms 212 KB ans=YES N=9
14 Correct 1 ms 300 KB ans=YES N=8
15 Correct 1 ms 212 KB ans=YES N=8
16 Correct 1 ms 212 KB ans=NO N=2
17 Correct 1 ms 212 KB ans=YES N=17
18 Correct 1 ms 212 KB ans=YES N=25
19 Correct 1 ms 212 KB ans=YES N=100
20 Correct 1 ms 300 KB ans=YES N=185
21 Correct 1 ms 212 KB ans=NO N=174
22 Correct 1 ms 304 KB ans=YES N=90
23 Correct 1 ms 212 KB ans=YES N=63
24 Correct 1 ms 212 KB ans=YES N=87
25 Correct 1 ms 212 KB ans=YES N=183
26 Correct 1 ms 212 KB ans=YES N=188
27 Correct 1 ms 212 KB ans=YES N=183
28 Correct 1 ms 212 KB ans=YES N=189
29 Correct 1 ms 304 KB ans=YES N=200
30 Correct 1 ms 340 KB ans=YES N=190
31 Correct 1 ms 212 KB ans=YES N=187
32 Correct 1 ms 212 KB ans=YES N=187
33 Correct 1 ms 212 KB ans=YES N=182
34 Correct 1 ms 212 KB ans=YES N=184
35 Correct 1 ms 296 KB ans=YES N=188
36 Correct 1 ms 212 KB ans=YES N=181
37 Correct 1 ms 212 KB ans=YES N=188
38 Correct 1 ms 296 KB ans=YES N=191
39 Correct 1 ms 212 KB ans=YES N=196
40 Correct 1 ms 212 KB ans=YES N=196
41 Correct 1 ms 212 KB ans=YES N=196
42 Correct 1 ms 212 KB ans=YES N=196
43 Correct 1 ms 212 KB ans=YES N=195
44 Correct 1 ms 468 KB ans=NO N=1934
45 Correct 2 ms 340 KB ans=NO N=1965
46 Correct 5 ms 468 KB ans=YES N=1824
47 Correct 5 ms 468 KB ans=YES N=1981
48 Correct 4 ms 444 KB ans=YES N=1814
49 Correct 3 ms 468 KB ans=YES N=1854
50 Correct 4 ms 468 KB ans=YES N=1831
51 Correct 4 ms 468 KB ans=YES N=2000
52 Correct 4 ms 468 KB ans=YES N=1847
53 Correct 3 ms 568 KB ans=YES N=1819
54 Correct 4 ms 596 KB ans=YES N=1986
55 Correct 4 ms 596 KB ans=YES N=2000
56 Correct 3 ms 468 KB ans=YES N=1834
57 Correct 4 ms 468 KB ans=YES N=1860
58 Correct 4 ms 564 KB ans=YES N=1898
59 Correct 4 ms 540 KB ans=YES N=1832
60 Correct 4 ms 468 KB ans=YES N=1929
61 Correct 4 ms 572 KB ans=YES N=1919
62 Correct 3 ms 468 KB ans=YES N=1882
63 Correct 3 ms 468 KB ans=YES N=1922
64 Correct 5 ms 468 KB ans=YES N=1989
65 Correct 3 ms 468 KB ans=YES N=1978
66 Correct 3 ms 468 KB ans=YES N=1867
67 Correct 4 ms 468 KB ans=YES N=1942
68 Correct 125 ms 9044 KB ans=NO N=66151
69 Correct 41 ms 5324 KB ans=NO N=64333
70 Correct 142 ms 9556 KB ans=YES N=69316
71 Correct 160 ms 9236 KB ans=YES N=66695
72 Correct 141 ms 9584 KB ans=YES N=68436
73 Correct 151 ms 9680 KB ans=YES N=70000
74 Correct 134 ms 9640 KB ans=YES N=68501
75 Correct 145 ms 9788 KB ans=YES N=70000
76 Correct 131 ms 9052 KB ans=YES N=65009
77 Correct 134 ms 9364 KB ans=YES N=67007
78 Correct 126 ms 9244 KB ans=YES N=66357
79 Correct 112 ms 9160 KB ans=YES N=65430
80 Correct 126 ms 9240 KB ans=YES N=65790
81 Correct 140 ms 9184 KB ans=YES N=66020
82 Correct 122 ms 9176 KB ans=YES N=65809
83 Correct 135 ms 9284 KB ans=YES N=65651
84 Correct 132 ms 9512 KB ans=YES N=68040
85 Correct 119 ms 9304 KB ans=YES N=66570
86 Correct 145 ms 9012 KB ans=YES N=65421
87 Correct 149 ms 9532 KB ans=YES N=68351
88 Correct 157 ms 9280 KB ans=YES N=67027
89 Correct 107 ms 9644 KB ans=YES N=68879
90 Correct 152 ms 9408 KB ans=YES N=67256
91 Correct 363 ms 20368 KB ans=YES N=148315
92 Correct 99 ms 11724 KB ans=NO N=142745
93 Correct 106 ms 13732 KB ans=NO N=148443
94 Correct 332 ms 22108 KB ans=YES N=148328
95 Correct 328 ms 22208 KB ans=YES N=147855
96 Correct 332 ms 22572 KB ans=YES N=150000
97 Correct 320 ms 21720 KB ans=YES N=144725
98 Correct 334 ms 22484 KB ans=YES N=149445
99 Correct 311 ms 21792 KB ans=YES N=144455
100 Correct 321 ms 21656 KB ans=YES N=143487
101 Correct 320 ms 22292 KB ans=YES N=149688
102 Correct 277 ms 21460 KB ans=YES N=141481
103 Correct 270 ms 22024 KB ans=YES N=147430
104 Correct 288 ms 21488 KB ans=YES N=142247
105 Correct 305 ms 22612 KB ans=YES N=149941
106 Correct 262 ms 21340 KB ans=YES N=141635
107 Correct 276 ms 21228 KB ans=YES N=142896
108 Correct 274 ms 20960 KB ans=YES N=142069
109 Correct 293 ms 20720 KB ans=YES N=142378
110 Correct 296 ms 22556 KB ans=YES N=150000
111 Correct 254 ms 21116 KB ans=YES N=141452
112 Correct 228 ms 20132 KB ans=YES N=134453
113 Correct 241 ms 21500 KB ans=YES N=144172

Subtask #6
0 / 10.0

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

Subtask #7
0 / 19.0

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