oj.uz

Submission #994172

# Submission time Handle Problem Language Result Execution time Memory
994172 2024-06-07T08:16:51 Z bachhoangxuan Construction Project 2 (JOI24_ho_t2) C++17
100 / 100
 217 ms 40368 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<pii,int>
#define mpp make_pair
#define fi first
#define se second
const int inf=1e18;
const int mod=998244353;
const int maxn=200005;
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,S,T,L,K,d[2][maxn];
vector<pii> edge[maxn];

int bit[maxn];
void update(int x){
    for(int i=x;i<=n;i+=(i&(-i))) bit[i]++;
}
int query(int x){
    int res=0;
    for(int i=x;i>=1;i-=(i&(-i))) res+=bit[i];
    return res;
}

void dijisktra(int s,int t){
    for(int i=1;i<=n;i++) d[t][i]=inf;
    priority_queue<pii,vector<pii>,greater<pii>> pq;
    d[t][s]=0;pq.push({0,s});
    while(!pq.empty()){
        auto [dd,u]=pq.top();pq.pop();
        if(d[t][u]!=dd) continue;
        for(auto [v,w]:edge[u]){
            if(d[t][v]>dd+w) pq.push({d[t][v]=dd+w,v});
        }
    }
}

void solve(){
    cin >> n >> m >> S >> T >> L >> K;
    for(int i=1;i<=m;i++){
        int u,v,w;cin >> u >> v >> w;
        edge[u].push_back({v,w});
        edge[v].push_back({u,w});
    }
    dijisktra(S,0);dijisktra(T,1);
    if(d[0][T]<=K){
        cout << n*(n-1)/2 << '\n';
        return;
    }
    K-=L;
    int res=0;
    vector<int> d1;
    for(int i=1;i<=n;i++) d1.push_back(d[1][i]);
    sort(d1.begin(),d1.end());
    for(int i=1;i<=n;i++){
        int dd=K-d[0][i];
        res+=upper_bound(d1.begin(),d1.end(),dd)-d1.begin();
    }
    d1.erase(unique(d1.begin(),d1.end()),d1.end());
    vector<piii> p;
    for(int i=1;i<=n;i++){
        p.push_back({{d[0][i],d[1][i]},-1});
        p.push_back({{K-d[1][i],K-d[0][i]},0});
    }
    sort(p.begin(),p.end());
    for(auto [x,id]:p){
        int pos=upper_bound(d1.begin(),d1.end(),x.se)-d1.begin();
        if(id==0) res-=query(pos);
        else update(pos);
    }
    cout << 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
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 8540 KB Output is correct
2 Correct 1 ms 8540 KB Output is correct
3 Correct 2 ms 8540 KB Output is correct
4 Correct 1 ms 8540 KB Output is correct
5 Correct 2 ms 9052 KB Output is correct
6 Correct 2 ms 8796 KB Output is correct
7 Correct 80 ms 35312 KB Output is correct
8 Correct 105 ms 35688 KB Output is correct
9 Correct 56 ms 21020 KB Output is correct
10 Correct 1 ms 8540 KB Output is correct
11 Correct 1 ms 8620 KB Output is correct
12 Correct 2 ms 9052 KB Output is correct
13 Correct 3 ms 9052 KB Output is correct
14 Correct 63 ms 30600 KB Output is correct
15 Correct 150 ms 36964 KB Output is correct
16 Correct 1 ms 8536 KB Output is correct
17 Correct 2 ms 9052 KB Output is correct
18 Correct 94 ms 35608 KB Output is correct
19 Correct 1 ms 8540 KB Output is correct
20 Correct 2 ms 8608 KB Output is correct
21 Correct 2 ms 9052 KB Output is correct
22 Correct 3 ms 9052 KB Output is correct
23 Correct 63 ms 31160 KB Output is correct
24 Correct 148 ms 35936 KB Output is correct
25 Correct 2 ms 8540 KB Output is correct
26 Correct 2 ms 8796 KB Output is correct
27 Correct 73 ms 26792 KB Output is correct
28 Correct 87 ms 27640 KB Output is correct
29 Correct 74 ms 32448 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8536 KB Output is correct
2 Correct 1 ms 8540 KB Output is correct
3 Correct 1 ms 8540 KB Output is correct
4 Correct 1 ms 8540 KB Output is correct
5 Correct 2 ms 8792 KB Output is correct
6 Correct 1 ms 8540 KB Output is correct
7 Correct 1 ms 8540 KB Output is correct
8 Correct 2 ms 8540 KB Output is correct
9 Correct 1 ms 8540 KB Output is correct
10 Correct 2 ms 8540 KB Output is correct
11 Correct 1 ms 8540 KB Output is correct
12 Correct 1 ms 8540 KB Output is correct
13 Correct 1 ms 8540 KB Output is correct
14 Correct 1 ms 8540 KB Output is correct
15 Correct 1 ms 8540 KB Output is correct
16 Correct 1 ms 8540 KB Output is correct
17 Correct 2 ms 8540 KB Output is correct
18 Correct 1 ms 8540 KB Output is correct
19 Correct 1 ms 8540 KB Output is correct
20 Correct 1 ms 8540 KB Output is correct
21 Correct 1 ms 8540 KB Output is correct
22 Correct 1 ms 8540 KB Output is correct
23 Correct 1 ms 8540 KB Output is correct
24 Correct 1 ms 8540 KB Output is correct
25 Correct 1 ms 8540 KB Output is correct
26 Correct 1 ms 8540 KB Output is correct
27 Correct 2 ms 8540 KB Output is correct
28 Correct 1 ms 8540 KB Output is correct
29 Correct 1 ms 8540 KB Output is correct
30 Correct 1 ms 8540 KB Output is correct
31 Correct 1 ms 8540 KB Output is correct
32 Correct 1 ms 8540 KB Output is correct

Subtask #3
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8536 KB Output is correct
2 Correct 1 ms 8540 KB Output is correct
3 Correct 1 ms 8540 KB Output is correct
4 Correct 1 ms 8540 KB Output is correct
5 Correct 2 ms 8792 KB Output is correct
6 Correct 1 ms 8540 KB Output is correct
7 Correct 1 ms 8540 KB Output is correct
8 Correct 2 ms 8540 KB Output is correct
9 Correct 1 ms 8540 KB Output is correct
10 Correct 2 ms 8540 KB Output is correct
11 Correct 1 ms 8540 KB Output is correct
12 Correct 1 ms 8540 KB Output is correct
13 Correct 1 ms 8540 KB Output is correct
14 Correct 1 ms 8540 KB Output is correct
15 Correct 1 ms 8540 KB Output is correct
16 Correct 1 ms 8540 KB Output is correct
17 Correct 2 ms 8540 KB Output is correct
18 Correct 1 ms 8540 KB Output is correct
19 Correct 1 ms 8540 KB Output is correct
20 Correct 1 ms 8540 KB Output is correct
21 Correct 1 ms 8540 KB Output is correct
22 Correct 1 ms 8540 KB Output is correct
23 Correct 1 ms 8540 KB Output is correct
24 Correct 1 ms 8540 KB Output is correct
25 Correct 1 ms 8540 KB Output is correct
26 Correct 1 ms 8540 KB Output is correct
27 Correct 2 ms 8540 KB Output is correct
28 Correct 1 ms 8540 KB Output is correct
29 Correct 1 ms 8540 KB Output is correct
30 Correct 1 ms 8540 KB Output is correct
31 Correct 1 ms 8540 KB Output is correct
32 Correct 1 ms 8540 KB Output is correct
33 Correct 3 ms 9052 KB Output is correct
34 Correct 2 ms 8796 KB Output is correct
35 Correct 2 ms 9048 KB Output is correct
36 Correct 3 ms 9052 KB Output is correct
37 Correct 2 ms 9148 KB Output is correct
38 Correct 2 ms 9052 KB Output is correct
39 Correct 3 ms 9052 KB Output is correct
40 Correct 2 ms 8796 KB Output is correct
41 Correct 2 ms 8796 KB Output is correct
42 Correct 2 ms 9052 KB Output is correct
43 Correct 3 ms 9052 KB Output is correct
44 Correct 4 ms 9048 KB Output is correct
45 Correct 3 ms 9052 KB Output is correct
46 Correct 4 ms 9052 KB Output is correct
47 Correct 3 ms 9052 KB Output is correct
48 Correct 2 ms 9052 KB Output is correct
49 Correct 2 ms 8840 KB Output is correct
50 Correct 2 ms 9052 KB Output is correct
51 Correct 4 ms 9048 KB Output is correct
52 Correct 3 ms 9052 KB Output is correct
53 Correct 3 ms 9048 KB Output is correct
54 Correct 3 ms 9052 KB Output is correct
55 Correct 3 ms 8796 KB Output is correct
56 Correct 3 ms 8796 KB Output is correct
57 Correct 3 ms 8896 KB Output is correct
58 Correct 3 ms 8796 KB Output is correct

Subtask #4
47.0 / 47.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 8540 KB Output is correct
2 Correct 1 ms 8540 KB Output is correct
3 Correct 2 ms 8540 KB Output is correct
4 Correct 1 ms 8540 KB Output is correct
5 Correct 2 ms 9052 KB Output is correct
6 Correct 2 ms 8796 KB Output is correct
7 Correct 80 ms 35312 KB Output is correct
8 Correct 105 ms 35688 KB Output is correct
9 Correct 56 ms 21020 KB Output is correct
10 Correct 1 ms 8540 KB Output is correct
11 Correct 1 ms 8620 KB Output is correct
12 Correct 2 ms 9052 KB Output is correct
13 Correct 3 ms 9052 KB Output is correct
14 Correct 63 ms 30600 KB Output is correct
15 Correct 150 ms 36964 KB Output is correct
16 Correct 1 ms 8536 KB Output is correct
17 Correct 2 ms 9052 KB Output is correct
18 Correct 94 ms 35608 KB Output is correct
19 Correct 1 ms 8540 KB Output is correct
20 Correct 2 ms 8608 KB Output is correct
21 Correct 2 ms 9052 KB Output is correct
22 Correct 3 ms 9052 KB Output is correct
23 Correct 63 ms 31160 KB Output is correct
24 Correct 148 ms 35936 KB Output is correct
25 Correct 2 ms 8540 KB Output is correct
26 Correct 2 ms 8796 KB Output is correct
27 Correct 73 ms 26792 KB Output is correct
28 Correct 87 ms 27640 KB Output is correct
29 Correct 74 ms 32448 KB Output is correct
30 Correct 2 ms 8536 KB Output is correct
31 Correct 1 ms 8540 KB Output is correct
32 Correct 1 ms 8540 KB Output is correct
33 Correct 1 ms 8540 KB Output is correct
34 Correct 2 ms 8792 KB Output is correct
35 Correct 1 ms 8540 KB Output is correct
36 Correct 1 ms 8540 KB Output is correct
37 Correct 2 ms 8540 KB Output is correct
38 Correct 1 ms 8540 KB Output is correct
39 Correct 2 ms 8540 KB Output is correct
40 Correct 1 ms 8540 KB Output is correct
41 Correct 1 ms 8540 KB Output is correct
42 Correct 1 ms 8540 KB Output is correct
43 Correct 1 ms 8540 KB Output is correct
44 Correct 1 ms 8540 KB Output is correct
45 Correct 1 ms 8540 KB Output is correct
46 Correct 2 ms 8540 KB Output is correct
47 Correct 1 ms 8540 KB Output is correct
48 Correct 1 ms 8540 KB Output is correct
49 Correct 1 ms 8540 KB Output is correct
50 Correct 1 ms 8540 KB Output is correct
51 Correct 1 ms 8540 KB Output is correct
52 Correct 1 ms 8540 KB Output is correct
53 Correct 1 ms 8540 KB Output is correct
54 Correct 1 ms 8540 KB Output is correct
55 Correct 1 ms 8540 KB Output is correct
56 Correct 2 ms 8540 KB Output is correct
57 Correct 1 ms 8540 KB Output is correct
58 Correct 1 ms 8540 KB Output is correct
59 Correct 1 ms 8540 KB Output is correct
60 Correct 1 ms 8540 KB Output is correct
61 Correct 1 ms 8540 KB Output is correct
62 Correct 3 ms 9052 KB Output is correct
63 Correct 2 ms 8796 KB Output is correct
64 Correct 2 ms 9048 KB Output is correct
65 Correct 3 ms 9052 KB Output is correct
66 Correct 2 ms 9148 KB Output is correct
67 Correct 2 ms 9052 KB Output is correct
68 Correct 3 ms 9052 KB Output is correct
69 Correct 2 ms 8796 KB Output is correct
70 Correct 2 ms 8796 KB Output is correct
71 Correct 2 ms 9052 KB Output is correct
72 Correct 3 ms 9052 KB Output is correct
73 Correct 4 ms 9048 KB Output is correct
74 Correct 3 ms 9052 KB Output is correct
75 Correct 4 ms 9052 KB Output is correct
76 Correct 3 ms 9052 KB Output is correct
77 Correct 2 ms 9052 KB Output is correct
78 Correct 2 ms 8840 KB Output is correct
79 Correct 2 ms 9052 KB Output is correct
80 Correct 4 ms 9048 KB Output is correct
81 Correct 3 ms 9052 KB Output is correct
82 Correct 3 ms 9048 KB Output is correct
83 Correct 3 ms 9052 KB Output is correct
84 Correct 3 ms 8796 KB Output is correct
85 Correct 3 ms 8796 KB Output is correct
86 Correct 3 ms 8896 KB Output is correct
87 Correct 3 ms 8796 KB Output is correct
88 Correct 89 ms 20380 KB Output is correct
89 Correct 77 ms 20528 KB Output is correct
90 Correct 106 ms 36520 KB Output is correct
91 Correct 38 ms 19036 KB Output is correct
92 Correct 40 ms 19024 KB Output is correct
93 Correct 65 ms 30392 KB Output is correct
94 Correct 67 ms 30396 KB Output is correct
95 Correct 198 ms 35992 KB Output is correct
96 Correct 131 ms 21572 KB Output is correct
97 Correct 217 ms 36912 KB Output is correct
98 Correct 181 ms 37044 KB Output is correct
99 Correct 101 ms 35004 KB Output is correct
100 Correct 92 ms 34536 KB Output is correct
101 Correct 37 ms 19024 KB Output is correct
102 Correct 40 ms 19028 KB Output is correct
103 Correct 63 ms 31420 KB Output is correct
104 Correct 63 ms 31204 KB Output is correct
105 Correct 201 ms 37268 KB Output is correct
106 Correct 192 ms 35488 KB Output is correct
107 Correct 169 ms 40236 KB Output is correct
108 Correct 172 ms 40368 KB Output is correct
109 Correct 86 ms 26868 KB Output is correct
110 Correct 82 ms 27512 KB Output is correct
111 Correct 101 ms 33536 KB Output is correct
112 Correct 107 ms 33228 KB Output is correct