#181921 (C++14) No.528 10^9と10^9+7と回文

提出ソース

結果

問題	No.528 10^9と10^9+7と回文
ユーザー	しらっ亭
提出日時	2017-06-21 00:34:13
言語	C++14 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	12 ms / 1,000 ms
コード長	5,660 bytes
コンパイル時間	1,795 ms
コンパイル使用メモリ	174,300 KB
実行使用メモリ	6,944 KB
最終ジャッジ日時	2024-07-23 18:34:33
合計ジャッジ時間	2,777 ms
ジャッジサーバーID （参考情報）	judge3 / judge1

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,812 KB
testcase_01	AC	2 ms 6,940 KB
testcase_02	AC	2 ms 6,940 KB
testcase_03	AC	2 ms 6,940 KB
testcase_04	AC	2 ms 6,940 KB
testcase_05	AC	2 ms 6,940 KB
testcase_06	AC	2 ms 6,940 KB
testcase_07	AC	2 ms 6,940 KB
testcase_08	AC	2 ms 6,944 KB
testcase_09	AC	2 ms 6,940 KB
testcase_10	AC	12 ms 6,944 KB
testcase_11	AC	12 ms 6,940 KB
testcase_12	AC	12 ms 6,940 KB
testcase_13	AC	12 ms 6,940 KB
testcase_14	AC	8 ms 6,940 KB
testcase_15	AC	7 ms 6,940 KB
testcase_16	AC	7 ms 6,940 KB
testcase_17	AC	6 ms 6,944 KB
testcase_18	AC	12 ms 6,944 KB
testcase_19	AC	4 ms 6,940 KB
testcase_20	AC	10 ms 6,944 KB
testcase_21	AC	6 ms 6,940 KB
testcase_22	AC	2 ms 6,940 KB
testcase_23	AC	2 ms 6,940 KB
testcase_24	AC	2 ms 6,940 KB
testcase_25	AC	3 ms 6,940 KB
testcase_26	AC	12 ms 6,940 KB
testcase_27	AC	10 ms 6,940 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

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

#define _p(...) (void)printf(__VA_ARGS__)
#define forr(x,arr) for(auto&& x:arr)
#define _overload3(_1,_2,_3,name,...) name
#define _rep2(i,n) _rep3(i,0,n)
#define _rep3(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload3(__VA_ARGS__,_rep3,_rep2,)(__VA_ARGS__)
#define _rrep2(i,n) _rrep3(i,0,n)
#define _rrep3(i,a,b) for(int i=int(b)-1;i>=int(a);i--)
#define rrep(...) _overload3(__VA_ARGS__,_rrep3,_rrep2,)(__VA_ARGS__)
#define all(x) (x).begin(),(x).end()
#define bit(n) (1LL<<(n))
#define sz(x) ((int)(x).size())
#define fst first
#define snd second

string DBG_DLM(int &i){return(i++==0?"":", ");}
#define DBG_B(exp){int i=0;os<<"{";{exp;}os<<"}";return os;}
template<class T>ostream&operator<<(ostream&os,vector<T>v);
template<class T>ostream&operator<<(ostream&os,set<T>v);
template<class T>ostream&operator<<(ostream&os,queue<T>q);
template<class T>ostream&operator<<(ostream&os,priority_queue<T>q);
template<class T,class K>ostream&operator<<(ostream&os,pair<T,K>p);
template<class T,class K>ostream&operator<<(ostream&os,map<T,K>mp);
template<class T,class K>ostream&operator<<(ostream&os,unordered_map<T,K>mp);
template<int I,class TPL>void DBG(ostream&os,TPL t){}
template<int I,class TPL,class H,class...Ts>void DBG(ostream&os,TPL t){os<<(I==0?"":", ")<<get<I>(t);DBG<I+1,TPL,Ts...>(os,t);}
template<class T,class K>void DBG(ostream&os,pair<T,K>p,string delim){os<<"("<<p.first<<delim<<p.second<<")";}
template<class...Ts>ostream&operator<<(ostream&os,tuple<Ts...>t){os<<"(";DBG<0,tuple<Ts...>,Ts...>(os,t);os<<")";return os;}
template<class T,class K>ostream&operator<<(ostream&os,pair<T,K>p){DBG(os,p,", ");return os;}
template<class T>ostream&operator<<(ostream&os,vector<T>v){DBG_B(forr(t,v){os<<DBG_DLM(i)<<t;});}
template<class T>ostream&operator<<(ostream&os,set<T>s){DBG_B(forr(t,s){os<<DBG_DLM(i)<<t;});}
template<class T>ostream&operator<<(ostream&os,queue<T>q){DBG_B(for(;q.size();q.pop()){os<<DBG_DLM(i)<<q.front();});}
template<class T>ostream&operator<<(ostream&os,priority_queue<T>q){DBG_B(for(;q.size();q.pop()){os<<DBG_DLM(i)<<q.top();});}
template<class T,class K>ostream&operator<<(ostream&os,map<T,K>m){DBG_B(forr(p,m){os<<DBG_DLM(i);DBG(os,p,"->");});}
template<class T,class K>ostream&operator<<(ostream&os,unordered_map<T,K>m){DBG_B(forr(p,m){os<<DBG_DLM(i);DBG(os,p,"->");});}
#define DBG_OVERLOAD(_1,_2,_3,_4,_5,_6,macro_name,...)macro_name
#define DBG_LINE(){char s[99];sprintf(s,"line:%3d | ",__LINE__);cerr<<s;}
#define DBG_OUTPUT(v){cerr<<(#v)<<"="<<(v);}
#define DBG1(v,...){DBG_OUTPUT(v);}
#define DBG2(v,...){DBG_OUTPUT(v);cerr<<", ";DBG1(__VA_ARGS__);}
#define DBG3(v,...){DBG_OUTPUT(v);cerr<<", ";DBG2(__VA_ARGS__);}
#define DBG4(v,...){DBG_OUTPUT(v);cerr<<", ";DBG3(__VA_ARGS__);}
#define DBG5(v,...){DBG_OUTPUT(v);cerr<<", ";DBG4(__VA_ARGS__);}
#define DBG6(v,...){DBG_OUTPUT(v);cerr<<", ";DBG5(__VA_ARGS__);}
#define DEBUG0(){DBG_LINE();cerr<<endl;}
#ifdef LOCAL
#define out(...){DBG_LINE();DBG_OVERLOAD(__VA_ARGS__,DBG6,DBG5,DBG4,DBG3,DBG2,DBG1)(__VA_ARGS__);cerr<<endl;}
#else
#define out(...)
#endif

using ll=long long;
using pii=pair<int,int>;using pll=pair<ll,ll>;using pil=pair<int,ll>;using pli=pair<ll,int>;
using vs=vector<string>;using vvs=vector<vs>;using vvvs=vector<vvs>;
using vb=vector<bool>;using vvb=vector<vb>;using vvvb=vector<vvb>;
using vi=vector<int>;using vvi=vector<vi>;using vvvi=vector<vvi>;
using vl=vector<ll>;using vvl=vector<vl>;using vvvl=vector<vvl>;
using vd=vector<double>;using vvd=vector<vd>;using vvvd=vector<vvd>;
using vpii=vector<pii>;using vvpii=vector<vpii>;using vvvpii=vector<vvpii>;
template<class T>bool amax(T&a,const T&b){return a<b?a=b,1:0;}
template<class T>bool amin(T&a,const T&b){return a>b?a=b,1:0;}
ll ri(){ll l;cin>>l;return l;} string rs(){string s;cin>>s;return s;}

ll mod1 = 1e9;
ll mod2 = 1e9+7;

vl p10;

long long toModInt(const string &s, const long long mod) {
  long long ret = 0;
  long long pw = 1;
  int n = (int) s.size();
  for (int i = n - 1; i >= 0; i--) {
    int c = s[i] - '0';
    (ret += pw * c) %= mod;
    (pw *= 10) %= mod;
  }
  return ret;
}

ll keta(int n, const ll mod) {
  ll ans = 0;
  rep(i, 1, n+1) {
    (ans += 9 * p10[(i+1)/2-1]) %= mod;

  }
  return ans;
}

string dec(string S) {
  int bollow = 1;
  for (int i = S.length() - 1; i >= 0; i--) {
    int p = S[i] - '0';
    if (p - bollow < 0) {
      S[i] = '9';
      bollow = 1;
    }
    else {
      S[i] = (p - bollow) + '0';
      break;
    }
  }
  return S;
}

ll solve(const string s, const ll mod) {
  int n = sz(s);

  if (n == 1) {
    return s[0] - '0';
  }

  p10.clear();
  {
    ll p = 1;
    rep(i, n+1) {
      p10.emplace_back(p);
      (p*=10) %= mod;
    }
  }
  //out(p10);

  ll ret1 = keta(n-1, mod);
  out(n, ret1);

  int m = (n+1) / 2;

  bool flg = false;  // 左のが大きいので引かなきゃフラグ

  out(n, m);
  rrep(i, m) {
    int j = n - 1 - i;
    out(i, j, s[i], s[j]);
    if (s[i] < s[j]) {
      flg = false;
      break;
    }
    if (s[i] > s[j]) {
      flg = true;
      break;
    }
  }

  auto t = s.substr(0, m);
  out(flg);

  out(s, t, flg);
  if (m>1) t[0]--;
  out(t);

  ll ans2;
  if (*max_element(all(t)) > '0') {
    // ゼロじゃない
    ans2 = toModInt(t, mod);
    if (flg) ans2--;
    if (m>1) ans2++;
  }
  else {
    // 全部ゼロ
    ans2 = 0;
    if (!flg) ans2++;
  }
  //out(s, n, t, m);
  out(ans2);
  return (ret1 + ans2 + mod) % mod;
}

void Main() {
  auto s = rs();

  cout << solve(s, mod1) << endl;
  cout << solve(s, mod2) << endl;
}

signed main() { cin.tie(nullptr); ios::sync_with_stdio(false); Main(); return 0; }

yukicoder

結果

テストケース

ソースコード