結果

問題 No.896 友達以上恋人未満
ユーザー lumc_lumc_
提出日時 2019-09-27 23:48:59
言語 C++14
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 1,467 ms / 3,500 ms
コード長 5,537 bytes
コンパイル時間 1,060 ms
コンパイル使用メモリ 113,408 KB
実行使用メモリ 82,092 KB
最終ジャッジ日時 2023-10-25 07:30:05
合計ジャッジ時間 7,609 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,348 KB
testcase_01 AC 2 ms
4,348 KB
testcase_02 AC 2 ms
4,348 KB
testcase_03 AC 2 ms
4,348 KB
testcase_04 AC 2 ms
4,348 KB
testcase_05 AC 708 ms
37,036 KB
testcase_06 AC 1,121 ms
37,016 KB
testcase_07 AC 678 ms
37,036 KB
testcase_08 AC 633 ms
37,036 KB
testcase_09 AC 1,387 ms
69,804 KB
testcase_10 AC 1,467 ms
82,092 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.cpp: In function 'int main()':
main.cpp:206:9: warning: 'last' may be used uninitialized [-Wmaybe-uninitialized]
  206 |     sum ^= ans;
      |     ~~~~^~~~~~
main.cpp:195:20: note: 'last' was declared here
  195 |   ll la=-1, lb=-1, last;
      |                    ^~~~

ソースコード

diff # 

// includes {{{
#include<iostream>
#include<iomanip>
#include<algorithm>
#include<vector>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<tuple>
#include<cmath>
#include<random>
#include<cassert>
#include<bitset>
#include<cstdlib>
// #include<deque>
// #include<multiset>
// #include<cstring>
// #include<bits/stdc++.h>
// }}}
using namespace std;
using ll = long long;

// #undef DEBUG
// #define DEBUG
// DEBUG {{{
#include <array>
#include <deque>
#include <iostream>
#include <list>
#include <queue>
#include <stack>
#include <tuple>
#include <valarray>
#include <vector>
template < int n, class... T >
typename std::enable_if< (n >= sizeof...(T)) >::type __output_tuple(
    std::ostream &, std::tuple< T... > const &) {}
template < int n, class... T >
typename std::enable_if< (n < sizeof...(T)) >::type __output_tuple(
    std::ostream &os, std::tuple< T... > const &t) {
  os << (n == 0 ? "" : ", ") << std::get< n >(t);
  __output_tuple< n + 1 >(os, t);
}
template < class... T >
std::ostream &operator<<(std::ostream &os, std::tuple< T... > const &t) {
  os << "(";
  __output_tuple< 0 >(os, t);
  os << ")";
  return os;
}
template < class T, class U >
std::ostream &operator<<(std::ostream &os, std::pair< T, U > const &p) {
  os << "(" << p.first << ", " << p.second << ")";
  return os;
}
template < class T >
std::ostream &operator<<(std::ostream &os, const std::stack< T > &a) {
  os << "{";
  for(auto tmp = a; tmp.size(); tmp.pop())
    os << (a.size() == tmp.size() ? "" : ", ") << tmp.top();
  os << "}";
  return os;
}
template < class T, class Container, class Compare >
std::ostream &operator<<(std::ostream &os,
    std::priority_queue< T, Container, Compare > a) {
  os << "{ (top) ";
  while(a.size()) os << a.top() << (a.size() == 1 ? "" : ", "), a.pop();
  os << " }";
  return os;
}
template < class T, class Container >
std::ostream &operator<<(std::ostream &os, std::queue< T, Container > a) {
  os << "{ ";
  while(a.size()) os << a.front() << (a.size() == 1 ? "" : ", "), a.pop();
  os << " }";
  return os;
}
#ifdef DEBUG
#if !defined(DEBUG_OUT)
#define DEBUG_OUT std::cerr
#endif
#define dump(...)                                                                \
  [&]() {                                                                        \
    auto __debug_tap = std::make_tuple(__VA_ARGS__);                             \
    DEBUG_OUT << "[" << __LINE__ << "] " << #__VA_ARGS__ << " = " << __debug_tap \
    << std::endl;                                                      \
  }()
template < class T >
inline void dump2D(T &d, size_t sizey, size_t sizex) {
  for(size_t i = 0; i < sizey; i++) {
    DEBUG_OUT << "\t";
    for(size_t j = 0; j < sizex; j++)
      DEBUG_OUT << d[i][j] << (j + 1 == sizex ? "" : "\t");
    DEBUG_OUT << std::endl;
  }
}
template < class T >
inline void dump1D(T &d, size_t sizey) {
  for(size_t i = 0; i < sizey; i++) {
    DEBUG_OUT << d[i] << (i + 1 == sizey ? "" : " ");
  }
  DEBUG_OUT << std::endl;
}
template <
class T, class = typename std::iterator_traits< decltype(begin(T())) >::value_type,
      class = typename std::enable_if< !std::is_same< T, std::string >::value >::type >
      std::ostream &operator<<(std::ostream &os, const T &a) {
        os << "{";
        for(auto ite = begin(a); ite != end(a); ++ite)
          os << (ite == begin(a) ? "" : ", ") << *ite;
        os << "}";
        return os;
      }
#else
#define dump(...) ((void) 42)
#define dump2D(...) ((void) 42)
#define dump1D(...) ((void) 42)
template <
class T, class = typename std::iterator_traits< decltype(begin(T())) >::value_type,
      class = typename std::enable_if< !std::is_same< T, std::string >::value >::type >
      std::ostream &operator<<(std::ostream &os, const T &a) {
        for(auto ite = begin(a); ite != end(a); ++ite)
          os << (ite == begin(a) ? "" : " ") << *ite;
        return os;
      }
#endif
// }}}


ll m, n, mulX, addX, mulY, addY;


ll mod; // <= 2^24

constexpr int M = 1000;
constexpr int N = 1e7;
constexpr int F = 1 << 24;

ll X[M], Y[M], A[M], B[M];
ll z[F];
ll memo[M];

int main() {
  std::ios::sync_with_stdio(false), std::cin.tie(0);
  cin >> m >> n >> mulX >> addX >> mulY >> addY >> mod;
  assert(m <= M);
  ll mask = mod - 1;
  ll sum = 0;
  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];

  for(int i = 0; i < m; i++) {
    z[X[i]] += Y[i];
  }
  for(int i = m; i < n; i++) {
    (X[m-1] *= mulX) += addX;
    X[m-1] &= mask;
    (Y[m-1] *= mulY) += addY;
    Y[m-1] &= mask;

    z[X[m-1]] += Y[m-1];

  }
  for(int i = 0; i < M; i++) memo[i] = -1;


  auto f = [](ll t) {
    ll res = 0;
    if(t < M) {
      if(memo[t] == -1) {
        memo[t] = 0;
        for(int j = 0; j < mod; j += t) {
          memo[t] += z[j];
        }
      }
      res += memo[t];
    } else {
      for(ll j = 0; j < mod; j += t) {
        res += z[j];
      }
    }
    return res;
  };

  for(int i = 0; i < m; i++) {
    ll a = A[i], b = B[i];
    ll ans = f(a) - f(a*b);
    cout << ans << "\n";
    sum ^= ans;
  }
  ll la=-1, lb=-1, last;
  for(int i = m; i < n; i++) {
    A[m-1] = ((A[m-1] * mulX + mod + addX - 1) & mask) + 1;
    B[m-1] = ((B[m-1] * mulY + mod + addY - 1) & mask) + 1;
    ll a = A[m-1], b = B[m-1];
    ll ans;
    if(la==a && lb==b) ans = last;
    else {
      ans = f(a) - f(a*b);
    }
    la=a,lb=b,last=ans;
    sum ^= ans;
  }

  cout << sum << "\n";
  return 0;
}
0