結果

問題 No.5006 Hidden Maze
ユーザー uwiuwi
提出日時 2022-06-12 15:56:26
言語 Java21
(openjdk 21)
結果
AC  
実行時間 174 ms / 2,000 ms
コード長 12,636 bytes
コンパイル時間 4,563 ms
実行使用メモリ 51,568 KB
スコア 0
平均クエリ数 402.19
最終ジャッジ日時 2022-06-12 16:00:55
合計ジャッジ時間 20,938 ms
ジャッジサーバーID
(参考情報)
judge14 / judge13
純コード判定しない問題か言語
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 144 ms
51,140 KB
testcase_01 AC 129 ms
50,412 KB
testcase_02 AC 159 ms
51,336 KB
testcase_03 AC 148 ms
51,072 KB
testcase_04 AC 146 ms
51,156 KB
testcase_05 AC 98 ms
50,276 KB
testcase_06 AC 113 ms
50,656 KB
testcase_07 AC 105 ms
50,648 KB
testcase_08 AC 88 ms
50,416 KB
testcase_09 AC 98 ms
49,956 KB
testcase_10 AC 132 ms
50,848 KB
testcase_11 AC 101 ms
50,616 KB
testcase_12 AC 88 ms
50,252 KB
testcase_13 AC 152 ms
51,408 KB
testcase_14 AC 94 ms
50,628 KB
testcase_15 AC 112 ms
50,012 KB
testcase_16 AC 93 ms
50,532 KB
testcase_17 AC 88 ms
49,968 KB
testcase_18 AC 94 ms
50,136 KB
testcase_19 AC 101 ms
50,156 KB
testcase_20 AC 141 ms
50,764 KB
testcase_21 AC 97 ms
50,052 KB
testcase_22 AC 150 ms
50,648 KB
testcase_23 AC 107 ms
50,088 KB
testcase_24 AC 116 ms
50,416 KB
testcase_25 AC 94 ms
50,136 KB
testcase_26 AC 90 ms
50,764 KB
testcase_27 AC 144 ms
50,480 KB
testcase_28 AC 113 ms
50,876 KB
testcase_29 AC 116 ms
50,268 KB
testcase_30 AC 109 ms
50,644 KB
testcase_31 AC 103 ms
50,352 KB
testcase_32 AC 87 ms
49,880 KB
testcase_33 AC 151 ms
51,148 KB
testcase_34 AC 99 ms
50,148 KB
testcase_35 AC 145 ms
50,656 KB
testcase_36 AC 97 ms
50,604 KB
testcase_37 AC 85 ms
50,364 KB
testcase_38 AC 89 ms
50,656 KB
testcase_39 AC 102 ms
50,664 KB
testcase_40 AC 99 ms
50,048 KB
testcase_41 AC 110 ms
50,380 KB
testcase_42 AC 94 ms
50,200 KB
testcase_43 AC 138 ms
50,772 KB
testcase_44 AC 97 ms
50,556 KB
testcase_45 AC 109 ms
49,960 KB
testcase_46 AC 101 ms
50,144 KB
testcase_47 AC 102 ms
50,040 KB
testcase_48 AC 105 ms
50,204 KB
testcase_49 AC 100 ms
50,564 KB
testcase_50 AC 100 ms
50,024 KB
testcase_51 AC 101 ms
50,684 KB
testcase_52 AC 150 ms
51,436 KB
testcase_53 AC 91 ms
50,152 KB
testcase_54 AC 100 ms
50,140 KB
testcase_55 AC 152 ms
50,972 KB
testcase_56 AC 93 ms
50,572 KB
testcase_57 AC 97 ms
50,016 KB
testcase_58 AC 100 ms
50,528 KB
testcase_59 AC 141 ms
50,544 KB
testcase_60 AC 149 ms
51,012 KB
testcase_61 AC 141 ms
50,516 KB
testcase_62 AC 90 ms
50,040 KB
testcase_63 AC 144 ms
50,532 KB
testcase_64 AC 140 ms
51,016 KB
testcase_65 AC 135 ms
50,548 KB
testcase_66 AC 135 ms
50,720 KB
testcase_67 AC 130 ms
50,800 KB
testcase_68 AC 92 ms
50,188 KB
testcase_69 AC 123 ms
50,408 KB
testcase_70 AC 136 ms
51,228 KB
testcase_71 AC 154 ms
51,156 KB
testcase_72 AC 174 ms
51,568 KB
testcase_73 AC 123 ms
50,640 KB
testcase_74 AC 128 ms
50,792 KB
testcase_75 AC 103 ms
50,656 KB
testcase_76 AC 151 ms
51,160 KB
testcase_77 AC 120 ms
50,540 KB
testcase_78 AC 91 ms
50,276 KB
testcase_79 AC 90 ms
50,124 KB
testcase_80 AC 103 ms
49,960 KB
testcase_81 AC 104 ms
50,348 KB
testcase_82 AC 131 ms
50,552 KB
testcase_83 AC 118 ms
50,404 KB
testcase_84 AC 138 ms
50,904 KB
testcase_85 AC 112 ms
50,332 KB
testcase_86 AC 143 ms
50,468 KB
testcase_87 AC 92 ms
50,000 KB
testcase_88 AC 106 ms
49,980 KB
testcase_89 AC 153 ms
51,156 KB
testcase_90 AC 117 ms
50,124 KB
testcase_91 AC 130 ms
50,568 KB
testcase_92 AC 150 ms
51,228 KB
testcase_93 AC 121 ms
50,424 KB
testcase_94 AC 100 ms
50,344 KB
testcase_95 AC 151 ms
51,516 KB
testcase_96 AC 95 ms
50,380 KB
testcase_97 AC 106 ms
50,296 KB
testcase_98 AC 97 ms
50,452 KB
testcase_99 AC 96 ms
50,584 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

package contest220612;

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

public class A4 {
	InputStream is;
	FastWriter out;

	String INPUT = "";

	String D = "RDLU";

	final int L = 400;

	public void solve() {
		int H = ni(), W = ni(), P = ni();
		String s = "";
		Deque<Integer> curs = new ArrayDeque<>();
		curs.add(0);
		Deque<Boolean> other = new ArrayDeque<>();
		other.add(false);
		while(true){
			int resr = 0;
			int resd = 0;
			for(int k = 0;k < 2;k++) {
				String ns = s + "R";
				out.println(ns).flush();
				int res = ni();
				resr += res;
				if(res == -1)return;
			}
			for(int k = 0;k < 2;k++) {
				String ns = s + "D";
				out.println(ns).flush();
				int res = ni();
				resd += res;
				if(res == -1)return;
			}
			int cur = curs.peekLast();
			if(Math.max(resr, resd) > cur){
				curs.addLast(Math.max(resr, resd));
				if(resr >= resd){
					s += "R";
					other.addLast(resd > cur);
				}else{
					s += "D";
					other.addLast(resr > cur);
				}
			}else{
				while(s.length() >= 1) {
					char las = s.charAt(s.length() - 1);
					s = s.substring(0, s.length() - 1);
					curs.pollLast();
					boolean o = other.pollLast();
					if(o){
						if(las == 'R'){
							s += 'D';
						}else{
							s += 'R';
						}
						curs.add(curs.peekLast());
						other.addLast(false);
						break;
					}
				}
				if(s.length() == 0)return;
			}
		}
	}

	public static void main(String[] args) {
		new A4().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)); }
}
0