oj.uz

Submission #370316

# Submission time Handle Problem Language Result Execution time Memory
370316 2021-02-23T18:06:59 Z knightron0 Palindrome-Free Numbers (BOI13_numbers) C++14
100 / 100
 14 ms 15596 KB 
#include <bits/stdc++.h>
using namespace std;

#define pb push_back
#define fr first
#define sc second
#define clr(a, x) memset(a, x, sizeof(a))
#define dbg(x) cout<<"("<<#x<<"): "<<x<<endl;
#define printvector(arr) for (auto it = arr.begin(); it != arr.end(); ++it) cout<<*it<<" "; cout<<endl;
#define all(v) v.begin(), v.end()
#define lcm(a, b) (a * b)/__gcd(a, b)
#define int long long int
#define printvecpairs(vec) for(auto it: vec) cout<<it.fr<<' '<<it.sc<<endl;
#define endl '\n'
#define float long double

const int MOD = 1e9 + 7;
const int INF = 2e15;
const int MAXN = 1e5 + 5;

vector<int> v1, v2;
int dp1[20][22][22][2][2][25], dp2[20][22][22][2][2][25];

int solve1(int idx, int p1, int p2, bool same_upper, bool all_zeroes, int start){
	if(idx == (int)v1.size()) return 1;
	int hi = v1[idx];
	int ans= 0;
	if(dp1[idx][p1+1][p2+1][same_upper][all_zeroes][start] != -1) return dp1[idx][p1+1][p2+1][same_upper][all_zeroes][start];
	for(int i= 0;i<10;i++){
		bool valid = true;
		if(same_upper){
			if(i > hi) valid = false;
		}
		if((i == p1) && start < idx) {
			valid = false;
		}
		if((i == p2) && start < idx-1){
			valid = false;
		}
		if(!valid) continue;
		bool newb = (hi == i) && same_upper;
		bool same_zeroes = (i == 0) && all_zeroes;
		int newstart = start;
		if(all_zeroes && (i != 0)){
			newstart = idx;
		}
		ans += solve1(idx+1, i, p1, newb, same_zeroes, newstart);
	}
	return dp1[idx][p1+1][p2+1][same_upper][all_zeroes][start] = ans;
}

int solve2(int idx, int p1, int p2, bool same_upper, bool all_zeroes, int start){
	if(idx == (int)v2.size()) return 1;
	int hi = v2[idx];
	int ans= 0;
	if(dp2[idx][p1+1][p2+1][same_upper][all_zeroes][start] != -1){
		return dp2[idx][p1+1][p2+1][same_upper][all_zeroes][start];
	}
	for(int i= 0;i<10;i++){
		bool valid = true;
		if(same_upper){
			if(i > hi) valid = false;
		}
		if((i == p1) && start < idx) {
			valid = false;
		}
		if((i == p2) && start < idx-1){
			valid = false;
		}
		if(!valid) continue;
		bool newb = (hi == i) && same_upper;
		bool same_zeroes = (i == 0) && all_zeroes;
		int newstart = start;
		if(all_zeroes && (i != 0)){
			newstart = idx;
		}
		ans += solve2(idx+1, i, p1, newb, same_zeroes, newstart);
	}
	return dp2[idx][p1+1][p2+1][same_upper][all_zeroes][start] = ans;
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    #ifdef LOCAL
    freopen("input.txt", "r", stdin);
    #endif
    int x, y;
    cin>>x>>y;
    int num = 0;
    if(x == 0){
    	num = 1;
    }
    x = max(x-1, 0LL);
    while(x>0){
    	v1.pb(x%10);
    	x/=10;
    }
    while(y>0){
    	v2.pb(y%10);
    	y/=10;
    }
    reverse(all(v1));
    reverse(all(v2));
    clr(dp1, -1);
    clr(dp2, -1);
    cout<<solve2(0, -1, -1, 1, 1, 20)-solve1(0, -1, -1, 1, 1, 20)+num<<endl;
    return 0;
}

Subtask #1
25.0 / 25.0

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

Subtask #2
75.0 / 75.0

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