2019.08.09【NOIP提高组】模拟 A 组

JZOJ 6286 走格子 洛谷 4442 Portal JZOJ 5781 秘密难题

题目

---

分析

一开始想着用一个栈存下可以放传送门的地方，结果思路错误WA掉了
应该要建边跑最短路，我用的是DIJKSTRA+堆优化

---

代码

#include <cstdio>
#include <cctype>
#include <algorithm>
#define rr register
using namespace std;
struct node{int y,w,next;}e[2000101]; const int inf=707406378;
const int dx[4]={-1,0,1,0},dy[4]={0,-1,0,1}; pair<int,int>heap[251001];
int dis[251001],n,m,cnt,tot,ls[251001],st,ed,a[4][501][501]; char s[501][501];
inline signed rk(int x,int y){return (x-1)*m+y;}
inline void add(int x,int y,int w){e[++tot]=(node){y,w,ls[x]}; ls[x]=tot;}
inline void Push(pair<int,int>w){
    heap[++cnt]=w;
    rr int x=cnt;
    while (x>1){
        if (heap[x>>1]>heap[x])
            swap(heap[x>>1],heap[x]),x>>=1;
        else return;
    }
}
inline void Pop(){
    heap[1]=heap[cnt--];
    rr int x=1;
    while ((x<<1)<=cnt){
        rr int y=x<<1;
        if (y<cnt&&heap[y+1]<heap[y]) ++y;
        if (heap[y]<heap[x]) swap(heap[y],heap[x]),x=y;
            else return;
    }
}
signed main(){
	freopen("portal.in","r",stdin);
	freopen("portal.out","w",stdout); 
	scanf("%d%d",&n,&m);
	for (rr int i=1;i<=n;++i) scanf("%s",s[i]+1);
	for (rr int i=1;i<=n;++i)
	for (rr int j=1;j<=m;++j){
		if (s[i][j]=='C') s[i][j]='.',st=rk(i,j);
		    else if (s[i][j]=='F') s[i][j]='.',ed=rk(i,j);
	}
	for (rr int i=2;i<n;++i)
	for (rr int j=2;j<m;++j)
	    a[0][i][j]=s[i][j]=='#'?0:a[0][i-1][j]+1,
	    a[1][i][j]=s[i][j]=='#'?0:a[1][i][j-1]+1;
	for (rr int i=n-1;i>1;--i)
	for (rr int j=m-1;j>1;--j)
		a[2][i][j]=s[i][j]=='#'?0:a[2][i+1][j]+1,
		a[3][i][j]=s[i][j]=='#'?0:a[3][i][j+1]+1;
	for (rr int i=1;i<=n;++i)
	for (rr int j=1;j<=m;++j) if (s[i][j]=='.'){
	    rr int step=inf;
	    for (rr int k=0;k<4;++k) step=step<a[k][i][j]?step:a[k][i][j];
		for (rr int k=0;k<4;++k){
		    if (s[i+dx[k]][j+dy[k]]=='.') add(rk(i,j),rk(i+dx[k],j+dy[k]),1);
	        if (a[k][i][j]>2) add(rk(i,j),rk(i+dx[k]*(a[k][i][j]-1),j+dy[k]*(a[k][i][j]-1)),step);
	    }
    }
	fill(dis+1,dis+1+n*m,inf); dis[st]=0; Push(make_pair(0,st));
	while (cnt){
		rr int x=heap[1].second,d=heap[1].first; Pop();
		if (dis[x]!=d) continue;
		for (rr int i=ls[x];i;i=e[i].next)
		if (dis[e[i].y]>dis[x]+e[i].w)
			dis[e[i].y]=dis[x]+e[i].w,
			Push(make_pair(dis[e[i].y],e[i].y));
	}
	if (dis[ed]==inf) printf("nemoguce");
	    else printf("%d",dis[ed]);
	return 0;
}

---

JZOJ 6287 扭动的树

题目

---

分析

用区间dp，设$dp[l][r][0/1]$表示区间$[l\sim r]$后取左/右节点的最大$sum$和，那么显然一般式为 d p [ i ] [ j ] [ 0 / 1 ] = m a x { d p [ i ] [ k − 1 ] [ 1 ] + d p [ k + 1 ] [ j ] [ 0 ] + s u m [ j ] − s u m [ i − 1 ] } dp[i][j][0/1]=max\{dp[i][k-1][1]+dp[k+1][j][0]+sum[j]-sum[i-1]\} dp[i][j][0/1]=max{dp[i][k−1][1]+dp[k+1][j][0]+sum[j]−sum[i−1]}，时间复杂度$O(n^3)$

---

代码

#include <cstdio>
#include <cctype>
#include <cstring>
#include <algorithm>
#define rr register
using namespace std;
typedef long long ll;
struct rec{ll w; int c;}a[301];
ll b[301][301],dp[2][301][301],ans; int n,sum[301];
inline ll iut(){
	rr ll ans=0; rr char c=getchar();
	while (!isdigit(c)) c=getchar();
	while (isdigit(c)) ans=(ans<<3)+(ans<<1)+(c^48),c=getchar();
	return ans;
}
inline ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
bool cmp(rec x,rec y){return x.w<y.w;}
signed main(){
	freopen("tree.in","r",stdin);
	freopen("tree.out","w",stdout);
	n=iut();
	for (rr int i=1;i<=n;++i) a[i]=(rec){iut(),iut()};
	sort(a+1,a+1+n,cmp);
	for (rr int i=1;i<n;++i)
	for (rr int j=i+1;j<=n;++j)
	    b[i][j]=gcd(a[i].w,a[j].w);
	memset(dp,-0x3f,sizeof(dp));
	for (rr int i=1;i<=n;++i){
		sum[i]=sum[i-1]+a[i].c;
		if (i!=1&&b[i-1][i]>1) dp[0][i][i]=a[i].c;
		if (i!=n&&b[i][i+1]>1) dp[1][i][i]=a[i].c;
	}
	ans=dp[0][0][0];
	for (rr int len=2;len<=n;++len)
	for (rr int l=1;l+len-1<=n;++l){
		rr int r=l+len-1;
		for (rr int k=l;k<=r;++k){
			rr ll t=sum[r]-sum[l-1];
			if (k==l) t+=dp[0][l+1][r];
			else if (k==r) t+=dp[1][l][r-1];
			else t+=dp[1][l][k-1]+dp[0][k+1][r];
			if (l!=1&&b[l-1][k]>1) dp[0][l][r]=dp[0][l][r]>t?dp[0][l][r]:t;
			if (r!=n&&b[k][r+1]>1) dp[1][l][r]=dp[1][l][r]>t?dp[1][l][r]:t;
			if (len==n) ans=ans>t?ans:t;
		}
	}
	if (ans<0) printf("-1"); else printf("%lld",ans);
	return 0;
}

---

JZOJ 6288 旋转子段

题目

在$1\sim n$的排列中旋转若干长度的一段，使位置与数值尽量匹配

---

分析

那么枚举中心点，给以该中心点旋转的按距离排序，暴力，时间复杂度$O(nlogn)$

---

代码

#include <cstdio>
#include <cctype>
#include <algorithm>
#include <vector>
#define rr register
using namespace std;
int n,sum[100001],ans,now; vector<int>b[200001];
inline signed iut(){
	rr int ans=0; rr char c=getchar();
	while (!isdigit(c)) c=getchar();
	while (isdigit(c)) ans=(ans<<3)+(ans<<1)+(c^48),c=getchar();
	return ans;
}
inline signed abs(int x){return x<0?-x:x;}
inline signed max(int a,int b){return a>b?a:b;}
bool cmp(int x,int y){
	return abs((x<<1)-now)<abs((y<<1)-now);
}
signed main(){
	freopen("rotate.in","r",stdin);
	freopen("rotate.out","w",stdout);
	n=iut();
	for (rr int i=1;i<=n;++i){
		rr int x=iut();
		b[x+i].push_back(i);
		sum[i]=sum[i-1]+(x==i);
	}
	for (rr int i=2;i<=(n<<1);++i)
	if (b[i].size()){
		now=i; sort(b[i].begin(),b[i].end(),cmp);
        rr int len=b[i].size();
		for (rr int j=0;j<len;++j){
			rr int l=b[i][j],r=i-b[i][j];
			if (l>r) l^=r,r^=l,l^=r;
			ans=max(ans,sum[l-1]+sum[n]-sum[r]+j+1);
		}
	}
	return !printf("%d",ans);
}