UVA 1468 Restaurant ?
2016-10-14 09:07
309 查看
#include<iostream> #include<cstdio> #include<cstring> #include<algorithm> using namespace std; #define rep(i,a,b) for(int i=(a);i<(b);i++) #define ss(x) scanf("%d",&x) const int maxn=60000+10; int y,ax,ay,bx,by,m,n,h[maxn]; int main() { int t; ss(t); while(t--) { ss(m);ss(n); int a,b; ss(ax);ss(ay);ss(bx);ss(by); if(ax>bx) swap(ax,bx); y=ay; memset(h,0x7f,sizeof(h)); rep(i,2,n) {ss(a);ss(b);h[a]=min(h[a],abs(y-b));} h[ax]=h[bx]=0; rep(i,ax+1,bx) h[i]=min(h[i],h[i-1]+1); for(int i=bx;i>ax;i--) h[i]=min(h[i],h[i+1]+1); int ans=0; rep(i,ax+1,bx) if(h[i]) ans+=min(h[i]-1,y)+min(h[i]-1,m-y-1)+1; cout<<ans<<endl; } return 0; }
相关文章推荐
- UVaLive 4851 UVa 1468 - Restaurant (思维)
- UVa 1468 - Restaurant(贪心 + 扫描)
- ACM: uva 1468 - Restaurant
- uva 1468 - Restaurant(贪心)
- UVA 1468 - Restaurant(推理)
- uvalive 4851 Restaurant(扫描法)
- uvalive 4851 Restaurant(扫描法)
- UVALive - 4851 Restaurant 扫描
- UvaLive-4851-Restaurant
- UVALive - 4851 Restaurant
- uva 131 - The Psychic Poker Player
- uva10405 Longest Common Subsequence
- uva 1045 最佳完美匹配 km算法 && 枚举
- [动态规划]UVA111 - History Grading
- uva 11971 - Polygon(线性规划)
- UVa 622 - Grammar Evaluation(用栈计算表达式)
- 习题10-2 勤劳的蜜蜂 UVa808
- UVA-1626 Brackets sequence (简单区间DP)
- UVA 11752 The Super Powers【超级幂】
- uva 12230