oj.uz

Submission #1021376

# Submission time Handle Problem Language Result Execution time Memory
1021376 2024-07-12T17:23:03 Z mdn2002 Fountain Parks (IOI21_parks) C++17
25 / 100
 1206 ms 171880 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 = 1;
    vector<int> vis(n + 1);

    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:111:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  111 |     for (int i = 0; i < u.size(); i ++) {
      |                     ~~^~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 392 KB Output is correct
4 Correct 1 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 521 ms 82804 KB Output is correct
10 Correct 28 ms 9060 KB Output is correct
11 Correct 195 ms 47532 KB Output is correct
12 Correct 47 ms 13464 KB Output is correct
13 Correct 111 ms 28916 KB Output is correct
14 Correct 2 ms 860 KB Output is correct
15 Correct 3 ms 1116 KB Output is correct
16 Correct 491 ms 63480 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 392 KB Output is correct
4 Correct 1 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 521 ms 82804 KB Output is correct
10 Correct 28 ms 9060 KB Output is correct
11 Correct 195 ms 47532 KB Output is correct
12 Correct 47 ms 13464 KB Output is correct
13 Correct 111 ms 28916 KB Output is correct
14 Correct 2 ms 860 KB Output is correct
15 Correct 3 ms 1116 KB Output is correct
16 Correct 491 ms 63480 KB Output is correct
17 Incorrect 0 ms 344 KB a[0] = 0 is not an odd integer
18 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 392 KB Output is correct
4 Correct 1 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 521 ms 82804 KB Output is correct
10 Correct 28 ms 9060 KB Output is correct
11 Correct 195 ms 47532 KB Output is correct
12 Correct 47 ms 13464 KB Output is correct
13 Correct 111 ms 28916 KB Output is correct
14 Correct 2 ms 860 KB Output is correct
15 Correct 3 ms 1116 KB Output is correct
16 Correct 491 ms 63480 KB Output is correct
17 Incorrect 0 ms 344 KB a[0] = 0 is not an odd integer
18 Halted 0 ms 0 KB -

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 392 KB Output is correct
4 Correct 1 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 521 ms 82804 KB Output is correct
10 Correct 28 ms 9060 KB Output is correct
11 Correct 195 ms 47532 KB Output is correct
12 Correct 47 ms 13464 KB Output is correct
13 Correct 111 ms 28916 KB Output is correct
14 Correct 2 ms 860 KB Output is correct
15 Correct 3 ms 1116 KB Output is correct
16 Correct 491 ms 63480 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 975 ms 160504 KB Output is correct
21 Correct 1090 ms 143664 KB Output is correct
22 Correct 1012 ms 132620 KB Output is correct
23 Correct 989 ms 120956 KB Output is correct
24 Correct 397 ms 46388 KB Output is correct
25 Correct 504 ms 55960 KB Output is correct
26 Correct 485 ms 56080 KB Output is correct
27 Correct 1063 ms 75312 KB Output is correct
28 Correct 913 ms 75096 KB Output is correct
29 Correct 1171 ms 75284 KB Output is correct
30 Correct 1165 ms 75316 KB Output is correct
31 Correct 0 ms 344 KB Output is correct
32 Correct 47 ms 8232 KB Output is correct
33 Correct 111 ms 23360 KB Output is correct
34 Correct 1025 ms 141620 KB Output is correct
35 Correct 20 ms 3184 KB Output is correct
36 Correct 99 ms 14008 KB Output is correct
37 Correct 225 ms 26624 KB Output is correct
38 Correct 292 ms 28840 KB Output is correct
39 Correct 440 ms 39152 KB Output is correct
40 Correct 612 ms 49972 KB Output is correct
41 Correct 785 ms 60232 KB Output is correct
42 Correct 953 ms 70964 KB Output is correct
43 Correct 0 ms 344 KB Output is correct
44 Correct 0 ms 348 KB Output is correct
45 Correct 0 ms 348 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 1 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 0 ms 344 KB Output is correct
51 Correct 0 ms 344 KB Output is correct
52 Correct 0 ms 348 KB Output is correct
53 Correct 1 ms 344 KB Output is correct
54 Correct 4 ms 1624 KB Output is correct
55 Correct 5 ms 1372 KB Output is correct
56 Correct 444 ms 63556 KB Output is correct
57 Correct 702 ms 93960 KB Output is correct
58 Correct 733 ms 91672 KB Output is correct
59 Correct 0 ms 344 KB Output is correct
60 Correct 0 ms 348 KB Output is correct
61 Correct 0 ms 348 KB Output is correct
62 Correct 1148 ms 134312 KB Output is correct
63 Correct 1201 ms 141876 KB Output is correct
64 Correct 1129 ms 150840 KB Output is correct
65 Correct 7 ms 1884 KB Output is correct
66 Correct 15 ms 3012 KB Output is correct
67 Correct 445 ms 51780 KB Output is correct
68 Correct 743 ms 85736 KB Output is correct
69 Correct 1060 ms 102452 KB Output is correct

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 392 KB Output is correct
4 Correct 1 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 521 ms 82804 KB Output is correct
10 Correct 28 ms 9060 KB Output is correct
11 Correct 195 ms 47532 KB Output is correct
12 Correct 47 ms 13464 KB Output is correct
13 Correct 111 ms 28916 KB Output is correct
14 Correct 2 ms 860 KB Output is correct
15 Correct 3 ms 1116 KB Output is correct
16 Correct 491 ms 63480 KB Output is correct
17 Incorrect 1206 ms 171880 KB a[148988] = 0 is not an odd integer
18 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 392 KB Output is correct
4 Correct 1 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 521 ms 82804 KB Output is correct
10 Correct 28 ms 9060 KB Output is correct
11 Correct 195 ms 47532 KB Output is correct
12 Correct 47 ms 13464 KB Output is correct
13 Correct 111 ms 28916 KB Output is correct
14 Correct 2 ms 860 KB Output is correct
15 Correct 3 ms 1116 KB Output is correct
16 Correct 491 ms 63480 KB Output is correct
17 Incorrect 0 ms 344 KB a[0] = 0 is not an odd integer
18 Halted 0 ms 0 KB -