• ural 2023 Donald is a postman(水)


    2023. Donald is a postman

    Time limit: 1.0 second
    Memory limit: 64 MB
    Problem illustration
    Donald Duck works as a postman for the Walt Disney Studios. He delivers children’s letters from all over the world to his friends, which are cartoon characters. The Studios has three cases for the letters, with nine sections in each case. Every section has the name of the receiver on it. All cases stand in a row as it is shown at the picture below.
    Donald Duck have brought n letters today. Initially, he stands near the leftmost case. He has to make one step to go to the neighboring case or to the previous one. How many steps will he make until he puts all the letters into the respective sections, if he does this in the order they are in his bag?
    Problem illustration

    Input

    The first line contains an integer n that is the amount of letters in Donald’s bag (1 ≤ n ≤ 1 000). The following n lines contain receivers of the letters in the order they are in the bag.

    Output

    Output the number of steps Donald should make to put all the letters into the cases.

    Sample

    inputoutput
    4
    Aurora
    Tiana
    Ariel
    Mulan
    
    5
    
    Problem Author: Alex Samsonov
    Problem Source: NEERC 2014, Eastern subregional contest
  • 相关阅读:
    verilog RTL编程实践之四
    TB平台搭建之二
    hdu3466 Proud Merchants
    poj2411 Mondriaan's Dream (用1*2的矩形铺)
    zoj3471 Most Powerful
    poj2923 Relocation
    hdu3001 Travelling
    poj3311 Hie with the Pie
    poj1185 炮兵阵地
    poj3254 Corn Fields
  • 原文地址:https://www.cnblogs.com/gongpixin/p/6790405.html
Copyright © 2020-2023  润新知