oj.uz

Submission #1048395

# Submission time Handle Problem Language Result Execution time Memory
1048395 2024-08-08T07:18:31 Z 우민규(#11036) Circle Passing (EGOI24_circlepassing) C++17
100 / 100
 150 ms 94684 KB 
#include <bits/stdc++.h>
using namespace std;

int n, m, q;


vector<int> coords;

vector<vector<pair<int, int>>> adj;
vector<int64_t> dist1, dist2;

void dijkstra(vector<int64_t>& dist, int src) {
    dist.assign(adj.size(), INT_MAX);
    dist[src] = 0;
    priority_queue<pair<int64_t, int>, vector<pair<int64_t, int>>, greater<pair<int64_t, int>>> pq;
    pq.push({0, src});
    while (!pq.empty()) {
        auto [d, u] = pq.top();
        pq.pop();
        if (dist[u] < d) continue;
        for (auto [v, w] : adj[u]) {
            if (d + w < dist[v]) {
                dist[v] = d + w;
                pq.push({d + w, v});
            }
        }
    }
}

struct ToAdjacent {
    int node0, dist0;
    int node1, dist1;
};

void solve() {
    cin >> n >> m >> q;
    adj.assign(2 * m, {});
    int fst_k = -1, lst_k = -1;
    for (int i = 0; i < m; ++i) {
        int k;
        cin >> k;
        coords.push_back(k);
        adj[i + m].push_back({i, 1});
        adj[i].push_back({i + m, 1});
        if (lst_k != -1) {
            adj[i].push_back({i - 1, k - lst_k});
            adj[i + m].push_back({i - 1 + m, k - lst_k});
            adj[i - 1].push_back({i, k - lst_k});
            adj[i - 1 + m].push_back({i + m, k - lst_k});
        }

        if (fst_k == -1) fst_k = k;
        lst_k = k;
    }
    adj[m].push_back({m - 1, fst_k + n - lst_k});
    adj[0].push_back({2 * m - 1, fst_k + n - lst_k});
    adj[m - 1].push_back({m, fst_k + n - lst_k});
    adj[2 * m - 1].push_back({0, fst_k + n - lst_k});

    for (int i = 0; i < m; ++i) coords.push_back(coords[i] + n);
    for (int i = 0; i < 2 * m; ++i) coords.push_back(coords[i] + 2 * n);

    dijkstra(dist1, 0);
    dijkstra(dist2, m);

    auto to_adjacent = [&](int x) -> ToAdjacent {
        int upper = lower_bound(coords.begin(), coords.end(), x) - coords.begin();
        int upper_dist = coords[upper] - x;
        int lower = upper - 1;
        int lower_dist = x - coords[lower];
        return {upper, upper_dist, lower, lower_dist};
    };

    while (q--) {
        int64_t x, y;
        cin >> x >> y;
        // transform into nodes
        if (x >= y) swap(x, y);
        x += n, y += n;

        int64_t ans = min(abs(y - x), abs(x + 2 * n - y));

        // node, to node dist
        ToAdjacent xx = to_adjacent(x), yy = to_adjacent(y);
        for (auto [xn, xd] : initializer_list<pair<int, int>>{{xx.node0, xx.dist0}, {xx.node1, xx.dist1}}) {
            for (auto [yn, yd] : initializer_list<pair<int, int>>{{yy.node0, yy.dist0}, {yy.node1, yy.dist1}}) {
                xn %= 2 * m, yn %= 2 * m;

                // passing through dist1 or dist2
                ans = min(ans, xd + dist1[xn] + dist1[yn] + yd);
                ans = min(ans, xd + dist2[xn] + dist2[yn] + yd);
                // not passing through dist1 or dist2
                int x_through_loc = (xn + m) % (2 * m);
                int64_t x_through_x = coords[x_through_loc];
                int64_t y_node_x = coords[yn];

                if (x_through_x >= y_node_x) swap(x_through_x, y_node_x);

                int64_t d_after_pass = min(abs(y_node_x - x_through_x), abs(x_through_x + 2 * n - y_node_x));

                ans = min(ans, xd + 1 + d_after_pass + yd);
            }
        }

        cout << ans << "\n";
    }
}

int main() {
    cin.tie(0)->sync_with_stdio(0);
    int t = 1;
    solve();
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:111:9: warning: unused variable 't' [-Wunused-variable]
  111 |     int t = 1;
      |         ^

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 348 KB Output is correct
2 Correct 4 ms 348 KB Output is correct
3 Correct 3 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 3 ms 348 KB Output is correct
6 Correct 3 ms 604 KB Output is correct
7 Correct 4 ms 604 KB Output is correct
8 Correct 4 ms 604 KB Output is correct
9 Correct 4 ms 460 KB Output is correct
10 Correct 4 ms 604 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct

Subtask #2
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 1 ms 604 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 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 344 KB Output is correct
20 Correct 0 ms 348 KB Output is correct

Subtask #3
22.0 / 22.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 1 ms 604 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 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 344 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 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 1 ms 604 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 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 1 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 1 ms 604 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 0 ms 348 KB Output is correct
45 Correct 1 ms 604 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 0 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 348 KB Output is correct
51 Correct 0 ms 348 KB Output is correct
52 Correct 0 ms 348 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 604 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 108 ms 67260 KB Output is correct
4 Correct 28 ms 15560 KB Output is correct
5 Correct 4 ms 600 KB Output is correct
6 Correct 3 ms 604 KB Output is correct
7 Correct 3 ms 604 KB Output is correct
8 Correct 4 ms 604 KB Output is correct
9 Correct 3 ms 548 KB Output is correct
10 Correct 4 ms 604 KB Output is correct
11 Correct 4 ms 588 KB Output is correct
12 Correct 4 ms 604 KB Output is correct
13 Correct 4 ms 604 KB Output is correct
14 Correct 7 ms 1884 KB Output is correct
15 Correct 98 ms 40004 KB Output is correct
16 Correct 61 ms 38400 KB Output is correct
17 Correct 144 ms 94388 KB Output is correct
18 Correct 144 ms 94684 KB Output is correct
19 Correct 0 ms 348 KB Output is correct

Subtask #5
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 348 KB Output is correct
2 Correct 4 ms 348 KB Output is correct
3 Correct 3 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 3 ms 348 KB Output is correct
6 Correct 3 ms 604 KB Output is correct
7 Correct 4 ms 604 KB Output is correct
8 Correct 4 ms 604 KB Output is correct
9 Correct 4 ms 460 KB Output is correct
10 Correct 4 ms 604 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 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 1 ms 604 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 1 ms 344 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 1 ms 604 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 0 ms 348 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 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 1 ms 348 KB Output is correct
50 Correct 0 ms 348 KB Output is correct
51 Correct 1 ms 348 KB Output is correct
52 Correct 1 ms 604 KB Output is correct
53 Correct 0 ms 348 KB Output is correct
54 Correct 0 ms 348 KB Output is correct
55 Correct 0 ms 348 KB Output is correct
56 Correct 0 ms 348 KB Output is correct
57 Correct 1 ms 604 KB Output is correct
58 Correct 0 ms 348 KB Output is correct
59 Correct 0 ms 348 KB Output is correct
60 Correct 0 ms 348 KB Output is correct
61 Correct 0 ms 348 KB Output is correct
62 Correct 0 ms 348 KB Output is correct
63 Correct 0 ms 348 KB Output is correct
64 Correct 0 ms 348 KB Output is correct
65 Correct 5 ms 604 KB Output is correct
66 Correct 0 ms 348 KB Output is correct
67 Correct 108 ms 67260 KB Output is correct
68 Correct 28 ms 15560 KB Output is correct
69 Correct 4 ms 600 KB Output is correct
70 Correct 3 ms 604 KB Output is correct
71 Correct 3 ms 604 KB Output is correct
72 Correct 4 ms 604 KB Output is correct
73 Correct 3 ms 548 KB Output is correct
74 Correct 4 ms 604 KB Output is correct
75 Correct 4 ms 588 KB Output is correct
76 Correct 4 ms 604 KB Output is correct
77 Correct 4 ms 604 KB Output is correct
78 Correct 7 ms 1884 KB Output is correct
79 Correct 98 ms 40004 KB Output is correct
80 Correct 61 ms 38400 KB Output is correct
81 Correct 144 ms 94388 KB Output is correct
82 Correct 144 ms 94684 KB Output is correct
83 Correct 0 ms 348 KB Output is correct
84 Correct 3 ms 348 KB Output is correct
85 Correct 3 ms 348 KB Output is correct
86 Correct 3 ms 344 KB Output is correct
87 Correct 0 ms 348 KB Output is correct
88 Correct 3 ms 456 KB Output is correct
89 Correct 4 ms 604 KB Output is correct
90 Correct 4 ms 604 KB Output is correct
91 Correct 4 ms 604 KB Output is correct
92 Correct 4 ms 456 KB Output is correct
93 Correct 4 ms 604 KB Output is correct
94 Correct 0 ms 348 KB Output is correct
95 Correct 0 ms 348 KB Output is correct
96 Correct 0 ms 348 KB Output is correct
97 Correct 1 ms 348 KB Output is correct
98 Correct 0 ms 348 KB Output is correct
99 Correct 0 ms 348 KB Output is correct
100 Correct 0 ms 348 KB Output is correct
101 Correct 1 ms 604 KB Output is correct
102 Correct 0 ms 348 KB Output is correct
103 Correct 0 ms 348 KB Output is correct
104 Correct 0 ms 348 KB Output is correct
105 Correct 0 ms 348 KB Output is correct
106 Correct 0 ms 348 KB Output is correct
107 Correct 0 ms 348 KB Output is correct
108 Correct 0 ms 348 KB Output is correct
109 Correct 1 ms 348 KB Output is correct
110 Correct 0 ms 348 KB Output is correct
111 Correct 1 ms 348 KB Output is correct
112 Correct 1 ms 604 KB Output is correct
113 Correct 0 ms 348 KB Output is correct
114 Correct 0 ms 348 KB Output is correct
115 Correct 0 ms 348 KB Output is correct
116 Correct 0 ms 348 KB Output is correct
117 Correct 1 ms 604 KB Output is correct
118 Correct 1 ms 344 KB Output is correct
119 Correct 0 ms 348 KB Output is correct
120 Correct 1 ms 348 KB Output is correct
121 Correct 105 ms 68148 KB Output is correct
122 Correct 28 ms 15560 KB Output is correct
123 Correct 3 ms 604 KB Output is correct
124 Correct 3 ms 604 KB Output is correct
125 Correct 3 ms 604 KB Output is correct
126 Correct 3 ms 604 KB Output is correct
127 Correct 3 ms 604 KB Output is correct
128 Correct 4 ms 604 KB Output is correct
129 Correct 4 ms 604 KB Output is correct
130 Correct 5 ms 600 KB Output is correct
131 Correct 5 ms 604 KB Output is correct
132 Correct 6 ms 1876 KB Output is correct
133 Correct 78 ms 40452 KB Output is correct
134 Correct 64 ms 37944 KB Output is correct
135 Correct 146 ms 94396 KB Output is correct
136 Correct 147 ms 94392 KB Output is correct
137 Correct 144 ms 94480 KB Output is correct
138 Correct 150 ms 94588 KB Output is correct
139 Correct 19 ms 13000 KB Output is correct
140 Correct 7 ms 5112 KB Output is correct
141 Correct 53 ms 31164 KB Output is correct
142 Correct 82 ms 43632 KB Output is correct
143 Correct 97 ms 61700 KB Output is correct
144 Correct 4 ms 600 KB Output is correct
145 Correct 4 ms 604 KB Output is correct
146 Correct 4 ms 600 KB Output is correct
147 Correct 5 ms 644 KB Output is correct
148 Correct 6 ms 728 KB Output is correct
149 Correct 4 ms 604 KB Output is correct
150 Correct 8 ms 1300 KB Output is correct
151 Correct 0 ms 348 KB Output is correct
152 Correct 0 ms 348 KB Output is correct
153 Correct 0 ms 600 KB Output is correct
154 Correct 0 ms 344 KB Output is correct
155 Correct 0 ms 348 KB Output is correct