Submission #55525196

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#include <bits/stdc++.h>
using namespace std;
using ui = unsigned;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define rep(i,l,r) for(int i=(l);i<=(r);++i)
#define per(i,l,r) for(int i=(l);i>=(r);--i)
#define repn(i,n) for(int i=0;i<(n);++i)
#define sizc(x) ((int)(x).size())
#define allc(x) (x).begin(),(x).end()
#define fir first
#define sec second
constexpr int N = 2e5+5;
int n,m;
ll a[N];
vector<pair<int,ll>> G[N];
ll dis[N];
bool vis[N];
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include <bits/stdc++.h>
using namespace std;

using ui = unsigned;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define rep(i,l,r) for(int i=(l);i<=(r);++i)
#define per(i,l,r) for(int i=(l);i>=(r);--i)
#define repn(i,n) for(int i=0;i<(n);++i)
#define sizc(x) ((int)(x).size())
#define allc(x) (x).begin(),(x).end()
#define fir first
#define sec second

constexpr int N = 2e5+5;
int n,m;
ll a[N];
vector<pair<int,ll>> G[N];
ll dis[N];
bool vis[N];
signed main(){
	#ifndef ONLINE_JUDGE
	freopen("sample.in","r",stdin);
	freopen("sample.out","w",stdout);
	#endif
	ios::sync_with_stdio(false);
	cin.tie(nullptr);

	cin>>n>>m;
	rep(i,1,n)cin>>a[i];
	rep(i,1,m){
		int u,v;ll w;
		cin>>u>>v>>w;
		G[u].emplace_back(v,w+a[v]);
		G[v].emplace_back(u,w+a[u]);
	}
	rep(i,1,n)dis[i]=1e18;
	priority_queue<pair<ll,int>,vector<pair<ll,int>>,greater<pair<ll,int>>> q;
	q.emplace(dis[1]=a[1],1);
	while(!q.empty()){
		int u=q.top().sec;q.pop();
		if(vis[u])continue;vis[u]=1;
		for(auto p:G[u]){
			int v=p.fir;ll w=p.sec;
			if(dis[v]>dis[u]+w)q.emplace(dis[v]=dis[u]+w,v);
		}
	}
	rep(i,2,n)cout<<dis[i]<<' ';cout<<'\n';
}

Submission Info

Compile Error

Main.cpp: In function ‘int main()’:
Main.cpp:43:17: warning: this ‘if’ clause does not guard... [-Wmisleading-indentation]
   43 |                 if(vis[u])continue;vis[u]=1;
      |                 ^~
Main.cpp:43:36: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the ‘if’
   43 |                 if(vis[u])continue;vis[u]=1;
      |                                    ^~~
Main.cpp:8:20: warning: this ‘for’ clause does not guard... [-Wmisleading-indentation]
    8 | #define rep(i,l,r) for(int i=(l);i<=(r);++i)
      |                    ^~~
Main.cpp:49:9: note: in expansion of macro ‘rep’
   49 |         rep(i,2,n)cout<<dis[i]<<' ';cout<<'\n';
      |         ^~~
Main.cpp:49:37: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the ‘for’
   49 |         rep(i,2,n)cout<<dis[i]<<' ';cout<<'\n';
      |                                     ^~~~

Judge Result