oj.uz

Submission #1021140

# Submission time Handle Problem Language Result Execution time Memory
1021140 2024-07-12T14:46:32 Z mdn2002 Fountain Parks (IOI21_parks) C++17
25 / 100
 1291 ms 170548 KB 
/*
Mayoeba Yabureru
*/
#include "parks.h"
#include<bits/stdc++.h>
using namespace std;
static vector<int> _u, _v, _a, _b;

int construct_roads(vector<int> x, vector<int> y) {
    int n = x.size();
    vector<vector<int>> gr(n + 1);
    x.insert(x.begin(), 0);
    y.insert(y.begin(), 0);
    map<pair<int, int>, int> mp;
    map<pair<int, int>, pair<int, int>> mpp;
    for (int i = 1; i <= n; i ++) mp[{x[i], y[i]}] = i;
    vector<int> u, v, a, b;

    map<pair<int, int>, int> taken;

    for (int i = 1; i <= n; i ++) {
        if (mp[{x[i] + 2, y[i]}]) {
            u.push_back(i), v.push_back(mp[{x[i] + 2, y[i]}]);
            gr[i].push_back(mp[{x[i] + 2, y[i]}]);
            gr[mp[{x[i] + 2, y[i]}]].push_back(i);
        }
        if (mp[{x[i], y[i] + 2}]) {
            u.push_back(i), v.push_back(mp[{x[i], y[i] + 2}]);
            gr[i].push_back(mp[{x[i], y[i] + 2}]);
            gr[mp[{x[i], y[i] + 2}]].push_back(i);
        }
    }

    int num = 0, st = 0;
    vector<int> vis(n + 1);
    for (int i = 1; i <= n; i ++) {
        if (gr[i].size() == 1) {
            st = i;
            break;
        }
    }
    function<void(int)> go = [&] (int v) {
        num ++;
        vis[v] = 1;
        vector nx = {0, 2, 0, -2};
        vector ny = {2, 0, -2, 0};
        int ii = 0;
        for (int i = 0; i < 4; i ++) {
            int u = mp[{x[v] + nx[i], y[v] + ny[i]}];
            if (u == 0) continue;
            if (vis[u]) {
                ii = (i + 1) % 4;
                break;
            }
        }
        int nummmm = 10;
        while (nummmm --) {
            int i = ii;
            ii = (ii + 1) % 4;
            int u = mp[{x[v] + nx[i], y[v] + ny[i]}];
            if (u == 0 || vis[u]) continue;
            if (x[v] != x[u]) {
                int xx = v, uu = u;
                if (x[xx] > x[uu]) {
                    if (taken[{x[uu] + 1, y[uu] - 1}] == 0) {
                        mpp[{uu, xx}] = {x[uu] + 1, y[uu] - 1};
                        taken[{x[uu] + 1, y[uu] - 1}] = 1;
                    }
                    else if (taken[{x[uu] + 1, y[uu] + 1}] == 0) {
                        mpp[{uu, xx}] = {x[uu] + 1, y[uu] + 1};
                        taken[{x[uu] + 1, y[uu] + 1}] = 1;
                    }
                    else assert(0);
                }
                else {
                    if (taken[{x[xx] + 1, y[xx] + 1}] == 0) {
                        mpp[{xx, uu}] = {x[xx] + 1, y[xx] + 1};
                        taken[{x[xx] + 1, y[xx] + 1}] = 1;
                    }
                    else if (taken[{x[xx] + 1, y[xx] - 1}] == 0) {
                        mpp[{xx, uu}] = {x[xx] + 1, y[xx] - 1};
                        taken[{x[xx] + 1, y[xx] - 1}] = 1;
                    }
                    else assert(0);
                }
            }
            else {
                int xx = v, uu = u;
                if (y[xx] > y[uu]) {
                    if (taken[{x[uu] + 1, y[uu] + 1}] == 0) {
                        mpp[{uu, xx}] = {x[uu] + 1, y[uu] + 1};
                        taken[{x[uu] + 1, y[uu] + 1}] = 1;
                    }
                    else if (taken[{x[uu] - 1, y[uu] + 1}] == 0) {
                        mpp[{uu, xx}] = {x[uu] - 1, y[uu] + 1};
                        taken[{x[uu] - 1, y[uu] + 1}] = 1;
                    }
                    else assert(0);
                }
                else {
                    if (taken[{x[xx] - 1, y[xx] + 1}] == 0) {
                        mpp[{xx, uu}] = {x[xx] - 1, y[xx] + 1};
                        taken[{x[xx] - 1, y[xx] + 1}] = 1;
                    }
                    else if (taken[{x[xx] + 1, y[xx] + 1}] == 0) {
                        mpp[{xx, uu}] = {x[xx] + 1, y[xx] + 1};
                        taken[{x[xx] + 1, y[xx] + 1}] = 1;
                    }
                    else assert(0);
                }
            }
            go(u);
        }
    };
    go(st);
    for (int i = 0; i < u.size(); i ++) {
        a.push_back(mpp[{u[i], v[i]}].first);
        b.push_back(mpp[{u[i], v[i]}].second);
        u[i] --;
        v[i] --;
    }
    if (num == n) {
        build(u, v, a, b);
        return 1;
    }
    return 0;
}

Compilation message

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

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 496 ms 88384 KB Output is correct
10 Correct 27 ms 9064 KB Output is correct
11 Correct 179 ms 47792 KB Output is correct
12 Correct 44 ms 13556 KB Output is correct
13 Correct 104 ms 29428 KB Output is correct
14 Correct 2 ms 860 KB Output is correct
15 Correct 3 ms 1116 KB Output is correct
16 Correct 441 ms 82372 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 496 ms 88384 KB Output is correct
10 Correct 27 ms 9064 KB Output is correct
11 Correct 179 ms 47792 KB Output is correct
12 Correct 44 ms 13556 KB Output is correct
13 Correct 104 ms 29428 KB Output is correct
14 Correct 2 ms 860 KB Output is correct
15 Correct 3 ms 1116 KB Output is correct
16 Correct 441 ms 82372 KB Output is correct
17 Incorrect 0 ms 348 KB Solution announced impossible, but it is possible.
18 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 496 ms 88384 KB Output is correct
10 Correct 27 ms 9064 KB Output is correct
11 Correct 179 ms 47792 KB Output is correct
12 Correct 44 ms 13556 KB Output is correct
13 Correct 104 ms 29428 KB Output is correct
14 Correct 2 ms 860 KB Output is correct
15 Correct 3 ms 1116 KB Output is correct
16 Correct 441 ms 82372 KB Output is correct
17 Incorrect 0 ms 348 KB Solution announced impossible, but it is possible.
18 Halted 0 ms 0 KB -

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 496 ms 88384 KB Output is correct
10 Correct 27 ms 9064 KB Output is correct
11 Correct 179 ms 47792 KB Output is correct
12 Correct 44 ms 13556 KB Output is correct
13 Correct 104 ms 29428 KB Output is correct
14 Correct 2 ms 860 KB Output is correct
15 Correct 3 ms 1116 KB Output is correct
16 Correct 441 ms 82372 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 919 ms 164080 KB Output is correct
21 Correct 999 ms 163972 KB Output is correct
22 Correct 923 ms 160560 KB Output is correct
23 Correct 980 ms 148000 KB Output is correct
24 Correct 359 ms 47508 KB Output is correct
25 Correct 449 ms 56120 KB Output is correct
26 Correct 454 ms 56016 KB Output is correct
27 Correct 937 ms 75740 KB Output is correct
28 Correct 991 ms 76988 KB Output is correct
29 Correct 1291 ms 77104 KB Output is correct
30 Correct 1187 ms 77056 KB Output is correct
31 Correct 0 ms 344 KB Output is correct
32 Correct 45 ms 7760 KB Output is correct
33 Correct 119 ms 24736 KB Output is correct
34 Correct 1042 ms 165344 KB Output is correct
35 Correct 18 ms 3416 KB Output is correct
36 Correct 96 ms 14384 KB Output is correct
37 Correct 193 ms 27900 KB Output is correct
38 Correct 299 ms 29856 KB Output is correct
39 Correct 467 ms 40744 KB Output is correct
40 Correct 624 ms 51484 KB Output is correct
41 Correct 883 ms 62448 KB Output is correct
42 Correct 985 ms 73520 KB Output is correct
43 Correct 0 ms 344 KB Output is correct
44 Correct 0 ms 344 KB Output is correct
45 Correct 0 ms 604 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 0 ms 348 KB Output is correct
50 Correct 1 ms 348 KB Output is correct
51 Correct 0 ms 344 KB Output is correct
52 Correct 0 ms 348 KB Output is correct
53 Correct 0 ms 348 KB Output is correct
54 Correct 4 ms 1372 KB Output is correct
55 Correct 4 ms 1372 KB Output is correct
56 Correct 429 ms 63616 KB Output is correct
57 Correct 651 ms 93404 KB Output is correct
58 Correct 668 ms 81164 KB Output is correct
59 Correct 1 ms 348 KB Output is correct
60 Correct 0 ms 348 KB Output is correct
61 Correct 0 ms 348 KB Output is correct
62 Correct 1100 ms 170548 KB Output is correct
63 Correct 1057 ms 164148 KB Output is correct
64 Correct 1123 ms 166308 KB Output is correct
65 Correct 7 ms 1884 KB Output is correct
66 Correct 12 ms 2908 KB Output is correct
67 Correct 418 ms 52604 KB Output is correct
68 Correct 693 ms 92900 KB Output is correct
69 Correct 1018 ms 116840 KB Output is correct

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 496 ms 88384 KB Output is correct
10 Correct 27 ms 9064 KB Output is correct
11 Correct 179 ms 47792 KB Output is correct
12 Correct 44 ms 13556 KB Output is correct
13 Correct 104 ms 29428 KB Output is correct
14 Correct 2 ms 860 KB Output is correct
15 Correct 3 ms 1116 KB Output is correct
16 Correct 441 ms 82372 KB Output is correct
17 Incorrect 445 ms 57136 KB Solution announced impossible, but it is possible.
18 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 496 ms 88384 KB Output is correct
10 Correct 27 ms 9064 KB Output is correct
11 Correct 179 ms 47792 KB Output is correct
12 Correct 44 ms 13556 KB Output is correct
13 Correct 104 ms 29428 KB Output is correct
14 Correct 2 ms 860 KB Output is correct
15 Correct 3 ms 1116 KB Output is correct
16 Correct 441 ms 82372 KB Output is correct
17 Incorrect 0 ms 348 KB Solution announced impossible, but it is possible.
18 Halted 0 ms 0 KB -