hdu 4333 Revolving Digits

最新推荐文章于 2019-04-30 12:03:29 发布

oneplus_

最新推荐文章于 2019-04-30 12:03:29 发布

阅读量265

点赞数

CC 4.0 BY-SA版权

分类专栏：字符串

本文链接：https://blog.youkuaiyun.com/oneplus_/article/details/38351013

字符串专栏收录该内容

2 篇文章

订阅专栏

本文深入探讨了游戏开发领域的关键技术，包括游戏引擎、编程语言、硬件优化等，并重点介绍了AI音视频处理在游戏中的应用，如语音识别、图像处理、AR特效等。同时，文章还涉及了自动化测试、性能优化等现代开发流程，旨在提供全面的游戏开发与AI音视频处理技术指南。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

</pre>Revolving Digits</h1><span style="font-family:'Times New Roman';font-size:14px;color:#000000;font-style: normal; font-variant: normal; font-weight: normal; letter-spacing: normal; line-height: normal; orphans: auto; text-align: -webkit-center; text-indent: 0px; text-transform: none; white-space: normal; widows: auto; word-spacing: 0px; -webkit-text-stroke-width: 0px;"><strong><span style="font-family:Arial;font-size:12px;color:green;font-weight: bold;">Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1965    Accepted Submission(s): 564</span></strong></span><br style="color: rgb(0, 0, 0); font-family: 'Times New Roman';font-size:14px; font-style: normal; font-variant: normal; font-weight: normal; letter-spacing: normal; line-height: normal; orphans: auto; text-align: -webkit-center; text-indent: 0px; text-transform: none; white-space: normal; widows: auto; word-spacing: 0px; -webkit-text-stroke-width: 0px;" /><br style="color: rgb(0, 0, 0); font-family: 'Times New Roman';font-size:14px; font-style: normal; font-variant: normal; font-weight: normal; letter-spacing: normal; line-height: normal; orphans: auto; text-align: -webkit-center; text-indent: 0px; text-transform: none; white-space: normal; widows: auto; word-spacing: 0px; -webkit-text-stroke-width: 0px;" /><div class="panel_title" style="height: 38px; padding: 0px 14px; color: rgb(124, 169, 237); font-size: 18px; font-family: Arial; font-weight: bold; font-style: normal; font-variant: normal; letter-spacing: normal; line-height: normal; orphans: auto; text-indent: 0px; text-transform: none; white-space: normal; widows: auto; word-spacing: 0px; -webkit-text-stroke-width: 0px; background: url(http://acm.hdu.edu.cn/images/panel-title.png) 0% 100% no-repeat transparent;" align="left">Problem Description</div><div class="panel_content" style="height: auto; margin: 0px; padding: 0px 20px; font-size: 14px; font-family: 'Times New Roman'; text-align: left; color: rgb(0, 0, 0); font-style: normal; font-variant: normal; font-weight: normal; letter-spacing: normal; line-height: normal; orphans: auto; text-indent: 0px; text-transform: none; white-space: normal; widows: auto; word-spacing: 0px; -webkit-text-stroke-width: 0px; background: url(http://acm.hdu.edu.cn/images/panel-content.png) repeat-y;">One day Silence is interested in revolving the digits of a positive integer. In the revolving operation, he can put several last digits to the front of the integer. Of course, he can put all the digits to the front, so he will get the integer itself. For example, he can change 123 into 312, 231 and 123. Now he wanted to know how many different integers he can get that is less than the original integer, how many different integers he can get that is equal to the original integer and how many different integers he can get that is greater than the original integer. We will ensure that the original integer is positive and it has no leading zeros, but if we get an integer with some leading zeros by revolving the digits, we will regard the new integer as it has no leading zeros. For example, if the original integer is 104, we can get 410, 41 and 104.</div><div class="panel_bottom" style="height: auto; margin: 0px; color: rgb(0, 0, 0); font-family: 'Times New Roman';font-size:14px; font-style: normal; font-variant: normal; font-weight: normal; letter-spacing: normal; line-height: normal; orphans: auto; text-align: -webkit-center; text-indent: 0px; text-transform: none; white-space: normal; widows: auto; word-spacing: 0px; -webkit-text-stroke-width: 0px; background: url(http://acm.hdu.edu.cn/images/panel-bottom.png) 0% 0% no-repeat;"> </div><br style="color: rgb(0, 0, 0); font-family: 'Times New Roman';font-size:14px; font-style: normal; font-variant: normal; font-weight: normal; letter-spacing: normal; line-height: normal; orphans: auto; text-align: -webkit-center; text-indent: 0px; text-transform: none; white-space: normal; widows: auto; word-spacing: 0px; -webkit-text-stroke-width: 0px;" /><div class="panel_title" style="height: 38px; padding: 0px 14px; color: rgb(124, 169, 237); font-size: 18px; font-family: Arial; font-weight: bold; font-style: normal; font-variant: normal; letter-spacing: normal; line-height: normal; orphans: auto; text-indent: 0px; text-transform: none; white-space: normal; widows: auto; word-spacing: 0px; -webkit-text-stroke-width: 0px; background: url(http://acm.hdu.edu.cn/images/panel-title.png) 0% 100% no-repeat transparent;" align="left">Input</div><div class="panel_content" style="height: auto; margin: 0px; padding: 0px 20px; font-size: 14px; font-family: 'Times New Roman'; text-align: left; color: rgb(0, 0, 0); font-style: normal; font-variant: normal; font-weight: normal; letter-spacing: normal; line-height: normal; orphans: auto; text-indent: 0px; text-transform: none; white-space: normal; widows: auto; word-spacing: 0px; -webkit-text-stroke-width: 0px; background: url(http://acm.hdu.edu.cn/images/panel-content.png) repeat-y;">The first line of the input contains an integer T (1<=T<=50) which means the number of test cases.<span> </span>For each test cases, there is only one line that is the original integer N. we will ensure that N is an positive integer without leading zeros and N is less than 10^100000.</div><div class="panel_bottom" style="height: auto; margin: 0px; color: rgb(0, 0, 0); font-family: 'Times New Roman';font-size:14px; font-style: normal; font-variant: normal; font-weight: normal; letter-spacing: normal; line-height: normal; orphans: auto; text-align: -webkit-center; text-indent: 0px; text-transform: none; white-space: normal; widows: auto; word-spacing: 0px; -webkit-text-stroke-width: 0px; background: url(http://acm.hdu.edu.cn/images/panel-bottom.png) 0% 0% no-repeat;"> </div><br style="color: rgb(0, 0, 0); font-family: 'Times New Roman';font-size:14px; font-style: normal; font-variant: normal; font-weight: normal; letter-spacing: normal; line-height: normal; orphans: auto; text-align: -webkit-center; text-indent: 0px; text-transform: none; white-space: normal; widows: auto; word-spacing: 0px; -webkit-text-stroke-width: 0px;" /><div class="panel_title" style="height: 38px; padding: 0px 14px; color: rgb(124, 169, 237); font-size: 18px; font-family: Arial; font-weight: bold; font-style: normal; font-variant: normal; letter-spacing: normal; line-height: normal; orphans: auto; text-indent: 0px; text-transform: none; white-space: normal; widows: auto; word-spacing: 0px; -webkit-text-stroke-width: 0px; background: url(http://acm.hdu.edu.cn/images/panel-title.png) 0% 100% no-repeat transparent;" align="left">Output</div><div class="panel_content" style="height: auto; margin: 0px; padding: 0px 20px; font-size: 14px; font-family: 'Times New Roman'; text-align: left; color: rgb(0, 0, 0); font-style: normal; font-variant: normal; font-weight: normal; letter-spacing: normal; line-height: normal; orphans: auto; text-indent: 0px; text-transform: none; white-space: normal; widows: auto; word-spacing: 0px; -webkit-text-stroke-width: 0px; background: url(http://acm.hdu.edu.cn/images/panel-content.png) repeat-y;">For each test case, please output a line which is "Case X: L E G", X means the number of the test case. And L means the number of integers is less than N that we can get by revolving digits. E means the number of integers is equal to N. G means the number of integers is greater than N.</div><div class="panel_bottom" style="height: auto; margin: 0px; color: rgb(0, 0, 0); font-family: 'Times New Roman';font-size:14px; font-style: normal; font-variant: normal; font-weight: normal; letter-spacing: normal; line-height: normal; orphans: auto; text-align: -webkit-center; text-indent: 0px; text-transform: none; white-space: normal; widows: auto; word-spacing: 0px; -webkit-text-stroke-width: 0px; background: url(http://acm.hdu.edu.cn/images/panel-bottom.png) 0% 0% no-repeat;"> </div><br style="color: rgb(0, 0, 0); font-family: 'Times New Roman';font-size:14px; font-style: normal; font-variant: normal; font-weight: normal; letter-spacing: normal; line-height: normal; orphans: auto; text-align: -webkit-center; text-indent: 0px; text-transform: none; white-space: normal; widows: auto; word-spacing: 0px; -webkit-text-stroke-width: 0px;" /><div class="panel_title" style="height: 38px; padding: 0px 14px; color: rgb(124, 169, 237); font-size: 18px; font-family: Arial; font-weight: bold; font-style: normal; font-variant: normal; letter-spacing: normal; line-height: normal; orphans: auto; text-indent: 0px; text-transform: none; white-space: normal; widows: auto; word-spacing: 0px; -webkit-text-stroke-width: 0px; background: url(http://acm.hdu.edu.cn/images/panel-title.png) 0% 100% no-repeat transparent;" align="left">Sample Input</div><div class="panel_content" style="height: auto; margin: 0px; padding: 0px 20px; font-size: 14px; font-family: 'Times New Roman'; text-align: left; color: rgb(0, 0, 0); font-style: normal; font-variant: normal; font-weight: normal; letter-spacing: normal; line-height: normal; orphans: auto; text-indent: 0px; text-transform: none; white-space: normal; widows: auto; word-spacing: 0px; -webkit-text-stroke-width: 0px; background: url(http://acm.hdu.edu.cn/images/panel-content.png) repeat-y;"><pre style="margin: 0px; font-size: 14px;"><div style="font-family: 'Courier New', Courier, monospace;">1
341</div>

Sample Output

   
    Case 1: 1 1 1

Source

2012 Multi-University Training Contest 4

Recommend

zhoujiaqi2010

解法：扩展kmp

#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
#include <string>
#include <cmath>
using namespace std;
const int maxn = 210005;
int next[maxn],extand[maxn];
char S[maxn],T[maxn];
void GetNext(const char *T) {
    int len = strlen(T),a = 0;
    next[0] = len;
    while(a < len - 1 && T[a] == T[a + 1]) a++;
    next[1] = a;
    a = 1;
    for(int k = 2; k < len; k ++) {
        int p = a + next[a] - 1,L = next[k - a];
        if( (k - 1) + L >= p) {
            int j = (p - k + 1) > 0 ? (p - k + 1) : 0;
            while(k + j < len && T[k + j] == T[j]) j++;
            next[k] = j;
            a = k;
        } else
            next[k] = L;
    }
}

void GetExtand(const char *S,const char *T) {
    GetNext(T);
    int slen = strlen(S),tlen = strlen(T),a = 0;
    int MinLen = slen < tlen ? slen : tlen;
    while(a < MinLen && S[a] == T[a]) a++;
    extand[0] = a;
    a = 0;
    for(int k = 1; k < slen; k ++) {
        int p = a + extand[a] - 1, L = next[k - a];
        if( (k - 1) + L >= p) {
            int j = (p - k + 1) > 0 ? (p - k + 1) : 0;
            while(k + j < slen && j < tlen && S[k + j] == T[j]) j ++;
            extand[k] = j;
            a = k;
        } else
            extand[k] = L;
    }
}
int next2[maxn];
void getnext(char *s,int len)
{

    int i = 0, j = -1;
    next2[0] = -1;
    while(i < len){
        if(j == -1 || s[i] == s[j]){
            ++i,++j;
            if(s[i] == s[j]) next2[i] = next2[j];
            else next2[i] = j;
        }else j = next2[j];
    }
}
char s1[maxn],s2[maxn];
int main()
{

    int cas = 0,t;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%s",s1);
        int len = strlen(s1);
        strcpy(s2,s1);
        strcat(s2,s1);
        GetExtand(s2,s1);
        int cnt1 = 0,cnt2 = 0,cnt3 = 0;
        //cout<<len<<endl;
        for(int i = 0;i < len; ++i)
        {
            if(extand[i] >= len)cnt2++;
            else
            {
                if(s2[i + extand[i]] < s2[extand[i]])cnt1++;
                else cnt3++;
            }
              //  cout<<"d"<<endl;
        }
        //cout<<cnt1<<cnt2<<cnt3<<endl;
        getnext(s1,len);
        int L = len - next2[len],p = 1;
        if(len % L == 0)p = len / L;
        printf("Case %d: %d %d %d\n",++cas,cnt1/p,cnt2/p,cnt3/p);
    }

    return 0;
}