結果

問題 No.142 単なる配列の操作に関する実装問題
ユーザー shimomireshimomire
提出日時 2015-02-05 02:16:01
言語 C++11
(gcc 11.4.0)
結果
WA  
実行時間 -
コード長 7,709 bytes
コンパイル時間 1,041 ms
コンパイル使用メモリ 116,024 KB
実行使用メモリ 24,668 KB
最終ジャッジ日時 2023-09-05 12:08:56
合計ジャッジ時間 14,703 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 WA -
testcase_01 TLE -
testcase_02 TLE -
testcase_03 -- -
testcase_04 -- -
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <cassert>// c
#include <iostream>// io
#include <iomanip>
#include <fstream>
#include <sstream>
#include <vector>// container
#include <map>
#include <set>
#include <queue>
#include <bitset>
#include <stack>
#include <algorithm>// other
#include <complex>
#include <numeric>
#include <functional>
#include <random>
#include <regex>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;

#define ALL(c) (begin(c)),(end(c))
#define REP(i,n) FOR(i,0,n)
#define REPr(i,n) FORr(i,0,n)
#define FOR(i,l,r) for(int i=(int)(l);i<(int)(r);++i)
#define FORr(i,l,r) for(int i=(int)(r)-1;i>=(int)(l);--i)
#define EACH(it,o) for(auto it = (o).begin(); it != (o).end(); ++it)
#define IN(l,v,r) ((l)<=(v) && (v)<(r))
#define UNIQUE(v) v.erase(unique(ALL(v)),v.end())
//debug
#define DUMP(x)  cerr << #x << " = " << (x)
#define LINE()    cerr<< " (L" << __LINE__ << ")"

class range {
private:
	struct Iter{
		int v;
		int operator*(){return v;}
		bool operator!=(Iter& itr) {return v < itr.v;}
		void operator++() {++v;}
	};
	Iter i, n;
public:
	range(int n) : i({0}), n({n}) {}
	range(int i, int n) : i({i}), n({n}) {}
	Iter& begin() {return i;}
	Iter& end() {return n;}
};

//input
template<typename T1,typename T2> istream& operator >> (istream& is,pair<T1,T2>& p){return is>>p.first>>p.second;}
template<typename T1> istream& operator >> (istream& is,tuple<T1>& t){return is >> get<0>(t);}
template<typename T1,typename T2> istream& operator >> (istream& is,tuple<T1,T2>& t){return is >> get<0>(t) >> get<1>(t);}
template<typename T1,typename T2,typename T3> istream& operator >> (istream& is,tuple<T1,T2,T3>& t){return is >>get<0>(t)>>get<1>(t)>>get<2>(t);}
template<typename T1,typename T2,typename T3,typename T4> istream& operator >> (istream& is,tuple<T1,T2,T3,T4>& t){return is >> get<0>(t)>>get<1>(t)>>get<2>(t)>>get<3>(t);}
template<typename T1,typename T2,typename T3,typename T4,typename T5> istream& operator >> (istream& is, const tuple<T1,T2,T3,T4,T5>& t){return is >> get<0>(t) >> get<1>(t) >> get<2>(t) >> get<3>(t) >> get<4>(t);}
template<typename T1,typename T2,typename T3,typename T4,typename T5,typename T6> istream& operator >> (istream& is, const tuple<T1,T2,T3,T4,T5,T6>& t){return is >> get<0>(t) >> get<1>(t) >> get<2>(t) >> get<3>(t) >> get<4>(t) >> get<5>(t);}
template<typename T1,typename T2,typename T3,typename T4,typename T5,typename T6,typename T7> istream& operator >> (istream& is, const tuple<T1,T2,T3,T4,T5,T6,T7>& t){return is >> get<0>(t) >> get<1>(t) >> get<2>(t) >> get<3>(t) >> get<4>(t) >> get<5>(t) >> get<6>(t);}
template<typename T> istream& operator >> (istream& is,vector<T>& as){for(int i:range(as.size()))is >>as[i];return is;}

//output
template<typename T> ostream& operator << (ostream& os, const set<T>& ss){for(auto a:ss){if(a!=ss.begin())os<<" "; os<<a;}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 K,typename V> ostream& operator << (ostream& os, const map<K,V>& m){bool isF=true;for(auto& p:m){if(!isF)os<<endl;os<<p;isF=false;}return os;}
template<typename T1> ostream& operator << (ostream& os, const tuple<T1>& t){return os << get<0>(t);}
template<typename T1,typename T2> ostream& operator << (ostream& os, const tuple<T1,T2>& t){return os << get<0>(t)<<" "<<get<1>(t);}
template<typename T1,typename T2,typename T3> ostream& operator << (ostream& os, const tuple<T1,T2,T3>& t){return os << get<0>(t)<<" "<<get<1>(t)<<" "<<get<2>(t);}
template<typename T1,typename T2,typename T3,typename T4> ostream& operator << (ostream& os, const tuple<T1,T2,T3,T4>& t){return os << get<0>(t)<<" "<<get<1>(t)<<" "<<get<2>(t)<<" "<<get<3>(t);}
template<typename T1,typename T2,typename T3,typename T4,typename T5> ostream& operator << (ostream& os, const tuple<T1,T2,T3,T4,T5>& t){return os << get<0>(t)<<" "<<get<1>(t)<<" "<<get<2>(t)<<" "<<get<3>(t)<<" "<<get<4>(t);}
template<typename T1,typename T2,typename T3,typename T4,typename T5,typename T6> ostream& operator << (ostream& os, const tuple<T1,T2,T3,T4,T5,T6>& t){return os << get<0>(t)<<" "<<get<1>(t)<<" "<<get<2>(t)<<" "<<get<3>(t)<<" "<<get<4>(t)<<" "<<get<5>(t);}
template<typename T1,typename T2,typename T3,typename T4,typename T5,typename T6,typename T7> ostream& operator << (ostream& os, const tuple<T1,T2,T3,T4,T5,T6,T7>& t){return os << get<0>(t)<<" "<<get<1>(t)<<" "<<get<2>(t)<<" "<<get<3>(t)<<" "<<get<4>(t)<<" "<<get<5>(t)<<" "<<get<6>(t);}
template<typename T> ostream& operator << (ostream& os, const vector<T>& as){for(int i:range(as.size())){if(i!=0)os<<" "; os<<as[i];}return os;}
template<typename T> ostream& operator << (ostream& os, const vector<vector<T>>& as){for(int i:range(as.size())){if(i!=0)os<<endl; os<<as[i];}return os;}

// values
template<typename T> T INF(){assert(false);};
template<> int INF<int>(){return 1<<28;};
template<> ll INF<ll>(){return 1LL<<58;};
template<> double INF<double>(){return 1e16;};
template<> long double INF<long double>(){return 1e16;};

template<class T> T EPS(){assert(false);};
template<> int EPS<int>(){return 1;};
template<> ll EPS<ll>(){return 1LL;};
template<> double EPS<double>(){return 1e-8;};
template<> long double EPS<long double>(){return 1e-8;};

template<typename T,typename U> T pmod(T v,U M){return (v%M+M)%M;}

ll gcd_positive(ll a,ll b) { return b == 0 ? a : gcd_positive(b,a%b); }
ll gcd(ll a,ll b) { return gcd_positive(abs(a), abs(b)); }
ll lcm(ll a,ll b){return a/gcd(a,b)*b;}

// struct BitSet{
// 	const static int B=64;
// 	vector<ll> bit;

// 	BitSet(int N){
// 		bit=vector<ll>(N/B);
// 	}
// 	bool operator[](int i)const{
// 		return bit[i/B]&(1<<(i%B));
// 	}

// 	inline BitSet bitXOR(BitSet& b,int sa,int sb,int len) const{// [l,r)
// 		{
// 			int pa=sa/B;
// 			for(int pb:range(0,len/B + 1)){
// 				b.bit[pb]=(this->bit[pa++])>>(sa%B);
// 				if(sa%B) b.bit[pb] |= this->bit[pa]<<(B-sa%B);
// 			}
// 			b.bit[len/B] &= (len%B);			
// 		}
// 		{
// 			int pa=sb/B;
// 			for(int pa:range(0,len/B + 1)){
// 				this->bit[pa++] ^= b.bit[pa]>>(sa%B);
// 				if(sa%B) b.bit[pb] |= this->bit[pa]<<(B-sa%B);
// 			}
// 			b.bit[len/B] &= (len%B);			
// 		}
// 		return a;
// 	}

// 	BitSet operator |= (const BitSet& r) const{

// 	}

// };


class Main{
	public:
	void run(){
		int N;ll S,X,Y,Z;cin >> N >> S >> X >> Y >> Z;
		vector<ull> as(N);as[0]=S;
		for(int i:range(1,N)){
			as[i]=(X*as[i-1]+Y)%Z;
		}
		REP(i,N)as[i]%=2;

		vector<ull> mask(65);
		for(int i:range(0,64))mask[i+1]=mask[i]|(1<<i);
		vector<ull> maskr(65);
		for(int i:range(65))maskr[i]=mask[64]^mask[i];

		int B=60;
		vector<ull> bs(N/B+3);
		REP(i,N) bs[i/B]|=as[i]<<(i%B);

		int Q;cin >> Q;
		REP(q,Q){
			int s,t,u,v;cin >> s >> t >> u >> v;s--;u--;
			if(s>u){
				while(s<t){
					int sb=s%B,ub=u%B;
					int naB=min(t,s+B-sb),nbB=min(v,u+B-ub);
					int len=min(naB-s,nbB-u);
					// cerr <<make_tuple(naB,nbB,len)<<endl;
					// cerr <<((bs[s/B]&mask[s%B+len]&(maskr[s%B]))) <<endl;
					bs[u/B] ^= ((bs[s/B]&mask[sb+len]&(maskr[sb]))>>(sb)) <<(ub);
					s+=len;u+=len;
				}
			}else{
				while(s<t){
					int tb=t%B==0?B:t%B,vb=v%B==0?B:v%B;
					int naB=max(s,t-tb),nbB=max(u,v-vb);
					int len=min(t-naB,v-nbB);
					bs[(v-len)/B]^=((bs[(t-len)/B]&mask[tb]&(maskr[tb-len]))>>(tb-len))<<((v-len)%B);
					t-=len;v-=len;
				}
			}

			// REP(i,N)as[i]=(bs[i/B]>>(i%B))&1;
			// string res="";
			// REP(i,N)res+=as[i]?'O':'E';
			// cout << res <<endl;
		}

		REP(i,N)as[i]=(bs[i/B]>>(i%B))&1;
		string res="";
		REP(i,N)res+=as[i]?'O':'E';
		cout << res <<endl;
	}
};

int main(){
	cout <<fixed<<setprecision(20);
	cin.tie(0);
	ios::sync_with_stdio(false);
	Main().run();
	return 0;
}
0