oj.uz

답안 #1046387

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1046387 2024-08-06T13:45:55 Z YassineBenYounes Construction Project 2 (JOI24_ho_t2) C++17
100 / 100
 169 ms 40372 KB 
#include<bits/stdc++.h>
#include<chrono>
#include<random>
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef double db;
ll gcd(ll a , ll b) {return b ? gcd(b , a % b) : a ;} // greatest common divisor (PGCD)
ll lcm(ll a , ll b) {return (a * b) / gcd(a , b);} // least common multiple (PPCM)
int dx[8] = {1, 0, 0, -1, 1, 1, -1, -1};
int dy[8] = {0, 1, -1, 0, 1, -1, -1, 1};
#define endl "\n"
#define ss second
#define ff first
#define all(x) (x).begin() , (x).end()
#define pb push_back
#define vi vector<int>
#define vii vector<pair<int,int>>
#define vl vector<ll>
#define vll vector<pair<ll,ll>>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pdd  pair<double,double>
#define vdd  vector<pdd>
#define speed ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pbds tree<pii, null_type, less<pii>,rb_tree_tag, tree_order_statistics_node_update>
using namespace __gnu_pbds;
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

////////////////////Only Clear Code//////////////////////////

void usaco_problem(){
    freopen("milkvisits.in", "r", stdin);
    freopen("milkvisits.out", "w", stdout);
}

void init(){
    #ifndef ONLINE_JUDGE

freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif // ONLINE_JUDGE
}
const int mx = 2e5+5;
const int LOG = 22;
const int inf = 1e9;
const ll mod = 1e9+7;
const int sq = 300;
#define int ll
int n, m;
ll s, t, l, k;
ll distances_s[mx], distances_t[mx];

vll graph[mx];
bool vis[mx];
int32_t main(){
    speed;
    cin >> n >> m;
    cin >> s >> t >> l >> k;
    while(m--){
        ll a, b, c;cin >> a >> b >> c;
        graph[a].pb({b, c});
        graph[b].pb({a, c});
    }
    for(int i = 1; i <= n;i++){
        distances_s[i] = distances_t[i] = 1e18;
    }
    priority_queue<pll, vll, greater<pll>> pq;
    distances_s[s] = 0;
    pq.push({0, s});
    while(!pq.empty()){
        int node = pq.top().ss;
        ll dis = pq.top().ff;
        pq.pop();
        if(vis[node])continue;
        vis[node] = 1;
        for(pii adj : graph[node]){
            ll nw = dis + adj.ss;
            if(nw < distances_s[adj.ff]){
                distances_s[adj.ff] = nw;
                pq.push({nw, adj.ff});
            }
        }
    }
    memset(vis, 0, sizeof vis);
    distances_t[t] = 0;
    pq.push({0, t});
    while(!pq.empty()){
        int node = pq.top().ss;
        ll dis = pq.top().ff;
        pq.pop();
        if(vis[node])continue;
        vis[node] = 1;
        for(pii adj : graph[node]){
            ll nw = dis + adj.ss;
            if(nw < distances_t[adj.ff]){
                distances_t[adj.ff] = nw;
                pq.push({nw, adj.ff});
            }
        }
    }
    /*for(int i = 1; i <= n;i++){
        cout << i << " " << distances_s[i] << " " << distances_t[i] << endl;
    }*/
    for(int i = 1; i <= n;i++){
        ll tot = distances_s[i] + distances_t[i];
        if(tot <= k){
            cout << (n*(n-1))/2 << endl;
            return 0;
        }
    }
    ll ans = 0;
    k-=l;
    memset(vis, 0, sizeof vis);
    vll a, b;
    for(int i = 1; i <= n;i++){
        a.pb({distances_s[i], i});
        b.pb({distances_t[i], i});
    }
    sort(all(a), greater<pll>());
    sort(all(b));
    int j = 0;
    while(j < b.size() && ((a[0].ff + b[j].ff) <= k)){
        vis[b[j].ss] = 1;
        j++;
    }
    ans += j - vis[a[0].ss];
    for(int i = 1; i < a.size();i++){
        while(j < b.size() && ((a[i].ff + b[j].ff) <= k)){
            vis[b[j].ss] = 1;
            j++;
        }
        ans += j - vis[a[i].ss];
    }
    cout << ans << endl;
}

/*
    NEVER GIVE UP!
    DOING SMTHNG IS BETTER THAN DOING NTHNG!!!
    Your Guide when stuck:
    - Continue keyword only after reading the whole input
    - Don't use memset with testcases
    - Check for corner cases(n=1, n=0)
    - Check where you declare n(Be careful of declaring it globally and in main)
*/

Compilation message

Main.cpp: In function 'int32_t main()':
Main.cpp:126:13: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  126 |     while(j < b.size() && ((a[0].ff + b[j].ff) <= k)){
      |           ~~^~~~~~~~~~
Main.cpp:131:22: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  131 |     for(int i = 1; i < a.size();i++){
      |                    ~~^~~~~~~~~~
Main.cpp:132:17: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  132 |         while(j < b.size() && ((a[i].ff + b[j].ff) <= k)){
      |               ~~^~~~~~~~~~
Main.cpp: In function 'void usaco_problem()':
Main.cpp:36:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   36 |     freopen("milkvisits.in", "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:37:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   37 |     freopen("milkvisits.out", "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp: In function 'void init()':
Main.cpp:43:8: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   43 | freopen("input.txt", "r", stdin);
      | ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:44:8: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   44 | freopen("output.txt", "w", stdout);
      | ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6744 KB Output is correct
2 Correct 1 ms 6748 KB Output is correct
3 Correct 1 ms 6748 KB Output is correct
4 Correct 1 ms 6748 KB Output is correct
5 Correct 1 ms 7004 KB Output is correct
6 Correct 2 ms 7004 KB Output is correct
7 Correct 64 ms 27548 KB Output is correct
8 Correct 71 ms 26784 KB Output is correct
9 Correct 46 ms 18728 KB Output is correct
10 Correct 1 ms 6744 KB Output is correct
11 Correct 1 ms 6748 KB Output is correct
12 Correct 2 ms 7000 KB Output is correct
13 Correct 2 ms 7000 KB Output is correct
14 Correct 40 ms 23560 KB Output is correct
15 Correct 155 ms 29892 KB Output is correct
16 Correct 1 ms 6748 KB Output is correct
17 Correct 2 ms 7004 KB Output is correct
18 Correct 77 ms 29620 KB Output is correct
19 Correct 1 ms 6748 KB Output is correct
20 Correct 1 ms 6748 KB Output is correct
21 Correct 2 ms 7004 KB Output is correct
22 Correct 2 ms 7004 KB Output is correct
23 Correct 37 ms 24336 KB Output is correct
24 Correct 114 ms 31384 KB Output is correct
25 Correct 2 ms 6744 KB Output is correct
26 Correct 2 ms 7000 KB Output is correct
27 Correct 58 ms 27324 KB Output is correct
28 Correct 47 ms 24248 KB Output is correct
29 Correct 51 ms 28596 KB Output is correct

Subtask #2
16.0 / 16.0

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

Subtask #3
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6748 KB Output is correct
2 Correct 1 ms 6748 KB Output is correct
3 Correct 1 ms 6748 KB Output is correct
4 Correct 1 ms 6748 KB Output is correct
5 Correct 1 ms 6748 KB Output is correct
6 Correct 1 ms 6748 KB Output is correct
7 Correct 1 ms 6748 KB Output is correct
8 Correct 1 ms 6744 KB Output is correct
9 Correct 1 ms 6748 KB Output is correct
10 Correct 1 ms 6748 KB Output is correct
11 Correct 1 ms 6748 KB Output is correct
12 Correct 1 ms 6748 KB Output is correct
13 Correct 1 ms 6748 KB Output is correct
14 Correct 1 ms 6748 KB Output is correct
15 Correct 1 ms 6748 KB Output is correct
16 Correct 1 ms 6748 KB Output is correct
17 Correct 1 ms 6748 KB Output is correct
18 Correct 1 ms 6748 KB Output is correct
19 Correct 1 ms 6748 KB Output is correct
20 Correct 1 ms 6748 KB Output is correct
21 Correct 1 ms 6748 KB Output is correct
22 Correct 1 ms 6748 KB Output is correct
23 Correct 1 ms 6748 KB Output is correct
24 Correct 1 ms 6748 KB Output is correct
25 Correct 1 ms 6748 KB Output is correct
26 Correct 2 ms 6748 KB Output is correct
27 Correct 1 ms 6748 KB Output is correct
28 Correct 1 ms 6748 KB Output is correct
29 Correct 1 ms 6748 KB Output is correct
30 Correct 1 ms 6748 KB Output is correct
31 Correct 1 ms 7000 KB Output is correct
32 Correct 1 ms 6748 KB Output is correct
33 Correct 2 ms 7000 KB Output is correct
34 Correct 2 ms 7004 KB Output is correct
35 Correct 1 ms 7004 KB Output is correct
36 Correct 2 ms 7004 KB Output is correct
37 Correct 1 ms 7004 KB Output is correct
38 Correct 1 ms 7004 KB Output is correct
39 Correct 2 ms 7004 KB Output is correct
40 Correct 1 ms 7004 KB Output is correct
41 Correct 1 ms 7004 KB Output is correct
42 Correct 1 ms 7000 KB Output is correct
43 Correct 2 ms 7000 KB Output is correct
44 Correct 2 ms 7000 KB Output is correct
45 Correct 3 ms 7000 KB Output is correct
46 Correct 2 ms 7000 KB Output is correct
47 Correct 2 ms 7000 KB Output is correct
48 Correct 2 ms 7000 KB Output is correct
49 Correct 2 ms 7004 KB Output is correct
50 Correct 1 ms 7004 KB Output is correct
51 Correct 2 ms 7004 KB Output is correct
52 Correct 2 ms 7004 KB Output is correct
53 Correct 3 ms 7000 KB Output is correct
54 Correct 2 ms 7004 KB Output is correct
55 Correct 2 ms 7000 KB Output is correct
56 Correct 2 ms 7004 KB Output is correct
57 Correct 2 ms 7004 KB Output is correct
58 Correct 2 ms 7004 KB Output is correct

Subtask #4
47.0 / 47.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6744 KB Output is correct
2 Correct 1 ms 6748 KB Output is correct
3 Correct 1 ms 6748 KB Output is correct
4 Correct 1 ms 6748 KB Output is correct
5 Correct 1 ms 7004 KB Output is correct
6 Correct 2 ms 7004 KB Output is correct
7 Correct 64 ms 27548 KB Output is correct
8 Correct 71 ms 26784 KB Output is correct
9 Correct 46 ms 18728 KB Output is correct
10 Correct 1 ms 6744 KB Output is correct
11 Correct 1 ms 6748 KB Output is correct
12 Correct 2 ms 7000 KB Output is correct
13 Correct 2 ms 7000 KB Output is correct
14 Correct 40 ms 23560 KB Output is correct
15 Correct 155 ms 29892 KB Output is correct
16 Correct 1 ms 6748 KB Output is correct
17 Correct 2 ms 7004 KB Output is correct
18 Correct 77 ms 29620 KB Output is correct
19 Correct 1 ms 6748 KB Output is correct
20 Correct 1 ms 6748 KB Output is correct
21 Correct 2 ms 7004 KB Output is correct
22 Correct 2 ms 7004 KB Output is correct
23 Correct 37 ms 24336 KB Output is correct
24 Correct 114 ms 31384 KB Output is correct
25 Correct 2 ms 6744 KB Output is correct
26 Correct 2 ms 7000 KB Output is correct
27 Correct 58 ms 27324 KB Output is correct
28 Correct 47 ms 24248 KB Output is correct
29 Correct 51 ms 28596 KB Output is correct
30 Correct 1 ms 6748 KB Output is correct
31 Correct 1 ms 6748 KB Output is correct
32 Correct 1 ms 6748 KB Output is correct
33 Correct 1 ms 6748 KB Output is correct
34 Correct 1 ms 6748 KB Output is correct
35 Correct 1 ms 6748 KB Output is correct
36 Correct 1 ms 6748 KB Output is correct
37 Correct 1 ms 6744 KB Output is correct
38 Correct 1 ms 6748 KB Output is correct
39 Correct 1 ms 6748 KB Output is correct
40 Correct 1 ms 6748 KB Output is correct
41 Correct 1 ms 6748 KB Output is correct
42 Correct 1 ms 6748 KB Output is correct
43 Correct 1 ms 6748 KB Output is correct
44 Correct 1 ms 6748 KB Output is correct
45 Correct 1 ms 6748 KB Output is correct
46 Correct 1 ms 6748 KB Output is correct
47 Correct 1 ms 6748 KB Output is correct
48 Correct 1 ms 6748 KB Output is correct
49 Correct 1 ms 6748 KB Output is correct
50 Correct 1 ms 6748 KB Output is correct
51 Correct 1 ms 6748 KB Output is correct
52 Correct 1 ms 6748 KB Output is correct
53 Correct 1 ms 6748 KB Output is correct
54 Correct 1 ms 6748 KB Output is correct
55 Correct 2 ms 6748 KB Output is correct
56 Correct 1 ms 6748 KB Output is correct
57 Correct 1 ms 6748 KB Output is correct
58 Correct 1 ms 6748 KB Output is correct
59 Correct 1 ms 6748 KB Output is correct
60 Correct 1 ms 7000 KB Output is correct
61 Correct 1 ms 6748 KB Output is correct
62 Correct 2 ms 7000 KB Output is correct
63 Correct 2 ms 7004 KB Output is correct
64 Correct 1 ms 7004 KB Output is correct
65 Correct 2 ms 7004 KB Output is correct
66 Correct 1 ms 7004 KB Output is correct
67 Correct 1 ms 7004 KB Output is correct
68 Correct 2 ms 7004 KB Output is correct
69 Correct 1 ms 7004 KB Output is correct
70 Correct 1 ms 7004 KB Output is correct
71 Correct 1 ms 7000 KB Output is correct
72 Correct 2 ms 7000 KB Output is correct
73 Correct 2 ms 7000 KB Output is correct
74 Correct 3 ms 7000 KB Output is correct
75 Correct 2 ms 7000 KB Output is correct
76 Correct 2 ms 7000 KB Output is correct
77 Correct 2 ms 7000 KB Output is correct
78 Correct 2 ms 7004 KB Output is correct
79 Correct 1 ms 7004 KB Output is correct
80 Correct 2 ms 7004 KB Output is correct
81 Correct 2 ms 7004 KB Output is correct
82 Correct 3 ms 7000 KB Output is correct
83 Correct 2 ms 7004 KB Output is correct
84 Correct 2 ms 7000 KB Output is correct
85 Correct 2 ms 7004 KB Output is correct
86 Correct 2 ms 7004 KB Output is correct
87 Correct 2 ms 7004 KB Output is correct
88 Correct 69 ms 23868 KB Output is correct
89 Correct 64 ms 23760 KB Output is correct
90 Correct 93 ms 31876 KB Output is correct
91 Correct 38 ms 20488 KB Output is correct
92 Correct 31 ms 20568 KB Output is correct
93 Correct 49 ms 24956 KB Output is correct
94 Correct 43 ms 24360 KB Output is correct
95 Correct 128 ms 30956 KB Output is correct
96 Correct 101 ms 24324 KB Output is correct
97 Correct 114 ms 31108 KB Output is correct
98 Correct 135 ms 31288 KB Output is correct
99 Correct 56 ms 31040 KB Output is correct
100 Correct 65 ms 30248 KB Output is correct
101 Correct 37 ms 20360 KB Output is correct
102 Correct 41 ms 20564 KB Output is correct
103 Correct 76 ms 24224 KB Output is correct
104 Correct 45 ms 25188 KB Output is correct
105 Correct 137 ms 32232 KB Output is correct
106 Correct 165 ms 33252 KB Output is correct
107 Correct 169 ms 35824 KB Output is correct
108 Correct 141 ms 40372 KB Output is correct
109 Correct 63 ms 25316 KB Output is correct
110 Correct 67 ms 25476 KB Output is correct
111 Correct 78 ms 28272 KB Output is correct
112 Correct 77 ms 28464 KB Output is correct