oj.uz

Submission #598869

# Submission time Handle Problem Language Result Execution time Memory
598869 2022-07-19T06:40:20 Z 박상훈(#8456) Building Skyscrapers (CEOI19_skyscrapers) C++17
54 / 100
 420 ms 43376 KB 
#include <bits/stdc++.h>

typedef long long ll;
using namespace std;
struct Point{
    int x, y, i;
    Point(){}
    Point(int _x, int _y, int _i): x(_x), y(_y), i(_i) {}
    bool operator<(const Point &P) const{
        return tie(x, y) < tie(P.x, P.y);
    }
}a[150150];
map<int, map<int, int>> mp;
bool visited[150150];
int dx[8] = {1, -1, 0, 0, 1, 1, -1, -1}, dy[8] = {0, 0, 1, -1, -1, 1, -1, 1};

int main(){
    int n, typ;
    scanf("%d %d", &n, &typ);

    for (int i=1;i<=n;i++){
        scanf("%d %d", &a[i].x, &a[i].y);
        a[i].i = i;
        mp[a[i].x][a[i].y] = i;
    }

    vector<int> ans;
    set<Point> st;
    st.insert(*min_element(a+1, a+n+1));
    visited[st.begin()->i] = 1;

    while(!st.empty()){
        auto s = *st.begin(); st.erase(st.begin());
        //printf("%d\n", s.i);
        ans.push_back(s.i);
        for (int k=0;k<8;k++){
            int nx = s.x + dx[k], ny = s.y + dy[k];
            if (mp[nx][ny] && !visited[mp[nx][ny]]){
                st.insert(a[mp[nx][ny]]);
                visited[mp[nx][ny]] = 1;
            }
        }
    }

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

Compilation message

skyscrapers.cpp: In function 'int main()':
skyscrapers.cpp:19:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   19 |     scanf("%d %d", &n, &typ);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~
skyscrapers.cpp:22:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   22 |         scanf("%d %d", &a[i].x, &a[i].y);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory 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 212 KB ans=NO N=4
4 Correct 1 ms 212 KB ans=YES N=5
5 Correct 1 ms 212 KB ans=YES N=9
6 Correct 1 ms 212 KB ans=YES N=5
7 Correct 0 ms 212 KB ans=NO N=9
8 Correct 0 ms 212 KB ans=NO N=10
9 Correct 1 ms 212 KB ans=YES N=10
10 Correct 0 ms 212 KB ans=YES N=10
11 Correct 1 ms 212 KB ans=YES N=10
12 Correct 0 ms 212 KB ans=YES N=9
13 Correct 1 ms 212 KB ans=YES N=9
14 Correct 1 ms 212 KB ans=YES N=8
15 Correct 0 ms 212 KB ans=YES N=8
16 Correct 0 ms 212 KB ans=NO N=2

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory 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 212 KB ans=NO N=4
4 Correct 1 ms 212 KB ans=YES N=5
5 Correct 1 ms 212 KB ans=YES N=9
6 Correct 1 ms 212 KB ans=YES N=5
7 Correct 0 ms 212 KB ans=NO N=9
8 Correct 0 ms 212 KB ans=NO N=10
9 Correct 1 ms 212 KB ans=YES N=10
10 Correct 0 ms 212 KB ans=YES N=10
11 Correct 1 ms 212 KB ans=YES N=10
12 Correct 0 ms 212 KB ans=YES N=9
13 Correct 1 ms 212 KB ans=YES N=9
14 Correct 1 ms 212 KB ans=YES N=8
15 Correct 0 ms 212 KB ans=YES N=8
16 Correct 0 ms 212 KB ans=NO N=2
17 Correct 1 ms 212 KB ans=YES N=17
18 Correct 0 ms 212 KB ans=YES N=25
19 Correct 0 ms 212 KB ans=YES N=100
20 Correct 1 ms 212 KB ans=YES N=185
21 Correct 0 ms 212 KB ans=NO N=174
22 Correct 1 ms 212 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 212 KB ans=YES N=200
30 Correct 2 ms 340 KB ans=YES N=190
31 Correct 1 ms 212 KB ans=YES N=187
32 Correct 1 ms 340 KB ans=YES N=187
33 Correct 1 ms 340 KB ans=YES N=182
34 Correct 1 ms 340 KB ans=YES N=184
35 Correct 1 ms 340 KB ans=YES N=188
36 Correct 1 ms 340 KB ans=YES N=181
37 Correct 1 ms 340 KB ans=YES N=188
38 Correct 1 ms 340 KB ans=YES N=191
39 Correct 1 ms 340 KB ans=YES N=196
40 Correct 1 ms 212 KB ans=YES N=196
41 Correct 1 ms 340 KB ans=YES N=196
42 Correct 1 ms 212 KB ans=YES N=196
43 Correct 1 ms 340 KB ans=YES N=195

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory 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 212 KB ans=NO N=4
4 Correct 1 ms 212 KB ans=YES N=5
5 Correct 1 ms 212 KB ans=YES N=9
6 Correct 1 ms 212 KB ans=YES N=5
7 Correct 0 ms 212 KB ans=NO N=9
8 Correct 0 ms 212 KB ans=NO N=10
9 Correct 1 ms 212 KB ans=YES N=10
10 Correct 0 ms 212 KB ans=YES N=10
11 Correct 1 ms 212 KB ans=YES N=10
12 Correct 0 ms 212 KB ans=YES N=9
13 Correct 1 ms 212 KB ans=YES N=9
14 Correct 1 ms 212 KB ans=YES N=8
15 Correct 0 ms 212 KB ans=YES N=8
16 Correct 0 ms 212 KB ans=NO N=2
17 Correct 1 ms 212 KB ans=YES N=17
18 Correct 0 ms 212 KB ans=YES N=25
19 Correct 0 ms 212 KB ans=YES N=100
20 Correct 1 ms 212 KB ans=YES N=185
21 Correct 0 ms 212 KB ans=NO N=174
22 Correct 1 ms 212 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 212 KB ans=YES N=200
30 Correct 2 ms 340 KB ans=YES N=190
31 Correct 1 ms 212 KB ans=YES N=187
32 Correct 1 ms 340 KB ans=YES N=187
33 Correct 1 ms 340 KB ans=YES N=182
34 Correct 1 ms 340 KB ans=YES N=184
35 Correct 1 ms 340 KB ans=YES N=188
36 Correct 1 ms 340 KB ans=YES N=181
37 Correct 1 ms 340 KB ans=YES N=188
38 Correct 1 ms 340 KB ans=YES N=191
39 Correct 1 ms 340 KB ans=YES N=196
40 Correct 1 ms 212 KB ans=YES N=196
41 Correct 1 ms 340 KB ans=YES N=196
42 Correct 1 ms 212 KB ans=YES N=196
43 Correct 1 ms 340 KB ans=YES N=195
44 Correct 2 ms 520 KB ans=NO N=1934
45 Correct 1 ms 340 KB ans=NO N=1965
46 Correct 3 ms 340 KB ans=YES N=1824
47 Correct 4 ms 468 KB ans=YES N=1981
48 Correct 3 ms 340 KB ans=YES N=1814
49 Correct 3 ms 468 KB ans=YES N=1854
50 Correct 3 ms 420 KB ans=YES N=1831
51 Correct 4 ms 460 KB ans=YES N=2000
52 Correct 3 ms 468 KB ans=YES N=1847
53 Correct 4 ms 468 KB ans=YES N=1819
54 Correct 3 ms 468 KB ans=YES N=1986
55 Correct 4 ms 596 KB ans=YES N=2000
56 Correct 4 ms 596 KB ans=YES N=1834
57 Correct 4 ms 596 KB ans=YES N=1860
58 Correct 3 ms 596 KB ans=YES N=1898
59 Correct 4 ms 468 KB ans=YES N=1832
60 Correct 4 ms 724 KB ans=YES N=1929
61 Correct 4 ms 468 KB ans=YES N=1919
62 Correct 3 ms 596 KB ans=YES N=1882
63 Correct 4 ms 664 KB ans=YES N=1922
64 Correct 3 ms 468 KB ans=YES N=1989
65 Correct 2 ms 468 KB ans=YES N=1978
66 Correct 3 ms 724 KB ans=YES N=1867
67 Correct 3 ms 468 KB ans=YES N=1942

Subtask #4
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 596 KB ans=NO N=1934
2 Correct 1 ms 340 KB ans=NO N=1965
3 Incorrect 3 ms 340 KB Contestant's solution is not lexicographically largest at index 1824 (1813 vs 1702)
4 Halted 0 ms 0 KB -

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory 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 212 KB ans=NO N=4
4 Correct 1 ms 212 KB ans=YES N=5
5 Correct 1 ms 212 KB ans=YES N=9
6 Correct 1 ms 212 KB ans=YES N=5
7 Correct 0 ms 212 KB ans=NO N=9
8 Correct 0 ms 212 KB ans=NO N=10
9 Correct 1 ms 212 KB ans=YES N=10
10 Correct 0 ms 212 KB ans=YES N=10
11 Correct 1 ms 212 KB ans=YES N=10
12 Correct 0 ms 212 KB ans=YES N=9
13 Correct 1 ms 212 KB ans=YES N=9
14 Correct 1 ms 212 KB ans=YES N=8
15 Correct 0 ms 212 KB ans=YES N=8
16 Correct 0 ms 212 KB ans=NO N=2
17 Correct 1 ms 212 KB ans=YES N=17
18 Correct 0 ms 212 KB ans=YES N=25
19 Correct 0 ms 212 KB ans=YES N=100
20 Correct 1 ms 212 KB ans=YES N=185
21 Correct 0 ms 212 KB ans=NO N=174
22 Correct 1 ms 212 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 212 KB ans=YES N=200
30 Correct 2 ms 340 KB ans=YES N=190
31 Correct 1 ms 212 KB ans=YES N=187
32 Correct 1 ms 340 KB ans=YES N=187
33 Correct 1 ms 340 KB ans=YES N=182
34 Correct 1 ms 340 KB ans=YES N=184
35 Correct 1 ms 340 KB ans=YES N=188
36 Correct 1 ms 340 KB ans=YES N=181
37 Correct 1 ms 340 KB ans=YES N=188
38 Correct 1 ms 340 KB ans=YES N=191
39 Correct 1 ms 340 KB ans=YES N=196
40 Correct 1 ms 212 KB ans=YES N=196
41 Correct 1 ms 340 KB ans=YES N=196
42 Correct 1 ms 212 KB ans=YES N=196
43 Correct 1 ms 340 KB ans=YES N=195
44 Correct 2 ms 520 KB ans=NO N=1934
45 Correct 1 ms 340 KB ans=NO N=1965
46 Correct 3 ms 340 KB ans=YES N=1824
47 Correct 4 ms 468 KB ans=YES N=1981
48 Correct 3 ms 340 KB ans=YES N=1814
49 Correct 3 ms 468 KB ans=YES N=1854
50 Correct 3 ms 420 KB ans=YES N=1831
51 Correct 4 ms 460 KB ans=YES N=2000
52 Correct 3 ms 468 KB ans=YES N=1847
53 Correct 4 ms 468 KB ans=YES N=1819
54 Correct 3 ms 468 KB ans=YES N=1986
55 Correct 4 ms 596 KB ans=YES N=2000
56 Correct 4 ms 596 KB ans=YES N=1834
57 Correct 4 ms 596 KB ans=YES N=1860
58 Correct 3 ms 596 KB ans=YES N=1898
59 Correct 4 ms 468 KB ans=YES N=1832
60 Correct 4 ms 724 KB ans=YES N=1929
61 Correct 4 ms 468 KB ans=YES N=1919
62 Correct 3 ms 596 KB ans=YES N=1882
63 Correct 4 ms 664 KB ans=YES N=1922
64 Correct 3 ms 468 KB ans=YES N=1989
65 Correct 2 ms 468 KB ans=YES N=1978
66 Correct 3 ms 724 KB ans=YES N=1867
67 Correct 3 ms 468 KB ans=YES N=1942
68 Correct 129 ms 6464 KB ans=NO N=66151
69 Correct 33 ms 4176 KB ans=NO N=64333
70 Correct 114 ms 5268 KB ans=YES N=69316
71 Correct 116 ms 5112 KB ans=YES N=66695
72 Correct 126 ms 5192 KB ans=YES N=68436
73 Correct 142 ms 5256 KB ans=YES N=70000
74 Correct 119 ms 5268 KB ans=YES N=68501
75 Correct 153 ms 5552 KB ans=YES N=70000
76 Correct 112 ms 5732 KB ans=YES N=65009
77 Correct 117 ms 9120 KB ans=YES N=67007
78 Correct 119 ms 10692 KB ans=YES N=66357
79 Correct 125 ms 11864 KB ans=YES N=65430
80 Correct 171 ms 11336 KB ans=YES N=65790
81 Correct 139 ms 10504 KB ans=YES N=66020
82 Correct 139 ms 9620 KB ans=YES N=65809
83 Correct 120 ms 6756 KB ans=YES N=65651
84 Correct 172 ms 14584 KB ans=YES N=68040
85 Correct 127 ms 12868 KB ans=YES N=66570
86 Correct 125 ms 5488 KB ans=YES N=65421
87 Correct 111 ms 6116 KB ans=YES N=68351
88 Correct 107 ms 5144 KB ans=YES N=67027
89 Correct 107 ms 8352 KB ans=YES N=68879
90 Correct 153 ms 6196 KB ans=YES N=67256
91 Correct 336 ms 11368 KB ans=YES N=148315
92 Correct 87 ms 8780 KB ans=NO N=142745
93 Correct 164 ms 22960 KB ans=NO N=148443
94 Correct 315 ms 10804 KB ans=YES N=148328
95 Correct 320 ms 10864 KB ans=YES N=147855
96 Correct 331 ms 11016 KB ans=YES N=150000
97 Correct 314 ms 10604 KB ans=YES N=144725
98 Correct 369 ms 10956 KB ans=YES N=149445
99 Correct 321 ms 10608 KB ans=YES N=144455
100 Correct 318 ms 10600 KB ans=YES N=143487
101 Correct 357 ms 11056 KB ans=YES N=149688
102 Correct 342 ms 19684 KB ans=YES N=141481
103 Correct 420 ms 29376 KB ans=YES N=147430
104 Correct 329 ms 15664 KB ans=YES N=142247
105 Correct 332 ms 18880 KB ans=YES N=149941
106 Correct 360 ms 28344 KB ans=YES N=141635
107 Correct 295 ms 24252 KB ans=YES N=142896
108 Correct 314 ms 27068 KB ans=YES N=142069
109 Correct 293 ms 12620 KB ans=YES N=142378
110 Correct 359 ms 22412 KB ans=YES N=150000
111 Correct 330 ms 32192 KB ans=YES N=141452
112 Correct 296 ms 33164 KB ans=YES N=134453
113 Correct 337 ms 43376 KB ans=YES N=144172

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 127 ms 6472 KB ans=NO N=66151
2 Correct 32 ms 4060 KB ans=NO N=64333
3 Incorrect 117 ms 5188 KB Contestant's solution is not lexicographically largest at index 69316 (69235 vs 7320)
4 Halted 0 ms 0 KB -

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 596 KB ans=NO N=1934
2 Correct 1 ms 340 KB ans=NO N=1965
3 Incorrect 3 ms 340 KB Contestant's solution is not lexicographically largest at index 1824 (1813 vs 1702)
4 Halted 0 ms 0 KB -