LOne-Dimensional Maze
来源:互联网 发布:logo编程软件 编辑:程序博客网 时间:2024/04/27 17:59
BaoBao is trapped in a one-dimensional maze consisting of \(n\) grids arranged in a row! The grids are numbered from 1 to \(n\) from left to right, and the \(i\)-th grid is marked with a character \(s_i\), where \(s_i\) is either 'L' or 'R'.
Starting from the \(m\)-th grid, BaoBao will repeatedly take the following steps until he escapes the maze:
- If BaoBao is in the 1st grid or the \(n\)-th grid, then BaoBao is considered to arrive at the exit and thus can escape successfully.
- Otherwise, let BaoBao be in the \(t\)-th grid. If \(s_t = \text{'L'}\), BaoBao will move to the \((t-1)\)-th grid; If \(s_t = \text{'R'}\), Baobao will move to the \((t+1)\)-th grid.
Before taking the above steps, BaoBao can change the characters in some grids to help himself escape. Concretely speaking, for the \(i\)-th grid, BaoBao can change \(s_i\) from 'L' to 'R', or from 'R' to 'L'.
But changing characters in grids is a tiring job. Your task is to help BaoBao calculate the minimum number of grids he has to change to escape the maze.
There are multiple test cases. The first line of the input contains an integer \(T\), indicating the number of test cases. For each test case:
The first line contains two integers \(n\) and \(m\) (\(3 \le n \le 10^5\), \(1 < m < n\)), indicating the number of grids in the maze, and the index of the starting grid.
The second line contains a string \(s\) (\(|s| = n\)) consisting of characters 'L' and 'R'. The \(i\)-th character of \(s\) indicates the character in the \(i\)-th grid.
It is guaranteed that the sum of \(n\) over all test cases will not exceed \(10^6\).
<h4< dd="">For each test case output one line containing one integer, indicating the minimum number of grids BaoBao has to change to escape the maze.
<h4< dd="">33 2LRL10 4RRRRRRRLLR7 4RLLRLLR<h4< dd="">
021<h4< dd="">
For the first sample test case, BaoBao doesn't have to change any character and can escape from the 3rd grid. So the answer is 0.
For the second sample test case, BaoBao can change \(s_8\) to 'R' and \(s_9\) to 'R' and escape from the 10th grid. So the answer is 2.
For the third sample test case, BaoBao can change \(s_4\) to 'L' and escape from the 1st grid. So the answer is 1.
#include <stdio.h>#include <iostream>int main() {int T;int n , m;int s1 , s2;char c[100005];scanf("%d",&T);while(T--) {s1 = 0;s2 = 0;scanf("%d%d",&n,&m);scanf("%s",c+1);for(int i = m; i < n; i++) {if(c[i] != 'R')s1++;}for(int i = m; i > 1; i--) {if(c[i] != 'L')s2++;}printf("%d\n",std::min(s1,s2));}return 0;}
- LOne-Dimensional Maze
- ZOJ--3992--One-Dimensional Maze
- 2017CCPC秦皇岛 L:One-Dimensional Maze
- 2017 ccpc秦皇岛L One-Dimensional Maze
- ZOJ 3992 && 2017CCPC秦皇岛 L:One-Dimensional Maze
- Maze
- maze
- Maze
- maze
- Maze
- maze
- Maze
- Maze
- Maze
- Dimensional Modeling
- GDC2017: 《Lone Echo》中的VR动画
- Understanding Dimensional Models
- FW - Dimensional Modeling Concepts
- javaSE阶段的循环结构以及执行流程
- Valid Parentheses
- 图像对比度与亮度调整算法实现(Python&OpenCV)
- 基于体系结构的软件开发
- 基于WebMagic写的一个入门级CSDN博客爬虫
- LOne-Dimensional Maze
- 基于内置类的原型扩展方法实现数组去重
- vue+vue-cli+webpack中引入jQuery
- rocketMq源码学习 -- rocketmq源码学习计划
- leetcode练习(136)
- 从一道easy级leetcode题目到分治法的思想
- Android Studio3.0更新
- ABP官方文档(八)【会话管理】
- 语义标签和w3c标准