#606683 (Java21) No.1355 AND OR GAME

提出ソース

結果

問題	No.1355 AND OR GAME
ユーザー	uwi
提出日時	2021-01-17 14:53:01
言語	Java21 (openjdk 21)
結果	AC
実行時間	842 ms / 2,000 ms
コード長	11,246 bytes
コンパイル時間	6,440 ms
コンパイル使用メモリ	85,628 KB
実行使用メモリ	73,092 KB
最終ジャッジ日時	2023-08-19 20:53:41
合計ジャッジ時間	23,481 ms
ジャッジサーバーID （参考情報）	judge10 / judge13

このコードへのチャレンジ（β）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	40 ms 51,204 KB
testcase_01	AC	40 ms 51,012 KB
testcase_02	AC	44 ms 52,392 KB
testcase_03	AC	44 ms 52,524 KB
testcase_04	AC	45 ms 52,312 KB
testcase_05	AC	41 ms 51,260 KB
testcase_06	AC	44 ms 52,408 KB
testcase_07	AC	44 ms 52,468 KB
testcase_08	AC	44 ms 52,312 KB
testcase_09	AC	42 ms 51,364 KB
testcase_10	AC	40 ms 51,412 KB
testcase_11	AC	42 ms 51,208 KB
testcase_12	AC	40 ms 51,144 KB
testcase_13	AC	40 ms 51,268 KB
testcase_14	AC	39 ms 51,208 KB
testcase_15	AC	39 ms 51,444 KB
testcase_16	AC	40 ms 51,208 KB
testcase_17	AC	40 ms 51,212 KB
testcase_18	AC	40 ms 51,340 KB
testcase_19	AC	40 ms 51,276 KB
testcase_20	AC	40 ms 51,168 KB
testcase_21	AC	39 ms 51,644 KB
testcase_22	AC	40 ms 51,252 KB
testcase_23	AC	40 ms 51,200 KB
testcase_24	AC	40 ms 51,368 KB
testcase_25	AC	40 ms 51,176 KB
testcase_26	AC	40 ms 51,128 KB
testcase_27	AC	40 ms 51,252 KB
testcase_28	AC	40 ms 51,704 KB
testcase_29	AC	41 ms 51,176 KB
testcase_30	AC	40 ms 51,200 KB
testcase_31	AC	40 ms 51,400 KB
testcase_32	AC	40 ms 51,404 KB
testcase_33	AC	39 ms 51,220 KB
testcase_34	AC	62 ms 52,860 KB
testcase_35	AC	130 ms 57,092 KB
testcase_36	AC	129 ms 56,720 KB
testcase_37	AC	41 ms 51,256 KB
testcase_38	AC	134 ms 57,232 KB
testcase_39	AC	62 ms 53,088 KB
testcase_40	AC	107 ms 53,940 KB
testcase_41	AC	127 ms 56,872 KB
testcase_42	AC	130 ms 56,804 KB
testcase_43	AC	76 ms 53,484 KB
testcase_44	AC	64 ms 53,040 KB
testcase_45	AC	136 ms 57,408 KB
testcase_46	AC	99 ms 54,680 KB
testcase_47	AC	135 ms 57,048 KB
testcase_48	AC	126 ms 57,372 KB
testcase_49	AC	131 ms 57,028 KB
testcase_50	AC	42 ms 51,292 KB
testcase_51	AC	104 ms 54,992 KB
testcase_52	AC	130 ms 56,600 KB
testcase_53	AC	116 ms 54,804 KB
testcase_54	AC	131 ms 56,868 KB
testcase_55	AC	80 ms 55,368 KB
testcase_56	AC	80 ms 55,472 KB
testcase_57	AC	116 ms 56,416 KB
testcase_58	AC	66 ms 53,148 KB
testcase_59	AC	40 ms 51,164 KB
testcase_60	AC	118 ms 54,152 KB
testcase_61	AC	49 ms 51,140 KB
testcase_62	AC	76 ms 52,904 KB
testcase_63	AC	122 ms 57,180 KB
testcase_64	AC	81 ms 55,400 KB
testcase_65	AC	49 ms 52,844 KB
testcase_66	AC	61 ms 52,904 KB
testcase_67	AC	86 ms 54,588 KB
testcase_68	AC	97 ms 54,972 KB
testcase_69	AC	40 ms 51,160 KB
testcase_70	AC	102 ms 54,768 KB
testcase_71	AC	139 ms 59,360 KB
testcase_72	AC	129 ms 56,500 KB
testcase_73	AC	132 ms 56,932 KB
testcase_74	AC	131 ms 56,848 KB
testcase_75	AC	130 ms 56,840 KB
testcase_76	AC	131 ms 56,652 KB
testcase_77	AC	130 ms 56,140 KB
testcase_78	AC	40 ms 51,384 KB
testcase_79	AC	40 ms 48,980 KB
testcase_80	AC	132 ms 57,076 KB
testcase_81	AC	130 ms 56,976 KB
testcase_82	AC	120 ms 56,924 KB
testcase_83	AC	80 ms 55,364 KB
testcase_84	AC	285 ms 59,528 KB
testcase_85	AC	105 ms 70,272 KB
testcase_86	AC	99 ms 61,924 KB
testcase_87	AC	97 ms 61,500 KB
testcase_88	AC	65 ms 53,636 KB
testcase_89	AC	50 ms 53,112 KB
testcase_90	AC	106 ms 72,028 KB
testcase_91	AC	102 ms 57,444 KB
testcase_92	AC	68 ms 53,248 KB
testcase_93	AC	555 ms 70,252 KB
testcase_94	AC	422 ms 61,580 KB
testcase_95	AC	313 ms 59,636 KB
testcase_96	AC	248 ms 57,528 KB
testcase_97	AC	66 ms 53,356 KB
testcase_98	AC	842 ms 73,092 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

package nada2021d2;
import java.io.*;
import java.util.ArrayDeque;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.Queue;

public class F2 {
	InputStream is;
	FastWriter out;

	String INPUT = "";

	boolean dfs(long Y, long ast, int pos, long[] a, int[] route, long X)
	{
		if(pos < 0){
			return (X&~ast) == (Y&~ast);
		}
		long cur = a[pos];
		if((cur&~ast) == (Y&~ast)){
			route[pos] = 3;
			for(int i = 0;i < pos;i++)route[i] = 1;
			return true;
		}
		if((~cur&(Y&~ast)) == 0){
			// and
			route[pos] = 1;
			if(dfs(Y, ast | ~cur&~Y, pos-1, a, route, X))return true;
		}
		if((cur&(~Y&~ast)) == 0){
			// or
			route[pos] = 2;
			if(dfs(Y, ast | cur&Y, pos-1, a, route, X))return true;
		}
		return false;
	}

	public void solve()
	{
		int n = ni();
		long X = nl(), Y = nl();
		long[] a = new long[n];
		for(int i = 0;i < n;i++){
			a[i] = nl();
		}

		int[] route = new int[n];
		if(dfs(Y, 0L, n-1, a, route, X)) {
			out.println(route);
		}else{
			out.println(-1);
		}
	}

	public static void main(String[] args) {
		new F2().run();
	}

	public void run()
	{
		long S = System.currentTimeMillis();
		is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
		out = new FastWriter(System.out);
//
//		solve();
//		out.flush();
//		long G = System.currentTimeMillis();
//		tr(G-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();
		try {
			t.join();
		} catch (InterruptedException e) {
			e.printStackTrace();
		}
	}

	private 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 final 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 boolean isSpaceChar(int c) { return !(c >= 32 && 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))){
			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 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[] 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 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 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();
		}
	}

	public static class FastWriter
	{
		private static final int BUF_SIZE = 1<<13;
		private final byte[] buf = new byte[BUF_SIZE];
		private final OutputStream out;
		private int ptr = 0;

		private FastWriter(){out = null;}

		public FastWriter(OutputStream os)
		{
			this.out = os;
		}

		public FastWriter(String path)
		{
			try {
				this.out = new FileOutputStream(path);
			} catch (FileNotFoundException e) {
				throw new RuntimeException("FastWriter");
			}
		}

		public FastWriter write(byte b)
		{
			buf[ptr++] = b;
			if(ptr == BUF_SIZE)innerflush();
			return this;
		}

		public FastWriter write(char c)
		{
			return write((byte)c);
		}

		public FastWriter write(char[] s)
		{
			for(char c : s){
				buf[ptr++] = (byte)c;
				if(ptr == BUF_SIZE)innerflush();
			}
			return this;
		}

		public FastWriter write(String s)
		{
			s.chars().forEach(c -> {
				buf[ptr++] = (byte)c;
				if(ptr == BUF_SIZE)innerflush();
			});
			return this;
		}

		private static int countDigits(int l) {
			if (l >= 1000000000) return 10;
			if (l >= 100000000) return 9;
			if (l >= 10000000) return 8;
			if (l >= 1000000) return 7;
			if (l >= 100000) return 6;
			if (l >= 10000) return 5;
			if (l >= 1000) return 4;
			if (l >= 100) return 3;
			if (l >= 10) return 2;
			return 1;
		}

		public FastWriter write(int x)
		{
			if(x == Integer.MIN_VALUE){
				return write((long)x);
			}
			if(ptr + 12 >= BUF_SIZE)innerflush();
			if(x < 0){
				write((byte)'-');
				x = -x;
			}
			int d = countDigits(x);
			for(int i = ptr + d - 1;i >= ptr;i--){
				buf[i] = (byte)('0'+x%10);
				x /= 10;
			}
			ptr += d;
			return this;
		}

		private static int countDigits(long l) {
			if (l >= 1000000000000000000L) return 19;
			if (l >= 100000000000000000L) return 18;
			if (l >= 10000000000000000L) return 17;
			if (l >= 1000000000000000L) return 16;
			if (l >= 100000000000000L) return 15;
			if (l >= 10000000000000L) return 14;
			if (l >= 1000000000000L) return 13;
			if (l >= 100000000000L) return 12;
			if (l >= 10000000000L) return 11;
			if (l >= 1000000000L) return 10;
			if (l >= 100000000L) return 9;
			if (l >= 10000000L) return 8;
			if (l >= 1000000L) return 7;
			if (l >= 100000L) return 6;
			if (l >= 10000L) return 5;
			if (l >= 1000L) return 4;
			if (l >= 100L) return 3;
			if (l >= 10L) return 2;
			return 1;
		}

		public FastWriter write(long x)
		{
			if(x == Long.MIN_VALUE){
				return write("" + x);
			}
			if(ptr + 21 >= BUF_SIZE)innerflush();
			if(x < 0){
				write((byte)'-');
				x = -x;
			}
			int d = countDigits(x);
			for(int i = ptr + d - 1;i >= ptr;i--){
				buf[i] = (byte)('0'+x%10);
				x /= 10;
			}
			ptr += d;
			return this;
		}

		public FastWriter write(double x, int precision)
		{
			if(x < 0){
				write('-');
				x = -x;
			}
			x += Math.pow(10, -precision)/2;
			//		if(x < 0){ x = 0; }
			write((long)x).write(".");
			x -= (long)x;
			for(int i = 0;i < precision;i++){
				x *= 10;
				write((char)('0'+(int)x));
				x -= (int)x;
			}
			return this;
		}

		public FastWriter writeln(char c){
			return write(c).writeln();
		}

		public FastWriter writeln(int x){
			return write(x).writeln();
		}

		public FastWriter writeln(long x){
			return write(x).writeln();
		}

		public FastWriter writeln(double x, int precision){
			return write(x, precision).writeln();
		}

		public FastWriter write(int... xs)
		{
			boolean first = true;
			for(int x : xs) {
				if (!first) write(' ');
				first = false;
				write(x);
			}
			return this;
		}

		public FastWriter write(long... xs)
		{
			boolean first = true;
			for(long x : xs) {
				if (!first) write(' ');
				first = false;
				write(x);
			}
			return this;
		}

		public FastWriter writeln()
		{
			return write((byte)'\n');
		}

		public FastWriter writeln(int... xs)
		{
			return write(xs).writeln();
		}

		public FastWriter writeln(long... xs)
		{
			return write(xs).writeln();
		}

		public FastWriter writeln(char[] line)
		{
			return write(line).writeln();
		}

		public FastWriter writeln(char[]... map)
		{
			for(char[] line : map)write(line).writeln();
			return this;
		}

		public FastWriter writeln(String s)
		{
			return write(s).writeln();
		}

		private void innerflush()
		{
			try {
				out.write(buf, 0, ptr);
				ptr = 0;
			} catch (IOException e) {
				throw new RuntimeException("innerflush");
			}
		}

		public void flush()
		{
			innerflush();
			try {
				out.flush();
			} catch (IOException e) {
				throw new RuntimeException("flush");
			}
		}

		public FastWriter print(byte b) { return write(b); }
		public FastWriter print(char c) { return write(c); }
		public FastWriter print(char[] s) { return write(s); }
		public FastWriter print(String s) { return write(s); }
		public FastWriter print(int x) { return write(x); }
		public FastWriter print(long x) { return write(x); }
		public FastWriter print(double x, int precision) { return write(x, precision); }
		public FastWriter println(char c){ return writeln(c); }
		public FastWriter println(int x){ return writeln(x); }
		public FastWriter println(long x){ return writeln(x); }
		public FastWriter println(double x, int precision){ return writeln(x, precision); }
		public FastWriter print(int... xs) { return write(xs); }
		public FastWriter print(long... xs) { return write(xs); }
		public FastWriter println(int... xs) { return writeln(xs); }
		public FastWriter println(long... xs) { return writeln(xs); }
		public FastWriter println(char[] line) { return writeln(line); }
		public FastWriter println(char[]... map) { return writeln(map); }
		public FastWriter println(String s) { return writeln(s); }
		public FastWriter println() { return writeln(); }
	}

	public static void trnz(int... o)
	{
		for(int i = 0;i < o.length;i++)if(o[i] != 0)System.out.print(i+":"+o[i]+" ");
		System.out.println();
	}

	// print ids which are 1
	public static void trt(long... o)
	{
		Queue<Integer> stands = new ArrayDeque<>();
		for(int i = 0;i < o.length;i++){
			for(long x = o[i];x != 0;x &= x-1)stands.add(i<<6|Long.numberOfTrailingZeros(x));
		}
		System.out.println(stands);
	}

	public static void tf(boolean... r)
	{
		for(boolean x : r)System.out.print(x?'#':'.');
		System.out.println();
	}

	public static void tf(boolean[]... b)
	{
		for(boolean[] r : b) {
			for(boolean x : r)System.out.print(x?'#':'.');
			System.out.println();
		}
		System.out.println();
	}

	public void tf(long[]... b)
	{
		if(INPUT.length() != 0) {
			for (long[] r : b) {
				for (long x : r) {
					for (int i = 0; i < 64; i++) {
						System.out.print(x << ~i < 0 ? '#' : '.');
					}
				}
				System.out.println();
			}
			System.out.println();
		}
	}

	public void tf(long... b)
	{
		if(INPUT.length() != 0) {
			for (long x : b) {
				for (int i = 0; i < 64; i++) {
					System.out.print(x << ~i < 0 ? '#' : '.');
				}
			}
			System.out.println();
		}
	}

	private void tr(Object... o) { if(INPUT.length() != 0)System.out.println(Arrays.deepToString(o)); }
}

yukicoder

結果

テストケース

ソースコード