oj.uz

Submission #584142

# Submission time Handle Problem Language Result Execution time Memory
584142 2022-06-26T23:25:21 Z Olympia Palindrome-Free Numbers (BOI13_numbers) C++17
32.9167 / 100
 1000 ms 212 KB 
#include <bits/stdc++.h>
using namespace std;
bool isPalindrome (int i) {
    string s = to_string(i);
    bool fine = true;
    for (int j = 0; j < s.length(); j++) {
        if (j >= 1 && s[j] == s[j - 1]) {
            fine = false;
        }
        if (j >= 2 && s[j] == s[j - 2]) {
            fine = false;
        }
    }
    return fine;
}
int powerOf10 (int x) {
    //pow(10, x)
    if (x == 1) {
        return 10;
    }
    int tot = 81;
    for (int i = 0; i < x - 2; i++) {
        tot *= 8;
    }
    return tot + powerOf10(x - 1);
}
int res (int a, int b) {
    int ans = 0;
    for (int i = a; i <= b; i++) {
        ans += isPalindrome(i);
    }
    return ans;
}
int removeAllBut2 (int x) {
    string s = to_string(x);
    for (int i = 2; i < s.length(); i++) {
        s[i] = '0';
    }
    return stoi(s);
}
int query (int a, int b) {
    //cout << a << "<->" << b << '\n';
    if (b - a <= 1000) {
        return res(a, b);
    }
    if (a != 0) {
        return query(0, b) - query(0, a - 1);
    }
    if (a == b) {
        return a;
    }
    string s = to_string(b);
    int tot = 0;
    int c = 0;
    for (int i = 1; i <= 9; i++) {
        for (int j = 0; j <= 9; j++) {
            for (int k = 0; k <= 9; k++) {
                if (i == j || j == k || i == k) continue;
                if (100 * i + 10 * j + k >= 100 * (s[0] - '0') + 10 * (s[1] - '0') + (s[2] - '0')) {
                    continue;
                }
                c++;
            }
        }
    }
    //reverse(b.begin(), b.end());
    tot += c * pow(8, (int)s.size() - 3);
    tot += powerOf10((int)s.length() - 1);
    reverse(s.begin(), s.end());
    s.pop_back();
    reverse(s.begin(), s.end());
    b = stoi(s);
    tot += query(removeAllBut2(b), b);
    return tot;
}
int main() {
    int64_t a, b;
    cin >> a >> b;
    cout << query(a, b) << '\n';
}

Compilation message

numbers.cpp: In function 'bool isPalindrome(int)':
numbers.cpp:6:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    6 |     for (int j = 0; j < s.length(); j++) {
      |                     ~~^~~~~~~~~~~~
numbers.cpp: In function 'int removeAllBut2(int)':
numbers.cpp:36:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   36 |     for (int i = 2; i < s.length(); i++) {
      |                     ~~^~~~~~~~~~~~

Subtask #1
16.25 / 25.0

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

Subtask #2
16.6666666667 / 75.0

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