#592382 (Java21) No.1315 渦巻洞穴

提出ソース

結果

問題	No.1315 渦巻洞穴
ユーザー	uwi
提出日時	2020-12-12 02:43:22
言語	Java21 (openjdk 21)
結果	AC
実行時間	215 ms / 2,000 ms
コード長	13,406 bytes
コンパイル時間	4,423 ms
コンパイル使用メモリ	94,240 KB
実行使用メモリ	50,432 KB
最終ジャッジ日時	2024-09-19 21:42:45
合計ジャッジ時間	20,771 ms
ジャッジサーバーID （参考情報）	judge4 / judge5

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	64 ms 48,876 KB
testcase_01	AC	61 ms 38,088 KB
testcase_02	AC	62 ms 38,020 KB
testcase_03	AC	60 ms 37,844 KB
testcase_04	AC	61 ms 37,944 KB
testcase_05	AC	62 ms 37,880 KB
testcase_06	AC	71 ms 37,632 KB
testcase_07	AC	62 ms 37,608 KB
testcase_08	AC	65 ms 37,680 KB
testcase_09	AC	64 ms 37,968 KB
testcase_10	AC	63 ms 37,552 KB
testcase_11	AC	70 ms 37,564 KB
testcase_12	AC	68 ms 38,188 KB
testcase_13	AC	179 ms 47,676 KB
testcase_14	AC	172 ms 46,428 KB
testcase_15	AC	183 ms 46,396 KB
testcase_16	AC	197 ms 50,380 KB
testcase_17	AC	195 ms 49,048 KB
testcase_18	AC	189 ms 48,596 KB
testcase_19	AC	186 ms 46,356 KB
testcase_20	AC	206 ms 49,560 KB
testcase_21	AC	179 ms 46,676 KB
testcase_22	AC	188 ms 49,040 KB
testcase_23	AC	205 ms 49,308 KB
testcase_24	AC	208 ms 49,020 KB
testcase_25	AC	207 ms 49,672 KB
testcase_26	AC	194 ms 49,212 KB
testcase_27	AC	206 ms 49,644 KB
testcase_28	AC	197 ms 49,408 KB
testcase_29	AC	202 ms 48,960 KB
testcase_30	AC	205 ms 49,540 KB
testcase_31	AC	202 ms 49,584 KB
testcase_32	AC	209 ms 49,056 KB
testcase_33	AC	209 ms 49,460 KB
testcase_34	AC	203 ms 49,640 KB
testcase_35	AC	196 ms 48,212 KB
testcase_36	AC	197 ms 50,432 KB
testcase_37	AC	204 ms 49,524 KB
testcase_38	AC	191 ms 49,252 KB
testcase_39	AC	205 ms 48,948 KB
testcase_40	AC	196 ms 49,348 KB
testcase_41	AC	206 ms 49,500 KB
testcase_42	AC	208 ms 49,488 KB
testcase_43	AC	211 ms 49,576 KB
testcase_44	AC	211 ms 49,644 KB
testcase_45	AC	193 ms 49,524 KB
testcase_46	AC	200 ms 48,912 KB
testcase_47	AC	201 ms 49,088 KB
testcase_48	AC	208 ms 49,204 KB
testcase_49	AC	196 ms 49,404 KB
testcase_50	AC	215 ms 49,848 KB
testcase_51	AC	209 ms 49,564 KB
testcase_52	AC	203 ms 49,588 KB
testcase_53	AC	203 ms 49,212 KB
testcase_54	AC	204 ms 49,504 KB
testcase_55	AC	206 ms 49,200 KB
testcase_56	AC	206 ms 49,004 KB
testcase_57	AC	203 ms 49,420 KB
testcase_58	AC	203 ms 49,548 KB
testcase_59	AC	163 ms 46,568 KB
testcase_60	AC	165 ms 46,216 KB
testcase_61	AC	167 ms 46,648 KB
testcase_62	AC	168 ms 46,492 KB
testcase_63	AC	169 ms 46,868 KB
testcase_64	AC	162 ms 46,572 KB
testcase_65	AC	169 ms 46,580 KB
testcase_66	AC	165 ms 46,520 KB
testcase_67	AC	163 ms 46,824 KB
testcase_68	AC	163 ms 46,592 KB
testcase_69	AC	168 ms 46,592 KB
testcase_70	AC	166 ms 46,920 KB
testcase_71	AC	162 ms 46,720 KB
testcase_72	AC	163 ms 46,704 KB
testcase_73	AC	165 ms 46,496 KB
testcase_74	AC	162 ms 46,748 KB
testcase_75	AC	63 ms 37,444 KB
testcase_76	AC	67 ms 38,076 KB
testcase_77	AC	174 ms 46,120 KB
testcase_78	AC	172 ms 46,540 KB
testcase_79	AC	196 ms 49,736 KB
testcase_80	AC	179 ms 46,220 KB
testcase_81	AC	175 ms 46,548 KB

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

ソースコード

raw source code

package adv2020;

import java.io.*;
import java.util.*;

public class Day12 {
	InputStream is;
	FastWriter out;

	String INPUT = "";

	boolean[][] dp = new boolean[10][16];

	List<Integer> best = null;
	int summin = 99999;

	void dfs(int cur, int to, int sum, Deque<Integer> lroute)
	{
		if(dp[cur][sum])return;
		dp[cur][sum] = true;
		if(cur == to && sum < summin){
			summin = sum;
			best = new ArrayList<>(lroute);
		}
		int[] e = dec(cur);
		int[] dr = {1, 0, -1, 0};
		int[] dc = {0, 1, 0, -1};
		for(int k = 0;k < 4;k++){
			int nr = e[0] + dr[k], nc = e[1] + dc[k];
			if(nr >= -1 && nr <= 1 && nc >= -1 && nc <= 1){
				int ne = (int)enc(nr, nc);
				lroute.add(ne);
				dfs(ne, to, sum^ne, lroute);
				lroute.removeLast();
			}
		}
	}

	public void solve()
	{
		int S = ni(), T = ni();

		List<Long> so = new ArrayList<>(route(S));
		List<Long> to = new ArrayList<>(route(T));

		long x = 0;
		for(long s : so)x ^= s;
		for(long s : to)x ^= s;

		dp = new boolean[10][16];
		for(int i = 0;i < 10;i++){
			for(int j = 0;j < 16;j++){
				dp[i][j] = false;
			}
		}
		best = null;
		dfs(
				(int)(long)(so.get(so.size()-1)),
				(int)(long)(to.get(to.size()-1)), (int)(x^(long)(to.get(to.size()-1))), new ArrayDeque<>());

		best.remove(best.size()-1);
		List<Long> route = new ArrayList<>(so);
		for(int b : best)route.add((long)b);
		for(int i = to.size()-1;i >= 0;i--)route.add(to.get(i));

		x = 0;
		for(long s : route)x ^= s;

		out.println(x);
		out.println(route.size()-1);
		int[] dr = {1, 0, -1, 0};
		int[] dc = {0, 1, 0, -1};
		char[] D = "RULD".toCharArray();
		for(int i = 0;i < route.size()-1;i++){
			int[] f = dec(route.get(i)), t = dec(route.get(i+1));
			for(int k = 0;k < 4;k++){
				if(f[0] + dr[k] == t[0] && f[1] + dc[k] == t[1]){
					out.print(D[k]);
				}
			}
		}
		out.println();
	}

	Deque<Long> route(long S)
	{
		Deque<Long> ret = new ArrayDeque<>();
		Set<Long> ved = new HashSet<>();
		while(true) {
			if(!ved.add(S))return ret;
			ret.add(S);
			if (S <= 9) return ret;
			int[] ne;
			if ((S ^ S - 1) == 1) {
				ne = dec(S - 1);
				if(!ved.add(S-1))return ret;
			} else {
				ne = dec(S + 1);
				if(!ved.add(S+1))return ret;
			}
			ret.add(enc(ne[0], ne[1]));
			int[] dr = {1, 0, -1, 0};
			int[] dc = {0, 1, 0, -1};
			long min = Long.MAX_VALUE;
			for (int k = 0; k < 4; k++) {
				long val = enc(ne[0] + dr[k], ne[1] + dc[k]);
				if (val < min && val != S) {
					min = val;
				}
			}
			S = min;
		}
	}

	public int[] dec(long n)
	{
		long s = (int)Math.sqrt(n);
		if(s % 2 == 0)s--;
		int rem = (int)(n-s*s);
		int len = (int)s;
		if(rem == 0)return new int[]{len/2, -len/2};
		// s*s : (s/2, -s/2)
		len++;
		if(rem < len)return new int[]{len/2, -len/2 + rem};
		rem -= len;
		if(rem < len)return new int[]{len/2 - rem, len/2};
		rem -= len;
		if(rem < len)return new int[]{-len/2, len/2 - rem};
		rem -= len;
		return new int[]{-len/2+rem, -len/2};
	}

	public long enc(int x, int y)
	{
		int q = Math.max(Math.abs(x), Math.abs(y));
		if(x == q && y == -q)return (long)(2*q+1)*(2*q+1);
		long base = (long)(2*q-1)*(2*q-1);
		if(x == q)return base + (y-(-q));
		if(y == q)return base + 2*q + (q-x);
		if(x == -q)return base + 4*q + (q-y);
		return base + 6*q + (x-(-q));
	}

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

結果

テストケース

ソースコード