結果

問題 No.896 友達以上恋人未満
ユーザー ei1333333
提出日時 2019-09-27 22:28:39
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 2,901 ms / 3,500 ms
コード長 3,309 bytes
コンパイル時間 1,842 ms
コンパイル使用メモリ 196,332 KB
最終ジャッジ日時 2025-01-07 19:28:25
ジャッジサーバーID
（参考情報） 		judge5 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 7
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include<bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
using int64 = long long;
const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;
struct IoSetup {
  IoSetup() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    cerr << fixed << setprecision(10);
  }
} iosetup;
template< typename T1, typename T2 >
ostream &operator<<(ostream &os, const pair< T1, T2 > &p) {
  os << p.first << " " << p.second;
  return os;
}
template< typename T1, typename T2 >
istream &operator>>(istream &is, pair< T1, T2 > &p) {
  is >> p.first >> p.second;
  return is;
}
template< typename T >
ostream &operator<<(ostream &os, const vector< T > &v) {
  for(int i = 0; i < (int) v.size(); i++) {
    os << v[i] << (i + 1 != v.size() ? " " : "");
  }
  return os;
}
template< typename T >
istream &operator>>(istream &is, vector< T > &v) {
  for(T &in : v) is >> in;
  return is;
}
template< typename T1, typename T2 >
inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }
template< typename T1, typename T2 >
inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }
template< typename T = int64 >
vector< T > make_v(size_t a) {
  return vector< T >(a);
}
template< typename T, typename... Ts >
auto make_v(size_t a, Ts... ts) {
  return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...));
}
template< typename T, typename V >
typename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) {
  t = v;
}
template< typename T, typename V >
typename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) {
  for(auto &e : t) fill_v(e, v);
}
template< typename F >
struct FixPoint : F {
  FixPoint(F &&f) : F(forward< F >(f)) {}
  template< typename... Args >
  decltype(auto) operator()(Args &&... args) const {
    return F::operator()(*this, forward< Args >(args)...);
  }
};
template< typename F >
inline decltype(auto) MFP(F &&f) {
  return FixPoint< F >{forward< F >(f)};
}
using ll = int64;
int main() {
  int64 M, N, mulX, addX, mulY, addY, MOD;
  cin >> M >> N >> mulX >> addX >> mulY >> addY >> MOD;
  vector< int64 > z(MOD);
  vector< int > x(M), y(M), a(M), b(M);
  for(int i = 0; i < M; i++) cin >> x[i];
  for(int i = 0; i < M; i++) cin >> y[i];
  for(int i = 0; i < M; i++) cin >> a[i];
  for(int i = 0; i < M; i++) cin >> b[i];
  int64 pre_x = 0, pre_y = 0;
  for(int i = 0; i < N; i++) {
    int64 cur_x, cur_y;
    if(i < M) {
      cur_x = x[i];
      cur_y = y[i];
    } else {
      cur_x = (pre_x * mulX + addX) % MOD;
      cur_y = (pre_y * mulY + addY) % MOD;
    }
    z[cur_x] += cur_y;
    pre_x = cur_x;
    pre_y = cur_y;
  }
  for(int i = 1; i < MOD; i++) {
    for(int j = i + i; j < MOD; j += i) {
      z[i] += z[j];
    }
  }
  int64 ans = 0;
  int64 pre_a = 0, pre_b = 0;
  for(int i = 0; i < N; i++) {
    int64 cur_a, cur_b;
    if(i < M) {
      cur_a = a[i], cur_b = b[i];
    } else {
      cur_a = (pre_a * mulX + addX + MOD - 1) % MOD + 1;
      cur_b = (pre_b * mulY + addY + MOD - 1) % MOD + 1;
    }
    int64 ret = 0;
    ret += z[cur_a];
    if(1LL * cur_a * cur_b < MOD) ret -= z[cur_a * cur_b];
    if(i < M) cout << ret << "\n";
    ans ^= ret;
    pre_a = cur_a;
    pre_b = cur_b;
  }
  cout << ans << "\n";
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0