【28.57%】【codeforces 615C】 Running Track
time limit per test1 second
memory limit per test512 megabytes
inputstandard input
outputstandard output
A boy named Ayrat lives on planet AMI-1511. Each inhabitant of this planet has a talent. Specifically, Ayrat loves running, moreover, just running is not enough for him. He is dreaming of making running a real art.
First, he wants to construct the running track with coating t. On planet AMI-1511 the coating of the track is the sequence of colored blocks, where each block is denoted as the small English letter. Therefore, every coating can be treated as a string.
Unfortunately, blocks aren’t freely sold to non-business customers, but Ayrat found an infinite number of coatings s. Also, he has scissors and glue. Ayrat is going to buy some coatings s, then cut out from each of them exactly one continuous piece (substring) and glue it to the end of his track coating. Moreover, he may choose to flip this block before glueing it. Ayrat want’s to know the minimum number of coating s he needs to buy in order to get the coating t for his running track. Of course, he also want’s to know some way to achieve the answer.
Input
First line of the input contains the string s — the coating that is present in the shop. Second line contains the string t — the coating Ayrat wants to obtain. Both strings are non-empty, consist of only small English letters and their length doesn’t exceed 2100.
Output
The first line should contain the minimum needed number of coatings n or -1 if it’s impossible to create the desired coating.
If the answer is not -1, then the following n lines should contain two integers xi and yi — numbers of ending blocks in the corresponding piece. If xi ≤ yi then this piece is used in the regular order, and if xi > yi piece is used in the reversed order. Print the pieces in the order they should be glued to get the string t.
Examples
input
abc
cbaabc
output
2
3 1
1 3
input
aaabrytaaa
ayrat
output
3
1 1
6 5
8 7
input
ami
no
output
-1
Note
In the first sample string “cbaabc” = “cba” + “abc”.
In the second sample: “ayrat” = “a” + “yr” + “at”.
【题解】
把s1串的所有子串都加入到字典树;在每个节点记录这个节点在s1中的起始位置和终止位置;
加入的时候正串和反串都要加入(加入到同一颗字典树即可);
因为s1串可以多次使用;
所以我们让每次使用都达到最长的距离即可,这样肯定是最优的;
那个from和to域实在设计得巧妙;
从s2串的初始位置开始;从字典树的根节点开始走一条路径即可;
#include <cstdio>
#include <cmath>
#include <set>
#include <map>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <queue>
#include <vector>
#include <stack>
#include <string>
#define lson L,m,rt<<1
#define rson m+1,R,rt<<1|1
#define LL long long
using namespace std;
const int MAXN = 4500000;
const int MAXSIZE = 3000;
const int dx[5] = {0,1,-1,0,0};
const int dy[5] = {0,0,0,-1,1};
const double pi = acos(-1.0);
int tree1[MAXN][27],from[MAXN],to[MAXN];
int ans[MAXSIZE][2];
int cnt1 = 0,cnt2 = 0;
string s1,s2;
void add1(int pos,int len)
{
int now = 0;
for (int i = pos;i<=len-1;i++)
{
int key = s1[i]-'a'+1;
if (tree1[now][key])
{
now = tree1[now][key];
continue;
}
tree1[now][key]=++cnt1;
now = tree1[now][key];
from[now] = pos;to[now] = i;
}
}
void add2(int pos)
{
int now = 0;
for (int i = pos;i>=0;i--)
{
int key = s1[i]-'a'+1;
if (tree1[now][key])
{
now = tree1[now][key];
continue;
}
tree1[now][key]=++cnt1;
now = tree1[now][key];
from[now] = pos;to[now] =i;
}
}
int main()
{
//freopen("F:\\rush.txt","r",stdin);
cin >>s1;
cin >>s2;
int len1 = s1.size();
for (int i = 0;i <= len1-1;i++)
add1(i,len1);
for (int i = len1-1;i>=0;i--)
add2(i);
int now = 0;
int len2 = s2.size();
int dd = 0;
while (now<=len2-1)
{
int key = s2[now]-'a'+1;
//printf("%d\n",now);
int temp1 = 0,num1 =now;
while (num1<=len2-1 && tree1[temp1][key]!=0)
{
temp1 = tree1[temp1][key];
num1++;
key = s2[num1] - 'a'+1;
}
if (num1-1 < now)
{
puts("-1");
return 0;
}
else
{
dd++;
now = num1-1;
ans[dd][0] = from[temp1];
ans[dd][1] = to[temp1];
now++;
}
}
printf("%d\n",dd);
for (int i = 1;i <= dd;i++)
printf("%d %d\n",ans[i][0]+1,ans[i][1]+1);
return 0;
}
【28.57%】【codeforces 615C】 Running Track的更多相关文章
- 【28.57%】【codeforces 711E】ZS and The Birthday Paradox
time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard o ...
- 【 BowWow and the Timetable CodeForces - 1204A 】【思维】
题目链接 可以发现 十进制4 对应 二进制100 十进制16 对应 二进制10000 十进制64 对应 二进制1000000 可以发现每多两个零,4的次幂就增加1. 用string读入题目给定的二进制 ...
- 【57.97%】【codeforces Round #380A】Interview with Oleg
time limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard ou ...
- 【34.57%】【codeforces 557D】Vitaly and Cycle
time limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard ou ...
- 【75.28%】【codeforces 764B】Decoding
time limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard ou ...
- 【30.93%】【codeforces 558E】A Simple Task
time limit per test5 seconds memory limit per test512 megabytes inputstandard input outputstandard o ...
- 【77.78%】【codeforces 625C】K-special Tables
time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standa ...
- 【codeforces 760A】Petr and a calendar
time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard o ...
- 【codeforces 750C】New Year and Rating(做法2)
time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard o ...
随机推荐
- JS预解释的总结
预解释阶段发生在创建了堆内存,让代码执行之前,对当前作用域中带var和function的进行预解释 在浏览器解析执行代码的时候,会提前把带var和function的代码声明或定义,提前放在作用域的最前 ...
- 关于PyYAML报错问题解决
转自:http://www.fwqtg.net/%E5%85%B3%E4%BA%8Epyyaml%E6%8A%A5%E9%94%99%E9%97%AE%E9%A2%98%E8%A7%A3%E5%86% ...
- P2P借款的几种情况
借款,至少出现2种人,借款人和出借人.根据人的性质,企业和个人,分成4种情况. 企业-个人,企业-企业,个人-企业,个人-个人. P2P平台可能出现几种情况: 个人-个人 2种情况: a. 借款人 ...
- [Angular] FadeIn and FadeOut animation in Angular
To define an Angular Animation, we using DSL type of language. Means we are going to define few anim ...
- 对inetd、xinetd与TCP_Wrapper的基本了解
在Linux系统中有一个特殊的守护进程inetd(InterNET services Daemon),它用于Internet标准服务,通常在系统启动时启动.通过命令行可以给出inetd的配置文件,该配 ...
- DOS 命令forfiles
forfiles /p E:/dbbackup/diff /s /m *.* /d -14 /c "cmd /c del @file" forfiles: /p 指定的路径 /s ...
- 6.5 Android硬件访问服务使用反射
1.前面的例子中App为了能够范问ILedService接口,把classes.jar导入到应用程序中,但是我们不想把classes编进apk包里面去,这样导致我们的apk程序会很大(解压缩apk会发 ...
- 总览:SpringCloud基础结构
客户端: 1.连接 配置中心2.连接 服务中心3.连接 链路跟踪3.feign调用4.熔断机制5.连接 熔断监控6.swagger2 生成的RESTful-API7.消息总线-rabbitMQ实现 基 ...
- 【z09】关押罪犯
描述 S城现有两座监狱,一共关押着N名罪犯,编号分别为1~N.他们之间的关系自然也极不和谐.很多罪犯之间甚至积怨已久,如果客观条件具备则随时可能爆发冲突.我们用"怨气值"(一个正整 ...
- kafka集群操作指南
目录 kafka集群操作指南 (一)单机版安装 (二)集群安装 (三)集群启停操作 (四)topic相关的操作 (五)某个broker挂掉,本机器可重启 (六)某个broker挂掉且无法重启,需要其它 ...