oj.uz

답안 #1096009

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1096009 2024-10-03T14:55:18 Z yoav_s Building Skyscrapers (CEOI19_skyscrapers) C++17
22 / 100
 3500 ms 265484 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef vector<ll> v;
typedef vector<v> vv;
typedef vector<vv> vvv;
typedef pair<ll, ll> p;
typedef vector<p> vp;
typedef vector<vp> vvp;
typedef vector<vvp> vvvp;
typedef pair<ll, p> tri;
typedef vector<tri> vtri;
typedef vector<vtri> vvtri;
typedef vector<vvtri> vvvtri;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<vvb> vvvb;

#define f first
#define s second
#define pb push_back
#define pf push_front
#define eb emplace_back
#define all(v) (v).begin(),(v).end()

const ll INF = 1e18;
const ll mod = 1e9 + 7;

p getParent(p cur, vvp &dsuParent)
{
    if (dsuParent[cur.f][cur.s] == cur) return cur;
    return dsuParent[cur.f][cur.s] = getParent(dsuParent[cur.f][cur.s], dsuParent);
}

vp getNeighbors(p pos, ll maxX, ll maxY)
{
    vp neighbors; ll i = pos.f; ll j = pos.s;
    if (i - 1 >= 0)
    {
        neighbors.eb(i - 1, j);
    }
    if (i + 1 < maxX)
    {
        neighbors.eb(i + 1, j);
    }
    if (j - 1 >= 0)
    {
        neighbors.eb(i, j - 1);
    }
    if (j + 1 < maxY)
    {
        neighbors.eb(i, j + 1);
    }
    return neighbors;    
}

int main()
{
    ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
    ll n, t;
    cin >> n >> t;
    vp cells(n);
    for (ll i=  0; i < n; i++) cin >> cells[i].f >> cells[i].s;
    v relevantX, relevantY;
    for (ll i = 0; i < n; i++)
    {
        relevantX.pb(cells[i].f - 1);
        relevantX.pb(cells[i].f);
        relevantX.pb(cells[i].f + 1);
        relevantY.pb(cells[i].s - 1);
        relevantY.pb(cells[i].s);
        relevantY.pb(cells[i].s + 1);
    }
    sort(all(relevantX)); sort(all(relevantY));
    relevantX.erase(unique(all(relevantX)), relevantX.end()); relevantY.erase(unique(all(relevantY)), relevantY.end());
    map<ll, ll> xShrink;
    map<ll, ll> yShrink;
    for (ll i = 0; i < relevantX.size(); i++) xShrink[relevantX[i]] = i + 1;
    for (ll i = 0; i < relevantY.size(); i++) yShrink[relevantY[i]] = i + 1;
    for (ll i = 0; i < n; i++) cells[i] = p(xShrink[cells[i].f], yShrink[cells[i].s]);
    ll maxX = relevantX.size() + 2, maxY = relevantY.size() + 2;
    vv occupied(maxX, v(maxY, -1));
    for (ll i = 0; i < n; i++) occupied[cells[i].f][cells[i].s] = i;
    set<ll> remaining;
    deque<ll> available;
    set<ll> avSet;
    for (ll i = 0; i < n; i++) remaining.insert(i);
    v order;
    vb possible(n, false);
    vv adjacentStructures(n);
    for (ll i = 0; i < n; i++)
    {
        for (ll j = i + 1; j < n; j++)
        {
            if (abs(cells[i].f - cells[j].f) <= 1 && abs(cells[i].s - cells[j].s) <= 1)
            {
                adjacentStructures[i].pb(j);
                adjacentStructures[j].pb(i);
            }
        }
    }
    vb visited(n, false);
    stack<ll> dfs; dfs.push(0);
    ll cnt = 0;
    while (!dfs.empty())
    {
        auto top = dfs.top();
        dfs.pop();
        if (visited[top]) continue;
        visited[top] = true; cnt++;
        for (ll x : adjacentStructures[top]) dfs.push(x);
    }
    if (cnt != n)
    {
        cout << "NO\n";
        return 0;
    }
    vvp dsuParent(maxX, vp(maxY));
    for (ll i = 0; i < maxX; i++) for (ll j = 0; j < maxY; j++) dsuParent[i][j] = p(i, j);
    vv dsuSize(maxX, v(maxY, 1));
    for (ll i = 0; i < maxX; i++)
    {
        for (ll j = 0; j < maxY; j++)
        {
            if (occupied[i][j] != -1) continue;
            vp neighbors = getNeighbors(p(i, j), maxX, maxY);
            for (auto x : neighbors)
            {
                if (occupied[x.f][x.s] != -1) continue;
                p p1 = getParent(p(i, j), dsuParent), p2 = getParent(x, dsuParent);
                if (p1 == p2) continue;
                if (dsuSize[p1.f][p1.s] > dsuSize[p2.f][p2.s]) swap(p1,p2);
                dsuParent[p1.f][p1.s] = p2;
                dsuSize[p2.f][p2.s] += dsuSize[p1.f][p1.s];
            }
        }
    }
    for (ll i = 0; i < n; i++)
    {
        vp neighbors = getNeighbors(cells[i], maxX, maxY);
        bool hasNeighbor = false;
        p expected = getParent(p(0, 0), dsuParent);
        for (auto y : neighbors)
        {
            if (getParent(y, dsuParent) == expected) hasNeighbor = true;
        }
        if (hasNeighbor && avSet.count(i) == 0)
        {
            available.pf(i);
            avSet.insert(i);
        }
    }
    for (ll i = n - 1; i >= 0; i--)
    {
        v add;
        bool done = false;
        for (ll j = 0; j < available.size(); j++)
        {
            ll x = available[j];
            vp neighbors = getNeighbors(cells[x], maxX, maxY);
            if (i > 1)
            {
                vb visited(n, false);
                auto ptr = remaining.begin();
                if (*ptr == x) ptr++;
                ll start = *ptr;
                stack<ll> dfs; dfs.push(start);
                ll cnt = 0;
                while (!dfs.empty())
                {
                    auto top = dfs.top();
                    dfs.pop();
                    if (remaining.count(top) == 0 || top == x || visited[top]) continue;
                    visited[top] = true; cnt++;
                    for (ll x : adjacentStructures[top]) dfs.push(x);
                }
                if (cnt != remaining.size() - 1)
                {
                    continue;
                }
            }
            occupied[cells[x].f][cells[x].s] = -1;
            for (auto y : neighbors)
            {
                if (occupied[y.f][y.s] == -1)
                {
                    p p1 = getParent(y, dsuParent), p2 = getParent(cells[x], dsuParent);
                    if (p1 == p2) continue;
                    if (dsuSize[p1.f][p1.s] > dsuSize[p2.f][p2.s]) swap(p1,p2);
                    dsuParent[p1.f][p1.s] = p2;
                    dsuSize[p2.f][p2.s] += dsuSize[p1.f][p1.s];
                }
            }
            p expect = getParent(p(0, 0), dsuParent);
            p par = getParent(cells[x], dsuParent);
            if (par == expect)
            {
                for (auto y : neighbors)
                {
                    if (occupied[y.f][y.s] == -1)
                    {
                        vp nei = getNeighbors(y, maxX, maxY);
                        for (auto z : nei)
                        {
                            if (occupied[z.f][z.s] != -1 && avSet.count(occupied[z.f][z.s]) == 0)
                            {
                                add.pb(occupied[z.f][z.s]);
                                avSet.insert(occupied[z.f][z.s]);
                            }
                        }
                    }
                    else if (avSet.count(occupied[y.f][y.s]) == 0)
                    {
                        add.pb(occupied[y.f][y.s]);
                        avSet.insert(occupied[y.f][y.s]);
                    }
                }
            }
            remaining.erase(x);
            available.erase(available.begin() + j);
            reverse(all(add));
            for (ll x : add)
            {
                available.pf(x);
            }
            order.pb(x);
            done = true;
            break;
        }
        assert(done);
    }
    reverse(all(order));
    cout << "YES\n";
    for (ll x : order) cout << x + 1 << "\n";
    return 0;
}

Compilation message

skyscrapers.cpp: In function 'int main()':
skyscrapers.cpp:80:22: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   80 |     for (ll i = 0; i < relevantX.size(); i++) xShrink[relevantX[i]] = i + 1;
      |                    ~~^~~~~~~~~~~~~~~~~~
skyscrapers.cpp:81:22: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   81 |     for (ll i = 0; i < relevantY.size(); i++) yShrink[relevantY[i]] = i + 1;
      |                    ~~^~~~~~~~~~~~~~~~~~
skyscrapers.cpp:159:26: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::deque<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  159 |         for (ll j = 0; j < available.size(); j++)
      |                        ~~^~~~~~~~~~~~~~~~~~
skyscrapers.cpp:179:25: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::set<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  179 |                 if (cnt != remaining.size() - 1)
      |                     ~~~~^~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

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

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB ans=YES N=1
2 Correct 1 ms 348 KB ans=YES N=4
3 Correct 0 ms 348 KB ans=NO N=4
4 Correct 0 ms 348 KB ans=YES N=5
5 Correct 0 ms 348 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 1 ms 348 KB ans=YES N=10
10 Correct 0 ms 344 KB ans=YES N=10
11 Correct 1 ms 348 KB ans=YES N=10
12 Correct 0 ms 344 KB ans=YES N=9
13 Correct 0 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 348 KB ans=NO N=2
17 Correct 0 ms 348 KB ans=YES N=17
18 Correct 0 ms 348 KB ans=YES N=25
19 Correct 1 ms 500 KB ans=YES N=100
20 Correct 2 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 3 ms 348 KB ans=YES N=183
26 Correct 3 ms 344 KB ans=YES N=188
27 Correct 4 ms 348 KB ans=YES N=183
28 Correct 3 ms 348 KB ans=YES N=189
29 Correct 3 ms 348 KB ans=YES N=200
30 Correct 11 ms 344 KB ans=YES N=190
31 Correct 3 ms 536 KB ans=YES N=187
32 Correct 6 ms 348 KB ans=YES N=187
33 Correct 10 ms 348 KB ans=YES N=182
34 Correct 20 ms 344 KB ans=YES N=184
35 Correct 15 ms 604 KB ans=YES N=188
36 Correct 14 ms 568 KB ans=YES N=181
37 Correct 15 ms 348 KB ans=YES N=188
38 Correct 20 ms 604 KB ans=YES N=191
39 Correct 6 ms 348 KB ans=YES N=196
40 Correct 6 ms 344 KB ans=YES N=196
41 Correct 6 ms 528 KB ans=YES N=196
42 Correct 9 ms 348 KB ans=YES N=196
43 Correct 14 ms 600 KB ans=YES N=195

Subtask #3
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB ans=YES N=1
2 Correct 1 ms 348 KB ans=YES N=4
3 Correct 0 ms 348 KB ans=NO N=4
4 Correct 0 ms 348 KB ans=YES N=5
5 Correct 0 ms 348 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 1 ms 348 KB ans=YES N=10
10 Correct 0 ms 344 KB ans=YES N=10
11 Correct 1 ms 348 KB ans=YES N=10
12 Correct 0 ms 344 KB ans=YES N=9
13 Correct 0 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 348 KB ans=NO N=2
17 Correct 0 ms 348 KB ans=YES N=17
18 Correct 0 ms 348 KB ans=YES N=25
19 Correct 1 ms 500 KB ans=YES N=100
20 Correct 2 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 3 ms 348 KB ans=YES N=183
26 Correct 3 ms 344 KB ans=YES N=188
27 Correct 4 ms 348 KB ans=YES N=183
28 Correct 3 ms 348 KB ans=YES N=189
29 Correct 3 ms 348 KB ans=YES N=200
30 Correct 11 ms 344 KB ans=YES N=190
31 Correct 3 ms 536 KB ans=YES N=187
32 Correct 6 ms 348 KB ans=YES N=187
33 Correct 10 ms 348 KB ans=YES N=182
34 Correct 20 ms 344 KB ans=YES N=184
35 Correct 15 ms 604 KB ans=YES N=188
36 Correct 14 ms 568 KB ans=YES N=181
37 Correct 15 ms 348 KB ans=YES N=188
38 Correct 20 ms 604 KB ans=YES N=191
39 Correct 6 ms 348 KB ans=YES N=196
40 Correct 6 ms 344 KB ans=YES N=196
41 Correct 6 ms 528 KB ans=YES N=196
42 Correct 9 ms 348 KB ans=YES N=196
43 Correct 14 ms 600 KB ans=YES N=195
44 Correct 117 ms 265164 KB ans=NO N=1934
45 Correct 4 ms 860 KB ans=NO N=1965
46 Correct 539 ms 1040 KB ans=YES N=1824
47 Correct 731 ms 1064 KB ans=YES N=1981
48 Correct 534 ms 1052 KB ans=YES N=1814
49 Correct 1072 ms 1052 KB ans=YES N=1854
50 Correct 596 ms 1032 KB ans=YES N=1831
51 Correct 694 ms 1104 KB ans=YES N=2000
52 Correct 1625 ms 1060 KB ans=YES N=1847
53 Correct 2852 ms 860 KB ans=YES N=1819
54 Correct 694 ms 1072 KB ans=YES N=1986
55 Execution timed out 3561 ms 1492 KB Time limit exceeded
56 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

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

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB ans=YES N=1
2 Correct 1 ms 348 KB ans=YES N=4
3 Correct 0 ms 348 KB ans=NO N=4
4 Correct 0 ms 348 KB ans=YES N=5
5 Correct 0 ms 348 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 1 ms 348 KB ans=YES N=10
10 Correct 0 ms 344 KB ans=YES N=10
11 Correct 1 ms 348 KB ans=YES N=10
12 Correct 0 ms 344 KB ans=YES N=9
13 Correct 0 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 348 KB ans=NO N=2
17 Correct 0 ms 348 KB ans=YES N=17
18 Correct 0 ms 348 KB ans=YES N=25
19 Correct 1 ms 500 KB ans=YES N=100
20 Correct 2 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 3 ms 348 KB ans=YES N=183
26 Correct 3 ms 344 KB ans=YES N=188
27 Correct 4 ms 348 KB ans=YES N=183
28 Correct 3 ms 348 KB ans=YES N=189
29 Correct 3 ms 348 KB ans=YES N=200
30 Correct 11 ms 344 KB ans=YES N=190
31 Correct 3 ms 536 KB ans=YES N=187
32 Correct 6 ms 348 KB ans=YES N=187
33 Correct 10 ms 348 KB ans=YES N=182
34 Correct 20 ms 344 KB ans=YES N=184
35 Correct 15 ms 604 KB ans=YES N=188
36 Correct 14 ms 568 KB ans=YES N=181
37 Correct 15 ms 348 KB ans=YES N=188
38 Correct 20 ms 604 KB ans=YES N=191
39 Correct 6 ms 348 KB ans=YES N=196
40 Correct 6 ms 344 KB ans=YES N=196
41 Correct 6 ms 528 KB ans=YES N=196
42 Correct 9 ms 348 KB ans=YES N=196
43 Correct 14 ms 600 KB ans=YES N=195
44 Correct 117 ms 265164 KB ans=NO N=1934
45 Correct 4 ms 860 KB ans=NO N=1965
46 Correct 539 ms 1040 KB ans=YES N=1824
47 Correct 731 ms 1064 KB ans=YES N=1981
48 Correct 534 ms 1052 KB ans=YES N=1814
49 Correct 1072 ms 1052 KB ans=YES N=1854
50 Correct 596 ms 1032 KB ans=YES N=1831
51 Correct 694 ms 1104 KB ans=YES N=2000
52 Correct 1625 ms 1060 KB ans=YES N=1847
53 Correct 2852 ms 860 KB ans=YES N=1819
54 Correct 694 ms 1072 KB ans=YES N=1986
55 Execution timed out 3561 ms 1492 KB Time limit exceeded
56 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2901 ms 15608 KB ans=NO N=66151
2 Correct 2494 ms 17716 KB ans=NO N=64333
3 Execution timed out 3561 ms 20428 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #7
0 / 19.0

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