zoukankan      html  css  js  c++  java
  • 02TopcoderSRM710B

    Problem Statement

        

    Mancala is a family of games that are played using tokens (such as seeds or pebbles) that are placed into holes or pits in the ground. In this problem we will call the tokens "stones" and the holes "slots".

    You are playing a variant of mancala with n slots around a circle. The slots are labeled from 0 to n-1 in clockwise order. Initially, each slot may contain some stones: for each i, slot i contains start[i] stones.

    The game is played in turns. In each turn you do the following:

    1. You choose a non-empty slot and you take all stones from that slot into your hand.
    2. While you have some stones in your hand, you repeat the following process: you move one slot clockwise and you drop one stone into that slot.

    Note that if you picked up a lot of stones you may go around the whole circle multiple times. Also note that during the second step you also place stones into the slot chosen in the first step. For example, suppose we have four slots with the following numbers of stones: (6, 3, 4, 0). Next, suppose that in step 1 we chose slot 0, i.e., the slot that contains 6 stones. In step 2 we will place those 6 stones into slots 1, 2, 3, 0, 1, and 2. After this turn the stones will be distributed as follows: (1, 5, 6, 1).

    You are given the vector <int> start with n elements: the initial distribution of the stones. Find and return any sequence of at most 2500 moves that leads to a state in which all stones are in a single slot. For the constraints used in this problem it is guaranteed that such a sequence of moves exists. Note that you do not need to minimize the number of moves, any valid sequence will be accepted.

    In order to return a sequence that consists of x moves, return a vector <int> with x elements: for each turn in chronological order, the number of the slot you chose.

    Definition

        
    Class: ForwardMancala
    Method: findMoves
    Parameters: vector <int>
    Returns: vector <int>
    Method signature: vector <int> findMoves(vector <int> start)
    (be sure your method is public)

    Limits

        
    Time limit (s): 2.000
    Memory limit (MB): 256
    Stack limit (MB): 256

    Constraints

    - start will contain between 2 and 10 elements, inclusive.
    - Each element of start will be between 0 and 10, inclusive.
    - It is guaranteed that the sum of elements in start is positive.

    Examples

    0)  
        
    {6,1,0,1}
    Returns: {1, 2, 3, 1, 2, 3 }
    In this case, the states would look as follows:
    • (6,1,0,1)
    • (6,0,1,1)
    • (6,0,0,2)
    • (7,1,0,0)
    • (7,0,1,0)
    • (7,0,0,1)
    • (8,0,0,0)
    1)  
        
    {0,10,0,0,0}
    Returns: { }
    In this case, all the stones are already in one slot, so we don't have to do anything.
    2)  
        
    {0,1,0,1,0,1}
    Returns: {3, 4, 1, 2, 3, 4 }
     
    3)  
        
    {5,0,0,1,3,0,2,0}
    Returns: {3, 4, 5, 6, 7, 1, 2, 3, 4, 5, 6, 7, 1, 2, 3, 4, 5, 6, 7 }
     
    4)  
        
    {10,10,10,10,10,10,10,10,10,10}
    Returns: 
    {1, 2, 3, 4, 5, 6, 7, 8, 9, 1, 2, 3, 4, 5, 6, 7, 8, 9, 1, 2, 3, 4, 5,
     6, 7, 8, 9, 1, 2, 3, 4, 5, 6, 7, 8, 9, 1, 2, 3, 4, 5, 6, 7, 8, 9, 1, 2,
     3, 4, 5, 6, 7, 8, 9, 1, 2, 3, 4, 5, 6, 7, 8, 9, 1, 2, 3, 4, 5, 6, 7, 8,
     9, 1, 2, 3, 4, 5, 6, 7, 8, 9, 1, 2, 3, 4, 5, 6, 7, 8, 9, 1, 2, 3, 4, 5,
     6, 7, 8, 9, 1, 2, 3, 4, 5, 6, 7, 8, 9 }
     

    This problem statement is the exclusive and proprietary property of TopCoder, Inc. Any unauthorized use or reproduction of this information without the prior written consent of TopCoder, Inc. is strictly prohibited. (c)2003, TopCoder, Inc. All rights reserved.

    #include <vector>
    using namespace std;
    class ForwardMancala{
    public :
        vector<int>findMoves(vector<int>start)
        {
            vector<int>ret;
            while(1){
                     int index=-1,count=0;
            for(int i=0;i<start.size();i++){
                if(start[i]!=0){
                    count++;
                    index=i;
                }
            }
            if(count==1)return ret;
            ret.push_back(index);
            int selected=start[index];
            start[index]=0;
            
            for(int i=1;i<=selected;i++)
            {
                start[(index+i)%start.size()]++;
            }
            
            }
            return ret;
        }
         };
    

      

  • 相关阅读:
    MySQL Error--存储inode用完后报设备没有空间
    MySQL Binlog--基于ROW模式的binlog event大小限制
    MySQL Transaction--网络丢包导致长时间未提交事务
    java核心技术第四篇之JDBC第二篇
    java核心技术第三篇之JDBC第一篇
    java核心技术第二篇之数据库SQL语法
    JVM垃圾回收器原理及使用介绍
    JVM中优化指南
    MySQL常用工具、日志及读写分离
    java基础第十九篇之Xml
  • 原文地址:https://www.cnblogs.com/passion-sky/p/8561732.html
Copyright © 2011-2022 走看看