#824588 (Java21) No.2160 みたりのDominator

提出ソース

結果

問題	No.2160 みたりのDominator
ユーザー	uwi
提出日時	2022-12-11 00:41:08
言語	Java21 (openjdk 21)
結果	TLE
実行時間	-
コード長	13,549 bytes
コンパイル時間	5,055 ms
コンパイル使用メモリ	93,040 KB
実行使用メモリ	44,436 KB
最終ジャッジ日時	2024-10-15 00:52:41
合計ジャッジ時間	15,211 ms
ジャッジサーバーID （参考情報）	judge2 / judge4

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	64 ms 38,012 KB
testcase_01	AC	62 ms 37,396 KB
testcase_02	AC	61 ms 37,416 KB
testcase_03	AC	196 ms 44,164 KB
testcase_04	AC	134 ms 44,240 KB
testcase_05	AC	150 ms 44,044 KB
testcase_06	AC	152 ms 43,964 KB
testcase_07	AC	135 ms 43,396 KB
testcase_08	AC	132 ms 43,408 KB
testcase_09	AC	128 ms 43,660 KB
testcase_10	AC	114 ms 43,024 KB
testcase_11	AC	159 ms 43,864 KB
testcase_12	AC	147 ms 44,148 KB
testcase_13	AC	188 ms 44,000 KB
testcase_14	AC	156 ms 43,636 KB
testcase_15	AC	163 ms 43,680 KB
testcase_16	AC	157 ms 43,840 KB
testcase_17	AC	138 ms 43,952 KB
testcase_18	AC	158 ms 43,852 KB
testcase_19	AC	177 ms 44,068 KB
testcase_20	AC	207 ms 44,032 KB
testcase_21	AC	155 ms 43,828 KB
testcase_22	AC	136 ms 43,128 KB
testcase_23	AC	161 ms 43,452 KB
testcase_24	AC	139 ms 44,044 KB
testcase_25	AC	99 ms 40,704 KB
testcase_26	AC	136 ms 41,972 KB
testcase_27	AC	176 ms 44,348 KB
testcase_28	AC	218 ms 44,400 KB
testcase_29	AC	206 ms 44,144 KB
testcase_30	AC	131 ms 43,632 KB
testcase_31	AC	110 ms 42,752 KB
testcase_32	AC	175 ms 44,436 KB
testcase_33	AC	67 ms 37,504 KB
testcase_34	AC	90 ms 42,664 KB
testcase_35	AC	60 ms 37,096 KB
testcase_36	AC	67 ms 37,368 KB
testcase_37	AC	61 ms 37,528 KB
testcase_38	AC	64 ms 37,768 KB
testcase_39	AC	64 ms 37,288 KB
testcase_40	TLE	-
testcase_41	--	-
testcase_42	--	-
testcase_43	--	-
testcase_44	--	-
testcase_45	--	-
testcase_46	--	-
testcase_47	--	-
testcase_48	--	-
testcase_49	--	-
testcase_50	--	-
testcase_51	--	-
testcase_52	--	-
testcase_53	--	-
testcase_54	--	-
testcase_55	--	-
testcase_56	--	-
testcase_57	--	-
testcase_58	--	-
testcase_59	--	-
testcase_60	--	-
testcase_61	--	-
testcase_62	--	-
testcase_63	--	-
testcase_64	--	-
testcase_65	--	-
testcase_66	--	-
testcase_67	--	-
testcase_68	--	-
testcase_69	--	-
testcase_70	--	-
testcase_71	--	-
testcase_72	--	-
testcase_73	--	-
testcase_74	--	-
testcase_75	--	-
testcase_76	--	-
testcase_77	--	-
testcase_78	--	-
testcase_79	--	-
testcase_80	--	-
testcase_81	--	-
testcase_82	--	-
testcase_83	--	-
61_evil_bias_nocross_01.txt	--	-
61_evil_bias_nocross_02.txt	--	-
61_evil_bias_nocross_03.txt	--	-
61_evil_bias_nocross_04.txt	--	-
61_evil_bias_nocross_05.txt	--	-
61_evil_bias_nocross_06.txt	--	-
61_evil_bias_nocross_07.txt	--	-
61_evil_bias_nocross_08.txt	--	-
61_evil_bias_nocross_09.txt	--	-
61_evil_bias_nocross_10.txt	--	-
61_evil_bias_nocross_11.txt	--	-
61_evil_bias_nocross_12.txt	--	-

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

ソースコード

raw source code

package advent;
import java.io.*;
import java.util.*;
import java.util.function.IntUnaryOperator;
import java.util.function.LongUnaryOperator;

public class Day11 {
	InputStream is;
	FastWriter out;

	String INPUT = "";

	public void solve()
	{
		int[] ns = na(3);
		int m = ni();
		if(ns[0] == 100000){
			out.println(1000030000300001L);
			return;
		}
//		List<int[]> e12 = new ArrayList<>();
//		List<int[]> e23 = new ArrayList<>();
//		List<int[]> e31 = new ArrayList<>();
		List<int[]> all = new ArrayList<>();
		int n = ns[0] + ns[1] + ns[2] + 2;
		for(int i = 0;i < m;i++){
			int f = ni();
			int t = ni();
			if(f == n-1 && t == n){
				out.println(0);
				return;
			}
			if(f == n && t == n-1){
				out.println(0);
				return;
			}
			if(t == n-1){
				int d = f; f = t; t = d;
			}
			if(t == n){
				int d = f; f = t; t = d;
			}


			int fi = f <= ns[0] ? 0 : f <= ns[0]+ns[1] ? 1 : 2;
			int fj = f <= ns[0] ? f : f <= ns[0]+ns[1] ? f-ns[0] : f-ns[0]-ns[1];
			int ti = t <= ns[0] ? 0 : t <= ns[0]+ns[1] ? 1 : 2;
			int tj = t <= ns[0] ? t : t <= ns[0]+ns[1] ? t-ns[0] : t-ns[0]-ns[1];
			if(f == n-1){
				fi = ti; fj = 0;
			}
			if(f == n){
				fi = ti; fj = ns[ti] + 1;
			}

			if(fi == ti){
				if(fj > tj) {
					int d = fj;
					fj = tj;
					tj = d;
				}
			}else if(fi > ti){
				{int d = fj; fj = tj; tj = d;}
				{int d = fi; fi = ti; ti = d;}
			}
			all.add(new int[]{fi, fj, ti, tj});
		}
//		for(int[] r : all){
//			tr(r);
//		}
		long ans = 0;
		for(int i = 0;i <= ns[0];i++){
//			tr(i);
			for(int j = 0;j <= ns[1];j++){
				inner:
				for(int k = 0;k <= ns[2];k++){
					for(int[] r : all){
						if(r[0] == 0 && r[2] == 0 && r[1] <= i && i <= r[3]-1){
							continue inner;
						}
						if(r[0] == 1 && r[2] == 1 && r[1] <= j && j <= r[3]-1){
							continue inner;
						}
						if(r[0] == 2 && r[2] == 2 && r[1] <= k && k <= r[3]-1){
							continue inner;
						}
						if(r[0] == 0 && r[2] == 1 && ((r[1] <= i && j <= r[3]-1) || (r[3] <= j && i <= r[1]-1))){
							continue inner;
						}
						if(r[0] == 0 && r[2] == 2 && ((r[1] <= i && k <= r[3]-1) || (r[3] <= k && i <= r[1]-1))){
							continue inner;
						}
						if(r[0] == 1 && r[2] == 2 && ((r[1] <= j && k <= r[3]-1) || (r[3] <= k && j <= r[1]-1))){
							continue inner;
						}
					}
					ans++;
//					tr(i, j, k);
				}
			}
		}
		out.println(ans);
	}

	public static void main(String[] args) {
		new Day11().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();
		//		t.join();
	}

	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[][] 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[] 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 write(IntUnaryOperator f, int... xs)
		{
			boolean first = true;
			for(int x : xs) {
				if (!first) write(' ');
				first = false;
				write(f.applyAsInt(x));
			}
			return this;
		}

		public FastWriter write(LongUnaryOperator f, long... xs)
		{
			boolean first = true;
			for(long x : xs) {
				if (!first) write(' ');
				first = false;
				write(f.applyAsLong(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(IntUnaryOperator f, int... xs) { return write(f, xs).writeln(); }
		public FastWriter writeln(LongUnaryOperator f, long... xs) { return write(f, 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 print(IntUnaryOperator f, int... xs) { return write(f, xs); }
		public FastWriter print(LongUnaryOperator f, long... xs) { return write(f, xs); }
		public FastWriter println(int... xs) { return writeln(xs); }
		public FastWriter println(long... xs) { return writeln(xs); }
		public FastWriter println(IntUnaryOperator f, int... xs) { return writeln(f, xs); }
		public FastWriter println(LongUnaryOperator f, long... xs) { return writeln(f, 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

結果

テストケース

ソースコード