cf936c Lock Puzzle

【cf936c Lock Puzzle】的更多相关文章

ref #include <algorithm> #include <iostream> #include <cstring> #include <cstdio> #include <vector> using namespace std; int n; char su[2005], sv[2005]; vector<int> vec; void shift(int x){ if(x==0) return ; reverse(su+1…

CF936C Lock Puzzle 构造

传送门好久不做构造题脑子都僵化了qwq 无解的条件是\(s\)包含的字符可重集和\(t\)包含的字符可重集不相等,相等的时候下文会给出一种一定可行的构造方案. 考虑增量构造.定义某个字符串\(x\)的反串为\(x'\),设已经构造完成的串为\(S\),\(x\)和\(y\)是即将拼合在\(S\)上的两个字符,\(.\)是其他的无用字符那么我们通过以下步骤将\(x\)和\(y\)拼合: \(.....x.....S \rightarrow S'..........x \rightarrow x…

hduoj 4708 Rotation Lock Puzzle 2013 ACM/ICPC Asia Regional Online —— Warmup

http://acm.hdu.edu.cn/showproblem.php?pid=4708 Rotation Lock Puzzle Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Problem Description Alice was felling into a cave. She found a strange door with a number square m…

HDU 4708:Rotation Lock Puzzle

Rotation Lock Puzzle Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1836 Accepted Submission(s): 580 Problem Description Alice was felling into a cave. She found a strange door with a numbe…

hdu4708 Rotation Lock Puzzle

Rotation Lock Puzzle Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 654 Accepted Submission(s): 190 Problem Description Alice was felling into a cave. She found a strange door with a number squar…

Codeforces Round #467 (Div. 2) E -Lock Puzzle

Lock Puzzle 题目大意:给你两个字符串一个s,一个t,长度<=2000,要求你进行小于等于6100次的shift操作,将s变成t, shift(x)表示将字符串的最后x个字符翻转后放到最前面. 思路:不会写,看了题解... 因为长度为3000,操作为6500,我们考虑每三次操作将一个字符放到最后,并保证其他字符的顺序不变,这样是可以实现的, 如果我们想要将第k个字符移到最后,我们只要shift(n-1-k) , shift(1) , shift(n-1),就能实现啦 . #includ…