oj.uz

답안 #1112319

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1112319 2024-11-14T04:04:17 Z ljtunas Construction Project 2 (JOI24_ho_t2) C++14
16 / 100
 2000 ms 57388 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 = 1e6 + 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>>> 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
0.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 39504 KB Output is correct
2 Correct 8 ms 39504 KB Output is correct
3 Correct 8 ms 39504 KB Output is correct
4 Correct 8 ms 39364 KB Output is correct
5 Correct 9 ms 39648 KB Output is correct
6 Correct 9 ms 39848 KB Output is correct
7 Correct 80 ms 53812 KB Output is correct
8 Correct 92 ms 57388 KB Output is correct
9 Correct 79 ms 57388 KB Output is correct
10 Correct 8 ms 39400 KB Output is correct
11 Correct 8 ms 39392 KB Output is correct
12 Correct 9 ms 39504 KB Output is correct
13 Correct 47 ms 39760 KB Output is correct
14 Correct 50 ms 44760 KB Output is correct
15 Execution timed out 2074 ms 50880 KB Time limit exceeded
16 Halted 0 ms 0 KB -

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 39504 KB Output is correct
2 Correct 8 ms 39504 KB Output is correct
3 Correct 8 ms 39504 KB Output is correct
4 Correct 7 ms 39504 KB Output is correct
5 Correct 7 ms 39504 KB Output is correct
6 Correct 9 ms 39516 KB Output is correct
7 Correct 7 ms 39504 KB Output is correct
8 Correct 7 ms 39504 KB Output is correct
9 Correct 7 ms 39504 KB Output is correct
10 Correct 7 ms 39504 KB Output is correct
11 Correct 7 ms 39504 KB Output is correct
12 Correct 7 ms 39672 KB Output is correct
13 Correct 9 ms 39504 KB Output is correct
14 Correct 8 ms 39504 KB Output is correct
15 Correct 7 ms 39504 KB Output is correct
16 Correct 8 ms 39504 KB Output is correct
17 Correct 7 ms 39504 KB Output is correct
18 Correct 7 ms 39504 KB Output is correct
19 Correct 9 ms 39504 KB Output is correct
20 Correct 7 ms 39488 KB Output is correct
21 Correct 7 ms 39504 KB Output is correct
22 Correct 9 ms 39504 KB Output is correct
23 Correct 7 ms 39504 KB Output is correct
24 Correct 7 ms 39672 KB Output is correct
25 Correct 9 ms 39504 KB Output is correct
26 Correct 11 ms 39416 KB Output is correct
27 Correct 11 ms 39504 KB Output is correct
28 Correct 9 ms 39672 KB Output is correct
29 Correct 10 ms 39504 KB Output is correct
30 Correct 9 ms 39428 KB Output is correct
31 Correct 9 ms 39504 KB Output is correct
32 Correct 8 ms 39504 KB Output is correct

Subtask #3
0.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 39504 KB Output is correct
2 Correct 8 ms 39504 KB Output is correct
3 Correct 8 ms 39504 KB Output is correct
4 Correct 7 ms 39504 KB Output is correct
5 Correct 7 ms 39504 KB Output is correct
6 Correct 9 ms 39516 KB Output is correct
7 Correct 7 ms 39504 KB Output is correct
8 Correct 7 ms 39504 KB Output is correct
9 Correct 7 ms 39504 KB Output is correct
10 Correct 7 ms 39504 KB Output is correct
11 Correct 7 ms 39504 KB Output is correct
12 Correct 7 ms 39672 KB Output is correct
13 Correct 9 ms 39504 KB Output is correct
14 Correct 8 ms 39504 KB Output is correct
15 Correct 7 ms 39504 KB Output is correct
16 Correct 8 ms 39504 KB Output is correct
17 Correct 7 ms 39504 KB Output is correct
18 Correct 7 ms 39504 KB Output is correct
19 Correct 9 ms 39504 KB Output is correct
20 Correct 7 ms 39488 KB Output is correct
21 Correct 7 ms 39504 KB Output is correct
22 Correct 9 ms 39504 KB Output is correct
23 Correct 7 ms 39504 KB Output is correct
24 Correct 7 ms 39672 KB Output is correct
25 Correct 9 ms 39504 KB Output is correct
26 Correct 11 ms 39416 KB Output is correct
27 Correct 11 ms 39504 KB Output is correct
28 Correct 9 ms 39672 KB Output is correct
29 Correct 10 ms 39504 KB Output is correct
30 Correct 9 ms 39428 KB Output is correct
31 Correct 9 ms 39504 KB Output is correct
32 Correct 8 ms 39504 KB Output is correct
33 Correct 11 ms 39760 KB Output is correct
34 Correct 9 ms 39944 KB Output is correct
35 Correct 10 ms 39504 KB Output is correct
36 Correct 54 ms 39760 KB Output is correct
37 Correct 9 ms 39516 KB Output is correct
38 Correct 8 ms 39504 KB Output is correct
39 Correct 48 ms 39632 KB Output is correct
40 Correct 11 ms 39760 KB Output is correct
41 Correct 12 ms 39760 KB Output is correct
42 Correct 10 ms 39680 KB Output is correct
43 Correct 71 ms 39564 KB Output is correct
44 Correct 47 ms 39760 KB Output is correct
45 Correct 20 ms 39928 KB Output is correct
46 Correct 10 ms 39760 KB Output is correct
47 Correct 10 ms 39712 KB Output is correct
48 Correct 13 ms 39516 KB Output is correct
49 Correct 11 ms 39804 KB Output is correct
50 Correct 10 ms 39504 KB Output is correct
51 Correct 67 ms 39764 KB Output is correct
52 Correct 45 ms 39760 KB Output is correct
53 Correct 12 ms 39760 KB Output is correct
54 Correct 13 ms 39820 KB Output is correct
55 Correct 30 ms 39760 KB Output is correct
56 Correct 34 ms 39760 KB Output is correct
57 Execution timed out 2074 ms 39772 KB Time limit exceeded
58 Halted 0 ms 0 KB -

Subtask #4
0.0 / 47.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 39504 KB Output is correct
2 Correct 8 ms 39504 KB Output is correct
3 Correct 8 ms 39504 KB Output is correct
4 Correct 8 ms 39364 KB Output is correct
5 Correct 9 ms 39648 KB Output is correct
6 Correct 9 ms 39848 KB Output is correct
7 Correct 80 ms 53812 KB Output is correct
8 Correct 92 ms 57388 KB Output is correct
9 Correct 79 ms 57388 KB Output is correct
10 Correct 8 ms 39400 KB Output is correct
11 Correct 8 ms 39392 KB Output is correct
12 Correct 9 ms 39504 KB Output is correct
13 Correct 47 ms 39760 KB Output is correct
14 Correct 50 ms 44760 KB Output is correct
15 Execution timed out 2074 ms 50880 KB Time limit exceeded
16 Halted 0 ms 0 KB -