Submission #67547581

---

Source Code Expand

#include <cstdio>
#include <cstring>
#include <vector>
#include <queue>
#include <utility>
#define fi first
#define se second
using namespace std;
template<class T> using heap=priority_queue<T,vector<T>,greater<T>>;
using ll = long long;
const int N = 1e5, M = 1.5e6;
int n,m,tot;
ll a[N + 2],dis[M + 2];
vector<pair<int,ll>> e[M + 2];
struct Segtree {
	static const int S = N << 2;
	int s[S],b[N + 2];
	vector<pair<int,int>> p;
	int z[N + 2],en;
#define mid (l+r>>1)
#define ls (u<<1)
#define rs (ls|1)
#define li ls,l,mid
#define ri rs,mid+1,r
	void init(int u,int l,int r) {
		s[u]=++tot;
		if(l==r) return b[l]=s[u],void();
		init(li);
		init(ri);
		p.emplace_back(s[u],s[ls]);
		p.emplace_back(s[u],s[rs]);
	}
	void ask(int l,int r) {
		en=0;
		qry(1,1,n,l,r);
	}
	void qry(int u,int l,int r,int x,int y) {
		if(r<x||y<l) return ;
		if(x<=l&&r<=y) return z[++en]=s[u],void();
		if(x<=mid) qry(li,x,y);
		if(mid<y) qry(ri,x,y);
	}
} f0,f1,g0,g1;
inline void ins(int u,int v,ll w) { e[u].emplace_back(v,w); }
int main() {
	scanf("%d%d",&n,&m);
	for(int i=1; i<=n; ++i) scanf("%lld",&a[i]);
	tot=n;
	f0.init(1,1,n);
	f1.init(1,1,n);
	g0.init(1,1,n);
	g1.init(1,1,n);
	for(auto [p,u] : f0.p) ins(p,u,0);
	for(auto [p,u] : f1.p) ins(p,u,0);
	for(auto [p,u] : g0.p) ins(u,p,0);
	for(auto [p,u] : g1.p) ins(u,p,0);
	for(int i=1; i<=n; ++i) {
		ins(f0.b[i],i,-a[i]);
		ins(f1.b[i],i,a[i]);
		ins(i,g0.b[i],-a[i]);
		ins(i,g1.b[i],a[i]);
	}
	for(int i=1; i<=m; ++i) {
		int l,r,x,y;
		ll c;
		scanf("%d%d%d%d%lld\n",&l,&r,&x,&y,&c);
		int u=++tot;
		if(r<x) {
			g0.ask(l,r);
			for(int j=1; j<=g0.en; ++j) ins(g0.z[j],u,c);
			f1.ask(x,y);
			for(int j=1; j<=f1.en; ++j) ins(u,f1.z[j],0);
		} else {
			g1.ask(l,r);
			for(int j=1; j<=g1.en; ++j) ins(g1.z[j],u,c);
			f0.ask(x,y);
			for(int j=1; j<=f0.en; ++j) ins(u,f0.z[j],0);
		}
	}
	heap<pair<ll,int>> Q;
	memset(dis,0x3f,sizeof(dis));
	Q.emplace(dis[1]=0,1);
	while(Q.size()) {
		auto [d,u]=Q.top();
		Q.pop();
		if(dis[u]!=d) continue;
		for(auto [v,w] : e[u])
			if(d+w<dis[v])
				Q.emplace(dis[v]=d+w,v);
	}
	for(int i=2; i<=n; ++i) printf("%lld ",dis[i]==dis[0]?-1:dis[i]);
	return 0;
}

Submission Info

Compile Error

Main.cpp: In member function ‘void Segtree::init(int, int, int)’:
Main.cpp:20:15: warning: suggest parentheses around ‘+’ inside ‘>>’ [-Wparentheses]
   20 | #define mid (l+r>>1)
      |              ~^~
Main.cpp:23:17: note: in expansion of macro ‘mid’
   23 | #define li ls,l,mid
      |                 ^~~
Main.cpp:28:22: note: in expansion of macro ‘li’
   28 |                 init(li);
      |                      ^~
Main.cpp:20:15: warning: suggest parentheses around ‘+’ inside ‘>>’ [-Wparentheses]
   20 | #define mid (l+r>>1)
      |              ~^~
Main.cpp:24:15: note: in expansion of macro ‘mid’
   24 | #define ri rs,mid+1,r
      |               ^~~
Main.cpp:29:22: note: in expansion of macro ‘ri’
   29 |                 init(ri);
      |                      ^~
Main.cpp: In member function ‘void Segtree::qry(int, int, int, int, int)’:
Main.cpp:20:15: warning: suggest parentheses around ‘+’ inside ‘>>’ [-Wparentheses]
   20 | #define mid (l+r>>1)
      |              ~^~
Main.cpp:40:23: note: in expansion of macro ‘mid’
   40 |                 if(x<=mid) qry(li,x,y);
      |                       ^~~
Main.cpp:20:15: warning: suggest parentheses around ‘+’ inside ‘>>’ [-Wparentheses]
   20 | #define mid (l+r>>1)
      |              ~^~
Main.cpp:23:17: note: in expansion of macro ‘mid’
   23 | #define li ls,l,mid
      |                 ^~~
Main.cpp:40:32: note: in expansion of macro ‘li’
   40 |                 if(x<=mid) qry(li,x,y);
      |                                ^~
Main.cpp:20:15: warning: suggest parentheses around ‘+’ inside ‘>>’ [-Wparentheses]
   20 | #define mid (l+r>>1)
      |              ~^~
Main.cpp:41:20: note: in expansion of macro ‘mid’
   41 |                 if(mid<y) qry(ri,x,y);
      |                    ^~~
Main.cpp:20:15: warning: suggest parentheses around ‘+’ inside ‘>>’ [-Wparentheses]
   20 | #define mid (l+r>>1)
      |              ~^~
Main.cpp:24:15: note: in expansion of macro ‘mid’
   24 | #define ri rs,mid+1,r
      |               ^~~
Main.cpp:41:31: note: in expansion of macro ‘ri’
   41 |                 if(mid<y) qry(ri,x,y);
      |                               ^~
Main.cpp: In function ‘int main()’:
Main.cpp:46:14: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   46 |         scanf("%d%d",&n,&m);
      |         ~~~~~^~~~~~~~~~~~~~
Main.cpp:47:38: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   47 |         for(int i=1; i<=n; ++i) scanf("%lld",&a[i]);
      |                                 ~~~~~^~~~~~~~~~~~~~
Main.cpp:66:22: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   66 |                 scanf("%d%d%d%d%lld\n",&l,&r,&x,&y,&c);
      |                 ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Judge Result