oj.uz

답안 #924729

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
924729 2024-02-09T15:12:02 Z Camillus Building Skyscrapers (CEOI19_skyscrapers) C++17
54 / 100
 576 ms 16668 KB 
/// @author Camillus
#include "bits/stdc++.h"

using ll = long long;
using namespace std;

struct dsu {
    vector<int> p;

    dsu() = default;
    dsu(int n) {
        p.resize(n);
        iota(p.begin(), p.end(), 0);
    }

    int get(int x) {
        if (x == p[x]) {
            return x;
        } else {
            return p[x] = get(p[x]);
        }
    }

    void join(int x, int y) {
        x = get(x);
        y = get(y);
        p[x] = y;
    }
};

auto sideN(int x, int y) {
    array<pair<int, int>, 4> result;
    result[0] = pair(x, y - 1);
    result[1] = pair(x, y + 1);
    result[2] = pair(x - 1, y);
    result[3] = pair(x + 1, y);
    return result;
}

auto sideN(const pair<int, int> &pos) {
    return sideN(pos.first, pos.second);
}

auto cornerN(int x, int y) {
    array<pair<int, int>, 8> result;
    // sides
    result[0] = pair(x, y - 1);
    result[1] = pair(x, y + 1);
    result[2] = pair(x - 1, y);
    result[3] = pair(x + 1, y);
    // corners
    result[4] = pair(x + 1, y + 1);
    result[5] = pair(x + 1, y - 1);
    result[6] = pair(x - 1, y + 1);
    result[7] = pair(x - 1, y - 1);
    return result;
}

auto cornerN(const pair<int, int> &pos) {
    return cornerN(pos.first, pos.second);
}

ll dist(const pair<int, int> &first, const pair<int, int> &second) {
    ll x = first.first - second.first;
    ll y = first.second - second.second;
    return x * x + y * y;
}

mt19937 rnd(228);

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    
    int n, t;
    cin >> n >> t;

    vector<pair<int, int>> a(n);
    map<pair<int, int>, int> b;

    for (int i = 0; i < n; i++) {
        int r, c;
        cin >> r >> c;

        a[i] = pair(r, c);
        b[pair(r, c)] = i;
    }

    dsu D(n);

    for (auto [pos_u, u] : b) {
        for (auto pos_v : cornerN(pos_u)) {
            if (b.count(pos_v)) {
                int v = b[pos_v];
                D.join(u, v);
            }
        }
    }

    for (int u = 0; u < n; u++) {
        if (D.get(u) != D.get(0)) {
            cout << "NO\n";
            return 0;
        }
    }

    cout << "YES\n";

    vector<int> ans;

    int start = rnd() % n;

    vector<bool> used(n);
    set<pair<int, int>> Q; 
    used[start] = true;
    Q.emplace(0, start);

    while (!Q.empty()) {
        int u = Q.begin()->second;
        ans.push_back(u);
        Q.erase(Q.begin());

        auto pos_u = a[u];

        for (auto pos_v : cornerN(pos_u)) {
            if (b.count(pos_v)) {
                int v = b[pos_v];
                if (!used[v]) {
                    used[v] = true;
                    Q.emplace(dist(pos_v, a[start]), v);
                }
            }
        }
    }

    for (int i = 0; i < n; i++) {
        cout << ans[i] + 1 << '\n';
    }
    return 0;
}

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 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 0 ms 456 KB ans=YES N=9
6 Correct 0 ms 348 KB ans=YES N=5
7 Correct 0 ms 348 KB ans=NO N=9
8 Correct 0 ms 348 KB ans=NO N=10
9 Correct 0 ms 348 KB ans=YES N=10
10 Correct 0 ms 348 KB ans=YES N=10
11 Correct 0 ms 348 KB ans=YES N=10
12 Correct 0 ms 348 KB ans=YES N=9
13 Correct 0 ms 348 KB ans=YES N=9
14 Correct 0 ms 344 KB ans=YES N=8
15 Correct 0 ms 348 KB ans=YES N=8
16 Correct 0 ms 344 KB ans=NO N=2

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 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 0 ms 456 KB ans=YES N=9
6 Correct 0 ms 348 KB ans=YES N=5
7 Correct 0 ms 348 KB ans=NO N=9
8 Correct 0 ms 348 KB ans=NO N=10
9 Correct 0 ms 348 KB ans=YES N=10
10 Correct 0 ms 348 KB ans=YES N=10
11 Correct 0 ms 348 KB ans=YES N=10
12 Correct 0 ms 348 KB ans=YES N=9
13 Correct 0 ms 348 KB ans=YES N=9
14 Correct 0 ms 344 KB ans=YES N=8
15 Correct 0 ms 348 KB ans=YES N=8
16 Correct 0 ms 344 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 0 ms 348 KB ans=NO N=174
22 Correct 1 ms 348 KB ans=YES N=90
23 Correct 0 ms 344 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 456 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 348 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 348 KB ans=YES N=196
41 Correct 1 ms 344 KB ans=YES N=196
42 Correct 1 ms 344 KB ans=YES N=196
43 Correct 1 ms 356 KB ans=YES N=195

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 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 0 ms 456 KB ans=YES N=9
6 Correct 0 ms 348 KB ans=YES N=5
7 Correct 0 ms 348 KB ans=NO N=9
8 Correct 0 ms 348 KB ans=NO N=10
9 Correct 0 ms 348 KB ans=YES N=10
10 Correct 0 ms 348 KB ans=YES N=10
11 Correct 0 ms 348 KB ans=YES N=10
12 Correct 0 ms 348 KB ans=YES N=9
13 Correct 0 ms 348 KB ans=YES N=9
14 Correct 0 ms 344 KB ans=YES N=8
15 Correct 0 ms 348 KB ans=YES N=8
16 Correct 0 ms 344 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 0 ms 348 KB ans=NO N=174
22 Correct 1 ms 348 KB ans=YES N=90
23 Correct 0 ms 344 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 456 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 348 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 348 KB ans=YES N=196
41 Correct 1 ms 344 KB ans=YES N=196
42 Correct 1 ms 344 KB ans=YES N=196
43 Correct 1 ms 356 KB ans=YES N=195
44 Correct 2 ms 604 KB ans=NO N=1934
45 Correct 2 ms 604 KB ans=NO N=1965
46 Correct 5 ms 604 KB ans=YES N=1824
47 Correct 5 ms 604 KB ans=YES N=1981
48 Correct 5 ms 600 KB ans=YES N=1814
49 Correct 4 ms 604 KB ans=YES N=1854
50 Correct 5 ms 604 KB ans=YES N=1831
51 Correct 5 ms 604 KB ans=YES N=2000
52 Correct 5 ms 604 KB ans=YES N=1847
53 Correct 4 ms 604 KB ans=YES N=1819
54 Correct 5 ms 604 KB ans=YES N=1986
55 Correct 4 ms 604 KB ans=YES N=2000
56 Correct 3 ms 604 KB ans=YES N=1834
57 Correct 4 ms 604 KB ans=YES N=1860
58 Correct 4 ms 568 KB ans=YES N=1898
59 Correct 5 ms 600 KB ans=YES N=1832
60 Correct 3 ms 604 KB ans=YES N=1929
61 Correct 4 ms 600 KB ans=YES N=1919
62 Correct 4 ms 604 KB ans=YES N=1882
63 Correct 3 ms 856 KB ans=YES N=1922
64 Correct 4 ms 600 KB ans=YES N=1989
65 Correct 3 ms 604 KB ans=YES N=1978
66 Correct 3 ms 604 KB ans=YES N=1867
67 Correct 4 ms 604 KB ans=YES N=1942

Subtask #4
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 604 KB ans=NO N=1934
2 Correct 2 ms 424 KB ans=NO N=1965
3 Incorrect 5 ms 604 KB Contestant's solution is not lexicographically largest at index 1824 (1813 vs 1808)
4 Halted 0 ms 0 KB -

Subtask #5
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 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 0 ms 456 KB ans=YES N=9
6 Correct 0 ms 348 KB ans=YES N=5
7 Correct 0 ms 348 KB ans=NO N=9
8 Correct 0 ms 348 KB ans=NO N=10
9 Correct 0 ms 348 KB ans=YES N=10
10 Correct 0 ms 348 KB ans=YES N=10
11 Correct 0 ms 348 KB ans=YES N=10
12 Correct 0 ms 348 KB ans=YES N=9
13 Correct 0 ms 348 KB ans=YES N=9
14 Correct 0 ms 344 KB ans=YES N=8
15 Correct 0 ms 348 KB ans=YES N=8
16 Correct 0 ms 344 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 0 ms 348 KB ans=NO N=174
22 Correct 1 ms 348 KB ans=YES N=90
23 Correct 0 ms 344 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 456 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 348 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 348 KB ans=YES N=196
41 Correct 1 ms 344 KB ans=YES N=196
42 Correct 1 ms 344 KB ans=YES N=196
43 Correct 1 ms 356 KB ans=YES N=195
44 Correct 2 ms 604 KB ans=NO N=1934
45 Correct 2 ms 604 KB ans=NO N=1965
46 Correct 5 ms 604 KB ans=YES N=1824
47 Correct 5 ms 604 KB ans=YES N=1981
48 Correct 5 ms 600 KB ans=YES N=1814
49 Correct 4 ms 604 KB ans=YES N=1854
50 Correct 5 ms 604 KB ans=YES N=1831
51 Correct 5 ms 604 KB ans=YES N=2000
52 Correct 5 ms 604 KB ans=YES N=1847
53 Correct 4 ms 604 KB ans=YES N=1819
54 Correct 5 ms 604 KB ans=YES N=1986
55 Correct 4 ms 604 KB ans=YES N=2000
56 Correct 3 ms 604 KB ans=YES N=1834
57 Correct 4 ms 604 KB ans=YES N=1860
58 Correct 4 ms 568 KB ans=YES N=1898
59 Correct 5 ms 600 KB ans=YES N=1832
60 Correct 3 ms 604 KB ans=YES N=1929
61 Correct 4 ms 600 KB ans=YES N=1919
62 Correct 4 ms 604 KB ans=YES N=1882
63 Correct 3 ms 856 KB ans=YES N=1922
64 Correct 4 ms 600 KB ans=YES N=1989
65 Correct 3 ms 604 KB ans=YES N=1978
66 Correct 3 ms 604 KB ans=YES N=1867
67 Correct 4 ms 604 KB ans=YES N=1942
68 Correct 83 ms 5716 KB ans=NO N=66151
69 Correct 54 ms 5780 KB ans=NO N=64333
70 Correct 234 ms 6812 KB ans=YES N=69316
71 Correct 212 ms 6580 KB ans=YES N=66695
72 Correct 240 ms 6856 KB ans=YES N=68436
73 Correct 227 ms 6884 KB ans=YES N=70000
74 Correct 213 ms 6840 KB ans=YES N=68501
75 Correct 218 ms 6896 KB ans=YES N=70000
76 Correct 195 ms 6504 KB ans=YES N=65009
77 Correct 166 ms 6624 KB ans=YES N=67007
78 Correct 155 ms 6700 KB ans=YES N=66357
79 Correct 147 ms 6616 KB ans=YES N=65430
80 Correct 146 ms 6528 KB ans=YES N=65790
81 Correct 153 ms 6600 KB ans=YES N=66020
82 Correct 170 ms 6548 KB ans=YES N=65809
83 Correct 192 ms 6640 KB ans=YES N=65651
84 Correct 147 ms 6860 KB ans=YES N=68040
85 Correct 145 ms 6608 KB ans=YES N=66570
86 Correct 204 ms 6636 KB ans=YES N=65421
87 Correct 188 ms 6784 KB ans=YES N=68351
88 Correct 218 ms 6632 KB ans=YES N=67027
89 Correct 87 ms 7160 KB ans=YES N=68879
90 Correct 185 ms 6812 KB ans=YES N=67256
91 Correct 520 ms 14332 KB ans=YES N=148315
92 Correct 126 ms 12112 KB ans=NO N=142745
93 Correct 158 ms 14504 KB ans=NO N=148443
94 Correct 533 ms 15832 KB ans=YES N=148328
95 Correct 539 ms 16164 KB ans=YES N=147855
96 Correct 559 ms 16524 KB ans=YES N=150000
97 Correct 558 ms 15788 KB ans=YES N=144725
98 Correct 558 ms 16108 KB ans=YES N=149445
99 Correct 555 ms 15932 KB ans=YES N=144455
100 Correct 502 ms 15496 KB ans=YES N=143487
101 Correct 576 ms 16088 KB ans=YES N=149688
102 Correct 405 ms 15608 KB ans=YES N=141481
103 Correct 337 ms 16104 KB ans=YES N=147430
104 Correct 435 ms 15900 KB ans=YES N=142247
105 Correct 474 ms 16668 KB ans=YES N=149941
106 Correct 296 ms 15852 KB ans=YES N=141635
107 Correct 368 ms 15280 KB ans=YES N=142896
108 Correct 410 ms 15048 KB ans=YES N=142069
109 Correct 503 ms 14704 KB ans=YES N=142378
110 Correct 380 ms 16208 KB ans=YES N=150000
111 Correct 331 ms 15252 KB ans=YES N=141452
112 Correct 277 ms 14520 KB ans=YES N=134453
113 Correct 248 ms 16312 KB ans=YES N=144172

Subtask #6
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 96 ms 5872 KB ans=NO N=66151
2 Correct 53 ms 5524 KB ans=NO N=64333
3 Incorrect 239 ms 6956 KB Contestant's solution is not lexicographically largest at index 69316 (69235 vs 53400)
4 Halted 0 ms 0 KB -

Subtask #7
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 604 KB ans=NO N=1934
2 Correct 2 ms 424 KB ans=NO N=1965
3 Incorrect 5 ms 604 KB Contestant's solution is not lexicographically largest at index 1824 (1813 vs 1808)
4 Halted 0 ms 0 KB -