oj.uz

답안 #1046393

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1046393 2024-08-06T13:47:40 Z YassineBenYounes Construction Project 2 (JOI24_ho_t2) C++17
100 / 100
 129 ms 34608 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;
ll 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(pll 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(pll 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));
    ll 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:125: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]
  125 |     while(j < b.size() && ((a[0].ff + b[j].ff) <= k)){
      |           ~~^~~~~~~~~~
Main.cpp:130:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  130 |     for(int i = 1; i < a.size();i++){
      |                    ~~^~~~~~~~~~
Main.cpp:131: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]
  131 |         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 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 2 ms 7004 KB Output is correct
6 Correct 1 ms 7060 KB Output is correct
7 Correct 60 ms 27540 KB Output is correct
8 Correct 86 ms 26700 KB Output is correct
9 Correct 46 ms 18744 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 7004 KB Output is correct
13 Correct 2 ms 7004 KB Output is correct
14 Correct 38 ms 21412 KB Output is correct
15 Correct 121 ms 27000 KB Output is correct
16 Correct 1 ms 6744 KB Output is correct
17 Correct 2 ms 7004 KB Output is correct
18 Correct 68 ms 27312 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 7004 KB Output is correct
22 Correct 2 ms 7004 KB Output is correct
23 Correct 41 ms 21812 KB Output is correct
24 Correct 113 ms 28352 KB Output is correct
25 Correct 1 ms 6748 KB Output is correct
26 Correct 1 ms 7004 KB Output is correct
27 Correct 56 ms 24148 KB Output is correct
28 Correct 46 ms 21920 KB Output is correct
29 Correct 53 ms 24424 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 6748 KB Output is correct
9 Correct 1 ms 6748 KB Output is correct
10 Correct 2 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 6744 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 1 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 6748 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 6748 KB Output is correct
9 Correct 1 ms 6748 KB Output is correct
10 Correct 2 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 6744 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 1 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 6748 KB Output is correct
32 Correct 1 ms 6748 KB Output is correct
33 Correct 2 ms 7004 KB Output is correct
34 Correct 1 ms 7004 KB Output is correct
35 Correct 2 ms 7000 KB Output is correct
36 Correct 3 ms 7000 KB Output is correct
37 Correct 2 ms 7004 KB Output is correct
38 Correct 2 ms 7004 KB Output is correct
39 Correct 2 ms 7004 KB Output is correct
40 Correct 2 ms 7000 KB Output is correct
41 Correct 2 ms 7004 KB Output is correct
42 Correct 3 ms 7004 KB Output is correct
43 Correct 3 ms 7004 KB Output is correct
44 Correct 2 ms 7004 KB Output is correct
45 Correct 2 ms 7140 KB Output is correct
46 Correct 2 ms 7004 KB Output is correct
47 Correct 3 ms 7092 KB Output is correct
48 Correct 2 ms 7004 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 2 ms 7004 KB Output is correct
54 Correct 2 ms 7000 KB Output is correct
55 Correct 2 ms 7008 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 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 2 ms 7004 KB Output is correct
6 Correct 1 ms 7060 KB Output is correct
7 Correct 60 ms 27540 KB Output is correct
8 Correct 86 ms 26700 KB Output is correct
9 Correct 46 ms 18744 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 7004 KB Output is correct
13 Correct 2 ms 7004 KB Output is correct
14 Correct 38 ms 21412 KB Output is correct
15 Correct 121 ms 27000 KB Output is correct
16 Correct 1 ms 6744 KB Output is correct
17 Correct 2 ms 7004 KB Output is correct
18 Correct 68 ms 27312 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 7004 KB Output is correct
22 Correct 2 ms 7004 KB Output is correct
23 Correct 41 ms 21812 KB Output is correct
24 Correct 113 ms 28352 KB Output is correct
25 Correct 1 ms 6748 KB Output is correct
26 Correct 1 ms 7004 KB Output is correct
27 Correct 56 ms 24148 KB Output is correct
28 Correct 46 ms 21920 KB Output is correct
29 Correct 53 ms 24424 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 6748 KB Output is correct
38 Correct 1 ms 6748 KB Output is correct
39 Correct 2 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 6744 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 1 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 6748 KB Output is correct
61 Correct 1 ms 6748 KB Output is correct
62 Correct 2 ms 7004 KB Output is correct
63 Correct 1 ms 7004 KB Output is correct
64 Correct 2 ms 7000 KB Output is correct
65 Correct 3 ms 7000 KB Output is correct
66 Correct 2 ms 7004 KB Output is correct
67 Correct 2 ms 7004 KB Output is correct
68 Correct 2 ms 7004 KB Output is correct
69 Correct 2 ms 7000 KB Output is correct
70 Correct 2 ms 7004 KB Output is correct
71 Correct 3 ms 7004 KB Output is correct
72 Correct 3 ms 7004 KB Output is correct
73 Correct 2 ms 7004 KB Output is correct
74 Correct 2 ms 7140 KB Output is correct
75 Correct 2 ms 7004 KB Output is correct
76 Correct 3 ms 7092 KB Output is correct
77 Correct 2 ms 7004 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 2 ms 7004 KB Output is correct
83 Correct 2 ms 7000 KB Output is correct
84 Correct 2 ms 7008 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 64 ms 19076 KB Output is correct
89 Correct 68 ms 19156 KB Output is correct
90 Correct 81 ms 28228 KB Output is correct
91 Correct 30 ms 16984 KB Output is correct
92 Correct 30 ms 16980 KB Output is correct
93 Correct 42 ms 22372 KB Output is correct
94 Correct 43 ms 21412 KB Output is correct
95 Correct 129 ms 27624 KB Output is correct
96 Correct 105 ms 19916 KB Output is correct
97 Correct 123 ms 26296 KB Output is correct
98 Correct 108 ms 27820 KB Output is correct
99 Correct 68 ms 26288 KB Output is correct
100 Correct 57 ms 26036 KB Output is correct
101 Correct 35 ms 17140 KB Output is correct
102 Correct 31 ms 16980 KB Output is correct
103 Correct 44 ms 23200 KB Output is correct
104 Correct 42 ms 22124 KB Output is correct
105 Correct 122 ms 28136 KB Output is correct
106 Correct 128 ms 26860 KB Output is correct
107 Correct 117 ms 31628 KB Output is correct
108 Correct 114 ms 34608 KB Output is correct
109 Correct 58 ms 21816 KB Output is correct
110 Correct 56 ms 21936 KB Output is correct
111 Correct 75 ms 27008 KB Output is correct
112 Correct 74 ms 25244 KB Output is correct