제출 #557481

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
557481		Sam_a17	Palindrome-Free Numbers (BOI13_numbers)	C++14	100 / 100	3 ms	576 KiB

numbers

#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
// #include "temp.cpp"
#include <cstdio>
using namespace std;

#ifndef ONLINE_JUDGE
#define dbg(x) cerr << #x <<" "; print(x); cerr << endl;
#else
#define dbg(x)
#endif

#define sz(x) (int((x).size()))
#define len(x) (int)x.length()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define clr(x) x.clear()
#define uniq(x) x.resize(unique(all(x)) - x.begin());
#define blt __builtin_popcount

#define pb push_back
#define pf push_front
#define popf pop_front
#define popb pop_back

void print(long long t) {cerr << t;}
void print(int t) {cerr << t;}
void print(string t) {cerr << t;}
void print(char t) {cerr << t;}
void print(double t) {cerr << t;}
void print(long double t) {cerr << t;}
void print(unsigned long long t) {cerr << t;}

template <class T> void print(set <T> v);
template <class T> void print(vector <T> v);
template <class T> void print(multiset <T> v);
template <class T, class V> void print(map <T, V> v);
template <class T, class V> void print(pair <T, V> p);
template <class T, class V> void print(T v[],V n) {cerr << "["; for(int i = 0; i < n; i++) {print(v[i]); cerr << " "; } cerr << "]";}
template <class T, class V> void print(pair <T, V> p) {cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}";}
template <class T> void print(vector <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(deque<T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(set <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(multiset <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T, class V> void print(map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T, class V> void print(unordered_map<T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]";}

#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define nl '\n'

// for grid problems
int dx[8] = {-1,0,1,0,1,-1,1,-1};
int dy[8] = {0,1,0,-1,1,1,-1,-1};

// lowest / (1 << 17) >= 1e5 / (1 << 18) >= 2e5 / (1 << 21) >= 1e6
void fastIO() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr); cout.tie(nullptr);
}

// file in/out
void setIO(string str = "") {
  fastIO();

  if (str != "" && str != "input") {
    freopen((str + ".in").c_str(), "r", stdin);
    freopen((str + ".out").c_str(), "w", stdout);
  }

  if(str == "input") {
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
  }
}
// Indexed Set
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
const int N = 22;
long long a, b, dp[N][N][N][2], udp[N][N][N];
string s;

long long solveUnLim(int size, int pos, int lst, int curr) {
  if(pos == size) {
    return 1;
  }

  if(udp[pos][lst][curr] != -1) {
    return udp[pos][lst][curr];
  }

  long long answ = 0;
  for(int i = 0; i <= 9; i++) {
    if((!i && !pos) || i == lst || i == curr) continue;
    answ += solveUnLim(size, pos + 1, curr, i);
  }

  return udp[pos][lst][curr] = answ;
}

long long solveLim(int size, int pos, int lst, int curr, bool flag) {
  if(pos == size) {
    return 1;
  }

  if(dp[pos][lst][curr][flag] != -1) {
    return dp[pos][lst][curr][flag];
  }

  int lim = 9;
  if(!flag) {
    lim = s[pos] - '0';
  }

  long long answ = 0;
  for(int i = 0; i <= lim; i++) {
    if((!i && !pos) || i == lst || i == curr) continue;
    bool newFlag = flag;
    if(i != lim) newFlag = true;
    answ += solveLim(size, pos + 1, curr, i, newFlag);
  }

  return dp[pos][lst][curr][flag] = answ;
}

void solve_() {
  cin >> a >> b;

  long long answ1 = 0, answ2 = 0;
  if(a) {
    s = to_string(a - 1);
    for (int i = 1; i < sz(s); i++) {
      memset(udp, -1, sizeof(udp));
      answ1 += solveUnLim(i, 0, 10, 10);
    }
    memset(dp, -1, sizeof(dp));
    answ1 += solveLim(sz(s), 0, 10, 10, 0);
  }

  s = to_string(b);
  for(int i = 1; i < sz(s); i++) {
    memset(udp, -1, sizeof(udp));
    answ2 += solveUnLim(i, 0, 10, 10);
  }
  memset(dp, -1, sizeof(dp));
  answ2 += solveLim(sz(s), 0, 10, 10, 0);

  if(!a) answ2++;
  printf("%lld\n", answ2 - answ1);
}

int main() {
  setIO("");


  auto solve = [&](int test_case)-> void {
    while(test_case--) {
      solve_();
    }
  };

  int test_cases = 1;
  solve(test_cases);

  return 0;
}

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

numbers.cpp: In function 'void setIO(std::string)':
numbers.cpp:67:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   67 |     freopen((str + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
numbers.cpp:68:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   68 |     freopen((str + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
numbers.cpp:72:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   72 |     freopen("input.txt", "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
numbers.cpp:73:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   73 |     freopen("output.txt", "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

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