oj.uz

답안 #810926

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
810926 2023-08-06T17:39:13 Z treewave Building Skyscrapers (CEOI19_skyscrapers) C++17
0 / 100
 3500 ms 130504 KB 
#include <bits/stdc++.h>

using namespace std;

int dx[8] = {0, 0, 1, 1, 1, -1, -1, -1};
int dy[8] = {1, -1, 0, 1, -1, 0, 1, -1};

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int n, t; cin >> n >> t;
    vector<array<int, 2>> points;
    set<int> points_set;
    map<array<int, 2>, int> pt_to_idx;
    for (int i = 0; i < n; i++){
        int x, y; cin >> x >> y;
        points.push_back({x, y});
        points_set.insert(i);
        pt_to_idx[{x, y}] = i;
    }
    queue<int> bfs;
    bfs.push(*points_set.begin());
    set<array<int, 2>> visited;
    vector<int> ans;
    while (!bfs.empty()){
        int tp = bfs.front(); bfs.pop();
        visited.insert({points[tp][0], points[tp][1]});
        ans.push_back(tp);
        for (int d = 0; d < 8; d++){
            array<int, 2> new_pt = {points[tp][0] + dx[d], points[tp][1] + dy[d]};
            if (!visited.count(new_pt)){
                if (pt_to_idx.count(new_pt)){
                    bfs.push(pt_to_idx[new_pt]);
                }
            }
        }
    }
    if (ans.size() != n){
        cout << "NO\n";
        return 0;
    }
    cout << "YES\n";
    for (int i = 0; i < n; i++){
        cout << ans[i] + 1 << "\n";
    }
}

Compilation message

skyscrapers.cpp: In function 'int main()':
skyscrapers.cpp:39:20: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   39 |     if (ans.size() != n){
      |         ~~~~~~~~~~~^~~~

Subtask #1
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB ans=YES N=1
2 Incorrect 0 ms 212 KB Contestant did not find solution
3 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB ans=YES N=1
2 Incorrect 0 ms 212 KB Contestant did not find solution
3 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB ans=YES N=1
2 Incorrect 0 ms 212 KB Contestant did not find solution
3 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 468 KB ans=NO N=1934
2 Correct 3 ms 592 KB ans=NO N=1965
3 Execution timed out 3589 ms 130504 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB ans=YES N=1
2 Incorrect 0 ms 212 KB Contestant did not find solution
3 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 3562 ms 98688 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #7
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 468 KB ans=NO N=1934
2 Correct 3 ms 592 KB ans=NO N=1965
3 Execution timed out 3589 ms 130504 KB Time limit exceeded
4 Halted 0 ms 0 KB -