oj.uz

답안 #564552

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
564552 2022-05-19T10:55:42 Z shrimb Building Skyscrapers (CEOI19_skyscrapers) C++17
0 / 100
 293 ms 10492 KB 
#pragma GCC optimize ("Ofast")
#pragma GCC target ("avx,avx2,fma")

#include"bits/stdc++.h"
using namespace std;

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;

template<class x>
using ordered_set = tree<x, null_type,less<x>, rb_tree_tag,tree_order_statistics_node_update>;

#define int long long
#define endl '\n'
#define mod 1000000007
//\
#define mod 1686876991

int n, t;
int x[200001], y[200001];
int dx[] = {-1, 1, 0, 0, 1, 1, -1, -1};
int dy[] = {0, 0, 1, -1, 1, -1, 1, -1};
set<pair<int,int>> pts;
map<int,map<int,int>> pts2;
set<pair<int,int>> placed;
bitset<200001> taken;

signed main () {
    cin.tie(0)->sync_with_stdio(0);

    cin >> n >> t;

    for (int i = 0 ; i < n ; i++) {
        cin >> x[i] >> y[i];
        pts.insert({x[i], y[i]});
        pts2[x[i]][y[i]] = i;
    }

    if (n > 1) {
        for (int i = 0 ; i < n ; i++) {
            bool good = 0;
            for (int d = 0 ; d < 8 ; d++) {
                int u = x[i] + dx[d];
                int v = y[i] + dy[d];
                if (pts.count({u, v})) good = 1;
            }
            if (!good) {
                cout << "NO\n";
                return 0;
            }
        }
    }

    cout << "YES\n";
    set<array<int,3>> pos;
    int bx = INT_MAX, by = INT_MAX;
    int id = 0;
    for (int i = 0 ; i < n ; i++) {
        if (x[i] < bx) {
            bx = x[i], by = y[i];
            id = i;
        } else if (x[i] == bx and y[i] < by) {
            bx = x[i], by = y[i];
            id = i;
        }
    }
    pos.insert({bx, id, by});
    while (pos.size()) {
        auto [x, i, y] = *pos.begin();
        i *= -1;
        pts2[x].erase(y);
        pos.erase(pos.begin());
        cout << i + 1 << endl;
        for (int d = 0 ; d < 8 ; d++) {
            int u = x + dx[d];
            int v = y + dy[d];
            if (pts2[u].count(v)) {
                pos.insert({u, -pts2[u][v], v});
                pts2[u].erase(v);
            }
        }
    }
}

Compilation message

skyscrapers.cpp:17:1: warning: multi-line comment [-Wcomment]
   17 | //\
      | ^

Subtask #1
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB ans=YES N=1
2 Correct 0 ms 340 KB ans=YES N=4
3 Correct 0 ms 212 KB ans=NO N=4
4 Incorrect 0 ms 212 KB Integer 0 violates the range [1, 5]
5 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB ans=YES N=1
2 Correct 0 ms 340 KB ans=YES N=4
3 Correct 0 ms 212 KB ans=NO N=4
4 Incorrect 0 ms 212 KB Integer 0 violates the range [1, 5]
5 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB ans=YES N=1
2 Correct 0 ms 340 KB ans=YES N=4
3 Correct 0 ms 212 KB ans=NO N=4
4 Incorrect 0 ms 212 KB Integer 0 violates the range [1, 5]
5 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 724 KB ans=NO N=1934
2 Correct 2 ms 596 KB ans=NO N=1965
3 Incorrect 4 ms 596 KB Integer -973 violates the range [1, 1824]
4 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB ans=YES N=1
2 Correct 0 ms 340 KB ans=YES N=4
3 Correct 0 ms 212 KB ans=NO N=4
4 Incorrect 0 ms 212 KB Integer 0 violates the range [1, 5]
5 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 63 ms 9588 KB ans=NO N=66151
2 Correct 82 ms 9416 KB ans=NO N=64333
3 Incorrect 293 ms 10492 KB Integer -51179 violates the range [1, 69316]
4 Halted 0 ms 0 KB -

Subtask #7
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 724 KB ans=NO N=1934
2 Correct 2 ms 596 KB ans=NO N=1965
3 Incorrect 4 ms 596 KB Integer -973 violates the range [1, 1824]
4 Halted 0 ms 0 KB -