結果

問題 No.3082 Make Palindromic Multiple(Judge)
コンテスト
ユーザー hos.lyric
提出日時 2025-03-28 22:20:20
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
TLE  
実行時間 -
コード長 4,205 bytes
コンパイル時間 1,344 ms
コンパイル使用メモリ 119,960 KB
実行使用メモリ 7,324 KB
最終ジャッジ日時 2025-03-28 22:20:28
合計ジャッジ時間 7,344 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 5 TLE * 1 -- * 60
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.cpp: In function ‘__int128 unsigned inUInt128()’:
main.cpp:58:8: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   58 |   scanf("%s", buf);
      |   ~~~~~^~~~~~~~~~~
main.cpp: In function ‘__int128 inInt128()’:
main.cpp:63:8: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   63 |   scanf("%s", buf);
      |   ~~~~~^~~~~~~~~~~
main.cpp: In function ‘int main()’:
main.cpp:167:12: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
  167 |       scanf("%s%lld", buf, &T[k]);
      |       ~~~~~^~~~~~~~~~~~~~~~~~~~~~

ソースコード

diff # 

#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <chrono>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")


#ifndef LIBRA_OTHER_INT128_H_
#define LIBRA_OTHER_INT128_H_

#include <stdio.h>
#include <iostream>

constexpr unsigned __int128 toUInt128(const char *s) {
  unsigned __int128 x = 0;
  for (; *s; ++s) x = x * 10 + (*s - '0');
  return x;
}
constexpr __int128 toInt128(const char *s) {
  if (*s == '-') return -toInt128(s + 1);
  __int128 x = 0;
  for (; *s; ++s) x = x * 10 + (*s - '0');
  return x;
}
unsigned __int128 inUInt128() {
  static char buf[41];
  scanf("%s", buf);
  return toUInt128(buf);
}
__int128 inInt128() {
  static char buf[41];
  scanf("%s", buf);
  return toInt128(buf);
}

void out(unsigned __int128 x) {
  static char buf[41];
  int len = 0;
  do { buf[len++] = '0' + static_cast<int>(x % 10); } while (x /= 10);
  for (int i = len; --i >= 0; ) putchar(buf[i]);
}
void out(__int128 x) {
  if (x < 0) {
    putchar('-');
    out(-static_cast<unsigned __int128>(x));
  } else {
    out(static_cast<unsigned __int128>(x));
  }
}
std::ostream &operator<<(std::ostream &os, unsigned __int128 x) {
  static char buf[41];
  int len = 0;
  do { buf[len++] = '0' + static_cast<int>(x % 10); } while (x /= 10);
  for (int i = len; --i >= 0; ) os << buf[i];
  return os;
}
std::ostream &operator<<(std::ostream &os, __int128 x) {
  if (x < 0) {
    os << '-' << -static_cast<unsigned __int128>(x);
  } else {
    os << static_cast<unsigned __int128>(x);
  }
  return os;
}

#endif  // LIBRA_OTHER_INT128_H_


#include <chrono>
#ifdef LOCAL
mt19937_64 rng(58);
#else
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
#endif


using U = unsigned __int128;
constexpr U M = (((U)1) << 107) - 1;
U add(U a, U b) {
  return ((a += b) >= M) ? (a - M) : a;
}
U mul(U a, U b) {
  U c = 0;
  for (; b; ) {
    (c += a * (b & ((1<<18)-1))) %= M;
    (a <<= 18) %= M;
    b >>= 18;
  }
  return c;
}

using Pair = pair<U, U>;
Pair mul(Pair f, Pair g) {
  return Pair(mul(f.first, g.first), add(f.second, mul(f.first, g.second)));
}
Pair power(Pair f, Int e) {
  Pair g(1, 0);
  for (; ; f = mul(f, f)) {
    if (e & 1) g = mul(g, f);
    if (!(e >>= 1)) return g;
  }
}


char buf[200'010];

int K;
vector<string> S;
vector<Int> T;

U BASE;
Pair solve() {
  Pair ret(1, 0);
  for (int k = 0; k < K; ++k) {
    Pair p(1, 0);
    for (const char s : S[k]) {
      p = mul(p, Pair(BASE, s));
    }
    p = power(p, T[k]);
    ret = mul(ret, p);
  }
//cerr<<S<<" "<<T<<": "<<ret<<endl;
  return ret;
}

int main() {
  BASE |= (U)rng();
  BASE |= (U)rng() << 64;
  BASE %= M;
cerr<<"M = "<<M<<", BASE = "<<BASE<<endl;
  
  for (; ~scanf("%d", &K); ) {
    S.resize(K);
    T.resize(K);
    for (int k = 0; k < K; ++k) {
      scanf("%s%lld", buf, &T[k]);
      S[k] = buf;
    }
    
    const Pair res0 = solve();
    for (int k = 0; k < K; ++k) reverse(S[k].begin(), S[k].end());
    reverse(S.begin(), S.end());
    reverse(T.begin(), T.end());
    const Pair res1 = solve();
    puts((res0 == res1) ? "Yes" : "No");
  }
  return 0;
}
0