F - Many Moves
F - Many Moves
Time limit : 2sec / Memory limit : 256MB
Score : 900 points
Problem Statement
There are N squares in a row. The squares are numbered 1,2,…,N from left to right.
You have two pieces, initially placed on square A and B, respectively. You will be asked to process Q queries of the following kind, in the order received:
- Given an integer xi, move one of the two pieces of your choice to square xi.
Here, it takes you one second to move a piece one square. That is, the time it takes to move a piece from square X to Y is |X−Y| seconds.
Your objective is to process all the queries in the shortest possible time.
You may only move the pieces in response to queries, and you may not move both pieces at the same time. Also, it is not allowed to rearrange the order in which queries are given. It is, however, allowed to have both pieces in the same square at the same time.
Constraints
- 1≤N,Q≤200,000
- 1≤A,B≤N
- 1≤xi≤N
Input
Input is given from Standard Input in the following format:
N Q A B
x1 x2 ... xQ
Output
Let the shortest possible time to process all the queries be X seconds. Print X.
Sample Input 1
8 3 1 8
3 5 1
Sample Output 1
7
All the queries can be processed in seven seconds, by:
- moving the piece at square 1 to 3
- moving the piece at square 8 to 5
- moving the piece at square 3 to 1
Sample Input 2
9 2 1 9
5 1
Sample Output 2
4
The piece at square 9 should be moved first.
Sample Input 3
9 2 1 9
5 9
Sample Output 3
4
The piece at square 1 should be moved first.
Sample Input 4
11 16 8 1
1 1 5 1 11 4 5 2 5 3 3 3 5 5 6 7
Sample Output 4
21
分析:考虑dp[i][j]表示当前在x[i],j位置;
设之前一步在a,b,当前到c,d,且a,c为上次和这次到达点;
那么有a->c或b->c;
若a->c,则dp[i][j]直接加上abs(x[i]-x[i-1]);
若b->c,则dp[i][a]取min{dp[i-1][j]+abs(j-x[i])};
而这两个都可以用线段树维护;
代码:
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <climits>
#include <cstring>
#include <string>
#include <set>
#include <bitset>
#include <map>
#include <queue>
#include <stack>
#include <vector>
#include <cassert>
#include <ctime>
#define rep(i,m,n) for(i=m;i<=n;i++)
#define mod 1000000009
#define inf 0x3f3f3f3f
#define vi vector<int>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define ll long long
#define pi acos(-1.0)
#define pii pair<int,int>
#define sys system("pause")
#define ls rt<<1
#define rs rt<<1|1
const int maxn=2e5+;
const int N=2e5+;
using namespace std;
int id(int l,int r){return l+r|l!=r;}
ll gcd(ll p,ll q){return q==?p:gcd(q,p%q);}
ll qpow(ll p,ll q){ll f=;while(q){if(q&)f=f*p%mod;p=p*p%mod;q>>=;}return f;}
int n,m,k,t,q,a,b;
ll tag[maxn<<],mi[maxn<<],mi1[maxn<<],mi2[maxn<<];
void pup(int rt)
{
mi[rt]=min(mi[ls],mi[rs]);
mi1[rt]=min(mi1[ls],mi1[rs]);
mi2[rt]=min(mi2[ls],mi2[rs]);
tag[rt]=;
}
void pdw(int rt)
{
mi[ls]+=tag[rt];
mi1[ls]+=tag[rt];
mi2[ls]+=tag[rt];
tag[ls]+=tag[rt];
mi[rs]+=tag[rt];
mi1[rs]+=tag[rt];
mi2[rs]+=tag[rt];
tag[rs]+=tag[rt];
tag[rt]=;
}
void build(int l,int r,int rt)
{
if(l==r)
{
mi[rt]=mi1[rt]=mi2[rt]=1e18;
tag[rt]=;
return;
}
int mid=l+r>>;
build(l,mid,ls);
build(mid+,r,rs);
pup(rt);
}
void add(int L,int R,ll v,int l,int r,int rt)
{
if(L==l&&R==r)
{
mi[rt]+=v;
mi1[rt]+=v;
mi2[rt]+=v;
tag[rt]+=v;
return;
}
int mid=l+r>>;
if(tag[rt])pdw(rt);
if(R<=mid)add(L,R,v,l,mid,ls);
else if(L>mid)add(L,R,v,mid+,r,rs);
else
{
add(L,mid,v,l,mid,ls);
add(mid+,R,v,mid+,r,rs);
}
pup(rt);
}
void upd(int pos,ll v,int l,int r,int rt)
{
if(l==pos&&pos==r)
{
if(mi[rt]>v)
{
mi[rt]=v;
mi1[rt]=v-pos;
mi2[rt]=v+pos;
}
return;
}
int mid=l+r>>;
if(tag[rt])pdw(rt);
if(pos<=mid)upd(pos,v,l,mid,ls);
else upd(pos,v,mid+,r,rs);
pup(rt);
}
ll gao(int L,int R,int l,int r,int rt,ll *mi)
{
if(L==l&&R==r)return mi[rt];
int mid=l+r>>;
if(tag[rt])pdw(rt);
if(R<=mid)return gao(L,R,l,mid,ls,mi);
else if(L>mid)return gao(L,R,mid+,r,rs,mi);
else return min(gao(L,mid,l,mid,ls,mi),gao(mid+,R,mid+,r,rs,mi));
}
int main()
{
int i,j;
scanf("%d%d%d%d",&n,&q,&a,&b);
build(,n,);
upd(b,,,n,);
int pre=a;
rep(i,,q)
{
int x;
scanf("%d",&x);
ll cost1=gao(,x,,n,,mi1)+x;
ll cost2=gao(x,n,,n,,mi2)-x;
ll now=min(cost1,cost2);
add(,n,abs(x-pre),,n,);
upd(pre,now,,n,);
pre=x;
}
printf("%lld\n",gao(,n,,n,,mi));
return ;
}
F - Many Moves的更多相关文章
- arc073 F many moves(dp + 线段树)
设dp[i][y]表示一个点在x[i],另一个点在y时最小要走的步数 那么有以下转移 对于y != x[i-1]的状态,可以证明,他们直接加|x[i] - x[i-1]|即可(如果有其他方案,不符合对 ...
- Scalaz(23)- 泛函数据结构: Zipper-游标定位
外面沙尘滚滚一直向北去了,意识到年关到了,码农们都回乡过年去了,而我却留在这里玩弄“拉链”.不要想歪了,我说的不是裤裆拉链而是scalaz Zipper,一种泛函数据结构游标(cursor).在函数式 ...
- AtCoder瞎做第二弹
ARC 067 F - Yakiniku Restaurants 题意 \(n\) 家饭店,\(m\) 张餐票,第 \(i\) 家和第 \(i+1\) 家饭店之间的距离是 \(A_i\) ,在第 \( ...
- 【AtCoder】ARC073
ARC 073 C - Sentou 直接线段覆盖即可 #include <bits/stdc++.h> #define fi first #define se second #defin ...
- Mysql_以案例为基准之查询
查询数据操作
- 2016 ccpc 网络选拔赛 F. Robots
Robots Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Subm ...
- [Educational Codeforces Round 16]A. King Moves
[Educational Codeforces Round 16]A. King Moves 试题描述 The only king stands on the standard chess board ...
- UVA 439 Knight Moves
// 题意:输入标准国际象棋棋盘上的两个格子,求马最少需要多少步从起点跳到终点 BFS求最短路: bfs并维护距离状态cnt, vis记录是否访问过 #include<cstdio> ...
- POJ 2243 Knight Moves
Knight Moves Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 13222 Accepted: 7418 Des ...
随机推荐
- bzoj 1601 灌水
题目大意: 决定把水灌到n块农田,农田被数字1到n标记 把一块土地进行灌水有两种方法,从其他农田饮水,或者这块土地建造水库 建造一个水库需要花费wi,连接两块土地需要花费Pij. 计算所需的最少代价 ...
- ubuntu下如何查看和设置分辨率 (转载)
转自:http://blog.csdn.net/jcgu/article/details/8650423 在ubuntu下可以使用xrandr来设置自己需要的分辨率.大致步骤如下: 1.使用xrand ...
- [Swift通天遁地]七、数据与安全-(4)CoreData数据的增、删、改、查
★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★➤微信公众号:山青咏芝(shanqingyongzhi)➤博客园地址:山青咏芝(https://www.cnblogs. ...
- C#中 分层 显示数据库中多表的数据信息
如下图,要实现将三个表中的内容加载到同一个窗体中,该怎么来实现呢? 要实现上面的查询结果,我们就要从Student表中拿到学生姓名,从Subject表中拿到科目名称,从StudentResult表中拿 ...
- Android FileProvider相关 Failed to find configured root that contains
问题: 使用FileProvider构造SD卡中文件uri时异常 java.lang.IllegalArgumentException: Failed to find configured root ...
- Android sensor 系统框架 (一)
这几天深入学习了Android sensor框架,以此博客记录和分享分析过程,其中难免会有错误的地方,欢迎指出! 这里主要分析KERNEL->HAL->JNI这3层的流程.主要从以下几方面 ...
- 使用TFS創建團隊項目
使用微軟賬號登錄Team Service,關聯一個TS賬戶,用來存放你所有的項目,可以從瀏覽器中直接訪問,地址類似yourname.visualstudio.com. 詳細鏈接 在TS賬戶主面板中,可 ...
- Lazarus 1.44升级到1.6 UTF8处理发生变化了
首先这里真的要强调一下,由于Freepascal升级到3.0后,FPC的内部将整个代码处理由AnsiString改为了UTF8编码(RTL with default codepage UTF-8). ...
- Centos7 Openstack - (第二节)添加认证服务(Keystone)
Centos7 install Openstack - (第二节)添加认证服务(Keystone) 我的blog地址:http://www.cnblogs.com/caoguo 根据openstack ...
- Android 动态设置 layout_centerInParent
RelativeLayout.LayoutParams rp = new RelativeLayout.LayoutParams(LayoutParams.WRAP_CONTENT, LayoutPa ...