Codeforces 725B Food on the Plane

简介: B. Food on the Plane time limit per test:2 seconds memory limit per test:256 megabytes input:standard input output:stand...
B. Food on the Plane
time limit per test:2 seconds
memory limit per test:256 megabytes
input:standard input
output:standard output

A new airplane SuperPuperJet has an infinite number of rows, numbered with positive integers starting with 1 from cockpit to tail. There are six seats in each row, denoted with letters from 'a' to 'f'. Seats 'a', 'b' and 'c' are located to the left of an aisle (if one looks in the direction of the cockpit), while seats 'd', 'e' and 'f' are located to the right. Seats 'a' and 'f' are located near the windows, while seats 'c' and 'd' are located near the aisle.

 

It's lunch time and two flight attendants have just started to serve food. They move from the first rows to the tail, always maintaining a distance of two rows from each other because of the food trolley. Thus, at the beginning the first attendant serves row 1 while the second attendant serves row 3. When both rows are done they move one row forward: the first attendant serves row 2 while the second attendant serves row 4. Then they move three rows forward and the first attendant serves row 5 while the second attendant serves row 7. Then they move one row forward again and so on.

Flight attendants work with the same speed: it takes exactly 1 second to serve one passenger and 1 second to move one row forward. Each attendant first serves the passengers on the seats to the right of the aisle and then serves passengers on the seats to the left of the aisle (if one looks in the direction of the cockpit). Moreover, they always serve passengers in order from the window to the aisle. Thus, the first passenger to receive food in each row is located in seat 'f', and the last one — in seat 'c'. Assume that all seats are occupied.

Vasya has seat s in row n and wants to know how many seconds will pass before he gets his lunch.

Input

The only line of input contains a description of Vasya's seat in the format ns, where n (1 ≤ n ≤ 1018) is the index of the row and s is the seat in this row, denoted as letter from 'a' to 'f'. The index of the row and the seat are not separated by a space.

Output

Print one integer — the number of seconds Vasya has to wait until he gets his lunch.

Examples
Input
1f
Output
1
Input
2d
Output
10
Input
4a
Output
11
Input
5e
Output
18
Note

In the first sample, the first flight attendant serves Vasya first, so Vasya gets his lunch after 1 second.

In the second sample, the flight attendants will spend 6 seconds to serve everyone in the rows 1 and 3, then they will move one row forward in 1 second. As they first serve seats located to the right of the aisle in order from window to aisle, Vasya has to wait 3 more seconds. The total is 6 + 1 + 3 = 10.

题目链接:http://codeforces.com/problemset/problem/725/B

思路:注意第一个乘务员是从1开始,第二个从三开始,然后模拟下即可

下面给出AC代码:

复制代码
 1 #include<bits/stdc++.h>
 2 using namespace std;
 3 __int64 judge(char c)  4 {  5 if(c=='f')  6 return 1;  7 if(c=='e')  8 return 2;  9 if(c=='d') 10 return 3; 11 if(c=='a') 12 return 4; 13 if(c=='b') 14 return 5; 15 if(c=='c') 16 return 6; 17 } 18 int main() 19 { 20  __int64 n,m,k,l,sum; 21 char str[3]; 22 while(scanf("%I64d%s",&n,str)!=EOF) 23  { 24 k=n/4; 25 l=n%4; 26 if(l==1||l==2) 27  { 28 sum=(k*2+l)*6+(n-1); 29  } 30 else if(l==3) 31  { 32 sum=(k*2+1)*6+(n-1)-2; 33  } 34 else if(l==0) 35  { 36 k=k-1; 37 sum=(k*2+2)*6+(n-1)-2; 38  } 39 sum+=judge(str[0])-6; 40 printf("%I64d\n",sum); 41  } 42 return 0; 43 }
复制代码
目录
相关文章
|
12月前
Codeforces Round #192 (Div. 2) (330B) B.Road Construction
要将N个城市全部相连,刚开始以为是最小生成树的问题,其实就是一道简单的题目。 要求两个城市之间不超过两条道路,那么所有的城市应该是连在一个点上的,至于这个点就很好找了,只要找到一个没有和其他点有道路限制的即可。
36 0
|
机器学习/深度学习 人工智能 BI
UPC Travel by Car (两次Floyd)
UPC Travel by Car (两次Floyd)
79 0
ZOJ - Summer 2018 - Contest 2 by Astolfo - Problems - 1002: Hazard and The Triangle
ZOJ - Summer 2018 - Contest 2 by Astolfo - Problems - 1002: Hazard and The Triangle
103 0
ZOJ - Summer 2018 - Contest 2 by Astolfo - Problems - 1002: Hazard and The Triangle
Funny Car Racing - 最短路小技巧
题意: n个路口,m条街道,每条街道都是有向的 并且这m条街道open a秒 close b秒(循环往复),自己的车通过这条道路需要t秒 可以从路口等待某一条道路open,必须在道路close 之前通过,且必须在另一条道路open的时候进入 问能否从s点到达t点,如果不能,输出-1,如果能输出最短的时间 细节的地方加在了代码里,在建图的过程中,如果说a > t,那么说这条路无论如何是走不过去的,所以干脆直接不建边
88 0