#221823 (Java21) No.608 God's Maze

提出ソース

結果

問題	No.608 God's Maze
ユーザー	uwi
提出日時	2017-12-08 00:54:19
言語	Java21 (openjdk 21)
結果	AC
実行時間	107 ms / 2,000 ms
コード長	5,162 bytes
コンパイル時間	4,130 ms
コンパイル使用メモリ	81,376 KB
実行使用メモリ	39,924 KB
最終ジャッジ日時	2024-11-29 19:24:36
合計ジャッジ時間	10,107 ms
ジャッジサーバーID （参考情報）	judge1 / judge4

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	53 ms 37,212 KB
testcase_01	AC	53 ms 37,172 KB
testcase_02	AC	52 ms 37,120 KB
testcase_03	AC	54 ms 37,096 KB
testcase_04	AC	53 ms 37,088 KB
testcase_05	AC	52 ms 37,116 KB
testcase_06	AC	53 ms 37,008 KB
testcase_07	AC	53 ms 37,120 KB
testcase_08	AC	52 ms 36,624 KB
testcase_09	AC	52 ms 36,928 KB
testcase_10	AC	53 ms 36,988 KB
testcase_11	AC	52 ms 36,992 KB
testcase_12	AC	53 ms 36,924 KB
testcase_13	AC	53 ms 36,976 KB
testcase_14	AC	54 ms 36,968 KB
testcase_15	AC	53 ms 37,156 KB
testcase_16	AC	53 ms 37,144 KB
testcase_17	AC	52 ms 37,200 KB
testcase_18	AC	54 ms 36,688 KB
testcase_19	AC	52 ms 37,004 KB
testcase_20	AC	52 ms 37,108 KB
testcase_21	AC	51 ms 36,876 KB
testcase_22	AC	52 ms 37,152 KB
testcase_23	AC	53 ms 37,120 KB
testcase_24	AC	54 ms 37,108 KB
testcase_25	AC	53 ms 37,212 KB
testcase_26	AC	53 ms 37,068 KB
testcase_27	AC	52 ms 37,116 KB
testcase_28	AC	53 ms 37,116 KB
testcase_29	AC	96 ms 39,924 KB
testcase_30	AC	106 ms 39,716 KB
testcase_31	AC	86 ms 38,852 KB
testcase_32	AC	100 ms 39,080 KB
testcase_33	AC	97 ms 39,780 KB
testcase_34	AC	93 ms 39,080 KB
testcase_35	AC	61 ms 37,220 KB
testcase_36	AC	86 ms 38,316 KB
testcase_37	AC	91 ms 38,236 KB
testcase_38	AC	94 ms 39,580 KB
testcase_39	AC	61 ms 37,388 KB
testcase_40	AC	93 ms 38,312 KB
testcase_41	AC	89 ms 38,116 KB
testcase_42	AC	96 ms 39,772 KB
testcase_43	AC	76 ms 38,092 KB
testcase_44	AC	96 ms 39,540 KB
testcase_45	AC	97 ms 39,772 KB
testcase_46	AC	65 ms 37,388 KB
testcase_47	AC	53 ms 36,904 KB
testcase_48	AC	107 ms 39,436 KB
testcase_49	AC	84 ms 37,800 KB
testcase_50	AC	56 ms 36,980 KB
testcase_51	AC	52 ms 36,980 KB
testcase_52	AC	52 ms 36,924 KB
testcase_53	AC	52 ms 37,164 KB
testcase_54	AC	53 ms 36,628 KB
testcase_55	AC	52 ms 36,980 KB
testcase_56	AC	52 ms 36,924 KB
testcase_57	AC	52 ms 37,156 KB
testcase_58	AC	51 ms 36,952 KB
testcase_59	AC	52 ms 37,132 KB
testcase_60	AC	52 ms 37,104 KB
testcase_61	AC	53 ms 37,116 KB
testcase_62	AC	52 ms 37,092 KB
testcase_63	AC	52 ms 36,972 KB
testcase_64	AC	52 ms 37,116 KB

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

ソースコード

raw source code

package adv2017;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;

public class N608_2 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int x = ni()-1;
		char[] s = ns().toCharArray();
		long ret = Math.min(go1(s, x), go2(s, x));
		if(ret == Long.MAX_VALUE)ret = 3;
		out.println(ret);
	}

	long go1(char[] s, int x)
	{
		int n = s.length;
		int p = 0, q = n-1;
		int[] f = new int[n];
		while(p < n && (s[p] == '#') == (f[p] == 1))p++;
		long ret = p >= x ? 0 : x - p;
		for(int i = p;i < x;i++){
			f[i] ^= 1;
		}
		while(q >= 0 && (s[q] == '#') == (f[q] == 1))q--;
		if(p > q)return ret;
		
		if(p >= x){
			if(p == x){
				if(x+1 == n)return Long.MAX_VALUE;
				ret += 2;
				f[x] ^= 1;
				f[x+1] ^= 1;
			}
			p = x;
			q = n-1;
			while(q >= 0 && (s[q] == '#') == (f[q] == 1))q--;
			if(p > q)return ret;
		}
		for(int i = p+1;i <= q;i++){
			f[i] ^= 1;
			ret++;
			if((f[i] == 1) == (s[i] == '#')){
				continue;
			}
			if(i+1 == q){
				ret += 2;
				break;
			}
			f[i] ^= 1;
			if(i < q)f[i+1] ^= 1;
			ret += 2;
		}
		return ret;
	}
	

	long go2(char[] s, int x)
	{
		int n = s.length;
		int p = 0, q = n-1;
		int[] f = new int[n];
		while(q >= 0 && (s[q] == '#') == (f[q] == 1))q--;
		long ret = q <= x ? 0 : q - x;
		for(int i = x+1;i <= q;i++){
			f[i] ^= 1;
		}
		while(p < n && (s[p] == '#') == (f[p] == 1))p++;
		if(p > q)return ret;
		
		if(q <= x){
			if(q == x){
				if(q-1 < 0)return Long.MAX_VALUE;
				ret += 2;
				f[x] ^= 1;
				f[x-1] ^= 1;
			}
			q = x;
			p = 0;
			while(p < n && (s[p] == '#') == (f[p] == 1))p++;
			if(p > q)return ret;
		}
		for(int i = q-1;i >= p;i--){
			f[i] ^= 1;
			ret++;
			if((f[i] == 1) == (s[i] == '#')){
				continue;
			}
			if(i-1 == p){
				ret += 2;
				break;
			}
			ret += 2;
			f[i] ^= 1;
			if(i > p)f[i-1] ^= 1;
		}
		return ret;
	}

public static int sumFenwick(int[] ft, int i)
{
	int sum = 0;
	for(i++;i > 0;i -= i&-i)sum ^= ft[i];
	return sum;
}

public static void addFenwick(int[] ft, int i, int v)
{
	if(v == 0 || i < 0)return;
	int n = ft.length;
	for(i++;i < n;i += i&-i)ft[i] ^= v;
}

public static int[] restoreFenwick(int[] ft)
{
	int n = ft.length-1;
	int[] ret = new int[n];
	for(int i = 0;i < n;i++)ret[i] = sumFenwick(ft, i);
	for(int i = n-1;i >= 1;i--)ret[i] ^= ret[i-1];
	return ret;
}


	
	void run() throws Exception
	{
		is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
		out = new PrintWriter(System.out);
		
		long s = System.currentTimeMillis();
		solve();
		out.flush();
		if(!INPUT.isEmpty())tr(System.currentTimeMillis()-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();
	}
	
	public static void main(String[] args) throws Exception { new N608_2().run(); }
	
	private 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 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))){ // when nextLine, (isSpaceChar(b) && 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 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 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 ni() { return (int)nl(); }
	
	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();
		}
	}
	
	private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); }
}

yukicoder

結果

テストケース

ソースコード