oj.uz

답안 #649828

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
649828 2022-10-11T11:38:58 Z mychecksedad Robot (JOI21_ho_t4) C++17
100 / 100
 639 ms 111740 KB 
/* Author : Mychecksdead */
#include<bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long int ll;
typedef long double ld;
#define MOD (1000000000+7)
#define MOD1 (998244353)
#define PI 3.1415926535
#define pb push_back
#define setp() cout << setprecision(15)
#define all(x) x.begin(), x.end()
#define debug(x) cerr << #x << " is " << x << '\n';
const int N = 1e6+100, M = 1e5+10, F = 2147483646, K = 20;

struct Edge{
    int nxt, c; ll e;
};

int n, m;
ll dist[N][2];
vector<Edge> g[N];
map<int, ll> s[N];
void solve(){
    cin >> n >> m;
    for(int i = 0; i < m; ++i){
        int u, v, c, p; cin >> u >> v >> c >> p;
        g[u].pb({v, c, p});
        g[v].pb({u, c, p});
        s[u][c] += p;
        s[v][c] += p;
    }

    for(int i = 1; i <= n; ++i) dist[i][0] = dist[i][1] = 1e18;

    priority_queue<array<ll, 3>> q;
    vector<bool> vis[2]; vis[0].resize(n+1), vis[1].resize(n+1);
    dist[n][0] = 0;
    q.push({0, n, -1});

    while(!q.empty()){
        int v = q.top()[1], cc = q.top()[2]; 
        ll D = -q.top()[0];
        q.pop();
        if(vis[cc == -1][v]) continue;
        vis[cc == -1][v] = 1;
        // cout << v << '\n';
        for(auto E: g[v]){
            int u = E.nxt, c = E.c; ll e = E.e;
            ll val = s[u][c];

            if(cc == c) e = 0;

            if(D + e < dist[u][0]){
                dist[u][0] = D + e;
                q.push({-dist[u][0], u, -1});
            }
            if(D + val - e < dist[u][1]){
                dist[u][1] = D + val - e;
                q.push({-dist[u][1], u, c});
            }
        }
    }
    if(min(dist[1][0], dist[1][1]) == 1e18) cout << -1;
    else cout << min(dist[1][0], dist[1][1]);
}   





int main(){
    cin.tie(0); ios::sync_with_stdio(0);
    int T = 1, aa;
    // cin >> T;aa=T;
    while(T--){
        // cout << "Case #" << aa-T << ": ";
        solve();
        cout << '\n';
    }
    return 0;
 
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:75:16: warning: unused variable 'aa' [-Wunused-variable]
   75 |     int T = 1, aa;
      |                ^~

Subtask #1
34.0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 35 ms 70732 KB Output is correct
2 Correct 37 ms 70772 KB Output is correct
3 Correct 34 ms 70772 KB Output is correct
4 Correct 36 ms 70712 KB Output is correct
5 Correct 39 ms 70728 KB Output is correct
6 Correct 34 ms 70688 KB Output is correct
7 Correct 36 ms 70784 KB Output is correct
8 Correct 39 ms 70736 KB Output is correct
9 Correct 37 ms 71056 KB Output is correct
10 Correct 35 ms 71040 KB Output is correct
11 Correct 36 ms 71040 KB Output is correct
12 Correct 37 ms 71020 KB Output is correct
13 Correct 36 ms 71052 KB Output is correct
14 Correct 38 ms 71040 KB Output is correct
15 Correct 36 ms 70848 KB Output is correct
16 Correct 37 ms 70932 KB Output is correct
17 Correct 36 ms 70996 KB Output is correct
18 Correct 35 ms 70856 KB Output is correct
19 Correct 36 ms 70996 KB Output is correct
20 Correct 36 ms 70932 KB Output is correct

Subtask #2
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 144 ms 81508 KB Output is correct
2 Correct 84 ms 76520 KB Output is correct
3 Correct 169 ms 83192 KB Output is correct
4 Correct 110 ms 78028 KB Output is correct
5 Correct 549 ms 105636 KB Output is correct
6 Correct 423 ms 99700 KB Output is correct
7 Correct 276 ms 96172 KB Output is correct
8 Correct 297 ms 89884 KB Output is correct
9 Correct 325 ms 89988 KB Output is correct
10 Correct 168 ms 86584 KB Output is correct
11 Correct 127 ms 82252 KB Output is correct

Subtask #3
42.0 / 42.0

# 결과 실행 시간 메모리 Grader output
1 Correct 35 ms 70732 KB Output is correct
2 Correct 37 ms 70772 KB Output is correct
3 Correct 34 ms 70772 KB Output is correct
4 Correct 36 ms 70712 KB Output is correct
5 Correct 39 ms 70728 KB Output is correct
6 Correct 34 ms 70688 KB Output is correct
7 Correct 36 ms 70784 KB Output is correct
8 Correct 39 ms 70736 KB Output is correct
9 Correct 37 ms 71056 KB Output is correct
10 Correct 35 ms 71040 KB Output is correct
11 Correct 36 ms 71040 KB Output is correct
12 Correct 37 ms 71020 KB Output is correct
13 Correct 36 ms 71052 KB Output is correct
14 Correct 38 ms 71040 KB Output is correct
15 Correct 36 ms 70848 KB Output is correct
16 Correct 37 ms 70932 KB Output is correct
17 Correct 36 ms 70996 KB Output is correct
18 Correct 35 ms 70856 KB Output is correct
19 Correct 36 ms 70996 KB Output is correct
20 Correct 36 ms 70932 KB Output is correct
21 Correct 144 ms 81508 KB Output is correct
22 Correct 84 ms 76520 KB Output is correct
23 Correct 169 ms 83192 KB Output is correct
24 Correct 110 ms 78028 KB Output is correct
25 Correct 549 ms 105636 KB Output is correct
26 Correct 423 ms 99700 KB Output is correct
27 Correct 276 ms 96172 KB Output is correct
28 Correct 297 ms 89884 KB Output is correct
29 Correct 325 ms 89988 KB Output is correct
30 Correct 168 ms 86584 KB Output is correct
31 Correct 127 ms 82252 KB Output is correct
32 Correct 132 ms 79840 KB Output is correct
33 Correct 147 ms 82352 KB Output is correct
34 Correct 319 ms 89044 KB Output is correct
35 Correct 236 ms 85964 KB Output is correct
36 Correct 316 ms 91844 KB Output is correct
37 Correct 319 ms 91784 KB Output is correct
38 Correct 314 ms 96184 KB Output is correct
39 Correct 151 ms 83464 KB Output is correct
40 Correct 322 ms 89852 KB Output is correct
41 Correct 388 ms 89980 KB Output is correct
42 Correct 261 ms 92508 KB Output is correct
43 Correct 153 ms 82268 KB Output is correct
44 Correct 236 ms 87956 KB Output is correct
45 Correct 245 ms 86864 KB Output is correct
46 Correct 225 ms 87260 KB Output is correct
47 Correct 288 ms 93216 KB Output is correct
48 Correct 639 ms 111740 KB Output is correct