oj.uz

Submission #25837

# Submission time Handle Problem Language Result Execution time Memory
25837 2017-06-24T09:41:37 Z gs14004 Palindrome-Free Numbers (BOI13_numbers) C++11
100 / 100
 0 ms 1152 KB 
#include <cstdio>
#include <algorithm>
#define pow fuck
typedef long long lint;
 
lint piv;
lint pow[20];
 
lint dp[20][11][11][2];
 
lint naive_calc(int d, int p1, int p2, int isroot){
    if(d == -1) return 1;
    if(dp[d][p1][p2][isroot]) return dp[d][p1][p2][isroot];
    lint ret = 0;
    for (int i=0; i<10; i++) {
        if(isroot && i ==0) continue;
        if(i != p1 && i != p2){
            ret += naive_calc(d-1,p2,i,0);
        }
    }
    return dp[d][p1][p2][isroot]=ret;
}
 
lint buho_calc(int d, int p1, int p2, int isroot){
    if(d == -1) return 1;
    lint ret = 0;
    for (int i=0; i<10; i++) {
        if(isroot && i == 0) continue;
        if((piv / pow[d]) % 10 < i) break;
        if(i != p1 && i != p2){
            if((piv / pow[d])%10 == i){
                ret += buho_calc(d-1,p2,i,0);
                break;
            }
            else ret += naive_calc(d-1,p2,i,0);
        }
    }
    return ret;
}
 
lint f(lint x){
    if(x == -1) return 0;
    piv = x;
    lint ret = 0;
    int i, lim = (int)(std::lower_bound(pow,pow+19,x+1) - pow);
     
    for (i=0; i<lim; i++) {
        ret += naive_calc(i-1,10,10,1);
    }
    ret += buho_calc(lim-1,10,10,1);
    return ret;
}
 
int main(){
    lint a,b;
    pow[0] = 1;
    for(int i=1; i<19; i++) pow[i] = pow[i-1] * 10;
    scanf("%lld %lld",&a,&b);
    printf("%lld",f(b) - f(a-1));
}

Compilation message

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

Subtask #1
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1152 KB Output is correct
2 Correct 0 ms 1152 KB Output is correct
3 Correct 0 ms 1152 KB Output is correct
4 Correct 0 ms 1152 KB Output is correct
5 Correct 0 ms 1152 KB Output is correct
6 Correct 0 ms 1152 KB Output is correct
7 Correct 0 ms 1152 KB Output is correct
8 Correct 0 ms 1152 KB Output is correct
9 Correct 0 ms 1152 KB Output is correct
10 Correct 0 ms 1152 KB Output is correct
11 Correct 0 ms 1152 KB Output is correct
12 Correct 0 ms 1152 KB Output is correct
13 Correct 0 ms 1152 KB Output is correct
14 Correct 0 ms 1152 KB Output is correct
15 Correct 0 ms 1152 KB Output is correct
16 Correct 0 ms 1152 KB Output is correct
17 Correct 0 ms 1152 KB Output is correct
18 Correct 0 ms 1152 KB Output is correct
19 Correct 0 ms 1152 KB Output is correct
20 Correct 0 ms 1152 KB Output is correct

Subtask #2
75.0 / 75.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1152 KB Output is correct
2 Correct 0 ms 1152 KB Output is correct
3 Correct 0 ms 1152 KB Output is correct
4 Correct 0 ms 1152 KB Output is correct
5 Correct 0 ms 1152 KB Output is correct
6 Correct 0 ms 1152 KB Output is correct
7 Correct 0 ms 1152 KB Output is correct
8 Correct 0 ms 1152 KB Output is correct
9 Correct 0 ms 1152 KB Output is correct
10 Correct 0 ms 1152 KB Output is correct
11 Correct 0 ms 1152 KB Output is correct
12 Correct 0 ms 1152 KB Output is correct
13 Correct 0 ms 1152 KB Output is correct
14 Correct 0 ms 1152 KB Output is correct
15 Correct 0 ms 1152 KB Output is correct
16 Correct 0 ms 1152 KB Output is correct
17 Correct 0 ms 1152 KB Output is correct
18 Correct 0 ms 1152 KB Output is correct
19 Correct 0 ms 1152 KB Output is correct
20 Correct 0 ms 1152 KB Output is correct
21 Correct 0 ms 1152 KB Output is correct
22 Correct 0 ms 1152 KB Output is correct
23 Correct 0 ms 1152 KB Output is correct
24 Correct 0 ms 1152 KB Output is correct
25 Correct 0 ms 1152 KB Output is correct
26 Correct 0 ms 1152 KB Output is correct
27 Correct 0 ms 1152 KB Output is correct
28 Correct 0 ms 1152 KB Output is correct
29 Correct 0 ms 1152 KB Output is correct
30 Correct 0 ms 1152 KB Output is correct
31 Correct 0 ms 1152 KB Output is correct
32 Correct 0 ms 1152 KB Output is correct
33 Correct 0 ms 1152 KB Output is correct
34 Correct 0 ms 1152 KB Output is correct
35 Correct 0 ms 1152 KB Output is correct
36 Correct 0 ms 1152 KB Output is correct
37 Correct 0 ms 1152 KB Output is correct
38 Correct 0 ms 1152 KB Output is correct
39 Correct 0 ms 1152 KB Output is correct
40 Correct 0 ms 1152 KB Output is correct
41 Correct 0 ms 1152 KB Output is correct
42 Correct 0 ms 1152 KB Output is correct
43 Correct 0 ms 1152 KB Output is correct
44 Correct 0 ms 1152 KB Output is correct
45 Correct 0 ms 1152 KB Output is correct