oj.uz

답안 #751257

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
751257 2023-05-31T09:48:22 Z nonono Robot (JOI21_ho_t4) C++17
100 / 100
 1188 ms 94356 KB 
#include "bits/stdc++.h"
#define int long long
using namespace std;

const int linf = 1e18;
const int mxN = 1e5 + 10;
const int mxM = 2e5 + 10;

int n, m;
map<int, vector<pair<int, int>>> adj[mxN];
map<int, int> sum[mxN], d[mxN];

int col[mxM], cost[mxM];

signed main(){

    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    
    cin >> n >> m;
    
    for(int i = 1; i <= m; i ++){
        int u, v;
        cin >> u >> v >> col[i] >> cost[i];
        
        adj[u][col[i]].push_back({v, i});
        adj[v][col[i]].push_back({u, i});
        
        d[u][col[i]] = d[v][col[i]] = linf;
            
        sum[u][col[i]] += cost[i];
        sum[v][col[i]] += cost[i];
    }
    
    for(int i = 1; i <= n; i ++) d[i][0] = linf;
    priority_queue<array<int, 3>, vector<array<int, 3>>, greater<array<int, 3>>> pq;
    pq.push({0, 1, 0});
    d[1][0] = 0;
    
    while(!pq.empty()){
        int u = pq.top()[1];
        int D = pq.top()[0];
        int k = pq.top()[2];
        pq.pop();
        
        int C = col[k];
        if(D != d[u][C]) continue ; 
        if(k){
            for(auto v : adj[u][C]){
                if(v.first == k) continue ;
                int nCost = D + sum[u][C] - cost[v.second];
                if(nCost < d[v.first][0]){
                    d[v.first][0] = nCost;
                    pq.push({nCost, v.first, 0});
                }
            }
        } else {
            
            for(auto x : adj[u]){
                int c = x.first;
                
                for(auto v : x.second){
                    int nCost = D + min(sum[u][c] - cost[v.second], cost[v.second]);
                    if(nCost < d[v.first][0]){
                        d[v.first][0] = nCost;
                        pq.push({nCost, v.first, 0});
                    }
                    
                    if(D < d[v.first][c]){
                        d[v.first][c] = D;
                        pq.push({D, v.first, v.second});
                    }
                }
            }   
            
        }
    }
    
    if(d[n][0] == linf) d[n][0] = -1;
    cout << d[n][0] << "\n";
    
    return 0;
}

Subtask #1
34.0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 14420 KB Output is correct
2 Correct 7 ms 14420 KB Output is correct
3 Correct 7 ms 14420 KB Output is correct
4 Correct 7 ms 14420 KB Output is correct
5 Correct 7 ms 14420 KB Output is correct
6 Correct 7 ms 14420 KB Output is correct
7 Correct 8 ms 14548 KB Output is correct
8 Correct 8 ms 14456 KB Output is correct
9 Correct 11 ms 15152 KB Output is correct
10 Correct 11 ms 15080 KB Output is correct
11 Correct 9 ms 14932 KB Output is correct
12 Correct 9 ms 14868 KB Output is correct
13 Correct 10 ms 14996 KB Output is correct
14 Correct 9 ms 14948 KB Output is correct
15 Correct 9 ms 14692 KB Output is correct
16 Correct 9 ms 14804 KB Output is correct
17 Correct 9 ms 14932 KB Output is correct
18 Correct 10 ms 14676 KB Output is correct
19 Correct 9 ms 14676 KB Output is correct
20 Correct 10 ms 14804 KB Output is correct

Subtask #2
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 275 ms 36584 KB Output is correct
2 Correct 97 ms 25660 KB Output is correct
3 Correct 236 ms 33060 KB Output is correct
4 Correct 137 ms 29372 KB Output is correct
5 Correct 1117 ms 89232 KB Output is correct
6 Correct 952 ms 82840 KB Output is correct
7 Correct 440 ms 66788 KB Output is correct
8 Correct 499 ms 59452 KB Output is correct
9 Correct 503 ms 59572 KB Output is correct
10 Correct 398 ms 55280 KB Output is correct
11 Correct 167 ms 43420 KB Output is correct

Subtask #3
42.0 / 42.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 14420 KB Output is correct
2 Correct 7 ms 14420 KB Output is correct
3 Correct 7 ms 14420 KB Output is correct
4 Correct 7 ms 14420 KB Output is correct
5 Correct 7 ms 14420 KB Output is correct
6 Correct 7 ms 14420 KB Output is correct
7 Correct 8 ms 14548 KB Output is correct
8 Correct 8 ms 14456 KB Output is correct
9 Correct 11 ms 15152 KB Output is correct
10 Correct 11 ms 15080 KB Output is correct
11 Correct 9 ms 14932 KB Output is correct
12 Correct 9 ms 14868 KB Output is correct
13 Correct 10 ms 14996 KB Output is correct
14 Correct 9 ms 14948 KB Output is correct
15 Correct 9 ms 14692 KB Output is correct
16 Correct 9 ms 14804 KB Output is correct
17 Correct 9 ms 14932 KB Output is correct
18 Correct 10 ms 14676 KB Output is correct
19 Correct 9 ms 14676 KB Output is correct
20 Correct 10 ms 14804 KB Output is correct
21 Correct 275 ms 36584 KB Output is correct
22 Correct 97 ms 25660 KB Output is correct
23 Correct 236 ms 33060 KB Output is correct
24 Correct 137 ms 29372 KB Output is correct
25 Correct 1117 ms 89232 KB Output is correct
26 Correct 952 ms 82840 KB Output is correct
27 Correct 440 ms 66788 KB Output is correct
28 Correct 499 ms 59452 KB Output is correct
29 Correct 503 ms 59572 KB Output is correct
30 Correct 398 ms 55280 KB Output is correct
31 Correct 167 ms 43420 KB Output is correct
32 Correct 134 ms 31600 KB Output is correct
33 Correct 213 ms 33692 KB Output is correct
34 Correct 494 ms 56320 KB Output is correct
35 Correct 389 ms 47424 KB Output is correct
36 Correct 365 ms 55088 KB Output is correct
37 Correct 461 ms 60380 KB Output is correct
38 Correct 452 ms 71124 KB Output is correct
39 Correct 158 ms 35652 KB Output is correct
40 Correct 503 ms 60804 KB Output is correct
41 Correct 559 ms 61136 KB Output is correct
42 Correct 573 ms 72396 KB Output is correct
43 Correct 253 ms 42012 KB Output is correct
44 Correct 523 ms 47568 KB Output is correct
45 Correct 385 ms 55472 KB Output is correct
46 Correct 316 ms 55480 KB Output is correct
47 Correct 388 ms 59256 KB Output is correct
48 Correct 1188 ms 94356 KB Output is correct