답안 #384448

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
384448	2021-04-01T17:03:48 Z	negar_a	Palindrome-Free Numbers (BOI13_numbers)	C++14	16.25 / 100	2 ms	640 KB

numbers

//!yrt tsuj uoy srettam gnihton no emoc
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef long double ld;
#define pb push_back
#define mp make_pair
#define pii pair <int, int>
#define fast_io ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define F first
#define S second

ll a, b, ans = 0;
ll x, y;
string A, B;

ll pw(ll x, ll y){
	ll res = 1;
	for(ll i = 0; i < y; i ++){
		res *= x;
	}
	return res;
}

bool Y(int l, int r, int m){
	return (m > l && m < r);
}

void solve_s(ll st){
	for(ll i = st - 1; i >= 0; i --){
		ll t = 9 - (A[i] - '0') - (i < x - 1 && A[i + 1] > A[i]) - (i < x - 2 && A[i + 2] > A[i]);
		ans += 1LL * t * (i == x - 1 ? 9 * pw(8, i - 1) : pw(8, i));
		if(i < x - 1 && A[i] == A[i + 1]){
			return;
		}
		if(i < x - 2 && A[i] == A[i + 2]){
			return;
		}
	}
	if(0 < x - 1 && A[0] == A[1]){
		return;
	}
	if(0 < x - 2 && A[0] == A[2]){
		return;
	}
	ans ++;
	return;
}

void solve_b(ll st){
	for(ll i = st - 1; i >= 0; i --){
		ll t = (B[i] - '0' - (i == y - 1)) - (i < y - 1 && B[i + 1] < B[i]) - (i < y - 2 && B[i + 2] < B[i]);
		ans += 1LL * t * (i == y - 1 ? 9 * pw(8, i - 1) : pw(8, i));
		if(i < y - 1 && B[i] == B[i + 1]){
			return;
		}
		if(i < y - 2 && B[i] == B[i + 2]){
			return;
		}
//		cout << "ani = " << i << " : " << ans << endl;
	}
	if(0 < y - 1 && B[0] == B[1]){
		return;
	}
	if(0 < y - 2 && B[0] == B[2]){
		return;
	}
	ans ++;
	return;
}

int main(){
	fast_io;
		
	cin >> a >> b;
	A = to_string(a);
	B = to_string(b);
	x = A.size(), y = B.size();
	
	reverse(A.begin(), A.end());
	reverse(B.begin(), B.end());
	
	if(x == y){
		assert(0);
		ll ind = x - 1;
		while(ind >= 0 && A[ind] == B[ind]){
			if(ind < x - 1 && A[ind] == A[ind + 1]){
				cout << 0;
				return 0;
			}
			if(ind < x - 2 && A[ind] == A[ind + 2]){
				cout << 0;
				return 0;
			}
			ind --;
		}
		if(ind >= 0){
			ll t = 1LL * (B[ind] - A[ind]) - 1 - (ind + 1 < x && Y(A[ind], B[ind], A[ind + 1])) - (ind + 2 < x && Y(A[ind], B[ind], A[ind + 2]));
			ans += t * (ind == x - 1 ? 9 * pw(8, ind - 1) : pw(8, ind));
			
			solve_s(ind);
			solve_b(ind);
		}else
			ans = 1;
	}else{
		for(ll i = x + 1; i < y; i ++){
			ans += 1LL * 9 * 9 * pw(8, i - 2);
		}
		solve_s(x);
		solve_b(y);
	}
	
	cout << ans;
	
	return 0;
}

Subtask #1

1.25 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	1 ms	364 KB	Output isn't correct
2	Incorrect	1 ms	364 KB	Output isn't correct
3	Runtime error	2 ms	492 KB	Execution killed with signal 6
4	Incorrect	1 ms	364 KB	Output isn't correct
5	Incorrect	1 ms	364 KB	Output isn't correct
6	Incorrect	1 ms	364 KB	Output isn't correct
7	Incorrect	1 ms	364 KB	Output isn't correct
8	Incorrect	1 ms	364 KB	Output isn't correct
9	Runtime error	2 ms	492 KB	Execution killed with signal 6
10	Runtime error	1 ms	492 KB	Execution killed with signal 6
11	Runtime error	2 ms	492 KB	Execution killed with signal 6
12	Runtime error	2 ms	492 KB	Execution killed with signal 6
13	Runtime error	2 ms	492 KB	Execution killed with signal 6
14	Incorrect	1 ms	364 KB	Output isn't correct
15	Incorrect	1 ms	384 KB	Output isn't correct
16	Runtime error	2 ms	492 KB	Execution killed with signal 6
17	Runtime error	2 ms	492 KB	Execution killed with signal 6
18	Runtime error	2 ms	492 KB	Execution killed with signal 6
19	Runtime error	2 ms	620 KB	Execution killed with signal 6
20	Correct	1 ms	364 KB	Output is correct

Subtask #2

15.0 / 75.0

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