oj.uz

Submission #588029

# Submission time Handle Problem Language Result Execution time Memory
588029 2022-07-02T16:16:44 Z Clan328 Fountain Parks (IOI21_parks) C++17
0 / 100
 0 ms 212 KB 
#include "parks.h"
#include <bits/stdc++.h>

using namespace std;

#define pb push_back

struct Coord {
    int x, y, i;

    bool operator<(Coord other) const  {
        if (y == other.y) {
            return x < other.x;
        }
        return y < other.y;
    }
};

int construct_roads(std::vector<int> x, std::vector<int> y) {
    if (x.size() == 1) {
        build({}, {}, {}, {});
        return 1;
    }  
    std::vector<int> u, v, a, b;

    int n = x.size();

    vector<pair<int, int>> yi(n);
    vector<Coord> coords(n);
    for (int i = 0; i < n; i++) {
        coords[i] = {x[i], y[i], i};
    }

    sort(coords.begin(), coords.end());
    bool res = true;
    for (int i = 0; i < n-1; i++) {
        if (coords[i].y+2 < coords[i+1].y) res = false;
        if (coords[i].x == coords[i+1].x) {
            u.pb(coords[i].i);
            v.pb(coords[i+1].i);
            a.pb(coords[i].x+1);
            b.pb(coords[i].y-1);
        } else if (coords[i].y == coords[i+1].y) {
            u.pb(coords[i].i);
            v.pb(coords[i+1].i);
            a.pb(coords[i].x+1);
            b.pb(coords[i].y-1);
        }
        // res &= yi[i].first+2 == yi[i+1].first;
        // u.pb(yi[i].second);
        // v.pb(yi[i+1].second);
        // a.pb(3);
        // b.pb(yi[i].first+1);
    }

    if (!res) return 0;

    
    // int maxY = 0;
    // for (int i = 0; i < y.size(); i++) maxY = max(maxY, y[i]);

    // vvi mat(maxY/2-1, vi(3)), matIdx(maxY/2-1, vi(3));
    // for (int i = 0; i < x.size(); i++) {
    //     mat[x[i]/2-1][y[i]/2-1] = 1;
    //     matIdx[x[i]/2-1][y[i]/2-1] = i;
    // }



    build(u, v, a, b);
    return 1;
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 0 ms 212 KB Tree (a[0], b[0]) = (3, 1) is not adjacent to edge between u[0]=0 @(2, 2) and v[0]=1 @(2, 4)
3 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 0 ms 212 KB Tree (a[0], b[0]) = (3, 1) is not adjacent to edge between u[0]=0 @(2, 2) and v[0]=1 @(2, 4)
3 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 0 ms 212 KB Tree (a[0], b[0]) = (3, 1) is not adjacent to edge between u[0]=0 @(2, 2) and v[0]=1 @(2, 4)
3 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 0 ms 212 KB Tree (a[0], b[0]) = (3, 1) is not adjacent to edge between u[0]=0 @(2, 2) and v[0]=1 @(2, 4)
3 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 0 ms 212 KB Tree (a[0], b[0]) = (3, 1) is not adjacent to edge between u[0]=0 @(2, 2) and v[0]=1 @(2, 4)
3 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 0 ms 212 KB Tree (a[0], b[0]) = (3, 1) is not adjacent to edge between u[0]=0 @(2, 2) and v[0]=1 @(2, 4)
3 Halted 0 ms 0 KB -