oj.uz

Submission #945226

# Submission time Handle Problem Language Result Execution time Memory
945226 2024-03-13T14:41:33 Z May27_th Robot (JOI21_ho_t4) C++17
100 / 100
 1048 ms 96200 KB 
#include<bits/stdc++.h>
#define taskname "A"
using namespace std;

void World_Final();
void Solve();

int main(){
    ios_base::sync_with_stdio(false); cin.tie(nullptr);
    if (fopen(taskname".in", "r")) {
        freopen(taskname".in", "r", stdin);
        freopen(taskname".out", "w", stdout);
    }
    World_Final();
}

void World_Final(){
    int Tests = 1;
    //cin >> Tests;
    for (int i = 1; i <= Tests; i ++) {
        //cout << i << "\n";
        Solve();
    }
}

const int MAXN = 1e5 + 10;
const int64_t INF = 1e18;

int N, M;
struct Edge{ int to, c, p; };
vector<Edge> G[MAXN]; map<int, int64_t> sum[MAXN], f[MAXN];
map<int, vector<pair<int, int>>> G1[MAXN];
void Solve(){
    cin >> N >> M; for (int i = 1; i <= M; i ++) {
        int u, v, c, p; cin >> u >> v >> c >> p;
        G[u].push_back({v, c, p});
        G[v].push_back({u, c, p});
        G1[u][c].push_back({v, p});
        G1[v][c].push_back({u, p});
        sum[u][c] += p;
        sum[v][c] += p;
    } f[1][0] = 0;
    priority_queue<pair<int64_t, pair<int, int>>> pq; pq.push(make_pair(0, make_pair(1, 0)));
    while (!pq.empty()) {
        int64_t d = pq.top().first;
        int u, prevc; tie(u, prevc) = pq.top().second; pq.pop();
        if (-d != f[u][prevc]) continue;

        if (prevc) {
            for (auto [v, p] : G1[u][prevc]) {
                /// Have to flip others because haven't flipped previous edge with same
                /// color c
                if (f[v].find(0) == f[v].end() || f[v][0] > f[u][prevc] + sum[u][prevc] - p) {
                    f[v][0] = f[u][prevc] + sum[u][prevc] - p;
                    pq.push(make_pair(-f[v][0], make_pair(v, 0)));
                }
            }
        } else {
            for (auto [v, c, p] : G[u]) {
                /// Flip this edge
                if (f[v].find(0) == f[v].end() || f[v][0] > f[u][0] + p) {
                    f[v][0] = f[u][0] + p;
                    pq.push(make_pair(-f[v][0], make_pair(v, 0)));
                }

                /// Flip others
                if (f[v].find(0) == f[v].end() || f[v][0] > f[u][0] + sum[u][c] - p) {
                    f[v][0] = f[u][0] + sum[u][c] - p;
                    pq.push(make_pair(-f[v][0], make_pair(v, 0)));
                }

                /// Save to flip with latter edge
                if (f[v].find(c) == f[v].end() || f[v][c] > f[u][0]) {
                    f[v][c] = f[u][0];
                    pq.push(make_pair(-f[v][c], make_pair(v, c)));
                }
            }
        }
    }
    if (f[N].find(0) == f[N].end()) cout << -1;
    else cout << f[N][0];
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:11:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   11 |         freopen(taskname".in", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:12:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   12 |         freopen(taskname".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 16732 KB Output is correct
2 Correct 4 ms 16732 KB Output is correct
3 Correct 4 ms 16904 KB Output is correct
4 Correct 4 ms 16732 KB Output is correct
5 Correct 4 ms 16732 KB Output is correct
6 Correct 4 ms 16820 KB Output is correct
7 Correct 5 ms 16984 KB Output is correct
8 Correct 4 ms 16860 KB Output is correct
9 Correct 9 ms 17500 KB Output is correct
10 Correct 6 ms 17500 KB Output is correct
11 Correct 5 ms 17244 KB Output is correct
12 Correct 5 ms 17244 KB Output is correct
13 Correct 5 ms 17244 KB Output is correct
14 Correct 5 ms 17244 KB Output is correct
15 Correct 5 ms 16988 KB Output is correct
16 Correct 6 ms 17196 KB Output is correct
17 Correct 5 ms 17244 KB Output is correct
18 Correct 4 ms 16988 KB Output is correct
19 Correct 5 ms 16988 KB Output is correct
20 Correct 5 ms 17244 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 156 ms 38232 KB Output is correct
2 Correct 68 ms 28116 KB Output is correct
3 Correct 166 ms 34504 KB Output is correct
4 Correct 87 ms 31688 KB Output is correct
5 Correct 962 ms 89652 KB Output is correct
6 Correct 755 ms 81628 KB Output is correct
7 Correct 289 ms 60832 KB Output is correct
8 Correct 350 ms 62480 KB Output is correct
9 Correct 404 ms 62472 KB Output is correct
10 Correct 282 ms 55064 KB Output is correct
11 Correct 110 ms 36688 KB Output is correct

Subtask #3
42.0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 16732 KB Output is correct
2 Correct 4 ms 16732 KB Output is correct
3 Correct 4 ms 16904 KB Output is correct
4 Correct 4 ms 16732 KB Output is correct
5 Correct 4 ms 16732 KB Output is correct
6 Correct 4 ms 16820 KB Output is correct
7 Correct 5 ms 16984 KB Output is correct
8 Correct 4 ms 16860 KB Output is correct
9 Correct 9 ms 17500 KB Output is correct
10 Correct 6 ms 17500 KB Output is correct
11 Correct 5 ms 17244 KB Output is correct
12 Correct 5 ms 17244 KB Output is correct
13 Correct 5 ms 17244 KB Output is correct
14 Correct 5 ms 17244 KB Output is correct
15 Correct 5 ms 16988 KB Output is correct
16 Correct 6 ms 17196 KB Output is correct
17 Correct 5 ms 17244 KB Output is correct
18 Correct 4 ms 16988 KB Output is correct
19 Correct 5 ms 16988 KB Output is correct
20 Correct 5 ms 17244 KB Output is correct
21 Correct 156 ms 38232 KB Output is correct
22 Correct 68 ms 28116 KB Output is correct
23 Correct 166 ms 34504 KB Output is correct
24 Correct 87 ms 31688 KB Output is correct
25 Correct 962 ms 89652 KB Output is correct
26 Correct 755 ms 81628 KB Output is correct
27 Correct 289 ms 60832 KB Output is correct
28 Correct 350 ms 62480 KB Output is correct
29 Correct 404 ms 62472 KB Output is correct
30 Correct 282 ms 55064 KB Output is correct
31 Correct 110 ms 36688 KB Output is correct
32 Correct 120 ms 31992 KB Output is correct
33 Correct 126 ms 34756 KB Output is correct
34 Correct 358 ms 57608 KB Output is correct
35 Correct 248 ms 48324 KB Output is correct
36 Correct 274 ms 54336 KB Output is correct
37 Correct 333 ms 57456 KB Output is correct
38 Correct 313 ms 66336 KB Output is correct
39 Correct 110 ms 36564 KB Output is correct
40 Correct 364 ms 63860 KB Output is correct
41 Correct 459 ms 64244 KB Output is correct
42 Correct 512 ms 70832 KB Output is correct
43 Correct 163 ms 41672 KB Output is correct
44 Correct 316 ms 48860 KB Output is correct
45 Correct 300 ms 58708 KB Output is correct
46 Correct 256 ms 58448 KB Output is correct
47 Correct 282 ms 56632 KB Output is correct
48 Correct 1048 ms 96200 KB Output is correct