結果

問題 No.142 単なる配列の操作に関する実装問題
ユーザー fumiphysfumiphys
提出日時 2019-09-15 20:40:51
言語 C++14
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 2,820 ms / 5,000 ms
コード長 5,419 bytes
コンパイル時間 2,016 ms
コンパイル使用メモリ 170,700 KB
実行使用メモリ 24,136 KB
最終ジャッジ日時 2023-09-21 04:14:07
合計ジャッジ時間 11,528 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge14
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 474 ms
24,136 KB
testcase_01 AC 2,208 ms
23,352 KB
testcase_02 AC 2,820 ms
23,072 KB
testcase_03 AC 461 ms
22,956 KB
testcase_04 AC 2,185 ms
23,620 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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

// macros
#define pb emplace_back
#define mk make_pair
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define irep(itr, st) for(auto itr = (st).begin(); itr != (st).end(); ++itr)
#define irrep(itr, st) for(auto itr = (st).rbegin(); itr != (st).rend(); ++itr)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define bit(n) (1LL<<(n))
// functions
template <class T>bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;}
template <class T>bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;}
template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}
template <typename T> ostream &operator<<(ostream &os, const vector<T>& vec){for(int i = 0; i < vec.size(); i++){ os << vec[i]; if(i + 1 != vec.size())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
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> ostream &operator<<(ostream &os, const map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
//  types
using ll = long long int;
using P = pair<int, int>;
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1000000007;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};
// io
struct fast_io{
  fast_io(){ios_base::sync_with_stdio(false); cin.tie(0); cout << fixed << setprecision(20);}
} fast_io_;

const int b = 60;
ll val[100010];
vector<ll> V;
int U;

void add(int s, int t, int u, int v){
  if(v - u + 1 <= 2 * b){
    for(int i = u; i <= v; i++){
      int j = s + i - u;
      int I = i / b;
      int J = j / b;
      V[I-U/b] ^= (bit(b - 1 - i % b) * ((val[J] >> (b - 1 - j % b)) & 1));
    }
    return;
  }
  V.clear();
  U = u;
  for(int i = u / b; i <= v / b; i++){
    V.pb(val[i]);
  }
  int l = 0, r = 0;
  for(int i = u / b + 1; i < v / b; i++){
    l = i * b, r = l + b - 1;
    int ld = s + l - u, rd = s + r - u;
    ll tmp = 0;
    tmp += (val[ld / b] & (bit(b - ld % b) - 1)) << (ld % b);
    if(ld % b){
      tmp += (val[rd / b] >> (b - 1 - rd % b));
    }
    V[i-u/b] ^= tmp;
  }
  l = u, r = (u / b) * b + b - 1;
  add(s, s + r - l, l, r);
  l = (v / b) * b, r = v;
  add(t - r + l, t, l, r);
  for(int i = u / b; i <= v / b; i++){
    val[i] = V[i-u/b];
  }
}

int main(int argc, char const* argv[])
{
  int n;
  ll S, x, y, z;
  cin >> n >> S >> x >> y >> z;
  vector<ll> a(n);
  a[0] = S;
  FOR(i, 1, n){
    a[i] = (x * a[i-1] + y) % z;
  }
  for(int i = 0; i < n; i += b){
    int I = i / b;
    for(int j = 0; j < b; j++){
      if(i + j >= n)break;
      val[I] += bit(b-1-j) * (a[i+j] & 1);
    }
  }
  rep(i, n)a[i] %= 2;
  int q;
  cin >> q;
  rep(i_, q){
    int s, t, u, v;
    cin >> s >> t >> u >> v, s--, t--, u--, v--;
    /*for(int i = 0; i < n; i+=b){
      int I = i / b;
      for(int j = 0; j < b; j++){
        if(i + j >= n)break;
        cout << ((val[I] & bit(b-1-j)) ? 1: 0);
      }
    }
    cout << endl;
    for(int i = 0; i < n; i++){
      cout << a[i];
    }
    cout << endl;*/
    if(v - u + 1 <= 2 * b){
      V.clear();
      U = u;
      for(int i = u / b; i <= v / b; i++){
        V.pb(val[i]);
      }
    }
    add(s, t, u, v);
    if(v - u + 1 <= 2 * b){
      for(int i = u / b; i <= v / b; i++){
        val[i] = V[i-u/b];
      }
    }
    /*vector<ll> c = a;
    for(int i = u; i <= v; i++){
      c[i] = (c[i] + a[s+i-u]) % 2;
    }
    swap(c, a);
    for(int i = 0; i < n; i++){
      if(u <= i && i <= v)cout << "-";
      else cout << " ";
    }
    cout << endl;
    for(int i = 0; i < n; i++){
      if(s <= i && i <= t)cout << "-";
      else cout << " ";
    }
    cout << endl;*/
    // cout << s << " " << t << " " << u << " " << v << endl;
  }
  string s = "";
  for(int i = 0; i < n; i+=b){
    int I = i / b;
    for(int j = 0; j < b; j++){
      if(i + j >= n)break;
      s += (val[I] & bit(b-1-j)) ? 'O': 'E';
    }
  }
  cout << s << endl;
  return 0;
}
0