oj.uz

답안 #448494

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
448494 2021-07-30T09:33:44 Z Khizri Palindrome-Free Numbers (BOI13_numbers) C++17
15 / 100
 1000 ms 312 KB 
#include <bits/stdc++.h>
using namespace std;
//------------------------------DEFINE------------------------------
//******************************************************************
#define IOS ios_base::sync_with_stdio(false); cin.tie(0),cout.tie(0)
#define ll long long
#define pb push_back		 
#define F first																 
#define S second 															 
#define INF 1e18
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define pii pair<int,int>
#define pll pair<ll,ll>
#define OK cout<<"Ok"<<endl;
#define MOD (ll)(1e9+7)
#define endl "\n"
//******************************************************************
//----------------------------FUNCTION------------------------------
//******************************************************************
ll gcd(ll a,ll b){
	if(a>b) swap(a,b);
	if(a==0) return a+b;
	return gcd(b%a,a);
}
ll lcm(ll a,ll b){
	return a/gcd(a,b)*b;
}
bool is_prime(ll n){
	ll k=sqrt(n);
	if(n==2) return true;
	if(n<2||n%2==0||k*k==n) return false;
	for(int i=3;i<=k;i+=2){
		if(n%i==0){
			return false;
		}
	}
	return true;
}
//*****************************************************************
//--------------------------MAIN-CODE------------------------------
const int mxn=1e6+5;
ll t=1,A,B,ans,dp[30];
void solve(){
	dp[0]=1;
	for(int i=1;i<=18;i++){
		dp[i]=dp[i-1]*10;
	}
	cin>>A>>B;
	for(ll i=A;i<=B;i++){
		bool q=true;;
		ll k=i,a=-1,b=-1,say=0;
		while(k>0){
			int x=k%10;
			if(x==a){
				q=false;
				k=k*dp[say]+(a+1)*dp[say-1];
				break;
			}
			else if(x==b){
				q=false;
				k=k*dp[say]+a*dp[say-1]+(x+1)*(dp[say-2]);
				break;
			}
			b=a;
			a=x;
			k/=10;
			say++;
		}
		if(k!=0){
			i=k-1;
		}
		if(i>=100&&i%10==0&&i+10<=B){
			int x=(i/10)%10,y=(i/100)%10;
			if(x==y){
				ans+=0;
			}
			else{
				ans+=8;
			}
			i+=9;
		}
		else if(q){
			ans++;
		}
	}
	cout<<ans<<endl;
}
int main(){
	IOS;
	//cin>>t;
	while(t--){
		solve();
	}
	return 0;
}

Subtask #1
15.0 / 25.0

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

Subtask #2
0 / 75.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 9 ms 204 KB Output isn't correct
2 Execution timed out 1091 ms 204 KB Time limit exceeded
3 Execution timed out 1098 ms 204 KB Time limit exceeded
4 Execution timed out 1099 ms 204 KB Time limit exceeded
5 Incorrect 86 ms 292 KB Output isn't correct
6 Incorrect 83 ms 204 KB Output isn't correct
7 Incorrect 5 ms 204 KB Output isn't correct
8 Incorrect 3 ms 204 KB Output isn't correct
9 Incorrect 7 ms 308 KB Output isn't correct
10 Incorrect 8 ms 312 KB Output isn't correct
11 Incorrect 9 ms 204 KB Output isn't correct
12 Incorrect 47 ms 204 KB Output isn't correct
13 Incorrect 12 ms 304 KB Output isn't correct
14 Incorrect 80 ms 204 KB Output isn't correct
15 Incorrect 94 ms 204 KB Output isn't correct
16 Execution timed out 1080 ms 204 KB Time limit exceeded
17 Incorrect 1 ms 204 KB Output isn't correct
18 Incorrect 0 ms 204 KB Output isn't correct
19 Incorrect 0 ms 204 KB Output isn't correct
20 Incorrect 0 ms 204 KB Output isn't correct
21 Execution timed out 1089 ms 204 KB Time limit exceeded
22 Incorrect 0 ms 204 KB Output isn't correct
23 Execution timed out 1085 ms 208 KB Time limit exceeded
24 Incorrect 0 ms 204 KB Output isn't correct
25 Execution timed out 1095 ms 204 KB Time limit exceeded
26 Execution timed out 1089 ms 204 KB Time limit exceeded
27 Execution timed out 1097 ms 204 KB Time limit exceeded
28 Execution timed out 1099 ms 204 KB Time limit exceeded
29 Incorrect 0 ms 204 KB Output isn't correct
30 Incorrect 0 ms 204 KB Output isn't correct
31 Execution timed out 1085 ms 204 KB Time limit exceeded
32 Incorrect 1 ms 204 KB Output isn't correct
33 Execution timed out 1089 ms 204 KB Time limit exceeded
34 Incorrect 0 ms 204 KB Output isn't correct
35 Execution timed out 1094 ms 204 KB Time limit exceeded
36 Execution timed out 1089 ms 204 KB Time limit exceeded
37 Execution timed out 1097 ms 204 KB Time limit exceeded
38 Execution timed out 1096 ms 204 KB Time limit exceeded
39 Execution timed out 1093 ms 204 KB Time limit exceeded
40 Incorrect 1 ms 204 KB Output isn't correct
41 Execution timed out 1098 ms 204 KB Time limit exceeded
42 Incorrect 1 ms 204 KB Output isn't correct
43 Execution timed out 1092 ms 204 KB Time limit exceeded
44 Execution timed out 1091 ms 204 KB Time limit exceeded
45 Execution timed out 1098 ms 204 KB Time limit exceeded