oj.uz

답안 #1053216

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1053216 2024-08-11T09:48:58 Z MercubytheFirst 분수 공원 (IOI21_parks) C++17
30 / 100
 318 ms 140972 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]);
    assert((int)roads.size() < n);
    if((int)roads.size() != n - 1) {
        return 0;
    }
    sort(roads.begin(), roads.end());
    map<pair<int, int>, int> taken;
    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};
        co[r.o] -= 1;
        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;
        if(!taken.count({co[0], co[1]})) {
            taken[{co[0], co[1]}] = true;
            roads[i].bench = {co[0], co[1]};
        }
        else assert(!r.o);
        // else return 0;    // for(const auto& x : roads) {
    //     cout << x.u << " -> " << x.v << endl;
    // }
    }
    const int m = roads.size();
    vector<int> ansu(m), ansv(m), ansa(m), ansb(m);
    for(int i = 0; i < m; ++i) {
        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

6
4 4
4 6
6 4
4 2
2 4
2 6

2
2 2
4 6
*/

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 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 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 114 ms 38084 KB Output is correct
10 Correct 8 ms 4180 KB Output is correct
11 Correct 53 ms 21100 KB Output is correct
12 Correct 13 ms 5968 KB Output is correct
13 Correct 21 ms 9932 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 102 ms 31276 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 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 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 114 ms 38084 KB Output is correct
10 Correct 8 ms 4180 KB Output is correct
11 Correct 53 ms 21100 KB Output is correct
12 Correct 13 ms 5968 KB Output is correct
13 Correct 21 ms 9932 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 102 ms 31276 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 0 ms 420 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 344 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 246 ms 77776 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 860 KB Output is correct
26 Correct 1 ms 860 KB Output is correct
27 Correct 1 ms 916 KB Output is correct
28 Correct 88 ms 31380 KB Output is correct
29 Correct 148 ms 46264 KB Output is correct
30 Correct 197 ms 63408 KB Output is correct
31 Correct 246 ms 79024 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 344 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 344 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 102 ms 32820 KB Output is correct
46 Correct 163 ms 49076 KB Output is correct
47 Correct 158 ms 48520 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 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 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 114 ms 38084 KB Output is correct
10 Correct 8 ms 4180 KB Output is correct
11 Correct 53 ms 21100 KB Output is correct
12 Correct 13 ms 5968 KB Output is correct
13 Correct 21 ms 9932 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 102 ms 31276 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 0 ms 420 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 344 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 246 ms 77776 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 860 KB Output is correct
26 Correct 1 ms 860 KB Output is correct
27 Correct 1 ms 916 KB Output is correct
28 Correct 88 ms 31380 KB Output is correct
29 Correct 148 ms 46264 KB Output is correct
30 Correct 197 ms 63408 KB Output is correct
31 Correct 246 ms 79024 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 344 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 344 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 102 ms 32820 KB Output is correct
46 Correct 163 ms 49076 KB Output is correct
47 Correct 158 ms 48520 KB Output is correct
48 Correct 0 ms 344 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 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 424 KB Output is correct
55 Correct 253 ms 75064 KB Output is correct
56 Correct 0 ms 344 KB Output is correct
57 Correct 1 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 110 ms 38548 KB Output is correct
61 Correct 180 ms 53484 KB Output is correct
62 Correct 201 ms 62648 KB Output is correct
63 Correct 255 ms 74676 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 348 KB Output is correct
67 Correct 246 ms 69556 KB Output is correct
68 Correct 238 ms 68788 KB Output is correct
69 Correct 237 ms 73396 KB Output is correct
70 Correct 2 ms 860 KB Output is correct
71 Correct 3 ms 1372 KB Output is correct
72 Correct 102 ms 28860 KB Output is correct
73 Correct 168 ms 47288 KB Output is correct
74 Correct 236 ms 57520 KB Output is correct
75 Correct 259 ms 72376 KB Output is correct
76 Correct 246 ms 77232 KB Output is correct
77 Correct 2 ms 1116 KB Output is correct
78 Correct 3 ms 1628 KB Output is correct
79 Correct 109 ms 29448 KB Output is correct
80 Correct 166 ms 45492 KB Output is correct
81 Correct 233 ms 60848 KB Output is correct

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 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 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 114 ms 38084 KB Output is correct
10 Correct 8 ms 4180 KB Output is correct
11 Correct 53 ms 21100 KB Output is correct
12 Correct 13 ms 5968 KB Output is correct
13 Correct 21 ms 9932 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 102 ms 31276 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 260 ms 76640 KB Output is correct
21 Correct 272 ms 72116 KB Output is correct
22 Correct 271 ms 68280 KB Output is correct
23 Correct 199 ms 56756 KB Output is correct
24 Correct 78 ms 15904 KB Output is correct
25 Correct 82 ms 16212 KB Output is correct
26 Correct 82 ms 16208 KB Output is correct
27 Correct 230 ms 46516 KB Output is correct
28 Correct 225 ms 45996 KB Output is correct
29 Correct 318 ms 47140 KB Output is correct
30 Correct 287 ms 47436 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Runtime error 11 ms 5976 KB Execution killed with signal 6
33 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 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 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 114 ms 38084 KB Output is correct
10 Correct 8 ms 4180 KB Output is correct
11 Correct 53 ms 21100 KB Output is correct
12 Correct 13 ms 5968 KB Output is correct
13 Correct 21 ms 9932 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 102 ms 31276 KB Output is correct
17 Correct 257 ms 78312 KB Output is correct
18 Correct 247 ms 65716 KB Output is correct
19 Runtime error 291 ms 140972 KB Execution killed with signal 6
20 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 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 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 114 ms 38084 KB Output is correct
10 Correct 8 ms 4180 KB Output is correct
11 Correct 53 ms 21100 KB Output is correct
12 Correct 13 ms 5968 KB Output is correct
13 Correct 21 ms 9932 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 102 ms 31276 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 0 ms 420 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 344 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 246 ms 77776 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 860 KB Output is correct
26 Correct 1 ms 860 KB Output is correct
27 Correct 1 ms 916 KB Output is correct
28 Correct 88 ms 31380 KB Output is correct
29 Correct 148 ms 46264 KB Output is correct
30 Correct 197 ms 63408 KB Output is correct
31 Correct 246 ms 79024 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 344 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 344 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 102 ms 32820 KB Output is correct
46 Correct 163 ms 49076 KB Output is correct
47 Correct 158 ms 48520 KB Output is correct
48 Correct 0 ms 344 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 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 424 KB Output is correct
55 Correct 253 ms 75064 KB Output is correct
56 Correct 0 ms 344 KB Output is correct
57 Correct 1 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 110 ms 38548 KB Output is correct
61 Correct 180 ms 53484 KB Output is correct
62 Correct 201 ms 62648 KB Output is correct
63 Correct 255 ms 74676 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 348 KB Output is correct
67 Correct 246 ms 69556 KB Output is correct
68 Correct 238 ms 68788 KB Output is correct
69 Correct 237 ms 73396 KB Output is correct
70 Correct 2 ms 860 KB Output is correct
71 Correct 3 ms 1372 KB Output is correct
72 Correct 102 ms 28860 KB Output is correct
73 Correct 168 ms 47288 KB Output is correct
74 Correct 236 ms 57520 KB Output is correct
75 Correct 259 ms 72376 KB Output is correct
76 Correct 246 ms 77232 KB Output is correct
77 Correct 2 ms 1116 KB Output is correct
78 Correct 3 ms 1628 KB Output is correct
79 Correct 109 ms 29448 KB Output is correct
80 Correct 166 ms 45492 KB Output is correct
81 Correct 233 ms 60848 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 260 ms 76640 KB Output is correct
86 Correct 272 ms 72116 KB Output is correct
87 Correct 271 ms 68280 KB Output is correct
88 Correct 199 ms 56756 KB Output is correct
89 Correct 78 ms 15904 KB Output is correct
90 Correct 82 ms 16212 KB Output is correct
91 Correct 82 ms 16208 KB Output is correct
92 Correct 230 ms 46516 KB Output is correct
93 Correct 225 ms 45996 KB Output is correct
94 Correct 318 ms 47140 KB Output is correct
95 Correct 287 ms 47436 KB Output is correct
96 Correct 0 ms 348 KB Output is correct
97 Runtime error 11 ms 5976 KB Execution killed with signal 6
98 Halted 0 ms 0 KB -