제출 #869007

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
869007		bobbilyking	Palindrome-Free Numbers (BOI13_numbers)	C++17	72.50 / 100	1 ms	604 KiB

numbers

#pragma GCC target ("avx2")
#pragma GCC optimize ("O3")
#pragma GCC optimize ("unroll-loops")

#include<bits/stdc++.h>
#include<math.h>
using namespace std;

typedef long long int ll;
typedef long double ld;
typedef pair<ll, ll> pl;

#define K first
#define V second
#define G(x) ll x; cin >> x;
#define GD(x) ld x; cin >> x;
#define GS(s) string s; cin >> s;
#define EX(x) { cout << x << '\n'; exit(0); }
#define A(a) (a).begin(), (a).end()
#define F(i, l, r) for (ll i = (l); i < r; ++i)

#define NN
#define M 1000000007 // 998244353

//digit dp
ll dp[20][2][13][13]; //also can have auxiliary info
string r;

constexpr ll INVALID = 10;

#define DP dp[pos][is_eq][l2][l1]
ll solve(int pos, bool is_eq, ll l2, ll l1) {
	if (~DP) return DP;
	if (pos==r.size())
		return DP=1;

	DP = 0;
	for (int i=0;i<=(is_eq?r[pos] - '0':9);i++){
        if (l1 == i) continue;
        if (l2 == i) continue;
		DP += solve(pos+1, is_eq && i==r[pos] - '0', l1, i);
    }

	return DP;
}


int main(){
//    freopen("a.in", "r", stdin);
//    freopen("a.out", "w", stdout);

    ios_base::sync_with_stdio(false); cin.tie(0);
    cout << fixed << setprecision(20);
    ll a,b;
    cin >> a >> b;
    memset(dp, -1, sizeof dp);
    r = to_string(a-1);
    ll lo = solve(0, 1, INVALID, INVALID);
    memset(dp, -1, sizeof dp);
    r = to_string(b);
    cout << solve(0, 1, INVALID, INVALID) - lo << '\n';
}

컴파일 시 표준 에러 (stderr) 메시지

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

• Subtask 1: 12.5 / 25
• Subtask 2: 60 / 75