oj.uz

Submission #564479

# Submission time Handle Problem Language Result Execution time Memory
564479 2022-05-19T09:34:17 Z 1zaid1 Building Skyscrapers (CEOI19_skyscrapers) C++14
0 / 100
 302 ms 483592 KB 
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define int long long
typedef long long ll;
const int M = 2e7 + 5, MOD = 1e9+7;
int vis[M], cnt;
vector<int> node[M];

struct point {int x, y, i;};

vector<int> ans;
bool ok = true;
void dfs(int s) {
    ans.push_back(s);
    vis[s] = true;
    cnt++;
    sort(node[s].rbegin(), node[s].rend());
    for (int i:node[s]) {
        if (!vis[i]) dfs(i);
        else {
            ok = false;
        }
    }
}

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

    vector<point> v(n);
    for (auto&i:v) cin >> i.x >> i.y;
    int ind = 1; for (auto&i:v) i.i = ind++;
    
    vector<point> p;
    sort(v.begin(), v.end(), [](point a, point b){if (a.y == b.y) return a.x < b.x; return a.y < b.y;});
    for (int i = 0; i < n; i++) {
        while (i < n && (!i || v[i].y == v[i-1].y)) {
            p.push_back(v[i++]);
        }

        for (int j = 1; j < p.size(); j++) {
            if (p[j-1].x+1 == p[j].x) {
                node[p[j].i].push_back(p[j-1].i);
                node[p[j-1].i].push_back(p[j].i);
            }
        }

        p.clear();
        p.push_back(v[i]);
    }

    p.clear();
    sort(v.begin(), v.end(), [](point a, point b){if (a.x == b.x) return a.y < b.y; return a.x < b.x;});
    for (int i = 0; i < n; i++) {
        while (i < n && (!i || v[i].x == v[i-1].x)) {
            p.push_back(v[i++]);
        }

        for (int j = 1; j < p.size(); j++) {
            if (p[j-1].y+1 == p[j].y) {
                node[p[j].i].push_back(p[j-1].i);
                node[p[j-1].i].push_back(p[j].i);
            }
        }

        p.clear();
        p.push_back(v[i]);
    }

    p.clear();
    sort(v.begin(), v.end(), [](point a, point b){if ((a.x+a.y) == (b.x+b.y)) return a.x < b.x; return a.x+a.y < b.x+b.y;});
    for (int i = 0; i < n; i++) {
        while (i < n && (!i || (v[i].x+v[i].y) == (v[i-1].x+v[i-1].y))) {
            p.push_back(v[i++]);
        }

        for (int j = 1; j < p.size(); j++) {
            if (p[j-1].x+1 == p[j].x) {
                node[p[j].i].push_back(p[j-1].i);
                node[p[j-1].i].push_back(p[j].i);
            }
        }

        p.clear();
        p.push_back(v[i]);
    }

    p.clear();
    sort(v.begin(), v.end(), [](point a, point b){if ((a.x-a.y) == (b.x-b.y)) return a.x < b.x; return a.x-a.y < b.x-b.y;});
    for (int i = 0; i < n; i++) {
        while (i < n && (!i || (v[i].x-v[i].y) == (v[i-1].x-v[i-1].y))) {
            p.push_back(v[i++]);
        }

        for (int j = 1; j < p.size(); j++) {
            if (p[j-1].x+1 == p[j].x) {
                node[p[j].i].push_back(p[j-1].i);
                node[p[j-1].i].push_back(p[j].i);
            }
        }

        p.clear();
        p.push_back(v[i]);
    }

    dfs(n);
    if (cnt == n && ok) {
        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:45:27: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<point>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   45 |         for (int j = 1; j < p.size(); j++) {
      |                         ~~^~~~~~~~~~
skyscrapers.cpp:63:27: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<point>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   63 |         for (int j = 1; j < p.size(); j++) {
      |                         ~~^~~~~~~~~~
skyscrapers.cpp:81:27: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<point>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   81 |         for (int j = 1; j < p.size(); j++) {
      |                         ~~^~~~~~~~~~
skyscrapers.cpp:99:27: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<point>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   99 |         for (int j = 1; j < p.size(); j++) {
      |                         ~~^~~~~~~~~~

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 224 ms 469924 KB ans=YES N=1
2 Incorrect 238 ms 469888 KB Contestant did not find solution
3 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 224 ms 469924 KB ans=YES N=1
2 Incorrect 238 ms 469888 KB Contestant did not find solution
3 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 224 ms 469924 KB ans=YES N=1
2 Incorrect 238 ms 469888 KB Contestant did not find solution
3 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 225 ms 469924 KB ans=NO N=1934
2 Correct 234 ms 470016 KB ans=NO N=1965
3 Incorrect 242 ms 470348 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 224 ms 469924 KB ans=YES N=1
2 Incorrect 238 ms 469888 KB Contestant did not find solution
3 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 296 ms 480700 KB ans=NO N=66151
2 Correct 302 ms 472316 KB ans=NO N=64333
3 Incorrect 301 ms 483592 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 225 ms 469924 KB ans=NO N=1934
2 Correct 234 ms 470016 KB ans=NO N=1965
3 Incorrect 242 ms 470348 KB Contestant did not find solution
4 Halted 0 ms 0 KB -