oj.uz

답안 #526558

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
526558 2022-02-15T08:13:25 Z ToroTN Palindrome-Free Numbers (BOI13_numbers) C++14
100 / 100
 2 ms 376 KB 
#include<bits/stdc++.h>
using namespace std;
long long a,b,cnt=0,pow_10[25];
long long query(long long num)
{
    string s;
    s.clear();
    s=to_string(num);
    //cout << s << endl;
    long long dp[23][15][15][2],arr[23];
    memset(arr,0,sizeof arr);
    memset(dp,0,sizeof dp);
    int n=s.size();
    //printf("%d\n",n);
    for(int i=1;i<=n;i++)
    {
        arr[i]=s[i-1]-48;
        //printf("%lld ",arr[i]);
    }
    //printf("\n");
    if(n==1)
    {
        return arr[1]+1;
    }
    for(int i=1;i<arr[1];i++)
    {
        for(int j=0;j<=9;j++)
        {
            if(i!=j)
            {
                dp[2][j][i][0]=1;
            }
        }
    }
    for(int i=0;i<arr[2];i++)
    {
        if(arr[1]!=i)
        {
            dp[2][i][arr[1]][0]=1;
        }
    }
    if(arr[1]!=arr[2])
    {
        dp[2][arr[2]][arr[1]][1]=1;
    }
    /*for(int i=0;i<=9;i++)
    {
        for(int j=0;j<=9;j++)
        {
            for(int k=0;k<=1;k++)
            {
                printf("%d %d %d %lld\n",i,j,k,dp[2][i][j][k]);
            }
        }
    }*/
    //printf("%lld\n",n);
    for(int i=3;i<=n;i++)
    {
        for(int j=0;j<=9;j++)
        {
            for(int k=0;k<=9;k++)
            {
                for(int l=0;l<=9;l++)
                {
                    if(l!=j&&l!=k)
                    {
                        dp[i][l][k][0]+=dp[i-1][k][j][0];
                    }
                }
            }
        }
        for(int j=0;j<arr[i];j++)
        {
            if(j!=arr[i-1]&&j!=arr[i-2])
            {
                dp[i][j][arr[i-1]][0]+=dp[i-1][arr[i-1]][arr[i-2]][1];
            }
        }
        if(arr[i]!=arr[i-1]&&arr[i]!=arr[i-2])
        {
            dp[i][arr[i]][arr[i-1]][1]+=dp[i-1][arr[i-1]][arr[i-2]][1];
        }
    }
    long long sum=0;
    for(int i=0;i<=9;i++)
    {
        for(int j=0;j<=9;j++)
        {
            sum+=dp[n][i][j][0];
            sum+=dp[n][i][j][1];
            //printf("%d %d %lld %lld\n",i,j,dp[n][i][j][0],dp[n][i][j][1]);
        }
    }
    //printf("sum=%lld\n",sum);
    return sum;
}
int main()
{
    pow_10[0]=1;
    for(int i=1;i<=18;i++)
    {
        pow_10[i]=pow_10[i-1]*10;
    }
    scanf("%lld%lld",&a,&b);
    for(int i=1;i<=18;i++)
    {
        if(b>=pow_10[i])
        {
            cnt+=query(pow_10[i]-1);
        }
        if(a-1>=pow_10[i])
        {
            cnt-=query(pow_10[i]-1);
        }
    }
    //printf("bug=%lld %lld\n",query(a),query(b));
    if(a==0)
    {
        printf("%lld\n",query(b)+cnt);
    }else
    {
        printf("%lld\n",cnt+query(b)-query(a-1));
    }
}

Compilation message

numbers.cpp: In function 'int main()':
numbers.cpp:104:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  104 |     scanf("%lld%lld",&a,&b);
      |     ~~~~~^~~~~~~~~~~~~~~~~~

Subtask #1
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 296 KB Output is correct
2 Correct 1 ms 292 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 292 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 0 ms 288 KB Output is correct
12 Correct 1 ms 296 KB Output is correct
13 Correct 1 ms 292 KB Output is correct
14 Correct 1 ms 288 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 288 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 284 KB Output is correct
20 Correct 1 ms 332 KB Output is correct

Subtask #2
75.0 / 75.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 288 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 292 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 296 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 0 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 288 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 292 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 292 KB Output is correct
21 Correct 1 ms 336 KB Output is correct
22 Correct 1 ms 336 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 288 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 292 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Correct 1 ms 332 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 1 ms 292 KB Output is correct
37 Correct 2 ms 332 KB Output is correct
38 Correct 1 ms 336 KB Output is correct
39 Correct 1 ms 292 KB Output is correct
40 Correct 1 ms 296 KB Output is correct
41 Correct 1 ms 344 KB Output is correct
42 Correct 1 ms 336 KB Output is correct
43 Correct 1 ms 332 KB Output is correct
44 Correct 1 ms 376 KB Output is correct
45 Correct 1 ms 332 KB Output is correct