oj.uz

Submission #914033

# Submission time Handle Problem Language Result Execution time Memory
914033 2024-01-20T20:01:04 Z CyberCow Building Skyscrapers (CEOI19_skyscrapers) C++17
54 / 100
 556 ms 32156 KB 
#include <random>
#include <algorithm>
#include <bitset>
#include <chrono>
#include <cmath>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <chrono>
#define fr first
#define sc second
#define ad push_back
using namespace std;
using ll = long long;
mt19937 rnd(348502);

const ll N = 1010;

map<pair<int, int>, int> ma;
map<pair<int, int>, int> ogt;

void solve()
{
    int  n, i, j, x, y, t;
    cin >> n >> t;
    vector<pair<int, int>> v;
    set<pair<int, int>> s;
    for ( i = 0; i < n; i++)
    {
        cin >> x >> y;
        ma[{x, y}] = i + 1;
        s.insert({ x, y });
        v.push_back({ x, y });
    }
    int x1 = x, y1 = y;
    priority_queue<pair<int, pair<int, int>>> p;
    vector<int> ans;
    p.push({ 0, {x, y} });
    while (!p.empty())
    {
        x = p.top().second.first;
        y = p.top().second.second;
        ans.push_back(ma[{x, y}]);
        p.pop();
        ogt[{x, y}] = 1;
        for (i = -1; i <= 1; i++)
        {
            for (j = -1; j <= 1; j++)
            {
                if (s.find({ x + i, y + j }) != s.end() && ogt[{x + i, y + j}] == 0)
                {
                    p.push({-( abs(x1 - (x + i)) + abs((y1 - (y + j)))), {x + i, y + j} });
                    ogt[{x + i, y + j}] = 1;
                }
            }
        }
    }
    if (ans.size() == n)
    {
        cout << "YES\n";
        for ( i = 0; i < ans.size(); i++)
        {
            cout << ans[i] << '\n';
        }
    }
    else
    {
        cout << "NO\n";
    }
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    ll tt = 1;
    //cin >> tt;
    while (tt--) {
        solve();
    }
    return 0;
}

Compilation message

skyscrapers.cpp: In function 'void solve()':
skyscrapers.cpp:69:20: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   69 |     if (ans.size() == n)
      |         ~~~~~~~~~~~^~~~
skyscrapers.cpp:72:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   72 |         for ( i = 0; i < ans.size(); i++)
      |                      ~~^~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB ans=YES N=1
2 Correct 0 ms 348 KB ans=YES N=4
3 Correct 0 ms 348 KB ans=NO N=4
4 Correct 1 ms 348 KB ans=YES N=5
5 Correct 1 ms 348 KB ans=YES N=9
6 Correct 0 ms 348 KB ans=YES N=5
7 Correct 0 ms 344 KB ans=NO N=9
8 Correct 1 ms 348 KB ans=NO N=10
9 Correct 1 ms 348 KB ans=YES N=10
10 Correct 1 ms 348 KB ans=YES N=10
11 Correct 1 ms 348 KB ans=YES N=10
12 Correct 0 ms 348 KB ans=YES N=9
13 Correct 1 ms 348 KB ans=YES N=9
14 Correct 0 ms 348 KB ans=YES N=8
15 Correct 0 ms 348 KB ans=YES N=8
16 Correct 0 ms 460 KB ans=NO N=2

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB ans=YES N=1
2 Correct 0 ms 348 KB ans=YES N=4
3 Correct 0 ms 348 KB ans=NO N=4
4 Correct 1 ms 348 KB ans=YES N=5
5 Correct 1 ms 348 KB ans=YES N=9
6 Correct 0 ms 348 KB ans=YES N=5
7 Correct 0 ms 344 KB ans=NO N=9
8 Correct 1 ms 348 KB ans=NO N=10
9 Correct 1 ms 348 KB ans=YES N=10
10 Correct 1 ms 348 KB ans=YES N=10
11 Correct 1 ms 348 KB ans=YES N=10
12 Correct 0 ms 348 KB ans=YES N=9
13 Correct 1 ms 348 KB ans=YES N=9
14 Correct 0 ms 348 KB ans=YES N=8
15 Correct 0 ms 348 KB ans=YES N=8
16 Correct 0 ms 460 KB ans=NO N=2
17 Correct 1 ms 348 KB ans=YES N=17
18 Correct 0 ms 348 KB ans=YES N=25
19 Correct 1 ms 348 KB ans=YES N=100
20 Correct 1 ms 348 KB ans=YES N=185
21 Correct 1 ms 348 KB ans=NO N=174
22 Correct 1 ms 348 KB ans=YES N=90
23 Correct 1 ms 348 KB ans=YES N=63
24 Correct 1 ms 348 KB ans=YES N=87
25 Correct 1 ms 348 KB ans=YES N=183
26 Correct 1 ms 348 KB ans=YES N=188
27 Correct 1 ms 348 KB ans=YES N=183
28 Correct 1 ms 348 KB ans=YES N=189
29 Correct 1 ms 348 KB ans=YES N=200
30 Correct 1 ms 348 KB ans=YES N=190
31 Correct 1 ms 348 KB ans=YES N=187
32 Correct 1 ms 348 KB ans=YES N=187
33 Correct 1 ms 348 KB ans=YES N=182
34 Correct 1 ms 348 KB ans=YES N=184
35 Correct 1 ms 348 KB ans=YES N=188
36 Correct 1 ms 348 KB ans=YES N=181
37 Correct 1 ms 500 KB ans=YES N=188
38 Correct 1 ms 348 KB ans=YES N=191
39 Correct 1 ms 348 KB ans=YES N=196
40 Correct 1 ms 600 KB ans=YES N=196
41 Correct 1 ms 348 KB ans=YES N=196
42 Correct 1 ms 348 KB ans=YES N=196
43 Correct 1 ms 348 KB ans=YES N=195

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB ans=YES N=1
2 Correct 0 ms 348 KB ans=YES N=4
3 Correct 0 ms 348 KB ans=NO N=4
4 Correct 1 ms 348 KB ans=YES N=5
5 Correct 1 ms 348 KB ans=YES N=9
6 Correct 0 ms 348 KB ans=YES N=5
7 Correct 0 ms 344 KB ans=NO N=9
8 Correct 1 ms 348 KB ans=NO N=10
9 Correct 1 ms 348 KB ans=YES N=10
10 Correct 1 ms 348 KB ans=YES N=10
11 Correct 1 ms 348 KB ans=YES N=10
12 Correct 0 ms 348 KB ans=YES N=9
13 Correct 1 ms 348 KB ans=YES N=9
14 Correct 0 ms 348 KB ans=YES N=8
15 Correct 0 ms 348 KB ans=YES N=8
16 Correct 0 ms 460 KB ans=NO N=2
17 Correct 1 ms 348 KB ans=YES N=17
18 Correct 0 ms 348 KB ans=YES N=25
19 Correct 1 ms 348 KB ans=YES N=100
20 Correct 1 ms 348 KB ans=YES N=185
21 Correct 1 ms 348 KB ans=NO N=174
22 Correct 1 ms 348 KB ans=YES N=90
23 Correct 1 ms 348 KB ans=YES N=63
24 Correct 1 ms 348 KB ans=YES N=87
25 Correct 1 ms 348 KB ans=YES N=183
26 Correct 1 ms 348 KB ans=YES N=188
27 Correct 1 ms 348 KB ans=YES N=183
28 Correct 1 ms 348 KB ans=YES N=189
29 Correct 1 ms 348 KB ans=YES N=200
30 Correct 1 ms 348 KB ans=YES N=190
31 Correct 1 ms 348 KB ans=YES N=187
32 Correct 1 ms 348 KB ans=YES N=187
33 Correct 1 ms 348 KB ans=YES N=182
34 Correct 1 ms 348 KB ans=YES N=184
35 Correct 1 ms 348 KB ans=YES N=188
36 Correct 1 ms 348 KB ans=YES N=181
37 Correct 1 ms 500 KB ans=YES N=188
38 Correct 1 ms 348 KB ans=YES N=191
39 Correct 1 ms 348 KB ans=YES N=196
40 Correct 1 ms 600 KB ans=YES N=196
41 Correct 1 ms 348 KB ans=YES N=196
42 Correct 1 ms 348 KB ans=YES N=196
43 Correct 1 ms 348 KB ans=YES N=195
44 Correct 1 ms 604 KB ans=NO N=1934
45 Correct 1 ms 604 KB ans=NO N=1965
46 Correct 4 ms 732 KB ans=YES N=1824
47 Correct 4 ms 860 KB ans=YES N=1981
48 Correct 4 ms 600 KB ans=YES N=1814
49 Correct 4 ms 604 KB ans=YES N=1854
50 Correct 4 ms 604 KB ans=YES N=1831
51 Correct 4 ms 860 KB ans=YES N=2000
52 Correct 4 ms 860 KB ans=YES N=1847
53 Correct 4 ms 604 KB ans=YES N=1819
54 Correct 4 ms 860 KB ans=YES N=1986
55 Correct 4 ms 860 KB ans=YES N=2000
56 Correct 4 ms 604 KB ans=YES N=1834
57 Correct 4 ms 604 KB ans=YES N=1860
58 Correct 3 ms 604 KB ans=YES N=1898
59 Correct 4 ms 764 KB ans=YES N=1832
60 Correct 3 ms 860 KB ans=YES N=1929
61 Correct 4 ms 860 KB ans=YES N=1919
62 Correct 4 ms 860 KB ans=YES N=1882
63 Correct 3 ms 860 KB ans=YES N=1922
64 Correct 4 ms 860 KB ans=YES N=1989
65 Correct 4 ms 860 KB ans=YES N=1978
66 Correct 3 ms 604 KB ans=YES N=1867
67 Correct 4 ms 860 KB ans=YES N=1942

Subtask #4
0 / 17.0

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

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB ans=YES N=1
2 Correct 0 ms 348 KB ans=YES N=4
3 Correct 0 ms 348 KB ans=NO N=4
4 Correct 1 ms 348 KB ans=YES N=5
5 Correct 1 ms 348 KB ans=YES N=9
6 Correct 0 ms 348 KB ans=YES N=5
7 Correct 0 ms 344 KB ans=NO N=9
8 Correct 1 ms 348 KB ans=NO N=10
9 Correct 1 ms 348 KB ans=YES N=10
10 Correct 1 ms 348 KB ans=YES N=10
11 Correct 1 ms 348 KB ans=YES N=10
12 Correct 0 ms 348 KB ans=YES N=9
13 Correct 1 ms 348 KB ans=YES N=9
14 Correct 0 ms 348 KB ans=YES N=8
15 Correct 0 ms 348 KB ans=YES N=8
16 Correct 0 ms 460 KB ans=NO N=2
17 Correct 1 ms 348 KB ans=YES N=17
18 Correct 0 ms 348 KB ans=YES N=25
19 Correct 1 ms 348 KB ans=YES N=100
20 Correct 1 ms 348 KB ans=YES N=185
21 Correct 1 ms 348 KB ans=NO N=174
22 Correct 1 ms 348 KB ans=YES N=90
23 Correct 1 ms 348 KB ans=YES N=63
24 Correct 1 ms 348 KB ans=YES N=87
25 Correct 1 ms 348 KB ans=YES N=183
26 Correct 1 ms 348 KB ans=YES N=188
27 Correct 1 ms 348 KB ans=YES N=183
28 Correct 1 ms 348 KB ans=YES N=189
29 Correct 1 ms 348 KB ans=YES N=200
30 Correct 1 ms 348 KB ans=YES N=190
31 Correct 1 ms 348 KB ans=YES N=187
32 Correct 1 ms 348 KB ans=YES N=187
33 Correct 1 ms 348 KB ans=YES N=182
34 Correct 1 ms 348 KB ans=YES N=184
35 Correct 1 ms 348 KB ans=YES N=188
36 Correct 1 ms 348 KB ans=YES N=181
37 Correct 1 ms 500 KB ans=YES N=188
38 Correct 1 ms 348 KB ans=YES N=191
39 Correct 1 ms 348 KB ans=YES N=196
40 Correct 1 ms 600 KB ans=YES N=196
41 Correct 1 ms 348 KB ans=YES N=196
42 Correct 1 ms 348 KB ans=YES N=196
43 Correct 1 ms 348 KB ans=YES N=195
44 Correct 1 ms 604 KB ans=NO N=1934
45 Correct 1 ms 604 KB ans=NO N=1965
46 Correct 4 ms 732 KB ans=YES N=1824
47 Correct 4 ms 860 KB ans=YES N=1981
48 Correct 4 ms 600 KB ans=YES N=1814
49 Correct 4 ms 604 KB ans=YES N=1854
50 Correct 4 ms 604 KB ans=YES N=1831
51 Correct 4 ms 860 KB ans=YES N=2000
52 Correct 4 ms 860 KB ans=YES N=1847
53 Correct 4 ms 604 KB ans=YES N=1819
54 Correct 4 ms 860 KB ans=YES N=1986
55 Correct 4 ms 860 KB ans=YES N=2000
56 Correct 4 ms 604 KB ans=YES N=1834
57 Correct 4 ms 604 KB ans=YES N=1860
58 Correct 3 ms 604 KB ans=YES N=1898
59 Correct 4 ms 764 KB ans=YES N=1832
60 Correct 3 ms 860 KB ans=YES N=1929
61 Correct 4 ms 860 KB ans=YES N=1919
62 Correct 4 ms 860 KB ans=YES N=1882
63 Correct 3 ms 860 KB ans=YES N=1922
64 Correct 4 ms 860 KB ans=YES N=1989
65 Correct 4 ms 860 KB ans=YES N=1978
66 Correct 3 ms 604 KB ans=YES N=1867
67 Correct 4 ms 860 KB ans=YES N=1942
68 Correct 201 ms 13252 KB ans=NO N=66151
69 Correct 40 ms 8388 KB ans=NO N=64333
70 Correct 192 ms 13976 KB ans=YES N=69316
71 Correct 181 ms 13624 KB ans=YES N=66695
72 Correct 187 ms 13984 KB ans=YES N=68436
73 Correct 206 ms 14124 KB ans=YES N=70000
74 Correct 234 ms 14076 KB ans=YES N=68501
75 Correct 258 ms 14168 KB ans=YES N=70000
76 Correct 171 ms 13256 KB ans=YES N=65009
77 Correct 192 ms 13696 KB ans=YES N=67007
78 Correct 153 ms 13600 KB ans=YES N=66357
79 Correct 165 ms 13248 KB ans=YES N=65430
80 Correct 188 ms 13716 KB ans=YES N=65790
81 Correct 192 ms 13508 KB ans=YES N=66020
82 Correct 182 ms 13516 KB ans=YES N=65809
83 Correct 192 ms 13776 KB ans=YES N=65651
84 Correct 180 ms 14024 KB ans=YES N=68040
85 Correct 174 ms 13928 KB ans=YES N=66570
86 Correct 198 ms 13184 KB ans=YES N=65421
87 Correct 169 ms 14020 KB ans=YES N=68351
88 Correct 189 ms 13812 KB ans=YES N=67027
89 Correct 125 ms 14216 KB ans=YES N=68879
90 Correct 192 ms 13800 KB ans=YES N=67256
91 Correct 524 ms 29796 KB ans=YES N=148315
92 Correct 136 ms 18372 KB ans=NO N=142745
93 Correct 144 ms 20672 KB ans=NO N=148443
94 Correct 556 ms 31436 KB ans=YES N=148328
95 Correct 525 ms 31440 KB ans=YES N=147855
96 Correct 534 ms 32072 KB ans=YES N=150000
97 Correct 525 ms 30940 KB ans=YES N=144725
98 Correct 530 ms 31748 KB ans=YES N=149445
99 Correct 538 ms 30968 KB ans=YES N=144455
100 Correct 517 ms 30628 KB ans=YES N=143487
101 Correct 528 ms 31732 KB ans=YES N=149688
102 Correct 493 ms 30348 KB ans=YES N=141481
103 Correct 434 ms 31332 KB ans=YES N=147430
104 Correct 531 ms 30400 KB ans=YES N=142247
105 Correct 545 ms 32156 KB ans=YES N=149941
106 Correct 370 ms 30656 KB ans=YES N=141635
107 Correct 443 ms 30400 KB ans=YES N=142896
108 Correct 478 ms 29936 KB ans=YES N=142069
109 Correct 494 ms 29636 KB ans=YES N=142378
110 Correct 453 ms 31984 KB ans=YES N=150000
111 Correct 393 ms 30120 KB ans=YES N=141452
112 Correct 324 ms 28940 KB ans=YES N=134453
113 Correct 326 ms 30488 KB ans=YES N=144172

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 203 ms 13188 KB ans=NO N=66151
2 Correct 42 ms 8400 KB ans=NO N=64333
3 Incorrect 197 ms 14172 KB Contestant's solution is not lexicographically largest at index 69316 (69235 vs 52771)
4 Halted 0 ms 0 KB -

Subtask #7
0 / 19.0

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