oj.uz

답안 #778987

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
778987 2023-07-11T06:11:30 Z vjudge1 Palindrome-Free Numbers (BOI13_numbers) C++14
100 / 100
 1 ms 340 KB 
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define int long long
#define f first
#define s second
#define pii pair<int,int>
#define piii pair<int,pair<int,int>>
#define vii vector<vector<int>>
#define vi vector<int>
#define cd complex<double>
#define endl '\n'
//#define multipletest
using namespace std;
const int LIM=5e3;
const int INF = 1e18;
const string name="template";
int n,m,l,r;
string t;
int memo[20][11][11][2][2];
int dp(int pos,int lst1,int lst2,int eq,int start){
//	cout<<pos<<" "<<lst1<<" "<<lst2<<" "<<eq<<" "<<start<<endl;
    if(pos==t.size()){
		return 1;
	}
	if(memo[pos][lst1+1][lst2+1][eq][start]!=-1){
		return memo[pos][lst1+1][lst2+1][eq][start];
	}
	int ans=0;
	if(start==0){
		if(eq==true){
		    ans+=dp(pos+1,-1,-1,false,false);
		    int lim=t[pos]-'0';
		    for(int i=1;i<=lim;++i){
		    	ans+=dp(pos+1,i,-1,(i==lim),true);
			}
		}
		else{
			ans+=dp(pos+1,-1,-1,false,false);
			for(int i=1;i<=9;++i){
				ans+=dp(pos+1,i,-1,false,true);
			}
		}
	}
	else{
	if(eq==true){
		 int limit = t[pos]-'0';
	     for(int i=0;i<=limit;++i){
	    	if(i==lst1 || i==lst2) continue;
	    	ans+= dp(pos+1,i,lst1,(i==limit),true);
		 }
	  }
	  else{
	  	for(int i=0;i<=9;++i){
	    	if(i==lst1 || i==lst2) continue;
	    	ans += dp(pos+1,i,lst1,false,true);
		 }
	  }
	}
	return memo[pos][lst1+1][lst2+1][eq][start]=ans;
}
int DP_digit(int x){
	if(x<0){
		return 0;
	}
	t=to_string(x);
	memset(memo,-1,sizeof(memo));
	return dp(0,-1,-1,true,0);
}
void solve(){
	//CODE GOES HERE
	cin>>l>>r;
	cout<<DP_digit(r) - DP_digit(l-1)<<endl;
}
signed main(){
  // freopen((name+".inp").c_str(),"r",stdin);
  // freopen((name+".out").c_str(),"w",stdout);
  //  ifstream cin(".txt");
  //  ofstream cout(".txt");
    //ifstream cin((name +".inp"));
    //ofstream cout((name +".ans"));
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
	int test;
	test=1;
	#ifdef multipletest
	cin>>test;
	#endif
	while(test--){
        solve();
        #ifdef DEBUG
		cerr << "Runtime is: " << clock() * 1.0 / CLOCKS_PER_SEC << endl;
	    #endif
	}
}

Compilation message

numbers.cpp: In function 'long long int dp(long long int, long long int, long long int, long long int, long long int)':
numbers.cpp:23:11: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   23 |     if(pos==t.size()){
      |        ~~~^~~~~~~~~~

Subtask #1
25.0 / 25.0

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

Subtask #2
75.0 / 75.0

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