結果

問題 No.715 集合と二人ゲーム
ユーザー 37zigen37zigen
提出日時 2018-07-15 06:30:49
言語 Java19
(openjdk 21)
結果
AC  
実行時間 231 ms / 2,000 ms
コード長 2,938 bytes
コンパイル時間 2,300 ms
コンパイル使用メモリ 75,000 KB
実行使用メモリ 41,580 KB
最終ジャッジ日時 2023-08-03 14:11:09
合計ジャッジ時間 11,085 ms
ジャッジサーバーID
(参考情報)
judge15 / judge14
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 42 ms
33,928 KB
testcase_01 AC 61 ms
35,240 KB
testcase_02 AC 57 ms
35,344 KB
testcase_03 AC 69 ms
35,316 KB
testcase_04 AC 69 ms
35,644 KB
testcase_05 AC 72 ms
35,780 KB
testcase_06 AC 73 ms
35,292 KB
testcase_07 AC 76 ms
35,520 KB
testcase_08 AC 78 ms
35,580 KB
testcase_09 AC 78 ms
35,644 KB
testcase_10 AC 79 ms
35,512 KB
testcase_11 AC 84 ms
35,812 KB
testcase_12 AC 84 ms
36,068 KB
testcase_13 AC 83 ms
35,652 KB
testcase_14 AC 83 ms
35,756 KB
testcase_15 AC 83 ms
35,700 KB
testcase_16 AC 86 ms
35,744 KB
testcase_17 AC 83 ms
36,088 KB
testcase_18 AC 88 ms
36,140 KB
testcase_19 AC 84 ms
35,892 KB
testcase_20 AC 88 ms
36,088 KB
testcase_21 AC 94 ms
36,080 KB
testcase_22 AC 94 ms
36,544 KB
testcase_23 AC 93 ms
36,452 KB
testcase_24 AC 93 ms
36,144 KB
testcase_25 AC 92 ms
36,308 KB
testcase_26 AC 93 ms
36,508 KB
testcase_27 AC 96 ms
36,060 KB
testcase_28 AC 89 ms
35,836 KB
testcase_29 AC 91 ms
36,004 KB
testcase_30 AC 122 ms
36,728 KB
testcase_31 AC 103 ms
37,092 KB
testcase_32 AC 103 ms
36,924 KB
testcase_33 AC 107 ms
36,732 KB
testcase_34 AC 104 ms
36,868 KB
testcase_35 AC 42 ms
34,088 KB
testcase_36 AC 43 ms
33,916 KB
testcase_37 AC 43 ms
34,144 KB
testcase_38 AC 42 ms
33,916 KB
testcase_39 AC 45 ms
33,844 KB
testcase_40 AC 48 ms
34,444 KB
testcase_41 AC 50 ms
34,476 KB
testcase_42 AC 52 ms
34,524 KB
testcase_43 AC 50 ms
34,196 KB
testcase_44 AC 50 ms
34,192 KB
testcase_45 AC 49 ms
34,196 KB
testcase_46 AC 50 ms
34,232 KB
testcase_47 AC 52 ms
34,068 KB
testcase_48 AC 50 ms
34,148 KB
testcase_49 AC 50 ms
34,176 KB
testcase_50 AC 207 ms
41,196 KB
testcase_51 AC 201 ms
40,952 KB
testcase_52 AC 215 ms
41,524 KB
testcase_53 AC 226 ms
40,920 KB
testcase_54 AC 231 ms
39,788 KB
testcase_55 AC 210 ms
41,460 KB
testcase_56 AC 222 ms
40,748 KB
testcase_57 AC 214 ms
41,068 KB
testcase_58 AC 211 ms
41,580 KB
testcase_59 AC 207 ms
41,120 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.HashMap;
import java.util.NoSuchElementException;

public class Main implements Runnable {

	public static void main(String[] args) {
		new Thread(null, new Main(), "", Runtime.getRuntime().maxMemory()).start();
	}

	int[] gr = new int[100];

	int calc(int p) {
		long mask = 0;
		for (int i = 1; i <= p; ++i) {
			int L = Math.max(0, i - 2), R = Math.max(0, p - i - 1);
			mask |= 1L << (gr[L] ^ gr[R]);
		}
		while ((mask & 1L << gr[p]) > 0) {
			++gr[p];
		}
		return gr[p];
	}

	public void run() {
		Scanner sc = new Scanner();
		PrintWriter pw = new PrintWriter(System.out);
		gr[1] = gr[2] = 1;
		for (int i = 3; i < 100; ++i) {
			calc(i);
		}
		int mod = 34;
		int n = sc.nextInt();
		int[] a = new int[n];
		for (int i = 0; i < n; ++i) {
			a[i] = sc.nextInt();
		}
		Arrays.sort(a);
		int g = 0;
		for (int i = 0; i < n; ++i) {
			int j = i;
			while (j + 1 < n && a[j] + 1 == a[j + 1])
				++j;
			int res = a[j] - a[i] + 1;
			while (res >= 100)
				res -= mod;
			g ^= gr[res];
			i = j;
		}
		pw.println(g == 0 ? "Second" : "First");
		pw.close();
	}

	class Scanner {
		private final InputStream in = System.in;
		private final byte[] buffer = new byte[1024];
		private int ptr = 0;
		private int buflen = 0;

		private boolean hasNextByte() {
			if (ptr < buflen) {
				return true;
			} else {
				ptr = 0;
				try {
					buflen = in.read(buffer);
				} catch (IOException e) {
					e.printStackTrace();
				}
				if (buflen <= 0) {
					return false;
				}
			}
			return true;
		}

		private int readByte() {
			if (hasNextByte())
				return buffer[ptr++];
			else
				return -1;
		}

		private boolean isPrintableChar(int c) {
			return 33 <= c && c <= 126;
		}

		private void skipUnprintable() {
			while (hasNextByte() && !isPrintableChar(buffer[ptr]))
				ptr++;
		}

		public boolean hasNext() {
			skipUnprintable();
			return hasNextByte();
		}

		public String next() {
			if (!hasNext())
				throw new NoSuchElementException();
			StringBuilder sb = new StringBuilder();
			int b = readByte();
			while (isPrintableChar(b)) {
				sb.appendCodePoint(b);
				b = readByte();
			}
			return sb.toString();
		}

		public long nextLong() {
			if (!hasNext())
				throw new NoSuchElementException();
			long n = 0;
			boolean minus = false;
			int b = readByte();
			if (b == '-') {
				minus = true;
				b = readByte();
			}
			if (b < '0' || '9' < b) {
				throw new NumberFormatException();
			}
			while (true) {
				if ('0' <= b && b <= '9') {
					n *= 10;
					n += b - '0';
				} else if (b == -1 || !isPrintableChar(b)) {
					return minus ? -n : n;
				} else {
					throw new NumberFormatException();
				}
				b = readByte();
			}
		}

		int nextInt() {
			return (int) nextLong();
		}
	}

	void tr(Object... objects) {
		System.out.println(Arrays.deepToString(objects));
	}
}
0