oj.uz

Submission #974679

# Submission time Handle Problem Language Result Execution time Memory
974679 2024-05-03T15:45:52 Z berr Robot (JOI21_ho_t4) C++17
100 / 100
 789 ms 91296 KB 
#include <bits/stdc++.h>
using namespace std; 
#define int long long
const int N=5005, INF=1e18;
 
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
   
    int n, m; cin >> n >> m;
 
    vector<vector<array<int, 2>>> g(n);
    vector<int> c(m), p(m), u(m), v(m);
    map<int, int> s[n], dpp[n], pos[n];
    vector<int> dp(n, INF);

    for(int i=0; i<m; i++){
        cin >> u[i] >> v[i] >> c[i] >> p[i];
        u[i]--; v[i]--;
        if(u[i] > v[i]) swap(u[i], v[i]);
        g[u[i]].push_back({v[i], i});
        g[v[i]].push_back({u[i], i});
        s[u[i]][c[i]]+=p[i];
        s[v[i]][c[i]]+=p[i];

    }
        
    for(int i=0; i<n; i++){
        if(!g[i].size()) continue;
        sort(g[i].begin(), g[i].end(), [&](auto x, auto y){
            return c[x[1]] < c[y[1]];
        });

        for(int l=0; l<g[i].size(); l++){
            int col=c[g[i][l][1]];
            if(pos[i].count(col)) continue;
            pos[i][col] = l;
        }
    }

    priority_queue<array<int, 3>> pq;
    dp[0]=0;
    pq.push({0, 0, -1});
    int ans = INF;

    while(pq.size()){
        auto [cost, v, color] = pq.top();

        pq.pop(); cost*=-1;
       // cout<<cost<<" "<<v<<" "<<color<<"\n";
        if(v==n-1){
            ans=min(ans, cost);
        }

        if(color == -1){
            if(dp[v] != cost) continue;

            for(auto [i, j]: g[v]){
                if(dp[i] > cost+p[j]){
                    dp[i] = cost+p[j];
                    pq.push({-dp[i], i, -1});
                }
                if(dp[i] > cost+s[v][c[j]]-p[j]){
                    dp[i] = cost+s[v][c[j]]-p[j];
                    pq.push({-dp[i], i, -1});
                }
                if(!dpp[i].count(c[j]) || dpp[i][c[j]] > cost){
                    dpp[i][c[j]] = cost;
                    pq.push({-(cost), i, c[j]});
                }
            }
        }
        else{
            if(cost != dpp[v][color]) continue;

            for(int l=pos[v][color]; l<g[v].size(); l++){
                auto [i, j]=g[v][l];

                if(c[j] != color) break;
                else{
                    int val = cost+s[v][c[j]]-p[j];
                    if(dp[i] > val){
                        dp[i] = val;
                        pq.push({-val, i, -1});
                    }
                }
            }
        }
    }

    if(dp[n-1] == INF) cout<<-1;
    else cout<<dp[n-1];
 
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:34:23: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::array<long long int, 2> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   34 |         for(int l=0; l<g[i].size(); l++){
      |                      ~^~~~~~~~~~~~
Main.cpp:76:39: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::array<long long int, 2> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   76 |             for(int l=pos[v][color]; l<g[v].size(); l++){
      |                                      ~^~~~~~~~~~~~

Subtask #1
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 3 ms 1116 KB Output is correct
10 Correct 2 ms 1112 KB Output is correct
11 Correct 2 ms 860 KB Output is correct
12 Correct 1 ms 860 KB Output is correct
13 Correct 2 ms 1076 KB Output is correct
14 Correct 2 ms 860 KB Output is correct
15 Correct 1 ms 856 KB Output is correct
16 Correct 2 ms 976 KB Output is correct
17 Correct 2 ms 856 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 2 ms 604 KB Output is correct
20 Correct 2 ms 860 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 119 ms 25996 KB Output is correct
2 Correct 44 ms 13836 KB Output is correct
3 Correct 107 ms 23956 KB Output is correct
4 Correct 91 ms 19140 KB Output is correct
5 Correct 789 ms 87776 KB Output is correct
6 Correct 533 ms 77344 KB Output is correct
7 Correct 299 ms 61168 KB Output is correct
8 Correct 288 ms 56660 KB Output is correct
9 Correct 301 ms 56756 KB Output is correct
10 Correct 204 ms 44708 KB Output is correct
11 Correct 81 ms 34064 KB Output is correct

Subtask #3
42.0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 3 ms 1116 KB Output is correct
10 Correct 2 ms 1112 KB Output is correct
11 Correct 2 ms 860 KB Output is correct
12 Correct 1 ms 860 KB Output is correct
13 Correct 2 ms 1076 KB Output is correct
14 Correct 2 ms 860 KB Output is correct
15 Correct 1 ms 856 KB Output is correct
16 Correct 2 ms 976 KB Output is correct
17 Correct 2 ms 856 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 2 ms 604 KB Output is correct
20 Correct 2 ms 860 KB Output is correct
21 Correct 119 ms 25996 KB Output is correct
22 Correct 44 ms 13836 KB Output is correct
23 Correct 107 ms 23956 KB Output is correct
24 Correct 91 ms 19140 KB Output is correct
25 Correct 789 ms 87776 KB Output is correct
26 Correct 533 ms 77344 KB Output is correct
27 Correct 299 ms 61168 KB Output is correct
28 Correct 288 ms 56660 KB Output is correct
29 Correct 301 ms 56756 KB Output is correct
30 Correct 204 ms 44708 KB Output is correct
31 Correct 81 ms 34064 KB Output is correct
32 Correct 101 ms 17836 KB Output is correct
33 Correct 91 ms 23524 KB Output is correct
34 Correct 290 ms 46004 KB Output is correct
35 Correct 207 ms 36940 KB Output is correct
36 Correct 225 ms 50872 KB Output is correct
37 Correct 256 ms 55204 KB Output is correct
38 Correct 280 ms 68148 KB Output is correct
39 Correct 95 ms 24744 KB Output is correct
40 Correct 299 ms 58392 KB Output is correct
41 Correct 346 ms 58664 KB Output is correct
42 Correct 358 ms 65528 KB Output is correct
43 Correct 126 ms 28496 KB Output is correct
44 Correct 212 ms 35308 KB Output is correct
45 Correct 239 ms 52768 KB Output is correct
46 Correct 224 ms 51624 KB Output is correct
47 Correct 246 ms 54340 KB Output is correct
48 Correct 778 ms 91296 KB Output is correct