Codeforces Round #378 (Div. 2) C. Epidemic in Monstropolis 模拟
1 second
256 megabytes
standard input
standard output
There was an epidemic in Monstropolis and all monsters became sick. To recover, all monsters lined up in queue for an appointment to the only doctor in the city.
Soon, monsters became hungry and began to eat each other.
One monster can eat other monster if its weight is strictly greater than the weight of the monster being eaten, and they stand in the queue next to each other. Monsters eat each other instantly. There are no monsters which are being eaten at the same moment. After the monster A eats the monster B, the weight of the monster A increases by the weight of the eaten monster B. In result of such eating the length of the queue decreases by one, all monsters after the eaten one step forward so that there is no empty places in the queue again. A monster can eat several monsters one after another. Initially there were n monsters in the queue, the i-th of which had weight ai.
For example, if weights are [1, 2, 2, 2, 1, 2] (in order of queue, monsters are numbered from 1 to 6 from left to right) then some of the options are:
- the first monster can't eat the second monster because a1 = 1 is not greater than a2 = 2;
- the second monster can't eat the third monster because a2 = 2 is not greater than a3 = 2;
- the second monster can't eat the fifth monster because they are not neighbors;
- the second monster can eat the first monster, the queue will be transformed to [3, 2, 2, 1, 2].
After some time, someone said a good joke and all monsters recovered. At that moment there were k (k ≤ n) monsters in the queue, the j-th of which had weight bj. Both sequences (a and b) contain the weights of the monsters in the order from the first to the last.
You are required to provide one of the possible orders of eating monsters which led to the current queue, or to determine that this could not happen. Assume that the doctor didn't make any appointments while monsters were eating each other.
The first line contains single integer n (1 ≤ n ≤ 500) — the number of monsters in the initial queue.
The second line contains n integers a1, a2, ..., an (1 ≤ ai ≤ 106) — the initial weights of the monsters.
The third line contains single integer k (1 ≤ k ≤ n) — the number of monsters in the queue after the joke.
The fourth line contains k integers b1, b2, ..., bk (1 ≤ bj ≤ 5·108) — the weights of the monsters after the joke.
Monsters are listed in the order from the beginning of the queue to the end.
In case if no actions could lead to the final queue, print "NO" (without quotes) in the only line.
Otherwise print "YES" (without quotes) in the first line. In the next n - k lines print actions in the chronological order. In each line print x — the index number of the monster in the current queue which eats and, separated by space, the symbol 'L' if the monster which stays the x-th in the queue eats the monster in front of him, or 'R' if the monster which stays the x-th in the queue eats the monster behind him. After each eating the queue is enumerated again.
When one monster eats another the queue decreases. If there are several answers, print any of them.
6
1 2 2 2 1 2
2
5 5
YES
2 L
1 R
4 L
3 L
5
1 2 3 4 5
1
15
YES
5 L
4 L
3 L
2 L
5
1 1 1 3 3
3
2 1 6
NO
In the first example, initially there were n = 6 monsters, their weights are [1, 2, 2, 2, 1, 2] (in order of queue from the first monster to the last monster). The final queue should be [5, 5]. The following sequence of eatings leads to the final queue:
- the second monster eats the monster to the left (i.e. the first monster), queue becomes [3, 2, 2, 1, 2];
- the first monster (note, it was the second on the previous step) eats the monster to the right (i.e. the second monster), queue becomes [5, 2, 1, 2];
- the fourth monster eats the mosnter to the left (i.e. the third monster), queue becomes [5, 2, 3];
- the finally, the third monster eats the monster to the left (i.e. the second monster), queue becomes [5, 5].
Note that for each step the output contains numbers of the monsters in their current order in the queue.
题意:给你一个序列a,代表有a个怪物,给你每个怪物的重量,要求重量大的可以吃掉相邻重量小的,重量相加,问能否得到b序列;
思路:模拟,找每个区间得到b,对于每个区间找最大值,看等否吃掉旁边的,能则能合并;
搓代码;
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pi (4*atan(1.0))
#define eps 1e-14
const int N=2e5+,M=4e6+,inf=1e9+,mod=1e9+;
const ll INF=1e18+;
int a[N],sum[N];
int ans[N];
struct is
{
int l,r;
}p[N];
int check(int l,int r)
{
if(l==r)return ;
int maxx=;
for(int i=l;i<=r;i++)
maxx=max(maxx,a[i]);
for(int i=l;i<=r;i++)
{
if(a[i]==maxx&&i==l&&a[i]>a[i+])
{
return ;
}
else if(a[i]==maxx&&i==r&&a[i]>a[i-])
{
return ;
}
else if(l!=i&&r!=i&&a[i]==maxx&&(a[i]>a[i+]||a[i]>a[i-]))
{
return ;
}
}
return ;
}
void getans(int l,int len,int n)
{
int maxx=;
for(int i=l;i<=l+len-;i++)
maxx=max(maxx,a[i]);
while(len!=)
{
for(int i=l;i<=l+len-;i++)
{
if(i==l&&a[i]>=maxx&&a[i]>a[i+])
{
printf("%d R\n",i);
a[i]+=a[i+];
maxx=max(maxx,a[i]);
for(int j=i+;j<=n;j++)
a[j]=a[j+];
break;
}
if(i==l+len-&&a[i]>=maxx&&a[i]>a[i-])
{
printf("%d L\n",i);
a[i-]+=a[i];
maxx=max(a[i-],maxx);
for(int j=i;j<=n;j++)
a[j]=a[j+];
break;
}
if(i!=l+len-&&i!=l&&a[i]>=maxx&&a[i]>a[i+])
{
printf("%d R\n",i);
a[i]+=a[i+];
maxx=max(a[i],maxx);
for(int j=i+;j<=n;j++)
a[j]=a[j+];
break;
}
if(i!=l+len-&&i!=l&&a[i]>=maxx&&a[i]>a[i-])
{
printf("%d L\n",i);
a[i-]+=a[i];
maxx=max(a[i-],maxx);
for(int j=i;j<=n;j++)
a[j]=a[j+];
break;
}
}
len--;
}
}
int main()
{
int n,m;
scanf("%d",&n);
for(int i=;i<=n;i++)
scanf("%d",&a[i]),sum[i]=sum[i-]+a[i];
scanf("%d",&m);
for(int i=;i<=m;i++)
scanf("%d",&ans[i]);
int pre=;
int hh=;
for(int i=;i<=m;i++)
{
for(int j=pre+;j<=n;j++)
{
if(sum[j]-sum[pre]==ans[i])
{
p[hh].l=pre+;
p[hh++].r=j;
pre=j;
break;
}
}
}
if(hh!=m||p[hh-].r!=n)
return puts("NO\n");
for(int i=;i<hh;i++)
{
if(check(p[i].l,p[i].r)==)
return puts("NO\n");
}
printf("YES\n");
for(int i=;i<m;i++)
getans(i+,p[i].r-p[i].l+,n);
return ;
}
Codeforces Round #378 (Div. 2) C. Epidemic in Monstropolis 模拟的更多相关文章
- Codeforces Round #378 (Div. 2)-C. Epidemic in Monstropolis
C. Epidemic in Monstropolis time limit per test 1 second memory limit per test 256 megabytes input s ...
- Codeforces Round #378 (Div. 2) D题(data structure)解题报告
题目地址 先简单的总结一下这次CF,前两道题非常的水,可是第一题又是因为自己想的不够周到而被Hack了一次(或许也应该感谢这个hack我的人,使我没有最后在赛后测试中WA).做到C题时看到题目情况非常 ...
- Codeforces Round #367 (Div. 2) B. Interesting drink (模拟)
Interesting drink 题目链接: http://codeforces.com/contest/706/problem/B Description Vasiliy likes to res ...
- Codeforces Round #378 (Div. 2) A B C D 施工中
A. Grasshopper And the String time limit per test 1 second memory limit per test 256 megabytes input ...
- Codeforces Round #378 (Div. 2)F - Drivers Dissatisfaction GNU
http://codeforces.com/contest/733/problem/F 题意:给你一些城市和一些路,每条路有不满意程度和每减少一点不满意程度的花费,给出最大花费,要求找出花费小于s的最 ...
- Codeforces Round #378 (Div. 2) D. Kostya the Sculptor 分组 + 贪心
http://codeforces.com/contest/733/problem/D 给定n个长方体,然后每个长方体都能选择任何一个面,去和其他长方体接在一起,也可以自己一个,要求使得新的长方体的最 ...
- Codeforces Round #378 (Div. 2)
A: 思路: 水题,没啥意思; B: 思路: 暴力,也没啥意思; C: 思路: 思维,可以发现从前往后和为b[i]的分成一块,然后这一块里面如果都相同就没法开始吃,然后再暴力找到那个最大的且能一开始就 ...
- Codeforces Round #378 (Div. 2) C D
在实验室通宵 一边做水题一边准备随时躲起来以免被门卫大爷巡查发现..结果居然没来.. 本来以为可以加几分变个颜色..结果挂了CD...状态有点差...思维不太活跃 沉迷暴力不能自拔 D 给出n个长方体 ...
- Codeforces Round #378 (Div. 2) D - Kostya the Sculptor
Kostya the Sculptor 这次cf打的又是心累啊,果然我太菜,真的该认真学习,不要随便的浪费时间啦 [题目链接]Kostya the Sculptor &题意: 给你n个长方体, ...
随机推荐
- EL表达式简介
EL表达式简介 EL 全名为Expression Language.EL主要作用: 1.获取数据 EL表达式主要用于替换JSP页面中的脚本表达式,以从各种类型的web域 中检索java对象.获取数据. ...
- 使用SQLServer Profiler侦测死锁(转)
准备工作: 为了侦测死锁,我们需要先模拟死锁.本例将使用两个不同的会话创建两个事务. 步骤: 1. 打开SQLServer Profiler 2. 选择[新建跟踪],连到实例. 3. 然后选择[空白] ...
- umask:遮罩码
查看umask:umask 创建文件:-umask 文件默认不能具有执行权限 创建目录:-umask 设置umask:umask 0022 生效访范围:当前shell
- android studio自动导包
http://blog.csdn.net/buaaroid/article/details/44979629 关于导包的设置以上博文解释的很清楚,在此主要强调下这一句: Add unambiguous ...
- 八大排序算法之六--交换排序—快速排序(Quick Sort)
基本思想: 1)选择一个基准元素,通常选择第一个元素或者最后一个元素, 2)通过一趟排序讲待排序的记录分割成独立的两部分,其中一部分记录的元素值均比基准元素值小.另一部分记录的 元素值比基准值大. 3 ...
- c# 中的日期格式
输出日期格式是:美国时间 :Tue Oct 22 xxxx 00:00:00 GMT+0800 第一种: string strDate = "Mon Aug 15 2011 00:00:0 ...
- hdu1081 To the Max
直接暴力枚举所有子矩形至少需要O(n^4)的复杂度,显然这不是一个合理的解决方法. 上述方案忽略了矩形之间的联系,进行了过多不必要的计算. 实际上如果固定矩形的左右边界,则底边在i行的矩形内数值之和与 ...
- linux内核2.4.x网络接口分析层次图
http://blog.csdn.net/wswifth/article/details/5108744 今天大概分写了下<Linux内核2.4.x的网络接口源码的结构[转]>中的结构层次 ...
- C语言typeof详解 offsetof
http://blog.chinaunix.net/uid-28458801-id-4200573.html 前言: typeof关键字是C语言中的一个新扩展,这个特性在linux内核中应用非常 ...
- 基于PowerShell 3.0的web接口测试
对于web接口测试,做一下总结. 接口测试总结 1. 接口url格式:http://www.xxx.com/a/bbb.html: 2. 接口url后面接的参数格式:“?参数名=参数值&参数名 ...