답안 #579882

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
579882	2022-06-20T07:45:33 Z	RealSnake	Palindrome-Free Numbers (BOI13_numbers)	C++14	73.75 / 100	1 ms	340 KB

numbers

#include "bits/stdc++.h"
using namespace std;

#define ll long long
#define mod 1000000007

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;

ll n;
string s;
ll dp[20][2][11][11][2];

ll solve(ll ind, bool b, ll lst1, ll lst2, bool zero) {
    if(ind + 1 == n)
        return 1;
    if(dp[ind + 1][b][lst1][lst2][zero])
        return dp[ind + 1][b][lst1][lst2][zero];
    ll ans = 0;
    if(b == 1) {
        ll d = (s[ind + 1] - '0');
        for(ll i = 0; i <= d; i++) {
            if(!zero && (i == lst1 || i == lst2))
                continue;
            ans += solve(ind + 1, (i == d), i, lst1, (zero & (i == 0)));
        }
    }
    else {
        for(ll i = 0; i <= 9; i++) {
            if(!zero && (i == lst1 || i == lst2))
                continue;
            ans += solve(ind + 1, 0, i, lst1, (zero & (i == 0)));
        }
    }
    return dp[ind + 1][b][lst1][lst2][zero] = ans;
}

signed main() {

    ios::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);

    string b;
    ll a;
    cin >> a >> b;
    s = b;
    n = s.size();
    ll ans = solve(-1, 1, 10, 10, 1);
    a--;
    if(a >= 0) {
        memset(dp, 0, sizeof dp);
        s = to_string(a);
        n = s.size();
        ans -= solve(-1, 1, 10, 10, 1);
    }
    cout << ans;

    return 0;
}

Subtask #1

13.75 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	0 ms	340 KB	Output isn't correct
2	Incorrect	0 ms	340 KB	Output isn't correct
3	Correct	1 ms	340 KB	Output is correct
4	Incorrect	0 ms	340 KB	Output isn't correct
5	Correct	0 ms	340 KB	Output is correct
6	Incorrect	0 ms	340 KB	Output isn't correct
7	Incorrect	1 ms	340 KB	Output isn't correct
8	Incorrect	0 ms	340 KB	Output isn't correct
9	Correct	1 ms	340 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct
11	Correct	0 ms	340 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	0 ms	340 KB	Output is correct
14	Incorrect	0 ms	212 KB	Output isn't correct
15	Incorrect	0 ms	340 KB	Output isn't correct
16	Correct	1 ms	340 KB	Output is correct
17	Correct	1 ms	340 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct
19	Correct	1 ms	340 KB	Output is correct
20	Incorrect	0 ms	340 KB	Output isn't correct

Subtask #2

60.0 / 75.0

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