AT_abc237_e [ABC237E] Skiing 题解

洛谷
AT

思路

直接最长路。但是可以每个数*(-1),跑最短路。注意双向边。边权按题目意思来。

常规SPFA

#include<bits/stdc++.h>
#include<cstring>
#include<queue>
#include<set>
#include<stack>
#include<vector>
#include<map>
#define int long long
using namespace std;
const int N=3e5+10;
const int M=2023;
const int inf=0x3f3f3f3f;
int n,m;
int v[N],dis[N];
vector<int> a[N],b[N];
int ans;
void spfa(int x)
{
	queue<int> q;
	q.push(x);
	memset(dis,-inf,sizeof dis);
	dis[x]=0;
	while(q.size())
	{
		int now=q.front();
		q.pop();
		for(int i=0;i<a[now].size();i++)
		{
			int u=a[now][i];
			int v=b[now][i];
			if(dis[u]<dis[now]+v)
			{
				dis[u]=dis[now]+v;
				q.push(u);
			}
		} 
	} 
}
signed main()
{
	scanf("%lld%lld",&n,&m);
	for(int i=1;i<=n;i++)cin>>v[i];
	for(int i=1;i<=m;i++)
	{
		int x,y,f=0;
		scanf("%lld%lld",&x,&y);
		(v[x]>v[y]) ? f=v[x]-v[y] : (v[x]<v[y]) ? f=2*(v[x]-v[y]) : f=0;
		a[x].push_back(y);
		b[x].push_back(f);
	}
	spfa(1);
	for(int i=2;i<=n;i++)
	{
		ans=max(ans,dis[i]);
	}
	printf("%lld",ans);
} 

TLE

SPFA+双端队列优化

/*
#pragma GCC optimize(3)
#pragma GCC target("avx")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("inline")
#pragma GCC optimize("-fgcse")
#pragma GCC optimize("-fgcse-lm")
#pragma GCC optimize("-fipa-sra")
#pragma GCC optimize("-ftree-pre")
#pragma GCC optimize("-ftree-vrp")
#pragma GCC optimize("-fpeephole2")
#pragma GCC optimize("-ffast-math")
#pragma GCC optimize("-fsched-spec")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-falign-jumps")
#pragma GCC optimize("-falign-loops")
#pragma GCC optimize("-falign-labels")
#pragma GCC optimize("-fdevirtualize")
#pragma GCC optimize("-fcaller-saves")
#pragma GCC optimize("-fcrossjumping")
#pragma GCC optimize("-fthread-jumps")
#pragma GCC optimize("-funroll-loops")
#pragma GCC optimize("-fwhole-program")
#pragma GCC optimize("-freorder-blocks")
#pragma GCC optimize("-fschedule-insns")
#pragma GCC optimize("inline-functions")
#pragma GCC optimize("-ftree-tail-merge")
#pragma GCC optimize("-fschedule-insns2")
#pragma GCC optimize("-fstrict-aliasing")
#pragma GCC optimize("-fstrict-overflow")
#pragma GCC optimize("-falign-functions")
#pragma GCC optimize("-fcse-skip-blocks")
#pragma GCC optimize("-fcse-follow-jumps")
#pragma GCC optimize("-fsched-interblock")
#pragma GCC optimize("-fpartial-inlining")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("-freorder-functions")
#pragma GCC optimize("-findirect-inlining")
#pragma GCC optimize("-fhoist-adjacent-loads")
#pragma GCC optimize("-frerun-cse-after-loop")
#pragma GCC optimize("inline-small-functions")
#pragma GCC optimize("-finline-small-functions")
#pragma GCC optimize("-ftree-switch-conversion")
#pragma GCC optimize("-foptimize-sibling-calls")
#pragma GCC optimize("-fexpensive-optimizations")
#pragma GCC optimize("-funsafe-loop-optimizations")
#pragma GCC optimize("inline-functions-called-once")
#pragma GCC optimize("-fdelete-null-pointer-checks")
#pragma GCC optimize(2)
火车头，可以快一点，不必要
*/
#include<bits/stdc++.h>
#include<cstring>
#include<queue>
#include<set>
#include<stack>
#include<vector>
#include<map>
#define int long long
using namespace std;
const int N=2e5+114;
const int M=2023;
const int inf=0x3f3f3f3f;
int n,m;
int v[N];
int dis[N],vis[N];
vector<int> a[N],b[N];
int ans,first[N];
typedef pair<int, int> PII;
void spfa(int s)
{
  deque<int> q;
  memset(dis,inf,sizeof dis);
  q.push_back(s);
  dis[s]=0;
  vis[s]=1;
  while(q.size()) 
  {
    int now=q.front();
	q.pop_front();
    vis[now]=0;
    for(int i=0;i<a[now].size();i++) 
    {
      int v=a[now][i];
      int w=b[now][i];
      if(dis[v]>dis[now]+w) 
      {
        dis[v]=dis[now]+w;
        if(!vis[v]) 
        {
          vis[v]=1;
          if(!q.empty() and dis[v]<dis[q.front()])
		  {
		  	q.push_front(v);
		  	
		  }
          else
		  {
		  	q.push_back(v);
		   } 
        }
      }
    }
  }
}
signed main()
{
	scanf("%lld%lld",&n,&m);	
	for(int i=1;i<=n;i++)scanf("%lld",&v[i]);
	for(int i=1;i<=m;i++)
	{
		int x,y,f=0;
		scanf("%lld%lld",&x,&y);
		if(v[x]>v[y])f=v[x]-v[y];
		else if (v[x]<v[y])  f=2*(v[x]-v[y]);
		else f=0;
		a[x].push_back(y);
		b[x].push_back(-f);
		f=0;
		swap(x,y);
		if(v[x]>v[y])f=v[x]-v[y];
		else if (v[x]<v[y])  f=2*(v[x]-v[y]);
		else f=0;
		a[x].push_back(y);
		b[x].push_back(-f);
	}
	spfa(1);
	for(int i=1;i<=n;i++)
	{
		ans=min(ans,dis[i]);
	}
	printf("%lld",-ans);
} 

AC记录