oj.uz

Submission #941740

# Submission time Handle Problem Language Result Execution time Memory
941740 2024-03-09T11:36:07 Z May27_th Robot (JOI21_ho_t4) C++17
0 / 100
 3000 ms 531712 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 = 2e5 + 10;
const int64_t INF = 1e18;
int N, M;
struct Road {
    int v, c, p;
    Road (int _v, int _c, int _p) : v(_v), c(_c), p(_p) {};
}; vector<Road> G[MAXN]; pair<int, int> par[MAXN]; int64_t f[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(Road(v, c, p));
        G[v].push_back(Road(u, c, p));
    }
    for (int i = 1; i <= N; i ++) { f[i] = INF; } f[1] = 0;
    priority_queue<pair<int64_t, int>> pq; pq.push(make_pair(0, 1));
    unordered_map<int, int64_t> sum, color;
    while (!pq.empty()) {
        int64_t d; int u; tie(d, u) = pq.top(); pq.pop();
        if (-d != f[u]) continue;
        sum.clear(); color.clear();
        for (auto [v, c, p] : G[u]) {
            sum[c] += p;
            color[c] ++;
        }
        for (auto [v, c, p] : G[u]) {
            int cnt = color[c] - (par[u].first == c);
            int64_t w = sum[c] - p - (par[u].first == c ? par[u].second : 0);
            if (w > p) w = p;
            if (cnt <= 1) w = 0;
            if (f[v] > f[u] + w) {
                f[v] = f[u] + w;
                pq.push(make_pair(-f[v], v));
                if(w != 0) par[v] = make_pair(c, p);
            }
        }
    }
    cout << (f[N] == INF ? -1 : f[N]);
}

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
0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 5980 KB Output is correct
2 Correct 1 ms 5980 KB Output is correct
3 Correct 1 ms 5980 KB Output is correct
4 Correct 2 ms 6228 KB Output is correct
5 Correct 2 ms 5980 KB Output is correct
6 Correct 2 ms 5976 KB Output is correct
7 Execution timed out 3107 ms 531712 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #2
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 11748 KB Output is correct
2 Correct 17 ms 7772 KB Output is correct
3 Correct 61 ms 14548 KB Output is correct
4 Correct 30 ms 11600 KB Output is correct
5 Incorrect 2191 ms 23852 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 5980 KB Output is correct
2 Correct 1 ms 5980 KB Output is correct
3 Correct 1 ms 5980 KB Output is correct
4 Correct 2 ms 6228 KB Output is correct
5 Correct 2 ms 5980 KB Output is correct
6 Correct 2 ms 5976 KB Output is correct
7 Execution timed out 3107 ms 531712 KB Time limit exceeded
8 Halted 0 ms 0 KB -