oj.uz

Submission #755429

# Submission time Handle Problem Language Result Execution time Memory
755429 2023-06-10T05:43:40 Z dxz05 Palindrome-Free Numbers (BOI13_numbers) C++17
88.75 / 100
 3 ms 364 KB 
#pragma GCC optimize("Ofast,O3,unroll-loops")
#pragma GCC target("avx2")

#include <bits/stdc++.h>

using namespace std;

#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define bpc(x) __builtin_popcount(x)
#define bpcll(x) __builtin_popcountll(x)
#define MP make_pair
//#define endl '\n'

mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());

typedef long long ll;
const int MOD = 1e9 + 7;
const int N = 1e6 + 3e2;

ll dp[18][2][11][11];
vector<int> digits;

ll calc(int ind, bool equal, int pre_last, int last){
    if (ind == digits.size()) return 1;

    ll &ans = dp[ind][equal][pre_last][last];
    if (ans != -1) return ans;

    ans = 0;

    for (int d = (ind == 0); d <= 9; d++){
        if (d == pre_last || d == last) continue;

        if (!equal || d < digits[ind]){
            ans += calc(ind + 1, false, last, d);
        } else if (d == digits[ind]){
            ans += calc(ind + 1, true, last, d);
        }
    }

    return ans;
}

ll f_fixed_length(ll n){
    memset(dp, -1, sizeof(dp));

    ll nn = n;

    digits.clear();
    while (nn > 0){
        digits.push_back(nn % 10);
        nn /= 10;
    }

    reverse(all(digits));

    return calc(0, true, 10, 10);
}

ll f(ll n){
    if (n <= 9) return n + 1;
    if (n == 1e18) --n;

    ll res = 0, pw = 9;
    while (pw <= n){
        res += f_fixed_length(pw);
        pw = pw * 10 + 9;
    }

    res += f_fixed_length(n);

    return res;
}

void solve(){
    ll l, r;
    cin >> l >> r;

    ll ans = f(r);
    if (l) ans -= f(l - 1);

    cout << ans << endl;

}

int main(){
    clock_t startTime = clock();
    ios_base::sync_with_stdio(false);

#ifdef LOCAL
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif

    int test_cases = 1;
//    cin >> test_cases;

    for (int test = 1; test <= test_cases; test++){
        // cout << (solve() ? "YES" : "NO") << endl;
        solve();
    }

#ifdef LOCAL
    cerr << "Time: " << int((double) (clock() - startTime) / CLOCKS_PER_SEC * 1000) << " ms" << endl;
#endif

    return 0;
}

Compilation message

numbers.cpp: In function 'll calc(int, bool, int, int)':
numbers.cpp:25:13: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   25 |     if (ind == digits.size()) return 1;
      |         ~~~~^~~~~~~~~~~~~~~~
numbers.cpp: In function 'int main()':
numbers.cpp:88:13: warning: unused variable 'startTime' [-Wunused-variable]
   88 |     clock_t startTime = clock();
      |             ^~~~~~~~~

Subtask #1
13.75 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 340 KB Output isn't correct
2 Incorrect 1 ms 340 KB Output isn't correct
3 Correct 2 ms 340 KB Output is correct
4 Incorrect 1 ms 340 KB Output isn't correct
5 Incorrect 0 ms 340 KB Output isn't correct
6 Incorrect 0 ms 328 KB Output isn't correct
7 Incorrect 0 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 1 ms 340 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Incorrect 1 ms 352 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 212 KB Output is correct
19 Correct 2 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct

Subtask #2
75.0 / 75.0

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