oj.uz

Submission #810989

# Submission time Handle Problem Language Result Execution time Memory
810989 2023-08-06T19:06:07 Z treewave Building Skyscrapers (CEOI19_skyscrapers) C++17
0 / 100
 31 ms 5688 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, 0, 1, -1, 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<array<int, 3>> points_set;
    for (int i = 0; i < n; i++){
        int x, y; cin >> x >> y;
        points.push_back({x, y});
        points_set.insert({x, y, i});
    }
    set<array<int, 2>> visited;
    vector<int> ans;
    while (!points_set.empty()){
        array<int, 3> tp = *points_set.begin();
        points_set.erase(points_set.begin());
        bool good = false;
        for (int d = 0; d < 8; d++){
            if (visited.count({tp[0]+dx[d], tp[1]+dy[d]})){
                good = true;
                break;
            }
        }
        if (!good && !ans.empty()){
            cout << "NO\n";
            return 0;
        }
        visited.insert({tp[0], tp[1]});
        ans.push_back(tp[2]);
    }
    reverse(ans.begin(), ans.end());
    cout << "YES\n";
    for (int i = 0; i < n; i++){
        cout << ans[i]+1 << "\n";
    }
}

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB ans=YES N=1
2 Correct 1 ms 316 KB ans=YES N=4
3 Correct 0 ms 212 KB ans=NO N=4
4 Incorrect 0 ms 212 KB Contestant did not find solution
5 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB ans=YES N=1
2 Correct 1 ms 316 KB ans=YES N=4
3 Correct 0 ms 212 KB ans=NO N=4
4 Incorrect 0 ms 212 KB Contestant did not find solution
5 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB ans=YES N=1
2 Correct 1 ms 316 KB ans=YES N=4
3 Correct 0 ms 212 KB ans=NO N=4
4 Incorrect 0 ms 212 KB Contestant did not find solution
5 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 460 KB ans=NO N=1934
2 Correct 1 ms 468 KB ans=NO N=1965
3 Incorrect 1 ms 460 KB Contestant did not find solution
4 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB ans=YES N=1
2 Correct 1 ms 316 KB ans=YES N=4
3 Correct 0 ms 212 KB ans=NO N=4
4 Incorrect 0 ms 212 KB Contestant did not find solution
5 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 5680 KB ans=NO N=66151
2 Correct 29 ms 5080 KB ans=NO N=64333
3 Incorrect 27 ms 5688 KB Contestant did not find solution
4 Halted 0 ms 0 KB -

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 460 KB ans=NO N=1934
2 Correct 1 ms 468 KB ans=NO N=1965
3 Incorrect 1 ms 460 KB Contestant did not find solution
4 Halted 0 ms 0 KB -