oj.uz

답안 #1053181

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1053181 2024-08-11T09:27:49 Z MercubytheFirst 분수 공원 (IOI21_parks) C++17
30 / 100
 329 ms 78772 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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 128 ms 37428 KB Output is correct
10 Correct 9 ms 4176 KB Output is correct
11 Correct 55 ms 21004 KB Output is correct
12 Correct 13 ms 5972 KB Output is correct
13 Correct 21 ms 9936 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 109 ms 31060 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 128 ms 37428 KB Output is correct
10 Correct 9 ms 4176 KB Output is correct
11 Correct 55 ms 21004 KB Output is correct
12 Correct 13 ms 5972 KB Output is correct
13 Correct 21 ms 9936 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 109 ms 31060 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 252 ms 77108 KB Output is correct
24 Correct 0 ms 600 KB Output is correct
25 Correct 1 ms 860 KB Output is correct
26 Correct 1 ms 932 KB Output is correct
27 Correct 1 ms 860 KB Output is correct
28 Correct 90 ms 31080 KB Output is correct
29 Correct 147 ms 46776 KB Output is correct
30 Correct 244 ms 63660 KB Output is correct
31 Correct 284 ms 77368 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 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 348 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 604 KB Output is correct
44 Correct 1 ms 604 KB Output is correct
45 Correct 112 ms 32696 KB Output is correct
46 Correct 177 ms 50064 KB Output is correct
47 Correct 183 ms 48728 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 128 ms 37428 KB Output is correct
10 Correct 9 ms 4176 KB Output is correct
11 Correct 55 ms 21004 KB Output is correct
12 Correct 13 ms 5972 KB Output is correct
13 Correct 21 ms 9936 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 109 ms 31060 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 252 ms 77108 KB Output is correct
24 Correct 0 ms 600 KB Output is correct
25 Correct 1 ms 860 KB Output is correct
26 Correct 1 ms 932 KB Output is correct
27 Correct 1 ms 860 KB Output is correct
28 Correct 90 ms 31080 KB Output is correct
29 Correct 147 ms 46776 KB Output is correct
30 Correct 244 ms 63660 KB Output is correct
31 Correct 284 ms 77368 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 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 348 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 604 KB Output is correct
44 Correct 1 ms 604 KB Output is correct
45 Correct 112 ms 32696 KB Output is correct
46 Correct 177 ms 50064 KB Output is correct
47 Correct 183 ms 48728 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 265 ms 75084 KB Output is correct
56 Correct 1 ms 348 KB Output is correct
57 Correct 3 ms 1112 KB Output is correct
58 Correct 6 ms 2544 KB Output is correct
59 Correct 4 ms 1628 KB Output is correct
60 Correct 115 ms 38588 KB Output is correct
61 Correct 168 ms 52360 KB Output is correct
62 Correct 259 ms 61608 KB Output is correct
63 Correct 295 ms 74424 KB Output is correct
64 Correct 0 ms 348 KB Output is correct
65 Correct 0 ms 348 KB Output is correct
66 Correct 0 ms 344 KB Output is correct
67 Correct 239 ms 69404 KB Output is correct
68 Correct 242 ms 70196 KB Output is correct
69 Correct 259 ms 72756 KB Output is correct
70 Correct 2 ms 1112 KB Output is correct
71 Correct 3 ms 1372 KB Output is correct
72 Correct 106 ms 29268 KB Output is correct
73 Correct 172 ms 46776 KB Output is correct
74 Correct 263 ms 57904 KB Output is correct
75 Correct 314 ms 72372 KB Output is correct
76 Correct 302 ms 78504 KB Output is correct
77 Correct 2 ms 1116 KB Output is correct
78 Correct 3 ms 1628 KB Output is correct
79 Correct 116 ms 29212 KB Output is correct
80 Correct 200 ms 46004 KB Output is correct
81 Correct 236 ms 60084 KB Output is correct

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 128 ms 37428 KB Output is correct
10 Correct 9 ms 4176 KB Output is correct
11 Correct 55 ms 21004 KB Output is correct
12 Correct 13 ms 5972 KB Output is correct
13 Correct 21 ms 9936 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 109 ms 31060 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 270 ms 77984 KB Output is correct
21 Correct 265 ms 70316 KB Output is correct
22 Correct 271 ms 67708 KB Output is correct
23 Correct 228 ms 57016 KB Output is correct
24 Correct 98 ms 15972 KB Output is correct
25 Correct 84 ms 16144 KB Output is correct
26 Correct 93 ms 16208 KB Output is correct
27 Correct 232 ms 47572 KB Output is correct
28 Correct 217 ms 47028 KB Output is correct
29 Correct 329 ms 47280 KB Output is correct
30 Correct 298 ms 47912 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Incorrect 14 ms 4380 KB Tree (a[545], b[545]) = (-1, -1) is not adjacent to edge between u[545]=1239 @(185834, 20796) and v[545]=6716 @(185836, 20796)
33 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 128 ms 37428 KB Output is correct
10 Correct 9 ms 4176 KB Output is correct
11 Correct 55 ms 21004 KB Output is correct
12 Correct 13 ms 5972 KB Output is correct
13 Correct 21 ms 9936 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 109 ms 31060 KB Output is correct
17 Correct 281 ms 78772 KB Output is correct
18 Correct 266 ms 65588 KB Output is correct
19 Incorrect 294 ms 77228 KB Tree (a[52388], b[52388]) = (-1, -1) is not adjacent to edge between u[52388]=155149 @(100000, 50002) and v[52388]=4025 @(100002, 50002)
20 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 128 ms 37428 KB Output is correct
10 Correct 9 ms 4176 KB Output is correct
11 Correct 55 ms 21004 KB Output is correct
12 Correct 13 ms 5972 KB Output is correct
13 Correct 21 ms 9936 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 109 ms 31060 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 252 ms 77108 KB Output is correct
24 Correct 0 ms 600 KB Output is correct
25 Correct 1 ms 860 KB Output is correct
26 Correct 1 ms 932 KB Output is correct
27 Correct 1 ms 860 KB Output is correct
28 Correct 90 ms 31080 KB Output is correct
29 Correct 147 ms 46776 KB Output is correct
30 Correct 244 ms 63660 KB Output is correct
31 Correct 284 ms 77368 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 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 348 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 604 KB Output is correct
44 Correct 1 ms 604 KB Output is correct
45 Correct 112 ms 32696 KB Output is correct
46 Correct 177 ms 50064 KB Output is correct
47 Correct 183 ms 48728 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 265 ms 75084 KB Output is correct
56 Correct 1 ms 348 KB Output is correct
57 Correct 3 ms 1112 KB Output is correct
58 Correct 6 ms 2544 KB Output is correct
59 Correct 4 ms 1628 KB Output is correct
60 Correct 115 ms 38588 KB Output is correct
61 Correct 168 ms 52360 KB Output is correct
62 Correct 259 ms 61608 KB Output is correct
63 Correct 295 ms 74424 KB Output is correct
64 Correct 0 ms 348 KB Output is correct
65 Correct 0 ms 348 KB Output is correct
66 Correct 0 ms 344 KB Output is correct
67 Correct 239 ms 69404 KB Output is correct
68 Correct 242 ms 70196 KB Output is correct
69 Correct 259 ms 72756 KB Output is correct
70 Correct 2 ms 1112 KB Output is correct
71 Correct 3 ms 1372 KB Output is correct
72 Correct 106 ms 29268 KB Output is correct
73 Correct 172 ms 46776 KB Output is correct
74 Correct 263 ms 57904 KB Output is correct
75 Correct 314 ms 72372 KB Output is correct
76 Correct 302 ms 78504 KB Output is correct
77 Correct 2 ms 1116 KB Output is correct
78 Correct 3 ms 1628 KB Output is correct
79 Correct 116 ms 29212 KB Output is correct
80 Correct 200 ms 46004 KB Output is correct
81 Correct 236 ms 60084 KB Output is correct
82 Correct 0 ms 348 KB Output is correct
83 Correct 0 ms 348 KB Output is correct
84 Correct 0 ms 348 KB Output is correct
85 Correct 270 ms 77984 KB Output is correct
86 Correct 265 ms 70316 KB Output is correct
87 Correct 271 ms 67708 KB Output is correct
88 Correct 228 ms 57016 KB Output is correct
89 Correct 98 ms 15972 KB Output is correct
90 Correct 84 ms 16144 KB Output is correct
91 Correct 93 ms 16208 KB Output is correct
92 Correct 232 ms 47572 KB Output is correct
93 Correct 217 ms 47028 KB Output is correct
94 Correct 329 ms 47280 KB Output is correct
95 Correct 298 ms 47912 KB Output is correct
96 Correct 0 ms 348 KB Output is correct
97 Incorrect 14 ms 4380 KB Tree (a[545], b[545]) = (-1, -1) is not adjacent to edge between u[545]=1239 @(185834, 20796) and v[545]=6716 @(185836, 20796)
98 Halted 0 ms 0 KB -