oj.uz

Submission #564843

# Submission time Handle Problem Language Result Execution time Memory
564843 2022-05-19T19:23:53 Z RealSnake Building Skyscrapers (CEOI19_skyscrapers) C++14
0 / 100
 53 ms 5608 KB 
#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;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;

#define ll long long
#define mod 1000000007

ofstream fout(".out");
ifstream fin(".in");

int n, t;
int a[150001];
bool vis[150001];
map<pair<int, int>, int> mp;
int xi[8] = {-1, -1, -1, 0, 0, 1, 1, 1};
int yi[8] = {-1, 0, 1, -1, 1, -1, 0, 1};

bool check(int x, int y) {
    return x >= 0 && x < n && y >= 0 && y < n;
}

signed main() {

    ios::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);

    cin >> n >> t;
    vector<pair<int, int>> v;
    for(int i = 0; i < n; i++) {
        int x, y;
        cin >> x >> y;
        v.push_back({x, y});
        mp[{x, y}] = i + 1;
    }
    pair<int, int> p = *max_element(v.begin(), v.end());
    priority_queue<pair<int, int>> pq;
    pq.push(p);
    vis[mp[p] - 1] = 1;
    int j = 0;
    while(!pq.empty()) {
        int x = pq.top().first, y = pq.top().second;
        pq.pop();
        a[j++] = mp[{x, y}];
        for(int i = 0; i < 8; i++) {
            int xx = x + xi[i];
            int yy = y + yi[i];
            if(check(xx, yy) && mp[{xx, yy}] && !vis[mp[{xx, yy}] - 1]) {
                vis[mp[{xx, yy}] - 1] = 1;
                pq.push({xx, yy});
            }
        }
    }
    if(j != n) {
        cout << "NO";
        return 0;
    }
    cout << "YES\n";
    for(int i = 0; i < n; i++)
        cout << a[i] << "\n";

    return 0;
}

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB ans=YES N=1
2 Correct 0 ms 212 KB ans=YES N=4
3 Correct 0 ms 340 KB ans=NO N=4
4 Incorrect 0 ms 340 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 0 ms 212 KB ans=YES N=1
2 Correct 0 ms 212 KB ans=YES N=4
3 Correct 0 ms 340 KB ans=NO N=4
4 Incorrect 0 ms 340 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 0 ms 212 KB ans=YES N=1
2 Correct 0 ms 212 KB ans=YES N=4
3 Correct 0 ms 340 KB ans=NO N=4
4 Incorrect 0 ms 340 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 468 KB ans=NO N=1934
2 Correct 1 ms 468 KB ans=NO N=1965
3 Incorrect 4 ms 468 KB Contestant's solution is not lexicographically largest at index 1824 (1813 vs 974)
4 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB ans=YES N=1
2 Correct 0 ms 212 KB ans=YES N=4
3 Correct 0 ms 340 KB ans=NO N=4
4 Incorrect 0 ms 340 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 53 ms 5608 KB ans=NO N=66151
2 Correct 39 ms 4800 KB ans=NO N=64333
3 Incorrect 34 ms 5400 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 468 KB ans=NO N=1934
2 Correct 1 ms 468 KB ans=NO N=1965
3 Incorrect 4 ms 468 KB Contestant's solution is not lexicographically largest at index 1824 (1813 vs 974)
4 Halted 0 ms 0 KB -