답안 #283039

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
283039	2020-08-25T09:04:02 Z	theStaticMind	Palindrome-Free Numbers (BOI13_numbers)	C++14	95 / 100	1 ms	512 KB

numbers

#include<bits/stdc++.h>
#define pb push_back
#define ii pair<int,int>
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define INF 100000000000000000
#define modulo 1000000007
#define mod 998244353
#define int long long int
using namespace std;

int count(int n, int s){
	int ret = 1;
	for(int i = 0; i < n; i++){
		ret *= max(s--, 8ll);
	}
	return ret;
}

int solve(string s){
	int n = sz(s);
	int cnt = 1;
	cnt += max(0ll, 0ll+s[0] - '1') * count(n - 1, 9);
	for(int i = 1; i < sz(s); i++) cnt += 9ll * count(n - i - 1, 9);
	for(int i = 1; i < sz(s); i++){
		cnt += max(0ll, 0ll+s[i] - '0' - (s[i-1] < s[i] ? 1 : 0) - (i>1 && s[i - 2] < s[i] ? 1 : 0)) * count(n - i - 1, 8);
		if(s[i] == s[i - 1] || (i > 1 && s[i] == s[i - 2])){
			cnt--;
			break;
		}
	}
	return cnt;
}

int32_t main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);

	int a, b;
	cin >> a >> b;

	cout << solve(to_string(b)) - (a ? solve(to_string(a - 1)) : -1);
}

Subtask #1

20.0 / 25.0

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

Subtask #2

75.0 / 75.0

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