2016 多校 Multi-University Training Contest 8 Balls
来源:互联网 发布:茗伊插件目标监控数据 编辑:程序博客网 时间:2024/05/19 07:25
hdu 5812 Balls
题意,给你n个箱子,每个箱子最多放一个球,然后球有不同颜色,同种颜色的球是一样的,现在给你一种排列方式,也就是告诉你这n个箱子里放了啥,0代表没放球,又告诉你一种操作,这个操作是将某个区间里所有的球随机重新排列,然后告诉你了另一种排列方式,和几个操作,问你在这几次操作之后,能否从最初态变到后来告诉你的那个排列。
搞几个样例测试,再思考,发现,可以贪心来做,你想办法定义一下最终态,然后让每次的操作逼近最终态,如果最后能一致就是成功,不然就不行,具体做法是将最终态重新定义,每个箱子里的数字依次从1到n,再回到最初态,把新的编号放到该放的位置,然后每次操作对每个区间进行排序,最后完成后检查是否到达最终态。还有判定是否错误还有些小技巧,具体见代码。
#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>using namespace std;const int S = 1005;int A[S], B[S];int l, r;int n, m;bool flag = true;int map[S][S];int col[S];int main(void){int T;scanf("%d", &T);while (T--){flag = true;memset(col, 0, sizeof col);memset(map, 0, sizeof map);scanf("%d%d", &n, &m);for (int i = 1; i <= n; i++)scanf("%d", &A[i]);for (int i = 1; i <= n; i++)scanf("%d", &B[i]);for (int i = 1; i <= n; i++)map[B[i]][++map[B[i]][0]] = i;for (int i = 1; i <= n; i++){A[i] = map[A[i]][++col[A[i]]];if (A[i] == 0) flag = false;}for (int i = 0; i < m; i++){scanf("%d%d", &l, &r);sort(A + l, A + r + 1);}for (int i = 1; i <= n; i++){if (A[i] != i) flag = false;}if (flag) printf("Yes\n");else printf("No\n");}return 0;}
0 0
- 2016 多校 Multi-University Training Contest 8 Balls
- 2016 Multi-University Training Contest 8 题解
- hdu 5810 Balls and Boxes(2016 Multi-University Training Contest 7——数学题)
- 2016 Multi-University Training Contest 7 1002 Balls and Boxes (数学)
- 2016 多校 Multi-University Training Contest 4 Another Meaning
- 2016 多校 Multi-University Training Contest 4 Substring
- 2016 多校 Multi-University Training Contest 4 Bubble Sort
- 2016 多校 Multi-University Training Contest 5 Divide the Sequence
- 2016 多校 Multi-University Training Contest 5 Two
- 2016 多校 Multi-University Training Contest 6 A Simple Chess
- 2016 Multi-University Training Contest 8题解报告
- 2016 Multi-University Training Contest 8-1006 physics
- HDU 5821 Ball 2016 Multi-University Training Contest 8
- hdu 5821 2016 Multi-University Training Contest 8(排序)
- 2016 Multi-University Training Contest 8 1001 Ball
- 2016 Multi-University Training Contest 1
- 2016 Multi-University Training Contest 1
- 2016 Multi-University Training Contest 2 Acperience
- Uva548 Tree 二叉树遍历
- android定时器管理器
- Bounce 弹飞绵羊(splay | 分块)
- eclipse color theme 问题之一
- JAVA学习代码——二重循环
- 2016 多校 Multi-University Training Contest 8 Balls
- 一个老程序员总结过去十年的程序员生涯
- Ubuntu 和 Fedora 下 安装Django
- C#在textbox中显示实时时间
- HDU 2546 饭卡 基本的01背包
- Leetcode Ransom Note
- abstract修饰符和接口
- 欢迎使用CSDN-markdown编辑器
- 上传自己的包到nmp上