oj.uz

답안 #488478

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
488478 2021-11-19T08:53:35 Z NintsiChkhaidze Palindrome-Free Numbers (BOI13_numbers) C++14
95 / 100
 1 ms 412 KB 
#include <bits/stdc++.h>
#define pb push_back
#define s second
#define f first
#define ll long long
#define int ll
using namespace std;
 
string str;
int dp[15][15][25][5];
 
int get(int last2,int last,int len,int sm){
    if (len >= str.size()) return 1;
    if (dp[last2][last][len][sm] != -1) 
        return dp[last2][last][len][sm];
    
    int l = str[len] - '0',sum = 0;
    if (sm){
        for (int i = 0; i <= 9; i++){
            if (i != last && i != last2)
                sum += get(last,i,len + 1,1);
        }
    }
    else{
        for (int i = 0; i < l; i++){
            if (i != last && i != last2)
                sum += get(last,i,len + 1,1);
        }
        
        if (l != last && l != last2)
            sum += get(last,l,len + 1,0);    
    }
    return dp[last2][last][len][sm] = sum;
}
void clear(){
    for (int i = 0; i <= 9; i++)
        for (int j = 0; j <= 9; j++)
            for (int z = 0; z<=20; z++)
                dp[i][j][z][0] = dp[i][j][z][1] = -1;
}
int G(int x){
    if (x < 0) return 0;
    clear();
    str = "";
    while(x){
        str+=(x%10)+'0';
        x/=10;
    }
    
    reverse(str.begin(),str.end());
    int l = str[0] - '0',ans = 0;
    for (int i = 1; i < l; i++)
        ans += get(i,i,1,1);
    ans += get(l,l,1,0);
 
    for (int i = 2; i <= str.size(); i++)
        for (int j=1;j<=9;j++)
            ans += get(j,j,i,1);
 
    return ans+1;
}
signed main (){
    ios_base::sync_with_stdio(0),cin.tie(NULL),cout.tie(NULL);
    ll a,b;
    cin>>a>>b;
    cout<<G(b) - G(a - 1)<<"\n";
}

Compilation message

numbers.cpp: In function 'long long int get(long long int, long long int, long long int, long long int)':
numbers.cpp:13:13: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   13 |     if (len >= str.size()) return 1;
      |         ~~~~^~~~~~~~~~~~~
numbers.cpp: In function 'long long int G(long long int)':
numbers.cpp:56:23: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   56 |     for (int i = 2; i <= str.size(); i++)
      |                     ~~^~~~~~~~~~~~~

Subtask #1
20.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Incorrect 0 ms 332 KB Output isn't correct
6 Incorrect 0 ms 332 KB Output isn't correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 0 ms 332 KB Output is correct
13 Correct 0 ms 332 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Incorrect 0 ms 332 KB Output isn't correct
16 Correct 0 ms 332 KB Output is correct
17 Correct 0 ms 332 KB Output is correct
18 Incorrect 0 ms 332 KB Output isn't correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 0 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 0 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 1 ms 412 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 0 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 0 ms 332 KB Output is correct
16 Correct 0 ms 332 KB Output is correct
17 Correct 0 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 0 ms 332 KB Output is correct
27 Correct 0 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 0 ms 332 KB Output is correct
30 Correct 0 ms 332 KB Output is correct
31 Correct 1 ms 352 KB Output is correct
32 Correct 0 ms 332 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Correct 0 ms 332 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 1 ms 332 KB Output is correct
37 Correct 1 ms 332 KB Output is correct
38 Correct 1 ms 332 KB Output is correct
39 Correct 1 ms 332 KB Output is correct
40 Correct 0 ms 332 KB Output is correct
41 Correct 0 ms 332 KB Output is correct
42 Correct 0 ms 332 KB Output is correct
43 Correct 1 ms 332 KB Output is correct
44 Correct 0 ms 332 KB Output is correct
45 Correct 1 ms 332 KB Output is correct