oj.uz

Submission #390337

# Submission time Handle Problem Language Result Execution time Memory
390337 2021-04-15T20:53:04 Z oleksg Robot (JOI21_ho_t4) C++14
0 / 100
 1093 ms 78804 KB 
#pragma GCC optimize("O2")
#include <fstream>
#include <string>
#include <iostream>
#include <bitset>
#include <math.h>
#include <string>
#include <algorithm>
#include <assert.h>
#include <bits/stdc++.h>
#include <vector>
#include <queue>
#include<stdio.h>
#include<ctype.h>
#define ll long long
using namespace std;


int n, m;
struct con{
    int d;
    int color;
    ll cost;
};

map<int, vector<con>> cons[100001];
map<int, ll> cost[100001];
// how much to convert all nodes of a color to some other color

map<int, ll> dist[100001];
ll dist2[100001];



int main(){
    cin.tie(0)->sync_with_stdio(0);
    cin >> n >> m;
    int one, two, three;
    ll four;
    for (int x = 0; x < m; x++){
        cin >> one >> two >> three >> four;
        cons[one - 1][three].push_back({two - 1, three, four});
        cons[two - 1][three].push_back({one - 1, three, four});
    }
    for (int x = 0; x < n; x++){
        for (auto& i : cons[x]) {
            for (auto con: i.second){
                int col =con.color;
                ll cst = con.cost;
                if (cost[x].find(col) == cost[x].end()){
                    cost[x][col] = cst;
                } else {
                    cost[x][col] += cst;
                }
            }
            dist2[x] = 1e18;
        }
    }
    priority_queue<tuple<ll, int, int>> q;
    //cost, node, color
    q.push(make_tuple(0, 0, 0));
    dist2[0] = 0;
    while(q.size() > 0){
        int node;
        ll cst;
        int color;
        tie(cst, node, color) = q.top();
        cst *= -1;
        q.pop();
        if (node == n - 1 && color == 0){
            break;
        }
        if (color != 0){
            if (cst != dist[node][color]){
                continue;
            }
            //we need to go to a node with the same color
            for (auto con: cons[node][color]){
                if (con.color == color){
                    ll ncost = cst + cost[node][color] - con.cost;
                    if (dist2[con.d] > ncost){
                        dist2[con.d] = ncost;
                        q.push(make_tuple(-1 * ncost, con.d, 0));
                    }
                }
            }
        }
        else{
            if (cst != dist2[node]){
                continue;
            }
            //there are 3 things which we can do
            for (auto& i : cons[node]) {
                for (auto con: i.second){
                    //switch everything but the connection
                    ll ncost = cst + cost[node][con.color] - con.cost;
                    if (dist2[con.d] > ncost){
                        dist2[con.d] = ncost;
                        q.push(make_tuple(-1 * ncost, con.d, 0));
                    }
                    //switch our node only
                    ncost = cst + con.cost;
                    if (dist2[con.d] > ncost){
                        dist2[con.d] = ncost;
                        q.push(make_tuple(-1 * ncost, con.d, 0));
                    }
                    //dont switch anything and make the next node switch
                    ncost = cst;
                    if (dist[con.d].find(con.color) == dist[con.d].end() || (dist[con.d][con.color] > ncost && ncost < dist2[con.d] && cost[con.d][con.color] > con.cost)){
                        dist[con.d][con.color] = ncost;
                        q.push(make_tuple(-1 * ncost, con.d, con.color));
                    }
                }
            }
        }
    }
    if (dist2[n - 1] == 1e18){
        cout << -1 << "\n";
    }
    else{
        cout << dist2[n - 1] << "\n";
    }
}

Subtask #1
0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 14412 KB Output is correct
2 Incorrect 10 ms 14368 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 195 ms 32896 KB Output is correct
2 Correct 86 ms 23952 KB Output is correct
3 Correct 130 ms 26596 KB Output is correct
4 Correct 80 ms 24920 KB Output is correct
5 Correct 1093 ms 78804 KB Output is correct
6 Correct 746 ms 68580 KB Output is correct
7 Correct 377 ms 52756 KB Output is correct
8 Correct 429 ms 47004 KB Output is correct
9 Correct 444 ms 47100 KB Output is correct
10 Correct 379 ms 45900 KB Output is correct
11 Incorrect 132 ms 31236 KB Output isn't correct

Subtask #3
0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 14412 KB Output is correct
2 Incorrect 10 ms 14368 KB Output isn't correct
3 Halted 0 ms 0 KB -