oj.uz

Submission #967435

# Submission time Handle Problem Language Result Execution time Memory
967435 2024-04-22T05:59:23 Z angella Robot (JOI21_ho_t4) C++17
100 / 100
 361 ms 49912 KB 
/*
    IN THE NAME OF GOD
*/
#include <bits/stdc++.h>

// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")

using namespace std;

typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
typedef long double ld;

#define F                                      first
#define S                                      second
#define Mp                                     make_pair
#define pb                                     push_back
#define pf                                     push_front
#define size(x)                                ((ll)x.size())
#define all(x)                                 (x).begin(),(x).end()
#define kill(x)		                           cout << x << '\n', exit(0);
#define fuck(x)                                cout << "(" << #x << " , " << x << ")" << endl
#define endl                                   '\n'

const int N = 3e5+23, lg = 18;
ll Mod = 1e9+7; //998244353;

inline ll MOD(ll a, ll mod=Mod) {a%=mod; (a<0)&&(a+=mod); return a;}
inline ll poww(ll a, ll b, ll mod=Mod) {
    ll ans = 1;
    a=MOD(a, mod);
    while (b) {
        if (b & 1) ans = MOD(ans*a, mod);
        b >>= 1;
        a = MOD(a*a, mod);
    }
    return ans;
}

ll n, m, vis[N], d[N];
vector<vector<ll>> adj[N];
int main () {
	ios_base::sync_with_stdio(false), cin.tie(0);

	cin>>n>>m;
    for(ll v,u,c,p,i=1; i<=m; i++) {
        cin>>v>>u>>c>>p;
        adj[v].pb({u, c, p});
        adj[u].pb({v, c, p});
    }
    priority_queue<pll, vector<pll>, greater<pll>> pq;
    pq.push({0, 1});
    while(size(pq) > 0) {
        pll v = pq.top(); pq.pop();
        if(vis[v.S] == 1) continue;
        vis[v.S]=1, d[v.S] = v.F;
        map<int,ll> mp, mp2;
        for(auto it : adj[v.S]) {
            mp[it[1]] += it[2];
            if(vis[it[0]] == 1) {
                if(mp2.find(it[1]) == mp2.end()) mp2[it[1]]=d[it[0]];
                else mp2[it[1]]=min(mp2[it[1]], d[it[0]]);
            }
        }
        for(auto it : adj[v.S]) {
            if(vis[it[0]]==0) {
                pq.push({v.F+min(it[2],mp[it[1]]-it[2]), it[0]});
                if(mp2.find(it[1]) != mp2.end()) {
                    pq.push({mp2[it[1]]+mp[it[1]]-it[2], it[0]});
                }
            }
        }
    }

    cout<<(vis[n]==0 ? -1 : d[n])<<endl;

	return 0;
}

Subtask #1
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8796 KB Output is correct
2 Correct 3 ms 8796 KB Output is correct
3 Correct 2 ms 8796 KB Output is correct
4 Correct 2 ms 8796 KB Output is correct
5 Correct 3 ms 8796 KB Output is correct
6 Correct 2 ms 8796 KB Output is correct
7 Correct 4 ms 8848 KB Output is correct
8 Correct 2 ms 8796 KB Output is correct
9 Correct 4 ms 9052 KB Output is correct
10 Correct 4 ms 9016 KB Output is correct
11 Correct 4 ms 9052 KB Output is correct
12 Correct 3 ms 9048 KB Output is correct
13 Correct 3 ms 9052 KB Output is correct
14 Correct 3 ms 9052 KB Output is correct
15 Correct 2 ms 8796 KB Output is correct
16 Correct 6 ms 9048 KB Output is correct
17 Correct 3 ms 9052 KB Output is correct
18 Correct 2 ms 8796 KB Output is correct
19 Correct 4 ms 9052 KB Output is correct
20 Correct 3 ms 9048 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 79 ms 22984 KB Output is correct
2 Correct 31 ms 14720 KB Output is correct
3 Correct 155 ms 33476 KB Output is correct
4 Correct 48 ms 17884 KB Output is correct
5 Correct 361 ms 47932 KB Output is correct
6 Correct 325 ms 46964 KB Output is correct
7 Correct 215 ms 47780 KB Output is correct
8 Correct 217 ms 39508 KB Output is correct
9 Correct 228 ms 39736 KB Output is correct
10 Correct 131 ms 29148 KB Output is correct
11 Correct 51 ms 23380 KB Output is correct

Subtask #3
42.0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8796 KB Output is correct
2 Correct 3 ms 8796 KB Output is correct
3 Correct 2 ms 8796 KB Output is correct
4 Correct 2 ms 8796 KB Output is correct
5 Correct 3 ms 8796 KB Output is correct
6 Correct 2 ms 8796 KB Output is correct
7 Correct 4 ms 8848 KB Output is correct
8 Correct 2 ms 8796 KB Output is correct
9 Correct 4 ms 9052 KB Output is correct
10 Correct 4 ms 9016 KB Output is correct
11 Correct 4 ms 9052 KB Output is correct
12 Correct 3 ms 9048 KB Output is correct
13 Correct 3 ms 9052 KB Output is correct
14 Correct 3 ms 9052 KB Output is correct
15 Correct 2 ms 8796 KB Output is correct
16 Correct 6 ms 9048 KB Output is correct
17 Correct 3 ms 9052 KB Output is correct
18 Correct 2 ms 8796 KB Output is correct
19 Correct 4 ms 9052 KB Output is correct
20 Correct 3 ms 9048 KB Output is correct
21 Correct 79 ms 22984 KB Output is correct
22 Correct 31 ms 14720 KB Output is correct
23 Correct 155 ms 33476 KB Output is correct
24 Correct 48 ms 17884 KB Output is correct
25 Correct 361 ms 47932 KB Output is correct
26 Correct 325 ms 46964 KB Output is correct
27 Correct 215 ms 47780 KB Output is correct
28 Correct 217 ms 39508 KB Output is correct
29 Correct 228 ms 39736 KB Output is correct
30 Correct 131 ms 29148 KB Output is correct
31 Correct 51 ms 23380 KB Output is correct
32 Correct 163 ms 39844 KB Output is correct
33 Correct 117 ms 32064 KB Output is correct
34 Correct 171 ms 36184 KB Output is correct
35 Correct 154 ms 31312 KB Output is correct
36 Correct 136 ms 29920 KB Output is correct
37 Correct 213 ms 41132 KB Output is correct
38 Correct 228 ms 47000 KB Output is correct
39 Correct 201 ms 42808 KB Output is correct
40 Correct 258 ms 41088 KB Output is correct
41 Correct 239 ms 41224 KB Output is correct
42 Correct 207 ms 39112 KB Output is correct
43 Correct 96 ms 26056 KB Output is correct
44 Correct 261 ms 47168 KB Output is correct
45 Correct 166 ms 33016 KB Output is correct
46 Correct 150 ms 31176 KB Output is correct
47 Correct 164 ms 33972 KB Output is correct
48 Correct 341 ms 49912 KB Output is correct