oj.uz

Submission #1039922

# Submission time Handle Problem Language Result Execution time Memory
1039922 2024-07-31T12:28:42 Z yanb Fountain Parks (IOI21_parks) C++17
25 / 100
 977 ms 112104 KB 
#include <bits/stdc++.h>
    
using namespace std;
    
//#define int long long
//#define pii pair<long long, long long>
#define pii pair<int, int>
#define pib pair<int, bool>
#define fi first
#define se second

void build(vector<int> u, vector<int> v, vector<int> a, vector<int> b);

void dfs(int v, vector<vector<int>> &g, vector<bool> &uu) {
    if (uu[v]) return;
    uu[v] = 1;
    for (int u : g[v]) dfs(u, g, uu);
}

void follow(int v, vector<vector<int>> &h, vector<int> &a, vector<int> &b, map<pii, int> &mid, 
vector<pii> &pm, vector<int> &x, vector<int> &y) {
    if (h[v].empty()) return;
while (h[v].size()){
    int u = h[v].back();
    //cout << "Erasing " << pm[v].fi << "," << pm[v].se << " ~ " << pm[u].fi << "," << pm[u].se << "\n";
    h[v].erase(remove(h[v].begin(), h[v].end(), u), h[v].end());
    h[u].erase(remove(h[u].begin(), h[u].end(), v), h[u].end());
    int pd = mid[{(pm[v].fi + pm[u].fi) / 2, (pm[v].se + pm[u].se) / 2}];
    a[pd] = pm[u].fi;
    b[pd] = pm[u].se;
    follow(u, h, a, b, mid, pm, x, y);
}
}

int do_tree(vector<int> x, vector<int> y) {
    int n = x.size();
    map<pii, int> id, mid;
    for (int i = 0; i < n; i++) {
        id[{x[i], y[i]}] = i;
    }

    vector<vector<int>> g(n);
    for (int i = 0; i < n; i++) {
        if (id.count({x[i] + 2, y[i]})) g[i].push_back(id[{x[i] + 2, y[i]}]);
        if (id.count({x[i] - 2, y[i]})) g[i].push_back(id[{x[i] - 2, y[i]}]);
        if (id.count({x[i], y[i] + 2})) g[i].push_back(id[{x[i], y[i] + 2}]);
        if (id.count({x[i], y[i] - 2})) g[i].push_back(id[{x[i], y[i] - 2}]);
    }

    vector<bool> uu(n);
    dfs(0, g, uu);
    for (int i = 0; i < n; i++) {
        if (!uu[i]) return 0;
    }

    vector<int> bu, bv;
    int cnt = 0;
    for (int u = 0; u < n; u++) {
        for (int v : g[u]) {
            if (v > u) {
                bv.push_back(v);
                bu.push_back(u);
                mid[{(x[v] + x[u]) / 2, (y[v] + y[u]) / 2}] = cnt;
                cnt++;
            }
        }
    }

    cnt = 0;
    map<pii, int> mp;
    vector<pii> pm;
    vector<vector<int>> h;
    for (int v = 0; v < n; v++) {
        for (int u : g[v]) {
            int xm = (x[v] + x[u]) / 2, ym = (y[v] + y[u]) / 2;
            pii p = {xm + (ym - y[v]), ym + (xm - x[v])}; 
            pii q = {xm + (ym - y[u]), ym + (xm - x[u])}; 
            if (!mp.count(p)) {
                mp[p] = cnt;
                h.push_back({});
                pm.push_back(p);
                cnt++;
            }
            if (!mp.count(q)) {
                mp[q] = cnt;
                h.push_back({});
                pm.push_back(q);
                cnt++;
            }
            h[mp[p]].push_back(mp[q]);
        }
    }
    
    for (int v = 0; v < cnt; ++v) if (h[v].size() > 2) return 0;
    
    // for (int v = 0; v < cnt; ++v) {
    //     cout << pm[v].first << " " << pm[v].second << "\n";
    //     std::cout << "Start edges" << "\n";
    //     for (int to : h[v]) std::cout << to << " ";
    //     std::cout << "\n";
    // }

    vector<int> a(n - 1), b(n - 1);
    for (int i = 0; i < cnt; i++) {
        follow(i, h, a, b, mid, pm, x, y);
    }

    build(bu, bv, a, b);

    return 1;
}

int construct_roads(vector<int> x, vector<int> y) {
    return do_tree(x, y);
}

#ifdef ONLINE_JUDGE
void build(vector<int> u, vector<int> v, vector<int> a, vector<int> b) {
    int n = u.size();
    for (int i = 0; i < n; i++) cout << u[i] << " ";
    cout << "\n";
    for (int i = 0; i < n; i++) cout << v[i] << " ";
    cout << "\n";
    for (int i = 0; i < n; i++) cout << a[i] << " ";
    cout << "\n";
    for (int i = 0; i < n; i++) cout << b[i] << " ";
    cout << "\n";
}

signed main() {
    construct_roads({2, 2, 4}, {2, 4, 2});
    //construct_roads({4, 4, 6, 4, 2}, {4, 6, 4, 2, 4});
}
#endif

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 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 313 ms 55568 KB Output is correct
10 Correct 16 ms 5816 KB Output is correct
11 Correct 133 ms 30572 KB Output is correct
12 Correct 25 ms 8732 KB Output is correct
13 Correct 28 ms 8304 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 331 ms 53552 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 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 313 ms 55568 KB Output is correct
10 Correct 16 ms 5816 KB Output is correct
11 Correct 133 ms 30572 KB Output is correct
12 Correct 25 ms 8732 KB Output is correct
13 Correct 28 ms 8304 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 331 ms 53552 KB Output is correct
17 Incorrect 0 ms 344 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 348 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 313 ms 55568 KB Output is correct
10 Correct 16 ms 5816 KB Output is correct
11 Correct 133 ms 30572 KB Output is correct
12 Correct 25 ms 8732 KB Output is correct
13 Correct 28 ms 8304 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 331 ms 53552 KB Output is correct
17 Incorrect 0 ms 344 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 348 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 313 ms 55568 KB Output is correct
10 Correct 16 ms 5816 KB Output is correct
11 Correct 133 ms 30572 KB Output is correct
12 Correct 25 ms 8732 KB Output is correct
13 Correct 28 ms 8304 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 331 ms 53552 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 712 ms 112104 KB Output is correct
21 Correct 704 ms 87484 KB Output is correct
22 Correct 700 ms 90396 KB Output is correct
23 Correct 692 ms 92332 KB Output is correct
24 Correct 177 ms 23956 KB Output is correct
25 Correct 289 ms 30260 KB Output is correct
26 Correct 256 ms 30028 KB Output is correct
27 Correct 843 ms 102180 KB Output is correct
28 Correct 868 ms 102184 KB Output is correct
29 Correct 914 ms 102180 KB Output is correct
30 Correct 977 ms 102180 KB Output is correct
31 Correct 0 ms 344 KB Output is correct
32 Correct 35 ms 6676 KB Output is correct
33 Correct 77 ms 12644 KB Output is correct
34 Correct 691 ms 106028 KB Output is correct
35 Correct 11 ms 2136 KB Output is correct
36 Correct 67 ms 7856 KB Output is correct
37 Correct 137 ms 15760 KB Output is correct
38 Correct 255 ms 33460 KB Output is correct
39 Correct 382 ms 45672 KB Output is correct
40 Correct 516 ms 58364 KB Output is correct
41 Correct 669 ms 71320 KB Output is correct
42 Correct 803 ms 82848 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 0 ms 344 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 0 ms 436 KB Output is correct
50 Correct 0 ms 432 KB Output is correct
51 Correct 0 ms 348 KB Output is correct
52 Correct 0 ms 344 KB Output is correct
53 Correct 0 ms 344 KB Output is correct
54 Correct 2 ms 604 KB Output is correct
55 Correct 2 ms 860 KB Output is correct
56 Correct 314 ms 47704 KB Output is correct
57 Correct 513 ms 67888 KB Output is correct
58 Correct 526 ms 67624 KB Output is correct
59 Correct 1 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 828 ms 108932 KB Output is correct
63 Correct 807 ms 109092 KB Output is correct
64 Correct 783 ms 109508 KB Output is correct
65 Correct 3 ms 860 KB Output is correct
66 Correct 6 ms 1628 KB Output is correct
67 Correct 339 ms 45300 KB Output is correct
68 Correct 540 ms 69144 KB Output is correct
69 Correct 807 ms 90916 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 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 313 ms 55568 KB Output is correct
10 Correct 16 ms 5816 KB Output is correct
11 Correct 133 ms 30572 KB Output is correct
12 Correct 25 ms 8732 KB Output is correct
13 Correct 28 ms 8304 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 331 ms 53552 KB Output is correct
17 Incorrect 671 ms 108808 KB Wrong answer detected in grader
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 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 313 ms 55568 KB Output is correct
10 Correct 16 ms 5816 KB Output is correct
11 Correct 133 ms 30572 KB Output is correct
12 Correct 25 ms 8732 KB Output is correct
13 Correct 28 ms 8304 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 331 ms 53552 KB Output is correct
17 Incorrect 0 ms 344 KB Solution announced impossible, but it is possible.
18 Halted 0 ms 0 KB -