Codeforces Gym 100531I Instruction 构造
Problem I. Instruction
题目连接:
http://codeforces.com/gym/100531/attachments
Description
Ingrid is a head of a big railway station and, among other duties, is responsible for routing trains to the
right platforms. The station has one entrance, and there are many switches that direct trains to other
switches and platforms.
Each switch has one inbound track and two outbound tracks, platforms have one inbound track, and
station entrance has one outbound track. Each outbound track is connected to one inbound track and
vice versa. Every switch and platform is reachable from station entrance.
Platforms have a rail dead ends and you may assume that trains disappear from the platform immediately
after arriving to it.
Each morning Ingrid looks at the timetable and writes switch toggling instruction: when and which
switch to toggle. She would like to automate this process to save a lot of time.
Input
The first line of the input file contains a single integer n — the total number of switches and platforms
on the station (3 ≤ n ≤ 51).
The i-th of the following n lines describes a switch or a platform with an index i. Description starts with
a character ‘p’ for a platform or ‘s’ for a switch. Next number qi
indicates the number of the switch the
inbound track is connected to or 0 if it is connected to station entrance (0 ≤ qi < i). Description of the
platform also contains a unique lowercase English letter — the platform identifier.
Trains spend exactly one minute to move between two connected switches or a switch and a platform.
In the morning, each switch is toggled in a way that a train would pass to the one of the two outbound
tracks connected to the switch/platform with the lower number.
Next line of the input file contains a single integer m (1 ≤ m ≤ 1000) — the number of trains in timetable.
Each of the following m lines contains integer ai (0 ≤ ai ≤ 10 000; ai > ai−1) — the time in minutes
when a train arrives to the station entrance, and the letter pi — identifier of the destination platform for
this train.
Output
In the first line output integer c — the number of commands in the switch toggling instruction. For each
command, output two integers si and ti (1 ≤ si ≤ n; 0 ≤ ti ≤ 109
) — the number of the switch and the
time to toggle it. Assume that the switch is toggled between minutes ti − 1 and ti
.
Output commands in order of non-decreasing time. The number of commands should not exceed 100 000
Sample Input
7
s 0
s 1
s 1
p 2 a
p 2 b
p 3 c
p 3 d
5
0 a
1 c
3 b
4 a
5 d
Sample Output
6
1 2
1 4
2 4
2 6
1 6
3 7
Hint
题意
给你一个像二叉树的火车站,一开始,所有点都指向最小的节点,你按动开关就会使得一个点指向另外一个儿子
然后现在有很多个火车会从起点走到他想去的叶子节点,然后请你输出一个可行解
题解:
我们一个火车一个火车分析就好了
当火车去序号小的,就不动开关,如果去序号大的,就动开关,当他过了之后,就再动一下开关,使得又指向小的就好了
代码
#include<bits/stdc++.h>
using namespace std;
int n;
map<char,int> H;
vector<int> E[3000];
vector<int>ans1[30000];
vector<int>temp1,temp2;
void solve(int x,int time,int fin)
{
//cout<<x<<" "<<time<<" "<<fin<<endl;
if(x==fin)
{
for(int i=0;i<temp1.size();i++)
ans1[temp2[i]].push_back(temp1[i]);
return;
}
for(int i=0;i<E[x].size();i++)
{
if(i==1)
{
temp1.push_back(x);
temp1.push_back(x);
temp2.push_back(time);
temp2.push_back(time+1);
}
solve(E[x][i],time+1,fin);
if(i==1)
{
temp1.pop_back();
temp1.pop_back();
temp2.pop_back();
temp2.pop_back();
}
}
}
int main()
{
freopen("instruction.in","r",stdin);
freopen("instruction.out","w",stdout);
scanf("%d",&n);
for(int i=1;i<=n;i++)
{
string s;
cin>>s;
if(s=="s")
{
int x;
scanf("%d",&x);
E[x].push_back(i);
}
if(s=="p")
{
int x;
scanf("%d",&x);
char c;cin>>c;
H[c]=i;
E[x].push_back(i);
}
}
int q;scanf("%d",&q);
for(int i=0;i<q;i++)
{
int t;scanf("%d",&t);
char c;cin>>c;
solve(0,t,H[c]);
}
int sum = 0;
for(int i=0;i<30000;i++)
sum+=ans1[i].size();
cout<<sum<<endl;
for(int i=0;i<30000;i++)
for(int j=0;j<ans1[i].size();j++)
cout<<ans1[i][j]<<" "<<i<<endl;
}
Codeforces Gym 100531I Instruction 构造的更多相关文章
- Codeforces gym 101343 J.Husam and the Broken Present 2【状压dp】
2017 JUST Programming Contest 2.0 题目链接:Codeforces gym 101343 J.Husam and the Broken Present 2 J. Hu ...
- Codeforces GYM 100876 J - Buying roads 题解
Codeforces GYM 100876 J - Buying roads 题解 才不是因为有了图床来测试一下呢,哼( 题意 给你\(N\)个点,\(M\)条带权边的无向图,选出\(K\)条边,使得 ...
- Codeforces Gym 101252D&&floyd判圈算法学习笔记
一句话题意:x0=1,xi+1=(Axi+xi%B)%C,如果x序列中存在最早的两个相同的元素,输出第二次出现的位置,若在2e7内无解则输出-1. 题解:都不到100天就AFO了才来学这floyd判圈 ...
- Codeforces Gym 101190M Mole Tunnels - 费用流
题目传送门 传送门 题目大意 $m$只鼹鼠有$n$个巢穴,$n - 1$条长度为$1$的通道将它们连通且第$i(i > 1)$个巢穴与第$\left\lfloor \frac{i}{2}\rig ...
- Codeforces Gym 101623A - 动态规划
题目传送门 传送门 题目大意 给定一个长度为$n$的序列,要求划分成最少的段数,然后将这些段排序使得新序列单调不减. 考虑将相邻的相等的数缩成一个数. 假设没有分成了$n$段,考虑最少能够减少多少划分 ...
- 【Codeforces Gym 100725K】Key Insertion
Codeforces Gym 100725K 题意:给定一个初始全0的序列,然后给\(n\)个查询,每一次调用\(Insert(L_i,i)\),其中\(Insert(L,K)\)表示在第L位插入K, ...
- codeforces gym 100553I
codeforces gym 100553I solution 令a[i]表示位置i的船的编号 研究可以发现,应是从中间开始,往两边跳.... 于是就是一个点往两边的最长下降子序列之和减一 魔改树状数 ...
- CodeForces Gym 100213F Counterfeit Money
CodeForces Gym题目页面传送门 有\(1\)个\(n1\times m1\)的字符矩阵\(a\)和\(1\)个\(n2\times m2\)的字符矩阵\(b\),求\(a,b\)的最大公共 ...
- Codeforces Gym 100187K K. Perpetuum Mobile 构造
K. Perpetuum Mobile Time Limit: 2 Sec Memory Limit: 256 MB 题目连接 http://codeforces.com/gym/100187/pro ...
随机推荐
- 设置TextView控件的背景透明度和字体透明度
TextView tv = (TextView) findViewById(R.id.xx); 第1种:tv.setBackgroundColor(Color.argb(255, 0, 255, 0) ...
- std::vector数据复制
std::vector<boost::shared_ptr <ITEM> > srcItemList; // 数据源 std::vector<ITEM> des ...
- 网页元素定位神器之Xpath详解
摘要: 经常在工作中会使用到XPath的相关知识,但每次总会在一些关键的地方不记得或不太清楚,所以免不了每次总要查一些零碎的知识,感觉即很烦又浪费时间,所以对XPath归纳及总结一下. ... ...
- Monitor traffic to localhost from IE or .NET
原文:http://docs.telerik.com/fiddler/Configure-Fiddler/Tasks/MonitorLocalTraffic Monitor traffic to lo ...
- spring依赖注入原理剖析
PropertyDefinition.java package junit.test; public class PropertyDefinition { private String name; p ...
- linux3.0.4编译LDD中的scull全过程
按照惯例,我是应该先写一些本章的收获的,不过太晚了. 在看完第三章之后开始编译,错误一堆,几乎崩溃,幸亏经过不断的百度,总算解决了问题,我发现 我遇到问题比较多,算是集中七个龙珠了吧,感谢先行的大神们 ...
- Codeforces Educational Codeforces Round 15 D. Road to Post Office
D. Road to Post Office time limit per test 1 second memory limit per test 256 megabytes input standa ...
- E2202 Required package 'VclJPG' not found
xe8 [dcc32 Fatal Error] RaizeComponentsVcl_Design.dpk(40): E2202 Required package 'VclJPG' not found ...
- C# Common Keyword
[C# Common Keyword] 1.abstract Use the abstract modifier in a class declaration to indicate that a c ...
- jQuery Callback 函数
@(编程) Callback 函数在当前动画 100% 完成之后执行. jQuery 动画的问题 许多 jQuery 函数涉及动画.这些函数也许会将 speed 或 duration 作为可选参数. ...