oj.uz

Submission #369085

# Submission time Handle Problem Language Result Execution time Memory
369085 2021-02-20T09:00:51 Z cpp219 Palindrome-Free Numbers (BOI13_numbers) C++14
100 / 100
 2 ms 640 KB 
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define fs first
#define sc second
using namespace std;
const ll N = 2e5 + 9;
const ll inf = 1e16 + 7;
typedef pair<int,int> LL;
string s;
ll n,k,dp[20][12][12][2][2],L,R;

string To_string(ll x){
    string res;
    while(x > 0) res += char(x%10 + '0'),x /= 10;
    reverse(res.begin(),res.end());
    return res;
}

ll f(ll num,ll prv1,ll prv2,ll smaller,ll st){
    if (num > n) return 1;
    if (dp[num][prv1][prv2][smaller][st] != -1) return dp[num][prv1][prv2][smaller][st];
    ll ans = 0,now = s[num] - '0';
    for (ll i = 0;i <= 9;i++){
        if (!smaller && i > now) break;
        if (!st){
            if (!i) ans += f(num + 1,prv1,prv2,1,0);
            else{
                if (i < now || smaller) ans += f(num + 1,i,prv1,1,1);
                else if (i == now) ans += f(num + 1,i,prv1,0,1);
            }
        }
        else{
            if (i != prv1 && i != prv2){
                if (i < now || smaller) ans += f(num + 1,i,prv1,1,1);
                else if (i == now) ans += f(num + 1,i,prv1,0,1);
            }
        }
    }
    return dp[num][prv1][prv2][smaller][st] = ans;
}

ll cal(ll x){
    memset(dp,-1,sizeof(dp));
    if (x < 0) return 0;
    if (!x) return 1;
    s = To_string(x); s = " " + s; n = s.size() - 1;
    //cout<<f(1,10,10,0,0); exit(0);
    return f(1,10,10,0,0);
}

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    #define task "tst"
    if (fopen(task".INP","r")){
        freopen(task".INP","r",stdin);
        //freopen(task".OUT","w",stdout);
    }
    cin>>L>>R;
    //cout<<cal(9); return 0;
    cout<<cal(R) - cal(L - 1);
}

Compilation message

numbers.cpp: In function 'int main()':
numbers.cpp:57:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   57 |         freopen(task".INP","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
25.0 / 25.0

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

Subtask #2
75.0 / 75.0

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