oj.uz

Submission #977260

# Submission time Handle Problem Language Result Execution time Memory
977260 2024-05-07T15:15:18 Z KawakiMeido Robot (JOI21_ho_t4) C++17
100 / 100
 407 ms 58616 KB 
/*Author: KawakiMeido*/
#include <bits/stdc++.h>
#define pb push_back
#define endl "\n"
#define int long long
#define pii pair<int,int>
#define piii pair<int,pii>
#define fi first
#define se second

using namespace std;

/*Constants*/
const int N = 1e5+10;
const int INF = 1e9+7;
const long long LLINF = 1e18+3;

/*TestCases*/
int test=1;
void solve();
void TestCases(bool v){
    if (v) cin >> test;
    while(test--) solve();
}

/*Global Variables*/
int n,m;
bool vis[N];
vector<piii> a[N];
map<int,int> dcolor[N];
map<int,int> tcolor[N];
int dist[N];
priority_queue<pii,vector<pii>,greater<pii>> pq;

void Dijkstra(){
    for (int i=1; i<=n; i++){
        dist[i] = LLINF;
    }
    dist[1] = 0;
    pq.push({0,1});
    while (!pq.empty()){
        int d1 = pq.top().fi;
        int u = pq.top().se;
        pq.pop();

        if (d1 > dist[u]) continue;

        vis[u] = true;

        for (auto in:a[u]){
            int v = in.fi;
            int clr = in.se.fi;
            int d2 = in.se.se;

            if (vis[v]) continue;

            int distcolor = dist[u];
            if (dcolor[u].find(clr)!=dcolor[u].end()) distcolor = min(distcolor,dcolor[u][clr]);
            distcolor += tcolor[u][clr]-d2;
            if (distcolor < dist[v]){
                dist[v] = distcolor;
                pq.push({distcolor,v});
            }

            int dnew = dist[u] + d2;
            if (dnew < dist[v]){
                dist[v] = dnew;
                pq.push({dnew,v});
            }
            if (dcolor[v].find(clr) == dcolor[v].end() || dist[u] < dcolor[v][clr]){
                dcolor[v][clr] = dist[u];
            }
        }
    }
}

/*Solution*/
void solve(){
    cin >> n >> m;
    for (int i=1; i<=m; i++){
        int u,v,c,w;
        cin >> u >> v >> c >> w;
        tcolor[u][c]+=w;
        tcolor[v][c]+=w;
        a[u].push_back({v,{c,w}});
        a[v].push_back({u,{c,w}});
    }
    Dijkstra();
//    for (int i=1; i<=n; i++){
//        cout << dist[i] << endl;
//    }
    if (dist[n] == LLINF) cout << -1 << endl;
    else cout << dist[n] << endl;
}

/*Driver Code*/
signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    TestCases(0);

    return 0;
}

Subtask #1
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12632 KB Output is correct
2 Correct 2 ms 12636 KB Output is correct
3 Correct 3 ms 12768 KB Output is correct
4 Correct 2 ms 12636 KB Output is correct
5 Correct 3 ms 12636 KB Output is correct
6 Correct 2 ms 12636 KB Output is correct
7 Correct 3 ms 12892 KB Output is correct
8 Correct 3 ms 12636 KB Output is correct
9 Correct 4 ms 13148 KB Output is correct
10 Correct 4 ms 13148 KB Output is correct
11 Correct 4 ms 13148 KB Output is correct
12 Correct 4 ms 12892 KB Output is correct
13 Correct 4 ms 12892 KB Output is correct
14 Correct 3 ms 13088 KB Output is correct
15 Correct 3 ms 12888 KB Output is correct
16 Correct 6 ms 12892 KB Output is correct
17 Correct 4 ms 12944 KB Output is correct
18 Correct 3 ms 12892 KB Output is correct
19 Correct 4 ms 12892 KB Output is correct
20 Correct 3 ms 12892 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 64 ms 27596 KB Output is correct
2 Correct 30 ms 19960 KB Output is correct
3 Correct 89 ms 29392 KB Output is correct
4 Correct 42 ms 22732 KB Output is correct
5 Correct 384 ms 57660 KB Output is correct
6 Correct 326 ms 54684 KB Output is correct
7 Correct 157 ms 46504 KB Output is correct
8 Correct 237 ms 43460 KB Output is correct
9 Correct 217 ms 43400 KB Output is correct
10 Correct 124 ms 36036 KB Output is correct
11 Correct 50 ms 26168 KB Output is correct

Subtask #3
42.0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 12632 KB Output is correct
2 Correct 2 ms 12636 KB Output is correct
3 Correct 3 ms 12768 KB Output is correct
4 Correct 2 ms 12636 KB Output is correct
5 Correct 3 ms 12636 KB Output is correct
6 Correct 2 ms 12636 KB Output is correct
7 Correct 3 ms 12892 KB Output is correct
8 Correct 3 ms 12636 KB Output is correct
9 Correct 4 ms 13148 KB Output is correct
10 Correct 4 ms 13148 KB Output is correct
11 Correct 4 ms 13148 KB Output is correct
12 Correct 4 ms 12892 KB Output is correct
13 Correct 4 ms 12892 KB Output is correct
14 Correct 3 ms 13088 KB Output is correct
15 Correct 3 ms 12888 KB Output is correct
16 Correct 6 ms 12892 KB Output is correct
17 Correct 4 ms 12944 KB Output is correct
18 Correct 3 ms 12892 KB Output is correct
19 Correct 4 ms 12892 KB Output is correct
20 Correct 3 ms 12892 KB Output is correct
21 Correct 64 ms 27596 KB Output is correct
22 Correct 30 ms 19960 KB Output is correct
23 Correct 89 ms 29392 KB Output is correct
24 Correct 42 ms 22732 KB Output is correct
25 Correct 384 ms 57660 KB Output is correct
26 Correct 326 ms 54684 KB Output is correct
27 Correct 157 ms 46504 KB Output is correct
28 Correct 237 ms 43460 KB Output is correct
29 Correct 217 ms 43400 KB Output is correct
30 Correct 124 ms 36036 KB Output is correct
31 Correct 50 ms 26168 KB Output is correct
32 Correct 69 ms 28084 KB Output is correct
33 Correct 64 ms 27344 KB Output is correct
34 Correct 162 ms 39960 KB Output is correct
35 Correct 129 ms 34360 KB Output is correct
36 Correct 139 ms 37420 KB Output is correct
37 Correct 204 ms 40832 KB Output is correct
38 Correct 178 ms 45028 KB Output is correct
39 Correct 79 ms 32976 KB Output is correct
40 Correct 212 ms 44624 KB Output is correct
41 Correct 282 ms 44888 KB Output is correct
42 Correct 243 ms 47040 KB Output is correct
43 Correct 75 ms 29644 KB Output is correct
44 Correct 178 ms 39732 KB Output is correct
45 Correct 174 ms 39880 KB Output is correct
46 Correct 133 ms 38740 KB Output is correct
47 Correct 158 ms 40104 KB Output is correct
48 Correct 407 ms 58616 KB Output is correct