oj.uz

Submission #1112325

# Submission time Handle Problem Language Result Execution time Memory
1112325 2024-11-14T04:10:37 Z ljtunas Construction Project 2 (JOI24_ho_t2) C++14
100 / 100
 206 ms 36020 KB 
// author : anhtun_hi , nqg
#include <bits/stdc++.h>
#define ll long long
#define ii pair<ll, ll>
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define reset(h, v)    memset(h, v, sizeof h)
#define Forv(i, a)     for(auto& i : a)
#define For(i, a, b)   for(int i = a; i <= b; ++i)
#define Ford(i, a, b)  for(int i = a; i >= b; --i)
#define c_bit(i)     __builtin_popcountll(i)
#define Bit(mask, i)    ((mask >> i) & 1LL)
#define onbit(mask, i)  ((mask) bitor (1LL << i))
#define offbit(mask, i) ((mask) &~ (1LL << i))
using namespace std;
namespace std {
    template <typename T, int D>
    struct _vector : public vector <_vector <T, D - 1>> {
        static_assert(D >= 1, "Dimension must be positive!");
        template <typename... Args>
        _vector(int n = 0, Args... args) : vector <_vector <T, D - 1>> (n, _vector <T, D - 1> (args...)) {}
    };
    template <typename T> struct _vector <T, 1> : public vector <T> {
        _vector(int n = 0, const T& val = T()) : vector <T> (n, val) {}
    };
    template <class A, class B> bool minimize(A &a, B b){return a > b ? a = b, true : false;}
    template <class A, class B> bool maximize(A &a, B b){return a < b ? a = b, true : false;}
}
const int dx[] = {0, 0, +1, -1}, dy[] = {-1, +1, 0, 0}, LOG = 20, base = 311, inf = 1e9 + 5;
const int MAXN = 2e5 + 5;
const  ll  mod = 1e9 + 7;
const  ll   oo = 1e18;
 
#define int long long
 
int n, m, s, t; ll L, k;
 
vector<ii> g[MAXN];
ll d[2][MAXN];
 
void Solve() {
    cin >> n >> m >> s >> t >> L >> k;
    For(i, 1, m){
        int u, v; ll w;
        cin >> u >> v >> w;
        g[u].push_back({v, w});
        g[v].push_back({u, w});
    }
    priority_queue<array<ll, 3>, vector<array<ll, 3>>, greater<array<ll, 3>>> pq;
    reset(d, 0x3f);
    pq.push({0, s, 0}); d[0][s] = 0;
    pq.push({0, t, 1}); d[1][t] = 0;
    while(pq.size()){
        auto [du, u, op] = pq.top(); pq.pop();
        if(du != d[op][u]) continue;
        for(auto [v, w] : g[u]){
            if(d[op][v] > d[op][u] + w){
                d[op][v] = d[op][u] + w;
                pq.push({d[op][v], v, op});
            }   
        }
    }
    if(d[0][t] <= k) cout << 1LL * n * (n - 1) / 2 << '\n';
    else {
        ll ans = 0;
        For(i, 0, 1) sort(d[i] + 1, d[i] + n + 1);
        For(i, 1, n) {
            int l = 0, r = n + 1;
            while(r - l > 1){
                int mid = l + r >> 1;
                if(d[0][i] + d[1][mid] <= k - L) l = mid;
                else r = mid;
            }
            ans += l;
        }
        cout << ans << '\n';
    }
}
 
int32_t main() {
    cin.tie(0) -> sync_with_stdio(0);
    if(fopen("JOI24_ho_t2.inp", "r")) {
        freopen("JOI24_ho_t2.inp", "r", stdin);
        freopen("JOI24_ho_t2.out", "w", stdout);
    }
 
    int t = 1;
//    cin >> t;
 
    for (int test = 1; test <= t; test++) {
        Solve();
    }
    return 0;
}

Compilation message

Main.cpp: In function 'void Solve()':
Main.cpp:55:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   55 |         auto [du, u, op] = pq.top(); pq.pop();
      |              ^
Main.cpp:57:18: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   57 |         for(auto [v, w] : g[u]){
      |                  ^
Main.cpp:71:29: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   71 |                 int mid = l + r >> 1;
      |                           ~~^~~
Main.cpp: In function 'int32_t main()':
Main.cpp:84:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   84 |         freopen("JOI24_ho_t2.inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:85:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   85 |         freopen("JOI24_ho_t2.out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 8272 KB Output is correct
2 Correct 2 ms 8272 KB Output is correct
3 Correct 2 ms 8128 KB Output is correct
4 Correct 3 ms 8272 KB Output is correct
5 Correct 4 ms 8452 KB Output is correct
6 Correct 4 ms 8528 KB Output is correct
7 Correct 71 ms 26048 KB Output is correct
8 Correct 89 ms 25988 KB Output is correct
9 Correct 81 ms 25892 KB Output is correct
10 Correct 3 ms 8444 KB Output is correct
11 Correct 3 ms 8444 KB Output is correct
12 Correct 3 ms 8272 KB Output is correct
13 Correct 4 ms 8272 KB Output is correct
14 Correct 41 ms 13560 KB Output is correct
15 Correct 165 ms 20160 KB Output is correct
16 Correct 3 ms 8272 KB Output is correct
17 Correct 6 ms 8272 KB Output is correct
18 Correct 87 ms 17676 KB Output is correct
19 Correct 3 ms 8272 KB Output is correct
20 Correct 3 ms 8272 KB Output is correct
21 Correct 4 ms 8272 KB Output is correct
22 Correct 4 ms 8272 KB Output is correct
23 Correct 40 ms 13584 KB Output is correct
24 Correct 157 ms 20160 KB Output is correct
25 Correct 2 ms 8272 KB Output is correct
26 Correct 4 ms 8528 KB Output is correct
27 Correct 93 ms 36016 KB Output is correct
28 Correct 70 ms 26152 KB Output is correct
29 Correct 67 ms 16456 KB Output is correct

Subtask #2
16.0 / 16.0

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

Subtask #3
29.0 / 29.0

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

Subtask #4
47.0 / 47.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 8272 KB Output is correct
2 Correct 2 ms 8272 KB Output is correct
3 Correct 2 ms 8128 KB Output is correct
4 Correct 3 ms 8272 KB Output is correct
5 Correct 4 ms 8452 KB Output is correct
6 Correct 4 ms 8528 KB Output is correct
7 Correct 71 ms 26048 KB Output is correct
8 Correct 89 ms 25988 KB Output is correct
9 Correct 81 ms 25892 KB Output is correct
10 Correct 3 ms 8444 KB Output is correct
11 Correct 3 ms 8444 KB Output is correct
12 Correct 3 ms 8272 KB Output is correct
13 Correct 4 ms 8272 KB Output is correct
14 Correct 41 ms 13560 KB Output is correct
15 Correct 165 ms 20160 KB Output is correct
16 Correct 3 ms 8272 KB Output is correct
17 Correct 6 ms 8272 KB Output is correct
18 Correct 87 ms 17676 KB Output is correct
19 Correct 3 ms 8272 KB Output is correct
20 Correct 3 ms 8272 KB Output is correct
21 Correct 4 ms 8272 KB Output is correct
22 Correct 4 ms 8272 KB Output is correct
23 Correct 40 ms 13584 KB Output is correct
24 Correct 157 ms 20160 KB Output is correct
25 Correct 2 ms 8272 KB Output is correct
26 Correct 4 ms 8528 KB Output is correct
27 Correct 93 ms 36016 KB Output is correct
28 Correct 70 ms 26152 KB Output is correct
29 Correct 67 ms 16456 KB Output is correct
30 Correct 3 ms 8272 KB Output is correct
31 Correct 3 ms 8272 KB Output is correct
32 Correct 3 ms 8440 KB Output is correct
33 Correct 3 ms 8272 KB Output is correct
34 Correct 3 ms 8440 KB Output is correct
35 Correct 3 ms 8272 KB Output is correct
36 Correct 3 ms 8272 KB Output is correct
37 Correct 3 ms 8272 KB Output is correct
38 Correct 3 ms 8272 KB Output is correct
39 Correct 4 ms 8272 KB Output is correct
40 Correct 3 ms 8272 KB Output is correct
41 Correct 3 ms 8272 KB Output is correct
42 Correct 3 ms 8272 KB Output is correct
43 Correct 4 ms 8272 KB Output is correct
44 Correct 3 ms 8272 KB Output is correct
45 Correct 2 ms 8272 KB Output is correct
46 Correct 2 ms 8272 KB Output is correct
47 Correct 3 ms 8272 KB Output is correct
48 Correct 3 ms 8048 KB Output is correct
49 Correct 3 ms 8272 KB Output is correct
50 Correct 3 ms 8272 KB Output is correct
51 Correct 3 ms 8272 KB Output is correct
52 Correct 3 ms 8272 KB Output is correct
53 Correct 3 ms 8272 KB Output is correct
54 Correct 3 ms 8440 KB Output is correct
55 Correct 3 ms 8272 KB Output is correct
56 Correct 2 ms 8272 KB Output is correct
57 Correct 3 ms 8440 KB Output is correct
58 Correct 2 ms 8236 KB Output is correct
59 Correct 3 ms 8272 KB Output is correct
60 Correct 3 ms 8272 KB Output is correct
61 Correct 3 ms 8272 KB Output is correct
62 Correct 4 ms 8528 KB Output is correct
63 Correct 4 ms 8528 KB Output is correct
64 Correct 3 ms 8272 KB Output is correct
65 Correct 6 ms 8272 KB Output is correct
66 Correct 3 ms 8272 KB Output is correct
67 Correct 3 ms 8272 KB Output is correct
68 Correct 4 ms 8444 KB Output is correct
69 Correct 4 ms 8528 KB Output is correct
70 Correct 3 ms 8404 KB Output is correct
71 Correct 3 ms 8188 KB Output is correct
72 Correct 4 ms 8272 KB Output is correct
73 Correct 4 ms 8448 KB Output is correct
74 Correct 4 ms 8272 KB Output is correct
75 Correct 4 ms 8272 KB Output is correct
76 Correct 4 ms 8272 KB Output is correct
77 Correct 4 ms 8272 KB Output is correct
78 Correct 3 ms 8380 KB Output is correct
79 Correct 4 ms 8272 KB Output is correct
80 Correct 4 ms 8536 KB Output is correct
81 Correct 4 ms 8272 KB Output is correct
82 Correct 5 ms 8472 KB Output is correct
83 Correct 4 ms 8540 KB Output is correct
84 Correct 4 ms 8528 KB Output is correct
85 Correct 4 ms 8528 KB Output is correct
86 Correct 4 ms 8272 KB Output is correct
87 Correct 4 ms 8272 KB Output is correct
88 Correct 82 ms 19344 KB Output is correct
89 Correct 98 ms 19212 KB Output is correct
90 Correct 98 ms 20744 KB Output is correct
91 Correct 43 ms 18868 KB Output is correct
92 Correct 42 ms 19228 KB Output is correct
93 Correct 46 ms 13392 KB Output is correct
94 Correct 47 ms 13392 KB Output is correct
95 Correct 189 ms 20164 KB Output is correct
96 Correct 149 ms 22452 KB Output is correct
97 Correct 159 ms 19780 KB Output is correct
98 Correct 138 ms 18504 KB Output is correct
99 Correct 87 ms 17480 KB Output is correct
100 Correct 80 ms 17480 KB Output is correct
101 Correct 46 ms 18760 KB Output is correct
102 Correct 45 ms 19272 KB Output is correct
103 Correct 49 ms 14416 KB Output is correct
104 Correct 48 ms 13648 KB Output is correct
105 Correct 206 ms 22372 KB Output is correct
106 Correct 204 ms 22204 KB Output is correct
107 Correct 187 ms 36020 KB Output is correct
108 Correct 179 ms 36012 KB Output is correct
109 Correct 86 ms 26164 KB Output is correct
110 Correct 92 ms 26604 KB Output is correct
111 Correct 112 ms 18108 KB Output is correct
112 Correct 120 ms 18116 KB Output is correct