Submission #3235309

---

Source Code Expand

#include <cstdio>
#include <algorithm>
#include <cstring>
#include <vector>
#include <queue>
#include <functional>
#include <utility>

using namespace std;
typedef long long lli;
typedef pair<lli,int> pli;

const lli inf=1e15;

struct edge{
	int t,w[2];
	edge() {}
	edge(int t,int a,int b):t(t){
		w[0]=a; w[1]=b;
	}
};

vector<edge> adj[100001];
int n,m,s,t;
lli dist[100001][2],mx[100001];
int vis[100001];

void dijk(int s,int t,int j) {
	priority_queue<pli,vector<pli>,greater<pli>> que;
	que.push(pli(0,s));
	fill(vis,vis+n+1,0);
	for(int i=1;i<=n;i++) dist[i][j] = inf;
	dist[s][j] = 0;

	while(!que.empty()) {
		lli cost=que.top().first;
		int cur=que.top().second;
		que.pop();

		if(vis[cur]) continue;
		vis[cur]=1;

		for(auto &it:adj[cur]) {
			if(!vis[it.t] && dist[it.t][j] > cost + it.w[j]) {
				dist[it.t][j] = cost+it.w[j];
				que.push(pli(dist[it.t][j],it.t));
			}
		}
	}
}


int main() {
	scanf("%d%d%d%d",&n,&m,&s,&t);
	for(int i=0,u,v,a,b;i<m;i++) {
		scanf("%d%d%d%d",&u,&v,&a,&b);
		adj[u].push_back(edge(v,a,b));
		adj[v].push_back(edge(u,a,b));
	}

	dijk(s,t,0);
	dijk(t,s,1);

	for(int i=n-1;i>=0;i--) {
		mx[i] = dist[i+1][0] + dist[i+1][1];
		if(i!=n-1) mx[i] = min(mx[i],mx[i+1]);
	}
	for(int i=0;i<n;i++) printf("%lld\n",inf-mx[i]);
	
	return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:54:31: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d%d%d",&n,&m,&s,&t);
                               ^
./Main.cpp:56:32: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d%d%d",&u,&v,&a,&b);
                                ^

Judge Result