oj.uz

Submission #1053180

# Submission time Handle Problem Language Result Execution time Memory
1053180 2024-08-11T09:27:06 Z MercubytheFirst Fountain Parks (IOI21_parks) C++17
30 / 100
 311 ms 139896 KB 
#include "parks.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
template<typename T, size_t N>
std::ostream& operator<<(std::ostream& os, const std::array<T, N>& a);
template<typename T>
std::ostream& operator<<(std::ostream& os, const std::vector<T>& v);
template<typename T1, typename T2>
std::ostream& operator<<(std::ostream& os, const std::pair<T1, T2>& p);
template<typename T>
std::ostream& operator<<(std::ostream& os, const std::set<T>& s);
template<typename T, typename cmp>
std::ostream& operator<<(std::ostream& os, const std::set<T, cmp>& s);


struct Road
{
    pair<int, int> u, v, bench;
    int u_idx, v_idx, idx;
    int o;
    Road() {
        u = v = bench = {-1, -1};
        u_idx = v_idx = idx = o = -1;
    }
    Road(const pii& a, const pii& b, int a_idx, int b_idx, int j) : u(a), v(b), u_idx(a_idx), v_idx(b_idx), idx(j) {
        bench = {-1, -1};
        if(u > v) {
            swap(u, v);
            swap(u_idx, v_idx);
        }
        assert(u.first == v.first or u.second == v.second);
        if(u.first == v.first) { // vertical
            o = 0;
        }
        else { // horizontal
            o = 1;
        }
    }
    bool operator<(const Road& other) const {
        return make_pair(u, v) < make_pair(other.u, other.v);
    }
    friend ostream& operator<<(ostream& os, const Road& r) {
        os << r.u_idx << " -> " << r.v_idx << " : " << r.u << " --> " << r.v;
        return os;
    }
};

int construct_roads(vector<int> x, vector<int> y) {
    int n = x.size();
    // vector<pii> points(n);
    // for(int i = 0; i < n; ++i) {
    //     points[i] = {x[i], y[i]};
    // }
    vector<bool> vis(n);
    map<pair<int, int>, int> mp;
    for(int i = 0; i < n; ++i) {
        mp[{x[i], y[i]}] = i;
    }
    const int dx[] = {0, +2, 0, -2},
              dy[] = {+2, 0, -2, 0};
    vector<Road> roads;
    auto road_dfs = [&](auto&& dfs, int i, int j) -> void
    {
        const int idx = mp[{i, j}];
        if(vis[idx])  {
            return;
        }
        vis[idx] = true;
        for(int d = 0; d < 4; ++d) {
            const int ii = i + dx[d], jj = j + dy[d];
            auto it = mp.find({ii, jj});
            if(it != mp.end() and !vis[it->second]) {
                roads.push_back(Road({i,j}, {ii,jj}, idx, it->second, roads.size()));
                dfs(dfs, ii, jj);
            }
        }
    };
    road_dfs(road_dfs, x[0], y[0]);
    // cout << roads << endl;
    // cout <<"Roads \n";
    // for(const auto& r : roads) {
    //     cout << r.u << " --> " << r.v << endl;
    // }cout << "-------\n";
    assert((int)roads.size() < n);
    if((int)roads.size() != n - 1) {
        return 0;
    }
    sort(roads.begin(), roads.end());
    // for(const auto& x : roads) {
    //     cout << x.u << " -> " << x.v << endl;
    // }
    map<pair<int, int>, int> taken;
    const int bx[2][2] = {{-1, +1}, {-1, +1}};
    for(int i = 0; i < (int)roads.size(); ++i) {
        const Road& r = roads[i];
        array<int, 2> co{(r.u.first + r.v.first)/2, (r.u.second + r.v.second) / 2};
        // cout << r << " : " << co << " : " << r.o << endl;
        co[r.o] -= 1;
        // cout << r << " : " << co << " : " << r.o << endl;
        if(!taken.count({co[0], co[1]})) {
            taken[{co[0], co[1]}] = true;
            roads[i].bench = {co[0], co[1]};
            continue;
        }
        co[r.o] += 2;
        // cout << r << " : " << co << " : " << r.o << endl;
        if(!taken.count({co[0], co[1]})) {
            taken[{co[0], co[1]}] = true;
            roads[i].bench = {co[0], co[1]};
        }
        else assert(false);
    }
    const int m = roads.size();
    vector<int> ansu(m), ansv(m), ansa(m), ansb(m);
    for(int i = 0; i < m; ++i) {
        // cout << roads[i].u_idx << ' ' << roads[i].v_idx << ' ' << roads[i].bench << ' ' << roads[i].o << ' ' << roads[i].idx << endl;
        ansu[roads[i].idx] = roads[i].u_idx;
        ansv[roads[i].idx] = roads[i].v_idx;
        ansa[roads[i].idx] = roads[i].bench.first;
        ansb[roads[i].idx] = roads[i].bench.second;
    }
    build(ansu, ansv, ansa, ansb);
    return 1;
}




template<typename T, size_t N>
std::ostream& operator<<(std::ostream& os, const std::array<T, N>& a) {
  os << "[";
  for(size_t i = 0; i + 1 < N; ++i) {
    os << a[i] << ", ";
  }
  if(N > 0)
    os << a[N - 1];
  os << "]";
  return os;
}
 
template<typename T1, typename T2>
std::ostream& operator<<(std::ostream& os, const std::pair<T1, T2>& p) {
  os << "(" << p.first << ", " << p.second << ") ";
  return os;
}
 
template<typename T>
std::ostream& operator<<(std::ostream& os, const std::vector<T>& v) {
  os << '[';
  for(auto x : v)
    os << x << ", ";
  os << "] ";
  return os;
}
 
template<typename T>
std::ostream& operator<<(std::ostream& os, const std::set<T>& s) {
  os << "{";
  for(auto x : s)
    os << x << ", ";
  os << "} ";
  return os;
}
//
template<typename T, typename cmp>
std::ostream& operator<<(std::ostream& os, const std::set<T, cmp>& s) {
  os << "{";
  for(auto x : s)
    os << x << ", ";
  os << "} ";
  return os;
}

/*
5
4 4
4 6
6 4
4 2
2 4


2
2 2
4 6
*/

Compilation message

parks.cpp: In function 'int construct_roads(std::vector<int>, std::vector<int>)':
parks.cpp:96:15: warning: unused variable 'bx' [-Wunused-variable]
   96 |     const int bx[2][2] = {{-1, +1}, {-1, +1}};
      |               ^~

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 110 ms 38568 KB Output is correct
10 Correct 8 ms 4180 KB Output is correct
11 Correct 58 ms 21192 KB Output is correct
12 Correct 13 ms 5972 KB Output is correct
13 Correct 21 ms 9936 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 106 ms 31000 KB Output is correct

Subtask #2
10.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 110 ms 38568 KB Output is correct
10 Correct 8 ms 4180 KB Output is correct
11 Correct 58 ms 21192 KB Output is correct
12 Correct 13 ms 5972 KB Output is correct
13 Correct 21 ms 9936 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 106 ms 31000 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 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 258 ms 77492 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 832 KB Output is correct
26 Correct 1 ms 860 KB Output is correct
27 Correct 1 ms 860 KB Output is correct
28 Correct 85 ms 31932 KB Output is correct
29 Correct 135 ms 46456 KB Output is correct
30 Correct 204 ms 61964 KB Output is correct
31 Correct 252 ms 77880 KB Output is correct
32 Correct 0 ms 344 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 344 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 344 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 1 ms 552 KB Output is correct
44 Correct 1 ms 604 KB Output is correct
45 Correct 104 ms 32752 KB Output is correct
46 Correct 159 ms 49584 KB Output is correct
47 Correct 154 ms 48056 KB Output is correct

Subtask #3
15.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 110 ms 38568 KB Output is correct
10 Correct 8 ms 4180 KB Output is correct
11 Correct 58 ms 21192 KB Output is correct
12 Correct 13 ms 5972 KB Output is correct
13 Correct 21 ms 9936 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 106 ms 31000 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 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 258 ms 77492 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 832 KB Output is correct
26 Correct 1 ms 860 KB Output is correct
27 Correct 1 ms 860 KB Output is correct
28 Correct 85 ms 31932 KB Output is correct
29 Correct 135 ms 46456 KB Output is correct
30 Correct 204 ms 61964 KB Output is correct
31 Correct 252 ms 77880 KB Output is correct
32 Correct 0 ms 344 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 344 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 344 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 1 ms 552 KB Output is correct
44 Correct 1 ms 604 KB Output is correct
45 Correct 104 ms 32752 KB Output is correct
46 Correct 159 ms 49584 KB Output is correct
47 Correct 154 ms 48056 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 348 KB Output is correct
51 Correct 0 ms 348 KB Output is correct
52 Correct 0 ms 348 KB Output is correct
53 Correct 0 ms 348 KB Output is correct
54 Correct 0 ms 348 KB Output is correct
55 Correct 257 ms 74784 KB Output is correct
56 Correct 0 ms 344 KB Output is correct
57 Correct 2 ms 1116 KB Output is correct
58 Correct 5 ms 2480 KB Output is correct
59 Correct 3 ms 1628 KB Output is correct
60 Correct 114 ms 38368 KB Output is correct
61 Correct 172 ms 52908 KB Output is correct
62 Correct 220 ms 63472 KB Output is correct
63 Correct 256 ms 75160 KB Output is correct
64 Correct 0 ms 344 KB Output is correct
65 Correct 0 ms 348 KB Output is correct
66 Correct 0 ms 348 KB Output is correct
67 Correct 231 ms 68552 KB Output is correct
68 Correct 238 ms 68496 KB Output is correct
69 Correct 246 ms 73396 KB Output is correct
70 Correct 2 ms 860 KB Output is correct
71 Correct 4 ms 1372 KB Output is correct
72 Correct 111 ms 28196 KB Output is correct
73 Correct 167 ms 46252 KB Output is correct
74 Correct 235 ms 58036 KB Output is correct
75 Correct 256 ms 72268 KB Output is correct
76 Correct 245 ms 78772 KB Output is correct
77 Correct 2 ms 1112 KB Output is correct
78 Correct 3 ms 1616 KB Output is correct
79 Correct 105 ms 29328 KB Output is correct
80 Correct 160 ms 46012 KB Output is correct
81 Correct 232 ms 60848 KB Output is correct

Subtask #4
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 110 ms 38568 KB Output is correct
10 Correct 8 ms 4180 KB Output is correct
11 Correct 58 ms 21192 KB Output is correct
12 Correct 13 ms 5972 KB Output is correct
13 Correct 21 ms 9936 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 106 ms 31000 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 265 ms 77176 KB Output is correct
21 Correct 263 ms 71916 KB Output is correct
22 Correct 280 ms 67140 KB Output is correct
23 Correct 193 ms 57532 KB Output is correct
24 Correct 77 ms 15956 KB Output is correct
25 Correct 83 ms 15952 KB Output is correct
26 Correct 76 ms 16212 KB Output is correct
27 Correct 217 ms 46516 KB Output is correct
28 Correct 216 ms 46256 KB Output is correct
29 Correct 311 ms 47028 KB Output is correct
30 Correct 287 ms 47976 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Runtime error 13 ms 6016 KB Execution killed with signal 6
33 Halted 0 ms 0 KB -

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 110 ms 38568 KB Output is correct
10 Correct 8 ms 4180 KB Output is correct
11 Correct 58 ms 21192 KB Output is correct
12 Correct 13 ms 5972 KB Output is correct
13 Correct 21 ms 9936 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 106 ms 31000 KB Output is correct
17 Correct 264 ms 77364 KB Output is correct
18 Correct 243 ms 65204 KB Output is correct
19 Runtime error 264 ms 139896 KB Execution killed with signal 6
20 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 110 ms 38568 KB Output is correct
10 Correct 8 ms 4180 KB Output is correct
11 Correct 58 ms 21192 KB Output is correct
12 Correct 13 ms 5972 KB Output is correct
13 Correct 21 ms 9936 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 106 ms 31000 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 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 258 ms 77492 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 832 KB Output is correct
26 Correct 1 ms 860 KB Output is correct
27 Correct 1 ms 860 KB Output is correct
28 Correct 85 ms 31932 KB Output is correct
29 Correct 135 ms 46456 KB Output is correct
30 Correct 204 ms 61964 KB Output is correct
31 Correct 252 ms 77880 KB Output is correct
32 Correct 0 ms 344 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 344 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 344 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 1 ms 552 KB Output is correct
44 Correct 1 ms 604 KB Output is correct
45 Correct 104 ms 32752 KB Output is correct
46 Correct 159 ms 49584 KB Output is correct
47 Correct 154 ms 48056 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 348 KB Output is correct
51 Correct 0 ms 348 KB Output is correct
52 Correct 0 ms 348 KB Output is correct
53 Correct 0 ms 348 KB Output is correct
54 Correct 0 ms 348 KB Output is correct
55 Correct 257 ms 74784 KB Output is correct
56 Correct 0 ms 344 KB Output is correct
57 Correct 2 ms 1116 KB Output is correct
58 Correct 5 ms 2480 KB Output is correct
59 Correct 3 ms 1628 KB Output is correct
60 Correct 114 ms 38368 KB Output is correct
61 Correct 172 ms 52908 KB Output is correct
62 Correct 220 ms 63472 KB Output is correct
63 Correct 256 ms 75160 KB Output is correct
64 Correct 0 ms 344 KB Output is correct
65 Correct 0 ms 348 KB Output is correct
66 Correct 0 ms 348 KB Output is correct
67 Correct 231 ms 68552 KB Output is correct
68 Correct 238 ms 68496 KB Output is correct
69 Correct 246 ms 73396 KB Output is correct
70 Correct 2 ms 860 KB Output is correct
71 Correct 4 ms 1372 KB Output is correct
72 Correct 111 ms 28196 KB Output is correct
73 Correct 167 ms 46252 KB Output is correct
74 Correct 235 ms 58036 KB Output is correct
75 Correct 256 ms 72268 KB Output is correct
76 Correct 245 ms 78772 KB Output is correct
77 Correct 2 ms 1112 KB Output is correct
78 Correct 3 ms 1616 KB Output is correct
79 Correct 105 ms 29328 KB Output is correct
80 Correct 160 ms 46012 KB Output is correct
81 Correct 232 ms 60848 KB Output is correct
82 Correct 1 ms 344 KB Output is correct
83 Correct 1 ms 348 KB Output is correct
84 Correct 0 ms 348 KB Output is correct
85 Correct 265 ms 77176 KB Output is correct
86 Correct 263 ms 71916 KB Output is correct
87 Correct 280 ms 67140 KB Output is correct
88 Correct 193 ms 57532 KB Output is correct
89 Correct 77 ms 15956 KB Output is correct
90 Correct 83 ms 15952 KB Output is correct
91 Correct 76 ms 16212 KB Output is correct
92 Correct 217 ms 46516 KB Output is correct
93 Correct 216 ms 46256 KB Output is correct
94 Correct 311 ms 47028 KB Output is correct
95 Correct 287 ms 47976 KB Output is correct
96 Correct 0 ms 348 KB Output is correct
97 Runtime error 13 ms 6016 KB Execution killed with signal 6
98 Halted 0 ms 0 KB -