結果

問題 No.142 単なる配列の操作に関する実装問題
ユーザー uwiuwi
提出日時 2015-02-01 23:54:35
言語 Java21
(openjdk 21)
結果
AC  
実行時間 2,351 ms / 5,000 ms
コード長 4,097 bytes
コンパイル時間 4,044 ms
コンパイル使用メモリ 77,512 KB
実行使用メモリ 76,176 KB
最終ジャッジ日時 2023-09-05 09:49:21
合計ジャッジ時間 13,545 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 592 ms
74,980 KB
testcase_01 AC 1,907 ms
74,856 KB
testcase_02 AC 2,351 ms
76,176 KB
testcase_03 AC 610 ms
72,868 KB
testcase_04 AC 1,862 ms
73,620 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;

public class Main {
	static InputStream is;
	static PrintWriter out;
	static String INPUT = "";
	
	static void solve()
	{
		int n = ni(), S = ni(), x = ni(), y = ni(), z = ni();
		long[] a = new long[n+1];
		a[1] = S;
		for(int k = 1;k <= n-1;k++){
			a[k+1] = ((long)x*a[k]+y)%z;
		}
		long[] ab = new long[(n+1>>>6)+2];
		for(int i = 0;i < n+1;i++){
			ab[i>>>6] |= (a[i]&1)<<i;
		}
		int Q = ni();
		long[] temp = new long[(100000>>6)+2];
		for(int i = 0;i < Q;i++){
			int s = ni(), t = ni(), u = ni(), v = ni();
			Arrays.fill(temp, 0);
			int p = 0;
			for(int j = s>>>6;j <= t>>>6;j++){
				temp[p] = ab[j]>>>s;
				if((s&63) != 0)temp[p] |= ab[j+1]<<-s;
				p++;
			}
			temp[(t-s+1)>>>6] &= (1L<<(t-s+1))-1;
			temp[((t-s+1)>>>6)+1] = 0;
			
			p = 0;
			for(int j = u>>>6;j <= v>>>6;j++){
				ab[j] ^= temp[p]<<u;
				if((u&63) != 0)ab[j+1] ^= temp[p]>>>-u;
				p++;
			}
		}
		for(int i = 1;i <= n;i++){
			out.print(ab[i>>>6]<<~i<0 ? 'O' : 'E');
		}
		out.println();
	}
	
	public static void main(String[] args) throws Exception
	{
		long S = System.currentTimeMillis();
		is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
		out = new PrintWriter(System.out);
		
		solve();
		out.flush();
		long G = System.currentTimeMillis();
		tr(G-S+"ms");
	}
	
	private static boolean eof()
	{
		if(lenbuf == -1)return true;
		int lptr = ptrbuf;
		while(lptr < lenbuf)if(!isSpaceChar(inbuf[lptr++]))return false;
		
		try {
			is.mark(1000);
			while(true){
				int b = is.read();
				if(b == -1){
					is.reset();
					return true;
				}else if(!isSpaceChar(b)){
					is.reset();
					return false;
				}
			}
		} catch (IOException e) {
			return true;
		}
	}
	
	private static byte[] inbuf = new byte[1024];
	static int lenbuf = 0, ptrbuf = 0;
	
	private static int readByte()
	{
		if(lenbuf == -1)throw new InputMismatchException();
		if(ptrbuf >= lenbuf){
			ptrbuf = 0;
			try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
			if(lenbuf <= 0)return -1;
		}
		return inbuf[ptrbuf++];
	}
	
	private static boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
	private static int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
	
	private static double nd() { return Double.parseDouble(ns()); }
	private static char nc() { return (char)skip(); }
	
	private static String ns()
	{
		int b = skip();
		StringBuilder sb = new StringBuilder();
		while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}
	
	private static char[] ns(int n)
	{
		char[] buf = new char[n];
		int b = skip(), p = 0;
		while(p < n && !(isSpaceChar(b))){
			buf[p++] = (char)b;
			b = readByte();
		}
		return n == p ? buf : Arrays.copyOf(buf, p);
	}
	
	private static char[][] nm(int n, int m)
	{
		char[][] map = new char[n][];
		for(int i = 0;i < n;i++)map[i] = ns(m);
		return map;
	}
	
	private static int[] na(int n)
	{
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}
	
	private static int ni()
	{
		int num = 0, b;
		boolean minus = false;
		while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
		if(b == '-'){
			minus = true;
			b = readByte();
		}
		
		while(true){
			if(b >= '0' && b <= '9'){
				num = num * 10 + (b - '0');
			}else{
				return minus ? -num : num;
			}
			b = readByte();
		}
	}
	
	private static long nl()
	{
		long num = 0;
		int b;
		boolean minus = false;
		while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
		if(b == '-'){
			minus = true;
			b = readByte();
		}
		
		while(true){
			if(b >= '0' && b <= '9'){
				num = num * 10 + (b - '0');
			}else{
				return minus ? -num : num;
			}
			b = readByte();
		}
	}
	
	private static void tr(Object... o) { if(INPUT.length() != 0)System.out.println(Arrays.deepToString(o)); }
}
0