oj.uz

Submission #390327

# Submission time Handle Problem Language Result Execution time Memory
390327 2021-04-15T20:39:23 Z oleksg Robot (JOI21_ho_t4) C++14
34 / 100
 3000 ms 55500 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;


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

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

unordered_map<ll, ll> dist[100001];
ll dist2[100001];

unordered_map<ll, ll> used[100001];
//if node with color x was used

int main(){
    cin.tie(0)->sync_with_stdio(0);
    cin >> n >> m;
    ll one, two, three, four;
    for (int x = 0; x < m; x++){
        cin >> one >> two >> three >> four;
        cons[one - 1].push_back({two - 1, three, four});
        cons[two - 1].push_back({one - 1, three, four});
    }
    for (int x = 0; x < n; x++){
        for (int y = 0; y < cons[x].size(); y++){
            ll col = cons[x][y].color;
            ll cst = cons[x][y].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, ll, ll>> q;
    //cost, node, color
    q.push(make_tuple(0, 0, 0));
    dist2[0] = 0;
    while(q.size() > 0){
        ll node;
        ll cst;
        ll color;
        tie(cst, node, color) = q.top();
        cst *= -1;
        q.pop();
        if (node == n - 1 && color == 0){
            break;
        }
        if (used[node].find(color) == used[node].end()){
            used[node][color] = 1;
            if (color != 0){
                //we need to go to a node with the same color
                for (auto con: cons[node]){
                    if (con.color == color){
                        if (used[con.d].find(0) == used[con.d].end()){
                            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{
                //there are 3 things which we can do
                for (auto con: cons[node]){
                    if (used[con.d].find(0) == used[con.d].end()){
                        //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));
                        }
                    }
                    if (used[con.d].find(con.color) == used[con.d].end()){
                        //dont switch anything and make the next node switch
                        ll 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";
    }
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:46:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<con>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   46 |         for (int y = 0; y < cons[x].size(); y++){
      |                         ~~^~~~~~~~~~~~~~~~

Subtask #1
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 19020 KB Output is correct
2 Correct 14 ms 19148 KB Output is correct
3 Correct 14 ms 19108 KB Output is correct
4 Correct 14 ms 19020 KB Output is correct
5 Correct 14 ms 19144 KB Output is correct
6 Correct 14 ms 19020 KB Output is correct
7 Correct 15 ms 19276 KB Output is correct
8 Correct 14 ms 19120 KB Output is correct
9 Correct 18 ms 19660 KB Output is correct
10 Correct 17 ms 19640 KB Output is correct
11 Correct 16 ms 19492 KB Output is correct
12 Correct 16 ms 19380 KB Output is correct
13 Correct 16 ms 19508 KB Output is correct
14 Correct 16 ms 19532 KB Output is correct
15 Correct 16 ms 19404 KB Output is correct
16 Correct 17 ms 19404 KB Output is correct
17 Correct 18 ms 19404 KB Output is correct
18 Correct 15 ms 19224 KB Output is correct
19 Correct 16 ms 19412 KB Output is correct
20 Correct 16 ms 19416 KB Output is correct

Subtask #2
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 208 ms 36468 KB Output is correct
2 Correct 100 ms 28200 KB Output is correct
3 Correct 103 ms 31508 KB Output is correct
4 Correct 81 ms 28156 KB Output is correct
5 Execution timed out 3068 ms 55500 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #3
0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 19020 KB Output is correct
2 Correct 14 ms 19148 KB Output is correct
3 Correct 14 ms 19108 KB Output is correct
4 Correct 14 ms 19020 KB Output is correct
5 Correct 14 ms 19144 KB Output is correct
6 Correct 14 ms 19020 KB Output is correct
7 Correct 15 ms 19276 KB Output is correct
8 Correct 14 ms 19120 KB Output is correct
9 Correct 18 ms 19660 KB Output is correct
10 Correct 17 ms 19640 KB Output is correct
11 Correct 16 ms 19492 KB Output is correct
12 Correct 16 ms 19380 KB Output is correct
13 Correct 16 ms 19508 KB Output is correct
14 Correct 16 ms 19532 KB Output is correct
15 Correct 16 ms 19404 KB Output is correct
16 Correct 17 ms 19404 KB Output is correct
17 Correct 18 ms 19404 KB Output is correct
18 Correct 15 ms 19224 KB Output is correct
19 Correct 16 ms 19412 KB Output is correct
20 Correct 16 ms 19416 KB Output is correct
21 Correct 208 ms 36468 KB Output is correct
22 Correct 100 ms 28200 KB Output is correct
23 Correct 103 ms 31508 KB Output is correct
24 Correct 81 ms 28156 KB Output is correct
25 Execution timed out 3068 ms 55500 KB Time limit exceeded
26 Halted 0 ms 0 KB -