結果

問題 No.1067 #いろいろな色 / Red and Blue and more various colors (Middle)
ユーザー uwiuwi
提出日時 2020-05-29 21:44:16
言語 Java21
(openjdk 21)
結果
AC  
実行時間 965 ms / 2,000 ms
コード長 4,206 bytes
コンパイル時間 4,241 ms
コンパイル使用メモリ 89,456 KB
実行使用メモリ 372,564 KB
最終ジャッジ日時 2024-11-06 03:21:53
合計ジャッジ時間 14,165 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 55 ms
49,932 KB
testcase_01 AC 56 ms
50,336 KB
testcase_02 AC 56 ms
50,292 KB
testcase_03 AC 56 ms
50,324 KB
testcase_04 AC 56 ms
50,524 KB
testcase_05 AC 58 ms
50,576 KB
testcase_06 AC 57 ms
50,280 KB
testcase_07 AC 56 ms
50,448 KB
testcase_08 AC 56 ms
50,384 KB
testcase_09 AC 56 ms
50,580 KB
testcase_10 AC 57 ms
50,272 KB
testcase_11 AC 672 ms
240,080 KB
testcase_12 AC 514 ms
200,460 KB
testcase_13 AC 787 ms
369,360 KB
testcase_14 AC 475 ms
200,088 KB
testcase_15 AC 318 ms
116,172 KB
testcase_16 AC 315 ms
95,452 KB
testcase_17 AC 149 ms
61,768 KB
testcase_18 AC 507 ms
200,168 KB
testcase_19 AC 559 ms
243,252 KB
testcase_20 AC 381 ms
116,180 KB
testcase_21 AC 965 ms
372,552 KB
testcase_22 AC 962 ms
372,564 KB
testcase_23 AC 959 ms
372,416 KB
testcase_24 AC 57 ms
50,424 KB
testcase_25 AC 59 ms
50,132 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest200529;
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 E {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		// x+(a[i]-1)
		int n = ni(), Q = ni();
		int[] a = na(n);
		Arrays.sort(a);
		a = rev(a);
		int mod = 998244353;
		long[][] dp = new long[n+1][n+1];
		dp[0][0] = 1;
		for(int i = 0;i < n;i++){
			for(int j = 0;j <= i;j++){
				if(j+1 <= n)dp[i+1][j+1] += dp[i][j];
				dp[i+1][j] += dp[i][j] * (a[i] - 1);
			}
			for(int j = 0;j <= n;j++){
				dp[i+1][j] %= mod;
			}
		}
		
		long[] cum = new long[n+1];
		cum[0] = 1;
		for(int i = 0;i < n;i++){
			cum[i+1] = cum[i] * a[n-1-i] % mod;
		}
		
		for(int i = 0;i < Q;i++){
			int l = ni(), r = ni();
			int P = ni();
			long X = 0;
			for(int j = 0;j < n;j++){
				int inf = j == n-1 ? l : Math.max(l, a[j+1] + 1);
				int sup = Math.min(r, a[j]);
				if(inf <= sup && (sup-inf+1) % 2 == 1){
					X ^= dp[j+1][P] * cum[n-j-1] % mod;
				}
			}
			out.println(X);
		}
	}
	
	public static long invl(long a, long mod) {
		long b = mod;
		long p = 1, q = 0;
		while (b > 0) {
			long c = a / b;
			long d;
			d = a;
			a = b;
			b = d % b;
			d = p;
			p = q;
			q = d - c * q;
		}
		return p < 0 ? p + mod : p;
	}

	
	public static int[] rev(int[] a){int[] b = new int[a.length];for(int i = 0;i < a.length;i++)b[a.length-1-i] = a[i];return b;}

	
	void run() throws Exception
	{
		is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
		out = new PrintWriter(System.out);
		
		long s = System.currentTimeMillis();
		solve();
		out.flush();
		if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
//		Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){
//			@Override
//			public void run() {
//				long s = System.currentTimeMillis();
//				solve();
//				out.flush();
//				if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
//			}
//		};
//		t.start();
//		t.join();
	}
	
	public static void main(String[] args) throws Exception { new E().run(); }
	
	private byte[] inbuf = new byte[1024];
	public int lenbuf = 0, ptrbuf = 0;
	
	private 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 boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
	private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
	
	private double nd() { return Double.parseDouble(ns()); }
	private char nc() { return (char)skip(); }
	
	private 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 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 int[] na(int n)
	{
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}
	
	private long[] nal(int n)
	{
		long[] a = new long[n];
		for(int i = 0;i < n;i++)a[i] = nl();
		return a;
	}
	
	private 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 int[][] nmi(int n, int m) {
		int[][] map = new int[n][];
		for(int i = 0;i < n;i++)map[i] = na(m);
		return map;
	}
	
	private int ni() { return (int)nl(); }
	
	private 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) { System.out.println(Arrays.deepToString(o)); }
}
0