oj.uz

Submission #927172

# Submission time Handle Problem Language Result Execution time Memory
927172 2024-02-14T10:56:58 Z bachhoangxuan None (JOI14_ho_t4) C++17
100 / 100
 139 ms 28052 KB 
// Judges with GCC >= 12 only needs Ofast
// #pragma GCC optimize("O3,no-stack-protector,fast-math,unroll-loops,tree-vectorize")
// MLE optimization
// #pragma GCC optimize("conserve-stack")
// Old judges
// #pragma GCC target("sse4.2,popcnt,lzcnt,abm,mmx,fma,bmi,bmi2")
// New judges. Test with assert(__builtin_cpu_supports("avx2"));
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")
// Atcoder
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma")
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
- insert(x),erase(x)
- find_by_order(k): return iterator to the k-th smallest element
- order_of_key(x): the number of elements that are strictly smaller
*/
#include<bits/stdc++.h>
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
uniform_real_distribution<> pp(0.0,1.0);
#define int long long
#define ld long double
#define pii pair<int,int>
#define piii pair<int,pii>
#define mpp make_pair
#define fi first
#define se second
const int inf=1e18;
const int mod=998244353;
const int maxn=100005;
const int bl=650;
const int maxs=655;
const int maxm=200005;
const int maxq=1000005;
const int maxl=25;
const int maxa=1000000;
const int root=3;
int power(int a,int n){
    int res=1;
    while(n){
        if(n&1) res=res*a%mod;
        a=a*a%mod;n>>=1;
    }
    return res;
}
const int iroot=power(3,mod-2);
const int base=101;

int n,m,h[maxn],X;
vector<pii> edge[maxn];
int dist[maxn][3];

void solve(){
    cin >> n >> m >> X;
    for(int i=1;i<=n;i++) cin >> h[i];
    for(int i=1;i<=m;i++){
        int u,v,w;cin >> u >> v >> w;
        if(h[u]>=w) edge[u].push_back({v,w});
        if(h[v]>=w) edge[v].push_back({u,w});
    }
    for(int i=1;i<=n;i++) dist[i][0]=dist[i][1]=inf;
    dist[1][1]=0;
    priority_queue<piii,vector<piii>,greater<piii>> pq;
    pq.push({0,{1,1}});
    while(!pq.empty()){
        auto [d,u]=pq.top();pq.pop();
        auto [x,t]=u;
        if(dist[x][t]!=d) continue;
        int cur=(t?X-d:0);
        for(auto [v,w]:edge[x]){
            int nxt=cur-w;
            if(nxt<0){
                if(dist[v][0]>d+w-nxt) pq.push({dist[v][0]=d+w-nxt,{v,0}});
            }
            else{
                nxt=min(nxt,h[v]);
                if(dist[v][1]>d+cur-nxt) pq.push({dist[v][1]=d+cur-nxt,{v,1}});
            }
        }
    }
    int res=min({dist[n][0]+h[n],2*dist[n][1]+h[n]-X});
    cout << (res>=inf?-1:res) << '\n';
}

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
    int test=1;//cin >> test;
    while(test--) solve();
}

Subtask #1
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2908 KB Output is correct
2 Correct 2 ms 2908 KB Output is correct
3 Correct 2 ms 2904 KB Output is correct
4 Correct 1 ms 2952 KB Output is correct
5 Correct 1 ms 2908 KB Output is correct
6 Correct 1 ms 2908 KB Output is correct
7 Correct 1 ms 2908 KB Output is correct
8 Correct 2 ms 2908 KB Output is correct
9 Correct 2 ms 2908 KB Output is correct
10 Correct 2 ms 2904 KB Output is correct
11 Correct 1 ms 2908 KB Output is correct
12 Correct 2 ms 2908 KB Output is correct
13 Correct 2 ms 2908 KB Output is correct
14 Correct 1 ms 2908 KB Output is correct
15 Correct 2 ms 3008 KB Output is correct
16 Correct 1 ms 2908 KB Output is correct
17 Correct 1 ms 2908 KB Output is correct
18 Correct 1 ms 2908 KB Output is correct
19 Correct 1 ms 2940 KB Output is correct
20 Correct 1 ms 2908 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 86 ms 16916 KB Output is correct
2 Correct 97 ms 28052 KB Output is correct
3 Correct 72 ms 15700 KB Output is correct
4 Correct 113 ms 26720 KB Output is correct
5 Correct 82 ms 26828 KB Output is correct
6 Correct 4 ms 3160 KB Output is correct
7 Correct 57 ms 11248 KB Output is correct
8 Correct 129 ms 23244 KB Output is correct
9 Correct 65 ms 13648 KB Output is correct
10 Correct 48 ms 9900 KB Output is correct
11 Correct 12 ms 7000 KB Output is correct
12 Correct 63 ms 17232 KB Output is correct
13 Correct 36 ms 13120 KB Output is correct
14 Correct 63 ms 12116 KB Output is correct
15 Correct 4 ms 5468 KB Output is correct
16 Correct 82 ms 26192 KB Output is correct
17 Correct 11 ms 6748 KB Output is correct
18 Correct 12 ms 6992 KB Output is correct
19 Correct 27 ms 8028 KB Output is correct
20 Correct 13 ms 7348 KB Output is correct

Subtask #3
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2908 KB Output is correct
2 Correct 2 ms 2908 KB Output is correct
3 Correct 2 ms 2904 KB Output is correct
4 Correct 1 ms 2952 KB Output is correct
5 Correct 1 ms 2908 KB Output is correct
6 Correct 1 ms 2908 KB Output is correct
7 Correct 1 ms 2908 KB Output is correct
8 Correct 2 ms 2908 KB Output is correct
9 Correct 2 ms 2908 KB Output is correct
10 Correct 2 ms 2904 KB Output is correct
11 Correct 1 ms 2908 KB Output is correct
12 Correct 2 ms 2908 KB Output is correct
13 Correct 2 ms 2908 KB Output is correct
14 Correct 1 ms 2908 KB Output is correct
15 Correct 2 ms 3008 KB Output is correct
16 Correct 1 ms 2908 KB Output is correct
17 Correct 1 ms 2908 KB Output is correct
18 Correct 1 ms 2908 KB Output is correct
19 Correct 1 ms 2940 KB Output is correct
20 Correct 1 ms 2908 KB Output is correct
21 Correct 86 ms 16916 KB Output is correct
22 Correct 97 ms 28052 KB Output is correct
23 Correct 72 ms 15700 KB Output is correct
24 Correct 113 ms 26720 KB Output is correct
25 Correct 82 ms 26828 KB Output is correct
26 Correct 4 ms 3160 KB Output is correct
27 Correct 57 ms 11248 KB Output is correct
28 Correct 129 ms 23244 KB Output is correct
29 Correct 65 ms 13648 KB Output is correct
30 Correct 48 ms 9900 KB Output is correct
31 Correct 12 ms 7000 KB Output is correct
32 Correct 63 ms 17232 KB Output is correct
33 Correct 36 ms 13120 KB Output is correct
34 Correct 63 ms 12116 KB Output is correct
35 Correct 4 ms 5468 KB Output is correct
36 Correct 82 ms 26192 KB Output is correct
37 Correct 11 ms 6748 KB Output is correct
38 Correct 12 ms 6992 KB Output is correct
39 Correct 27 ms 8028 KB Output is correct
40 Correct 13 ms 7348 KB Output is correct
41 Correct 62 ms 11344 KB Output is correct
42 Correct 15 ms 7768 KB Output is correct
43 Correct 48 ms 10068 KB Output is correct
44 Correct 60 ms 13660 KB Output is correct
45 Correct 118 ms 26320 KB Output is correct
46 Correct 7 ms 6488 KB Output is correct
47 Correct 139 ms 23112 KB Output is correct
48 Correct 134 ms 24472 KB Output is correct
49 Correct 99 ms 20684 KB Output is correct
50 Correct 98 ms 26880 KB Output is correct
51 Correct 16 ms 7772 KB Output is correct
52 Correct 98 ms 19956 KB Output is correct
53 Correct 58 ms 11624 KB Output is correct
54 Correct 67 ms 13568 KB Output is correct
55 Correct 60 ms 12112 KB Output is correct
56 Correct 125 ms 24780 KB Output is correct
57 Correct 25 ms 9476 KB Output is correct
58 Correct 3 ms 3416 KB Output is correct
59 Correct 57 ms 11236 KB Output is correct
60 Correct 24 ms 9464 KB Output is correct