Submission #1274895

#	Time	Username	Problem	Language	Result	Execution time	Memory
1274895		m.zeeshanrashid	Construction Project 2 (JOI24_ho_t2)	C++20	8 / 100	360 ms	38776 KiB

Main

#ifdef __AVX2__
#pragma GCC target "avx2"
#endif
#pragma GCC optimize "O3"
#pragma GCC optimize "unroll-loops"
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> 
#include <ext/pb_ds/tree_policy.hpp> 
using namespace __gnu_pbds; 
using namespace std;
#define int long long
#define elif else if
#define all(l) begin(l),end(l)
#define rall(l) rbegin(l),rend(l)
#define append push_back
#define print(l) for(auto i:l) cout<<i<<' '; cout<<endl;
#define pprint(a,b) cout<<a<<' '<<b<<endl;
#define inp(l) for(auto &i:l) cin>>i;
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define pai make_pair
#define endl "\n"
#define pii pair<int,int>
#define fi first
#define se second
#define vec vector
#define pq priority_queue

// const int mod=998244353;
const int mod1=998244353;
const int mod=1e9+7;
const int N=2e5+5;

int n,m,s,t,l,k;
int dis[2][N];
vec<vec<int>>G[N];


void dij(int u,int ind){
	pq<pii>q;
	q.push({0,u});
	for(int i=1;i<=n;i++) dis[ind][i]=1e18;
	while(q.size()){
		int w=-q.top().fi,u=q.top().se;
		q.pop();
		if(dis[ind][u]>w){
			dis[ind][u]=w;
			for(auto ed:G[u]){
				int v=ed[0],w1=ed[1];
				w1+=dis[ind][u];
				q.push({-w1,v});
			}
		}
	}
}

int iter=1,itera=1;
void solve(){
	cin>>n>>m>>s>>t>>l>>k;
	for(int i=1;i<=m;i++){
		int u,v,w;
		cin>>u>>v>>w;
		G[u].append({v,w});
		G[v].append({u,w});
	}
	dij(s,0);
	dij(t,1);
	if(dis[0][t]<=k){
		cout<<(n*(n-1))/2<<endl;
		return;
	}
	cout<<G[s].size()+G[t].size()+1<<endl;
}
signed main(){
	// freopen("","r",stdin);
	// freopen("","w",stdout);
	ios_base::sync_with_stdio(false);
	cin.tie(NULL); 
	cout.tie(NULL);
	// cin>>itera;
	for(iter=1;iter<=itera;iter++) solve();
}

• Subtask 1: 8 / 8
• Subtask 2: 0 / 16
• Subtask 3: 0 / 29
• Subtask 4: 0 / 47