oj.uz

답안 #964047

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
964047 2024-04-16T08:54:56 Z Pring Palindrome-Free Numbers (BOI13_numbers) C++17
100 / 100
 1 ms 356 KB 
#include <bits/stdc++.h>
using namespace std;

#ifdef MIKU
string dbmc = "\033[1;38;2;57;197;187m", dbrs = "\033[0m";
#define debug(x...) cout << dbmc << "[" << #x << "]: ", dout(x)
void dout() { cout << dbrs << endl; }
template <typename T, typename ...U>
void dout(T t, U ...u) { cout << t << (sizeof...(u) ? ", " : ""); dout(u...); }
#else
#define debug(...) 39
#endif

#define fs first
#define sc second
#define mp make_pair
#define FOR(i, j, k) for (int i = j, Z = k; i < Z; i++)
using ll = long long;
typedef pair<int, int> pii;
typedef pair<string, int> psi;

ll BA[20];

void init() {
    BA[0] = 1;
    FOR(i, 1, 20) BA[i] = BA[i - 1] * 8;
}

ll calc(string t, int k) {
    int n = t.size();
    FOR(i, 1, n) if (t[i] == t[i - 1]) return 0;
    FOR(i, 2, n) if (t[i] == t[i - 2]) return 0;
    if (k == 0) return 1;
    if (t.size() >= 2) return BA[k];
    return BA[k - 1] * 9;
}

ll f(ll x) {
    vector<psi> v;
    ll ans = 0;
    if (x <= 10) return x;
    string s = to_string(x);
    FOR(i, 0, s.size() - 1) {
        for (char j = '1'; j <= '9'; j++) v.push_back(mp(string(1, j), i));
    }
    for (char j = '1'; j < s[0]; j++) v.push_back(mp(string(1, j), (int) s.size() - 1));
    FOR(i, 1, s.size()) {
        for (char j = '0'; j < s[i]; j++) v.push_back(mp(s.substr(0, i) + string(1, j), (int) s.size() - i - 1));
    }
    debug(x);
    // for (auto [t, k] : v) debug(t, k);
    // for (auto [t, k] : v) ans += calc(t, k);
    for (auto [t, k] : v) {
        ans += calc(t, k);
        debug(t, k, ans);
    }
    return ans + 1;
}

void miku() {
    ll a, b;
    cin >> a >> b;
    cout << f(b + 1) - f(a) << '\n';
}

int32_t main() {
    cin.tie(0) -> sync_with_stdio(false);
    cin.exceptions(cin.failbit);
    init();
    miku();
    return 0;
}

Compilation message

numbers.cpp: In function 'll f(ll)':
numbers.cpp:11:20: warning: statement has no effect [-Wunused-value]
   11 | #define debug(...) 39
      |                    ^~
numbers.cpp:50:5: note: in expansion of macro 'debug'
   50 |     debug(x);
      |     ^~~~~
numbers.cpp:11:20: warning: statement has no effect [-Wunused-value]
   11 | #define debug(...) 39
      |                    ^~
numbers.cpp:55:9: note: in expansion of macro 'debug'
   55 |         debug(t, k, ans);
      |         ^~~~~

Subtask #1
25.0 / 25.0

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

Subtask #2
75.0 / 75.0

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