oj.uz

Submission #582501

# Submission time Handle Problem Language Result Execution time Memory
582501 2022-06-24T00:24:42 Z georgievskiy Fountain Parks (IOI21_parks) C++17
5 / 100
 512 ms 78332 KB 
#include "parks.h"
#include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;

map<pii, int> field;
vector<int> x, y, used;
vector<pii> e;
map<int, int> type;
int n;

void dfs(int v, int c) {
    if (used[v])
        return;
    used[v] = 1;
    int vx = x[v], vy = y[v];
    pii t[4] = {{vx + 2, vy}, {vx - 2, vy}, {vx, vy + 2}, {vx, vy - 2}};
    bool p0 = field.count(t[0]) && !used[field[t[0]]];
    bool p1 = field.count(t[1]) && !used[field[t[1]]];
    bool p2 = field.count(t[2]) && !used[field[t[2]]];
    bool p3 = field.count(t[3]) && !used[field[t[3]]];
    if (p0 && p1) {
        int x = field[t[0]], y =field[t[1]];
        type[e.size()] = 0; e.push_back({v, x});
        dfs(x, 1);
        type[e.size()] = 1; e.push_back({v, y});
        dfs(y, 0);
    } else if (p0) {
        int x = field[t[0]];
        type[e.size()] = c; e.push_back({v, x});
        dfs(x, !c);
    } else if (p1) {
        int y = field[t[1]];
        type[e.size()] = c; e.push_back({v, y});
        dfs(y, !c);
    }
    if (p2) {
        int u = field[t[2]];
        e.push_back({v, u});
        dfs(u, c);
    }
    if (p3) {
        int u = field[t[3]];
        e.push_back({v, u});
        dfs(u, c);
    }
}

int construct_roads(std::vector<int> X, std::vector<int> Y) {
    n = X.size(), x = X, y = Y;
    for (int i = 0; i < n; i++)
        field[{x[i], y[i]}] = i;

    used.resize(n, 0);
    dfs(0, 0);
    if (count(used.begin(), used.end(), 0))
        return 0;

    vector<int> a(e.size()), b(e.size());

    for (int i = 0; i < e.size(); i++) {
        if (type.count(i)) {
            pii p = e[i];
            pii v = {x[p.first], y[p.first]}, u = {x[p.second], y[p.second]};
            if (type[i])
                a[i] = (v.first + u.first) / 2, b[i] = v.second - 1;
            else
                a[i] = (v.first + u.first) / 2, b[i] = v.second + 1;
            field[{a[i], b[i]}] = -1;
        }
    }

    for (int i = 0; i < e.size(); i++) {
        if (!type.count(i)) {
            pii p = e[i];
            pii v = {x[p.first], y[p.first]}, u = {x[p.second], y[p.second]};

            a[i] = v.first - 1, b[i] = (v.second + u.second) / 2;
            if (field.count({a[i], b[i]}))
                a[i] += 2;

            if (field.count({a[i], b[i]}))
                return 0;
        }
    }

    vector<int> us, vs;
    for (auto p : e)
        us.push_back(p.first), vs.push_back(p.second);

    build(us, vs, a, b);

    return 1;
}

Compilation message

parks.cpp: In function 'int construct_roads(std::vector<int>, std::vector<int>)':
parks.cpp:61:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   61 |     for (int i = 0; i < e.size(); i++) {
      |                     ~~^~~~~~~~~~
parks.cpp:73:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   73 |     for (int i = 0; i < e.size(); i++) {
      |                     ~~^~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 288 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 146 ms 32260 KB Output is correct
10 Correct 12 ms 3616 KB Output is correct
11 Correct 80 ms 18048 KB Output is correct
12 Correct 19 ms 5308 KB Output is correct
13 Correct 39 ms 9804 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 151 ms 25356 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 288 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 146 ms 32260 KB Output is correct
10 Correct 12 ms 3616 KB Output is correct
11 Correct 80 ms 18048 KB Output is correct
12 Correct 19 ms 5308 KB Output is correct
13 Correct 39 ms 9804 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 151 ms 25356 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Incorrect 0 ms 212 KB Tree @(3, 5) appears more than once: for edges on positions 0 and 2
19 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 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 288 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 146 ms 32260 KB Output is correct
10 Correct 12 ms 3616 KB Output is correct
11 Correct 80 ms 18048 KB Output is correct
12 Correct 19 ms 5308 KB Output is correct
13 Correct 39 ms 9804 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 151 ms 25356 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Incorrect 0 ms 212 KB Tree @(3, 5) appears more than once: for edges on positions 0 and 2
19 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 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 288 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 146 ms 32260 KB Output is correct
10 Correct 12 ms 3616 KB Output is correct
11 Correct 80 ms 18048 KB Output is correct
12 Correct 19 ms 5308 KB Output is correct
13 Correct 39 ms 9804 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 151 ms 25356 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 304 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Incorrect 405 ms 68520 KB Solution announced impossible, but it is possible.
21 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 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 288 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 146 ms 32260 KB Output is correct
10 Correct 12 ms 3616 KB Output is correct
11 Correct 80 ms 18048 KB Output is correct
12 Correct 19 ms 5308 KB Output is correct
13 Correct 39 ms 9804 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 151 ms 25356 KB Output is correct
17 Correct 512 ms 78332 KB Output is correct
18 Correct 458 ms 66828 KB Output is correct
19 Incorrect 417 ms 69164 KB Solution announced impossible, but it is possible.
20 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 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 288 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 146 ms 32260 KB Output is correct
10 Correct 12 ms 3616 KB Output is correct
11 Correct 80 ms 18048 KB Output is correct
12 Correct 19 ms 5308 KB Output is correct
13 Correct 39 ms 9804 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 151 ms 25356 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Incorrect 0 ms 212 KB Tree @(3, 5) appears more than once: for edges on positions 0 and 2
19 Halted 0 ms 0 KB -