hdu 5821 Ball(2016 Multi-University Training Contest 8——贪心+排序)
来源:互联网 发布:fission for mac 编辑:程序博客网 时间:2024/05/29 17:16
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=5821
Ball
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 515 Accepted Submission(s): 309
Problem Description
ZZX has a sequence of boxes numbered 1,2,...,n . Each box can contain at most one ball.
You are given the initial configuration of the balls. For1≤i≤n , if the i -th box is empty then a[i]=0 , otherwise the i-th box contains exactly one ball, the color of which is a[i], a positive integer. Balls with the same color cannot be distinguished.
He will perform m operations in order. At the i-th operation, he collects all the balls from boxes l[i],l[i]+1,...,r[i]-1,r[i], and then arbitrarily put them back to these boxes. (Note that each box should always contain at most one ball)
He wants to change the configuration of the balls from a[1..n] to b[1..n] (given in the same format as a[1..n]), using these operations. Please tell him whether it is possible to achieve his goal.
You are given the initial configuration of the balls. For
He will perform m operations in order. At the i-th operation, he collects all the balls from boxes l[i],l[i]+1,...,r[i]-1,r[i], and then arbitrarily put them back to these boxes. (Note that each box should always contain at most one ball)
He wants to change the configuration of the balls from a[1..n] to b[1..n] (given in the same format as a[1..n]), using these operations. Please tell him whether it is possible to achieve his goal.
Input
First line contains an integer t. Then t testcases follow.
In each testcase: First line contains two integers n and m. Second line contains a[1],a[2],...,a[n]. Third line contains b[1],b[2],...,b[n]. Each of the next m lines contains two integers l[i],r[i].
1<=n<=1000,0<=m<=1000, sum of n over all testcases <=2000, sum of m over all testcases <=2000.
0<=a[i],b[i]<=n.
1<=l[i]<=r[i]<=n.
In each testcase: First line contains two integers n and m. Second line contains a[1],a[2],...,a[n]. Third line contains b[1],b[2],...,b[n]. Each of the next m lines contains two integers l[i],r[i].
1<=n<=1000,0<=m<=1000, sum of n over all testcases <=2000, sum of m over all testcases <=2000.
0<=a[i],b[i]<=n.
1<=l[i]<=r[i]<=n.
Output
For each testcase, print "Yes" or "No" in a line.
Sample Input
54 10 0 1 10 1 1 11 44 10 0 1 10 0 2 21 44 21 0 0 00 0 0 11 33 44 21 0 0 00 0 0 13 41 35 21 1 2 2 02 2 1 1 01 32 4
Sample Output
NoNoYesNoYes
Author
学军中学
Source
2016 Multi-University Training Contest 8
解题思路:用结构体存储a数组,值和下标,下标存的是a数组对应b数组之后的下标。然后在对a数组的下标进行排序,这样就会使a数组的值随着下标的变化而变换,尽可能使a和b相同的值对应好,最后在扫一遍看两个数组相同位置的数字是否相同,相同输出Yes,否则输出No。
详见代码。
#include <iostream>#include <cstdio>#include <algorithm>using namespace std;#define N 1010struct node{ int a,i;//值和下标} s[N];int b[N];bool cmp(node a,node b){ return a.i<b.i;}int main(){ int t; scanf("%d",&t); while (t--) { int n,m,flag=1; scanf("%d%d",&n,&m); for (int i=0; i<n; i++) { scanf("%d",&s[i].a); s[i].i=-1; } for (int i=0; i<n; i++) { scanf("%d",&b[i]); for (int j=0; j<n; j++) { if (s[j].a==b[i]&&s[j].i==-1) { s[j].i=i; break; } } } int l,r; for (int i=0; i<m; i++) { scanf("%d%d",&l,&r); sort(s+l-1,s+r,cmp);//根据s的下标进行排序 } for (int i=0; i<n; i++) { if (b[i]!=s[i].a) { flag=0; break; } } if (flag==1) printf ("Yes\n"); else printf ("No\n"); } return 0;}
0 0
- hdu 5821 Ball(2016 Multi-University Training Contest 8——贪心+排序)
- HDU 5821 Ball 2016 Multi-University Training Contest 8
- HDU-5821 <2016 Multi-University Training 8> Ball (贪心)
- 贪心 ( HDU 5821 )——2016 Multi-University Training Contest 8 1001
- hdu 5821 2016 Multi-University Training Contest 8(排序)
- hdu 5821 2016 Multi-University Training Contest 8 Ball 解题报告
- 2016 Multi-University Training Contest 8 1001 Ball
- 贪心——Windows10 ( HDU 5802 ) ( 2016 Multi-University Training Contest 6 1010 )
- hdu 5802 Windows 10(2016 Multi-University Training Contest 6——贪心+dfs)
- 贪心——HDU 5813 ( 2016 Multi-University Training Contest 7 1005 )
- hdu 5821 Ball 2016 Multi-University 8
- HDU 5826 physics(积分 找规律)——2016 Multi-University Training Contest 8
- hdu 5826 physics(2016 Multi-University Training Contest 8——积分求解)
- hdu 5831 Rikka with Parenthesis II(2016 Multi-University Training Contest 8——模拟)
- 计算几何(组合计数+向量排序)——Eureka ( HDU 5738 ) ( 2016 Multi-University Training Contest 2 1005 )
- 2016 Multi-University Training Contest 8 题解
- (HDU 5802)2016 Multi-University Training Contest 6 Windows 10 (贪心)
- (HDU 5813)2016 Multi-University Training Contest 7 Elegant Construction (贪心、图论)
- java的四种引用
- 【办公-WORD】VBA 选中所有表格
- Java解析Json数据的两种方式
- hd 2066 一个人的旅行 (dijkstra)
- js 验证60s发短信
- hdu 5821 Ball(2016 Multi-University Training Contest 8——贪心+排序)
- svg 与svg动画
- 利用DFS拆分数系列;Depth First Search
- clone 远程分支 Cannot update paths and switch to branch 'dev' at the same time. Did you intend to checko
- 使用SQL语句操作SQLite数据库
- jenkins.plugins.publish_over.BapPublisherException
- 7.Zeng_Cache(1) --- 简介
- 文档工具
- java编程面试——风口的猪-中国牛市