任意门:http://codeforces.com/contest/1073/problem/C

C. Vasya and Robot

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Vasya has got a robot which is situated on an infinite Cartesian plane, initially in the cell (0,0)(0,0). Robot can perform the following four kinds of operations:

  • U — move from (x,y) to (x,y+1)
  • D — move from (x,y)to (x,y−1)
  • L — move from (x,y)to (x−1,y)
  • R — move from (x,y) to (x+1,y)

Vasya also has got a sequence of nn operations. Vasya wants to modify this sequence so after performing it the robot will end up in (x,y)(x,y).

Vasya wants to change the sequence so the length of changed subsegment is minimum possible. This length can be calculated as follows: maxID−minID+1maxID−minID+1, where maxIDmaxID is the maximum index of a changed operation, and minIDminID is the minimum index of a changed operation. For example, if Vasya changes RRRRRRR to RLRRLRL, then the operations with indices 22, 55 and 77 are changed, so the length of changed subsegment is 7−2+1=67−2+1=6. Another example: if Vasya changes DDDD to DDRD, then the length of changed subsegment is 11.

If there are no changes, then the length of changed subsegment is 00. Changing an operation means replacing it with some operation (possibly the same); Vasya can't insert new operations into the sequence or remove them.

Help Vasya! Tell him the minimum length of subsegment that he needs to change so that the robot will go from (0,0)(0,0) to (x,y)(x,y), or tell him that it's impossible.

Input

The first line contains one integer number n (1≤n≤2⋅105)n (1≤n≤2⋅105) — the number of operations.

The second line contains the sequence of operations — a string of nn characters. Each character is either U, D, L or R.

The third line contains two integers x,y (−109≤x,y≤109)x,y (−109≤x,y≤109) — the coordinates of the cell where the robot should end its path.

Output

Print one integer — the minimum possible length of subsegment that can be changed so the resulting sequence of operations moves the robot from (0,0)(0,0) to (x,y)(x,y). If this change is impossible, print −1−1.

Examples
input

Copy
  1. 5
    RURUU
    -2 3
output

Copy
  1. 3
input

Copy
  1. 4
    RULR
    1 1
output

Copy
  1. 0
input

Copy
  1. 3
    UUU
    100 100
output

Copy
  1. -1
Note

In the first example the sequence can be changed to LULUU. So the length of the changed subsegment is 3−1+1=33−1+1=3.

In the second example the given sequence already leads the robot to (x,y)(x,y), so the length of the changed subsegment is 00.

In the third example the robot can't end his path in the cell (x,y)(x,y).

题意概括:

输入N个操作,询问修操作是否能到达终点,如果能到达终点输出“修改的区间”;

修改区间的定义:修改的最大坐标操作的坐标 - 修改的最小坐标操作的坐标

【规定起点为 (0,0),输入终点( x, y );】

操作(上下左右):

    • U — move from (x,y) to (x,y+1)
    • D — move from (x,y)to (x,y−1)
    • L — move from (x,y)to (x−1,y)
    • R — move from (x,y) to (x+1,y)

解题思路:二分 || 尺取

预处理路径前缀和(压缩路径)sum_x [ ],sum_y[ ] ;则sum_x[ N ] , sum_y[ N ] 为实际的终点;

输入的终点为 (ex, ey),假设能修改若干个操作到达输入的终点,那么:

某一段 [ st, ed ] 所走的影响为:

              X轴方向:xx = ex - ( sum_x[ N ] - sum_x[ ed -1 ] + sum_x[ st - 1 ] )

              Y轴方向:yy = ey - ( sum_y[ N ] - sum_y[ ed - 1 ] + sum_y[ st - 1 ] )

二分

二分修改区间长度 len ,尺取判断在该长度是否满足修改条件;

①操作所走最大范围不得超过 len ,因为每次操作只是上下左右移动一步

②判断能否完成假设的影响  len - abs(xx) - abs(yy))%2 ?= 0;

 abs(xx)表示的是 x 方向 到达终点 ex 的差值

 abs(yy)表示的是 y 方向 到达终点 ey 的差值

 假如 len > abs(xx)+abs(yy) 说明这段区间有操作是多余的,但是只要剩下的操作数是偶数就可以两两抵消。

尺取:

直接定义一个头指针一个尾指针,暴力一遍,条件判断是要头指针加还是尾指针加,记录最小修改区间。

AC code:

  1. #include<bits/stdc++.h>
  2. using namespace std;
  3. const int N=1e6+;
  4. int x[N],y[N];
  5. int sx,sy,n;
  6. char s[N];
  7. bool check(int m)
  8. {
  9. for(int i=;i<=n-m+;i++)
  10. {
  11. int tx=x[n]-x[i+m-]+x[i-]; //当前原来选项造成的横坐标影响
  12. int ty=y[n]-y[i+m-]+y[i-]; //当前原来选项造成的纵坐标影响
  13. int ex=sx-tx, ey=sy-ty; //消除当前影响
  14. printf("%d %d m: %d\n",ex,ey,m);
  15. if(m>=(abs(ex)+abs(ey)) && (m-abs(ex)-abs(ey))%==) //可以构造
  16. return ;
  17. }
  18. return ;
  19. }
  20. int main()
  21. {
  22. //string s;
  23. while(~scanf("%d",&n))
  24. {
  25. scanf("%s",s+);
  26. x[]=y[]=;
  27. for(int i=;i<=n;i++)
  28. {
  29. x[i]=x[i-];y[i]=y[i-]; //累积前面步数的结果
  30.  
  31. if(s[i]=='L') x[i]-=; //当前步数造成的影响
  32. else if(s[i]=='R') x[i]+=;
  33. else if(s[i]=='D') y[i]-=;
  34. else y[i]+=;
  35. }
  36. // printf("%d %d\n",x[n],y[n]);
  37. scanf("%d %d",&sx,&sy); //终点
  38. // printf("HH");
  39. int l=,r=n,ans=-;
  40. while(l<=r) //二分答案
  41. {
  42. printf("l:%d r:%d\n", l, r);
  43. int mid=(l+r)>>;
  44. if(check(mid)) ans=mid,r=mid-;
  45. else l=mid+;
  46. }
  47. printf("%d\n",ans);
  48. }
  49. }

Educational Codeforces Round 53 (Rated for Div. 2) C. Vasya and Robot 【二分 + 尺取】的更多相关文章

  1. Educational Codeforces Round 53 (Rated for Div. 2) C Vasya and Robot 二分

    题目:题目链接 思路:对于x方向距离与y方向距离之和大于n的情况是肯定不能到达的,另外,如果n比abs(x) + abs(y)大,那么我们总可以用UD或者LR来抵消多余的大小,所以只要abs(x) + ...

  2. Educational Codeforces Round 53 (Rated for Div. 2) C. Vasya and Robot

    题意:给出一段操作序列 和目的地 问修改(只可以更改 不可以删除或添加)该序列使得最后到达终点时  所进行的修改代价最小是多少 其中代价的定义是  终点序号-起点序号-1 思路:因为代价是终点序号减去 ...

  3. Educational Codeforces Round 53 (Rated for Div. 2) C. Vasya and Robot(二分或者尺取)

    题目哦 题意:给出一个序列,序列有四个字母组成,U:y+1,D:y-1 , L:x-1 , R:x+1;   这是规则 . 给出(x,y) 问可不可以经过最小的变化这个序列可以由(0,0) 变到(x, ...

  4. Educational Codeforces Round 53 (Rated for Div. 2) (前五题题解)

    这场比赛没有打,后来补了一下,第五题数位dp好不容易才搞出来(我太菜啊). 比赛传送门:http://codeforces.com/contest/1073 A. Diverse Substring ...

  5. Educational Codeforces Round 53 (Rated for Div. 2)

    http://codeforces.com/contest/1073 A. Diverse Substring #include <bits/stdc++.h> using namespa ...

  6. Educational Codeforces Round 53 (Rated for Div. 2) E. Segment Sum (数位dp求和)

    题目链接:https://codeforces.com/contest/1073/problem/E 题目大意:给定一个区间[l,r],需要求出区间[l,r]内符合数位上的不同数字个数不超过k个的数的 ...

  7. [codeforces][Educational Codeforces Round 53 (Rated for Div. 2)D. Berland Fair]

    http://codeforces.com/problemset/problem/1073/D 题目大意:有n个物品(n<2e5)围成一个圈,你有t(t<1e18)元,每次经过物品i,如果 ...

  8. Educational Codeforces Round 53 (Rated for Div. 2) E. Segment Sum

    https://codeforces.com/contest/1073/problem/E 题意 求出l到r之间的符合要求的数之和,结果取模998244353 要求:组成数的数位所用的数字种类不超过k ...

  9. Educational Codeforces Round 53 (Rated for Div. 2)G. Yet Another LCP Problem

    题意:给串s,每次询问k个数a,l个数b,问a和b作为后缀的lcp的综合 题解:和bzoj3879类似,反向sam日神仙...lcp就是fail树上的lca.把点抠出来建虚树,然后在上面dp即可.(感 ...

随机推荐

  1. 2019.03.26 读书笔记 关于event

    event 主要是给委托加了一层保护,不能任意的 class.delegate=null,class.delegate=fun1,不能由调用者去任意支配,而是由class自己去增加或减少,用+=.-= ...

  2. (转)source、sh、bash、./执行脚本的区别

    source.sh.bash../执行脚本的区别  原文:https://www.cnblogs.com/sparkbj/p/5976100.html 1.source命令用法: source Fil ...

  3. os.popen('python hello_out.py')中Python程序执行时默认的当前路径为MS-DOS CMD的默认路径

    >>> import os >>> os.getcwd() 'D:\\pythonCode\\pp4e' >>> os.chdir('Stream ...

  4. c++ MFC图像处理CImage类常用操作代码

    原文作者:aircraft 原文地址:https://www.cnblogs.com/DOMLX/p/9598974.html MFC图像处理CImage类常用操作 CImage类头文件为#inclu ...

  5. c#特性类 Attribute

    Attribute FYI Link: Attribute在.net编程中的应用(一) Attribute在.net编程中的应用(二) Attribute在.net编程中的应用(三) Attribut ...

  6. rockmongo配置文件config.php

    使用编辑器(比如notepad或者VI/VIM命令)打开RockMongo安装目录下的config.php,所有的配置都在这里. 认证 mongo_auth 和control_auth 在开始使用Ro ...

  7. React.js 小书 Lesson9 - 事件监听

    作者:胡子大哈 原文链接:http://huziketang.com/books/react/lesson9 转载请注明出处,保留原文链接和作者信息. 在 React.js 里面监听事件是很容易的事情 ...

  8. 【卷土重来之C#学习笔记】(一)c#文章导航目录

    [卷土重来之C#学习笔记](一)c#文章导航目录 [卷土重来之C#学习笔记](二)c#编程概述 [卷土重来之C#学习笔记](三)类型.存储.对象 [卷土重来之C#学习笔记](四)类的基本概念 [卷土重 ...

  9. html 跨过CSRF验证

    /* CSRF配置 */function csrfSafeMethod(method) { // these HTTP methods do not require CSRF protection r ...

  10. linux下为.net core应用创建守护进程

    1.Supervisor 安装 yum install python-setuptools easy_install supervisor 2.配置 Supervisor mkdir /etc/sup ...