2015 ACM/ICPC Asia Regional Shenyang Online（1006）

最新推荐文章于 2019-07-04 10:28:42 发布

zhaohuc

最新推荐文章于 2019-07-04 10:28:42 发布

阅读量474

点赞数

分类专栏： 2015沈阳网络赛模拟文章标签： ACM 算法 icpc

本文链接：https://blog.csdn.net/ZZ_AC/article/details/48581529

版权

模拟同时被 2 个专栏收录

22 篇文章 0 订阅

订阅专栏

2015沈阳网络赛

2 篇文章 0 订阅

订阅专栏

Fang Fang

Time Limit: 1500/1000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)
Total Submission(s): 332 Accepted Submission(s): 144

Problem Description

Fang Fang says she wants to be remembered.
I promise her. We define the sequence

F of strings.

F0 = ‘‘f",

F1 = ‘‘ff",

F2 = ‘‘cff",

Fn = Fn−1 + ‘‘f", for n > 2
Write down a serenade as a lowercase string

S in a circle, in a loop that never ends.
Spell the serenade using the minimum number of strings in

F , or nothing could be done but put her away in cold wilderness.

Input

An positive integer

T , indicating there are

T test cases.
Following are

T lines, each line contains an string

S as introduced above.
The total length of strings for all test cases would not be larger than

106 .

Output

The output contains exactly

T lines.
For each test case, if one can not spell the serenade by using the strings in

F , output

−1 . Otherwise, output the minimum number of strings in

F to split

S according to aforementioned rules. Repetitive strings should be counted repeatedly.

Sample Input

  
  
   
   8
ffcfffcffcff
cffcfff
cffcff
cffcf
ffffcffcfff
cffcfffcffffcfffff
cff
cffc

Sample Output

  
  
   
   Case #1: 3
Case #2: 2
Case #3: 2
Case #4: -1
Case #5: 2
Case #6: 4
Case #7: 1
Case #8: -1

   
   
    
    
     
     Hint
    
    
Shift the string in the first test case, we will get the string "cffffcfffcff"
and it can be split into "cffff", "cfff" and "cff".

Source

2015 ACM/ICPC Asia Regional Shenyang Online

简单模拟题

#include
     
     
      
      
#include
      
      
       
       
#include
       
       
        
        
using namespace std;

const int N = 1000001;
char str[N];

int main(void)
{
    int T;
    scanf("%d", &T);
    getchar();
    for(int tmp = 1; tmp <= T; tmp++)
    {
        gets(str);
        int i, j;
        int flag = -1;
        int ans = 0;
        int len = strlen(str);
        for(i = 0; i < len && i != flag; )
        {
            if(str[i] == 'c')
            {
                j = 0;
                if(flag == -1)  flag = i;
				i++;if(!str[i]) i = 0;
                while(str[i] == 'f')
                {
                    i++;
                    j++;
                    if(!str[i]) i = 0;
                }
                if(j < 2) {ans = -1;break;}
                ans++;
            }
			else if(str[i] == 'f')
				i++;
            else
            {
                flag = 0;
                ans = -1;break;
            }
        }
        if(flag == -1)
        {
            ans = len / 2;
            ans += len%2;
        }
        if(len==0) ans = -1;
        printf("Case #%d: %d\n", tmp, ans);
    }
    return 0;
}