oj.uz

답안 #564834

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
564834 2022-05-19T18:55:34 Z 1zaid1 Building Skyscrapers (CEOI19_skyscrapers) C++17
0 / 100
 111 ms 9416 KB 
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define int long long
typedef long long ll;
const int M = 2e6 + 5, MOD = 1e9+7;
struct point {int x, y, i;};
bool operator<(point a, point b) {if (a.x == b.x) return a.y < b.y; return a.x < b.x;}
vector<pair<int, int>> st = {{-1, -1}, {0, -1}, {1, -1}, {1, 0}, {1, 1}, {0, 1}, {-1, 1}, {-1, 0}};

signed main() {
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    srand(time(0));
    
    int n, t, ind = 0;
    cin >> n >> t;

    vector<int> ans;
    map<int, int> ok;
    vector<point> v(n);
    for (auto&i:v) cin >> i.x >> i.y;
    for (auto [x, y, i]:v) ok[x*2e9+y] = ++ind;
    priority_queue<point> q;
    q.push(*min_element(v.begin(), v.end()));

    while (!q.empty()) {
        auto [x, y, k] = q.top(); q.pop();
        for (auto [i, j]:st) {
            if (ok[(x+i)*2e9+(y+j)]) {
                ans.push_back(ok[(x+i)*2e9+(y+j)]);
                q.push({x+i, y+j, ok[(x+i)*2e9+(y+j)]});
                ok[(x+i)*2e9+(y+j)] = 0;
            }
        }
    }

    if (ans.size() == n) {
        cout << "YES" << endl;
        for (int i:ans) cout << i << endl;
    } else cout << "NO" << endl;

    return 0;
}

/*
3 2
0 0
0 1
0 2
*/

Compilation message

skyscrapers.cpp: In function 'int main()':
skyscrapers.cpp:37: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]
   37 |     if (ans.size() == n) {
      |         ~~~~~~~~~~~^~~~

Subtask #1
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB ans=YES N=1
2 Correct 1 ms 212 KB ans=YES N=4
3 Correct 1 ms 212 KB ans=NO N=4
4 Correct 1 ms 212 KB ans=YES N=5
5 Correct 1 ms 212 KB ans=YES N=9
6 Correct 1 ms 212 KB ans=YES N=5
7 Correct 0 ms 324 KB ans=NO N=9
8 Correct 1 ms 320 KB ans=NO N=10
9 Incorrect 1 ms 320 KB Full cells must be connected
10 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB ans=YES N=1
2 Correct 1 ms 212 KB ans=YES N=4
3 Correct 1 ms 212 KB ans=NO N=4
4 Correct 1 ms 212 KB ans=YES N=5
5 Correct 1 ms 212 KB ans=YES N=9
6 Correct 1 ms 212 KB ans=YES N=5
7 Correct 0 ms 324 KB ans=NO N=9
8 Correct 1 ms 320 KB ans=NO N=10
9 Incorrect 1 ms 320 KB Full cells must be connected
10 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB ans=YES N=1
2 Correct 1 ms 212 KB ans=YES N=4
3 Correct 1 ms 212 KB ans=NO N=4
4 Correct 1 ms 212 KB ans=YES N=5
5 Correct 1 ms 212 KB ans=YES N=9
6 Correct 1 ms 212 KB ans=YES N=5
7 Correct 0 ms 324 KB ans=NO N=9
8 Correct 1 ms 320 KB ans=NO N=10
9 Incorrect 1 ms 320 KB Full cells must be connected
10 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

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

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB ans=YES N=1
2 Correct 1 ms 212 KB ans=YES N=4
3 Correct 1 ms 212 KB ans=NO N=4
4 Correct 1 ms 212 KB ans=YES N=5
5 Correct 1 ms 212 KB ans=YES N=9
6 Correct 1 ms 212 KB ans=YES N=5
7 Correct 0 ms 324 KB ans=NO N=9
8 Correct 1 ms 320 KB ans=NO N=10
9 Incorrect 1 ms 320 KB Full cells must be connected
10 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 108 ms 9416 KB ans=NO N=66151
2 Correct 30 ms 6384 KB ans=NO N=64333
3 Incorrect 111 ms 8064 KB Contestant's solution is not lexicographically largest at index 69316 (69235 vs 51657)
4 Halted 0 ms 0 KB -

Subtask #7
0 / 19.0

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