oj.uz

Submission #564805

# Submission time Handle Problem Language Result Execution time Memory
564805 2022-05-19T16:29:51 Z AbdullahMW Building Skyscrapers (CEOI19_skyscrapers) C++14
54 / 100
 704 ms 61832 KB 
#include <bits/stdc++.h>
 
#define all(vec) vec.begin(), vec.end()
#define ll long long
#define db double
#define pb push_back
#define pf push_front
#define newl "\n"
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define f first
#define s second
#define MOD 1000000007
 
using namespace std;
 
#pragma GCC diagnostic ignored "-Wunused-result"
void setIO(string name = "") {
    ios_base::sync_with_stdio(0); cin.tie(0);
    cout << fixed << setprecision(15);
    if (name.size()) {
        freopen((name+".in").c_str(), "r", stdin);
        freopen((name+".out").c_str(), "w", stdout);
    }
}
 
map <pair <ll, ll>, bool> vis, exist;
vector <ll> ans;
priority_queue <pair <ll, ll>, vector <pair <ll, ll>>, greater <pair <ll, ll>>> pq;
map <pair <ll, ll>, ll> mp;
void bfs(ll ii, ll jj)
{
    pq.push({ii, jj});
    vis[{ii, jj}] = true;

    while (pq.size())
    {
        ll x = pq.top().f, y = pq.top().s;
        pq.pop();
        
        for (ll i = x - 1; i <= x + 1; i++)
        {
            for (ll j = y - 1; j <= y + 1; j++)
            {
                if (exist[{i, j}] && !vis[{i, j}])
                {
                    vis[{i, j}] = true;
                    pq.push({i, j});
                }
            }
        }
        
        ans.pb(mp[{x, y}]);
    }
}
 
int main()
{
    //fast
    //setIO("");
    
    //freopen("filename.in", "r", stdin);
    //freopen("filename.out", "w", stdout);
    
    ll n, t; cin >> n >> t;
    vector <pair <ll, ll>> a(n);
    for (ll i = 0; i < n; i++) 
    {
        cin >> a[i].f >> a[i].s;
        mp[a[i]] = i + 1;
        exist[a[i]] = true;
    }
    
    sort(a.begin(), a.end());
    bfs(a[0].f, a[0].s);

    if (ans.size() < n) 
    {
        cout << "NO" << newl;
        return 0;
    }
    
    cout << "YES" << newl;
    for (auto v : ans) cout << v << newl;
    
    //cout << 1;
 
 
 
    
    
    
}

Compilation message

skyscrapers.cpp: In function 'int main()':
skyscrapers.cpp:76:20: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
   76 |     if (ans.size() < n)
      |         ~~~~~~~~~~~^~~

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 0 ms 212 KB ans=NO N=4
4 Correct 0 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 1 ms 268 KB ans=NO N=9
8 Correct 0 ms 212 KB ans=NO N=10
9 Correct 0 ms 212 KB ans=YES N=10
10 Correct 0 ms 212 KB ans=YES N=10
11 Correct 0 ms 212 KB ans=YES N=10
12 Correct 0 ms 212 KB ans=YES N=9
13 Correct 0 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 0 ms 212 KB ans=NO N=4
4 Correct 0 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 1 ms 268 KB ans=NO N=9
8 Correct 0 ms 212 KB ans=NO N=10
9 Correct 0 ms 212 KB ans=YES N=10
10 Correct 0 ms 212 KB ans=YES N=10
11 Correct 0 ms 212 KB ans=YES N=10
12 Correct 0 ms 212 KB ans=YES N=9
13 Correct 0 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 0 ms 212 KB ans=YES N=17
18 Correct 0 ms 212 KB ans=YES N=25
19 Correct 1 ms 212 KB ans=YES N=100
20 Correct 1 ms 340 KB ans=YES N=185
21 Correct 1 ms 212 KB ans=NO N=174
22 Correct 1 ms 212 KB ans=YES N=90
23 Correct 0 ms 212 KB ans=YES N=63
24 Correct 1 ms 212 KB ans=YES N=87
25 Correct 1 ms 340 KB ans=YES N=183
26 Correct 1 ms 340 KB ans=YES N=188
27 Correct 1 ms 384 KB ans=YES N=183
28 Correct 2 ms 340 KB ans=YES N=189
29 Correct 1 ms 340 KB ans=YES N=200
30 Correct 1 ms 340 KB ans=YES N=190
31 Correct 1 ms 340 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 340 KB ans=YES N=196
41 Correct 1 ms 340 KB ans=YES N=196
42 Correct 1 ms 340 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 0 ms 212 KB ans=NO N=4
4 Correct 0 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 1 ms 268 KB ans=NO N=9
8 Correct 0 ms 212 KB ans=NO N=10
9 Correct 0 ms 212 KB ans=YES N=10
10 Correct 0 ms 212 KB ans=YES N=10
11 Correct 0 ms 212 KB ans=YES N=10
12 Correct 0 ms 212 KB ans=YES N=9
13 Correct 0 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 0 ms 212 KB ans=YES N=17
18 Correct 0 ms 212 KB ans=YES N=25
19 Correct 1 ms 212 KB ans=YES N=100
20 Correct 1 ms 340 KB ans=YES N=185
21 Correct 1 ms 212 KB ans=NO N=174
22 Correct 1 ms 212 KB ans=YES N=90
23 Correct 0 ms 212 KB ans=YES N=63
24 Correct 1 ms 212 KB ans=YES N=87
25 Correct 1 ms 340 KB ans=YES N=183
26 Correct 1 ms 340 KB ans=YES N=188
27 Correct 1 ms 384 KB ans=YES N=183
28 Correct 2 ms 340 KB ans=YES N=189
29 Correct 1 ms 340 KB ans=YES N=200
30 Correct 1 ms 340 KB ans=YES N=190
31 Correct 1 ms 340 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 340 KB ans=YES N=196
41 Correct 1 ms 340 KB ans=YES N=196
42 Correct 1 ms 340 KB ans=YES N=196
43 Correct 1 ms 340 KB ans=YES N=195
44 Correct 3 ms 596 KB ans=NO N=1934
45 Correct 2 ms 596 KB ans=NO N=1965
46 Correct 5 ms 724 KB ans=YES N=1824
47 Correct 5 ms 696 KB ans=YES N=1981
48 Correct 5 ms 724 KB ans=YES N=1814
49 Correct 5 ms 724 KB ans=YES N=1854
50 Correct 6 ms 724 KB ans=YES N=1831
51 Correct 7 ms 692 KB ans=YES N=2000
52 Correct 6 ms 824 KB ans=YES N=1847
53 Correct 6 ms 768 KB ans=YES N=1819
54 Correct 7 ms 724 KB ans=YES N=1986
55 Correct 6 ms 980 KB ans=YES N=2000
56 Correct 6 ms 980 KB ans=YES N=1834
57 Correct 6 ms 952 KB ans=YES N=1860
58 Correct 7 ms 980 KB ans=YES N=1898
59 Correct 6 ms 852 KB ans=YES N=1832
60 Correct 6 ms 1108 KB ans=YES N=1929
61 Correct 6 ms 828 KB ans=YES N=1919
62 Correct 6 ms 852 KB ans=YES N=1882
63 Correct 6 ms 1084 KB ans=YES N=1922
64 Correct 5 ms 724 KB ans=YES N=1989
65 Correct 5 ms 824 KB ans=YES N=1978
66 Correct 6 ms 824 KB ans=YES N=1867
67 Correct 7 ms 852 KB ans=YES N=1942

Subtask #4
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 468 KB ans=NO N=1934
2 Correct 2 ms 596 KB ans=NO N=1965
3 Incorrect 4 ms 588 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 0 ms 212 KB ans=NO N=4
4 Correct 0 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 1 ms 268 KB ans=NO N=9
8 Correct 0 ms 212 KB ans=NO N=10
9 Correct 0 ms 212 KB ans=YES N=10
10 Correct 0 ms 212 KB ans=YES N=10
11 Correct 0 ms 212 KB ans=YES N=10
12 Correct 0 ms 212 KB ans=YES N=9
13 Correct 0 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 0 ms 212 KB ans=YES N=17
18 Correct 0 ms 212 KB ans=YES N=25
19 Correct 1 ms 212 KB ans=YES N=100
20 Correct 1 ms 340 KB ans=YES N=185
21 Correct 1 ms 212 KB ans=NO N=174
22 Correct 1 ms 212 KB ans=YES N=90
23 Correct 0 ms 212 KB ans=YES N=63
24 Correct 1 ms 212 KB ans=YES N=87
25 Correct 1 ms 340 KB ans=YES N=183
26 Correct 1 ms 340 KB ans=YES N=188
27 Correct 1 ms 384 KB ans=YES N=183
28 Correct 2 ms 340 KB ans=YES N=189
29 Correct 1 ms 340 KB ans=YES N=200
30 Correct 1 ms 340 KB ans=YES N=190
31 Correct 1 ms 340 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 340 KB ans=YES N=196
41 Correct 1 ms 340 KB ans=YES N=196
42 Correct 1 ms 340 KB ans=YES N=196
43 Correct 1 ms 340 KB ans=YES N=195
44 Correct 3 ms 596 KB ans=NO N=1934
45 Correct 2 ms 596 KB ans=NO N=1965
46 Correct 5 ms 724 KB ans=YES N=1824
47 Correct 5 ms 696 KB ans=YES N=1981
48 Correct 5 ms 724 KB ans=YES N=1814
49 Correct 5 ms 724 KB ans=YES N=1854
50 Correct 6 ms 724 KB ans=YES N=1831
51 Correct 7 ms 692 KB ans=YES N=2000
52 Correct 6 ms 824 KB ans=YES N=1847
53 Correct 6 ms 768 KB ans=YES N=1819
54 Correct 7 ms 724 KB ans=YES N=1986
55 Correct 6 ms 980 KB ans=YES N=2000
56 Correct 6 ms 980 KB ans=YES N=1834
57 Correct 6 ms 952 KB ans=YES N=1860
58 Correct 7 ms 980 KB ans=YES N=1898
59 Correct 6 ms 852 KB ans=YES N=1832
60 Correct 6 ms 1108 KB ans=YES N=1929
61 Correct 6 ms 828 KB ans=YES N=1919
62 Correct 6 ms 852 KB ans=YES N=1882
63 Correct 6 ms 1084 KB ans=YES N=1922
64 Correct 5 ms 724 KB ans=YES N=1989
65 Correct 5 ms 824 KB ans=YES N=1978
66 Correct 6 ms 824 KB ans=YES N=1867
67 Correct 7 ms 852 KB ans=YES N=1942
68 Correct 188 ms 17144 KB ans=NO N=66151
69 Correct 86 ms 9792 KB ans=NO N=64333
70 Correct 234 ms 16028 KB ans=YES N=69316
71 Correct 230 ms 15500 KB ans=YES N=66695
72 Correct 211 ms 15864 KB ans=YES N=68436
73 Correct 232 ms 16192 KB ans=YES N=70000
74 Correct 233 ms 16020 KB ans=YES N=68501
75 Correct 227 ms 16572 KB ans=YES N=70000
76 Correct 214 ms 16340 KB ans=YES N=65009
77 Correct 215 ms 20976 KB ans=YES N=67007
78 Correct 233 ms 22780 KB ans=YES N=66357
79 Correct 217 ms 24220 KB ans=YES N=65430
80 Correct 227 ms 23660 KB ans=YES N=65790
81 Correct 225 ms 22660 KB ans=YES N=66020
82 Correct 219 ms 21560 KB ans=YES N=65809
83 Correct 236 ms 17716 KB ans=YES N=65651
84 Correct 243 ms 28328 KB ans=YES N=68040
85 Correct 226 ms 25792 KB ans=YES N=66570
86 Correct 210 ms 15852 KB ans=YES N=65421
87 Correct 214 ms 17136 KB ans=YES N=68351
88 Correct 208 ms 15504 KB ans=YES N=67027
89 Correct 200 ms 20300 KB ans=YES N=68879
90 Correct 225 ms 17044 KB ans=YES N=67256
91 Correct 533 ms 34612 KB ans=YES N=148315
92 Correct 238 ms 21584 KB ans=NO N=142745
93 Correct 287 ms 23988 KB ans=NO N=148443
94 Correct 563 ms 35540 KB ans=YES N=148328
95 Correct 555 ms 35576 KB ans=YES N=147855
96 Correct 587 ms 36212 KB ans=YES N=150000
97 Correct 566 ms 34792 KB ans=YES N=144725
98 Correct 586 ms 35844 KB ans=YES N=149445
99 Correct 567 ms 35084 KB ans=YES N=144455
100 Correct 583 ms 34624 KB ans=YES N=143487
101 Correct 578 ms 36096 KB ans=YES N=149688
102 Correct 617 ms 46640 KB ans=YES N=141481
103 Correct 601 ms 58684 KB ans=YES N=147430
104 Correct 638 ms 41396 KB ans=YES N=142247
105 Correct 704 ms 46736 KB ans=YES N=149941
106 Correct 608 ms 55592 KB ans=YES N=141635
107 Correct 566 ms 52552 KB ans=YES N=142896
108 Correct 580 ms 55980 KB ans=YES N=142069
109 Correct 536 ms 36708 KB ans=YES N=142378
110 Correct 629 ms 50248 KB ans=YES N=150000
111 Correct 579 ms 61632 KB ans=YES N=141452
112 Correct 577 ms 58652 KB ans=YES N=134453
113 Correct 520 ms 61832 KB ans=YES N=144172

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 229 ms 17120 KB ans=NO N=66151
2 Correct 81 ms 9292 KB ans=NO N=64333
3 Incorrect 223 ms 15480 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 3 ms 468 KB ans=NO N=1934
2 Correct 2 ms 596 KB ans=NO N=1965
3 Incorrect 4 ms 588 KB Contestant's solution is not lexicographically largest at index 1824 (1813 vs 1702)
4 Halted 0 ms 0 KB -