結果
問題 | No.608 God's Maze |
ユーザー | 夕叢霧香(ゆうむらきりか) |
提出日時 | 2017-12-08 02:45:11 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 194 ms / 2,000 ms |
コード長 | 3,443 bytes |
コンパイル時間 | 2,859 ms |
コンパイル使用メモリ | 83,112 KB |
実行使用メモリ | 45,052 KB |
最終ジャッジ日時 | 2024-05-07 05:33:01 |
合計ジャッジ時間 | 11,849 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 86 ms
40,108 KB |
testcase_01 | AC | 86 ms
38,168 KB |
testcase_02 | AC | 87 ms
39,980 KB |
testcase_03 | AC | 88 ms
38,480 KB |
testcase_04 | AC | 87 ms
38,124 KB |
testcase_05 | AC | 85 ms
39,924 KB |
testcase_06 | AC | 84 ms
38,156 KB |
testcase_07 | AC | 86 ms
38,436 KB |
testcase_08 | AC | 87 ms
40,056 KB |
testcase_09 | AC | 87 ms
38,600 KB |
testcase_10 | AC | 86 ms
38,004 KB |
testcase_11 | AC | 85 ms
40,136 KB |
testcase_12 | AC | 100 ms
40,028 KB |
testcase_13 | AC | 88 ms
38,568 KB |
testcase_14 | AC | 85 ms
40,140 KB |
testcase_15 | AC | 87 ms
39,776 KB |
testcase_16 | AC | 87 ms
39,900 KB |
testcase_17 | AC | 81 ms
37,968 KB |
testcase_18 | AC | 88 ms
38,780 KB |
testcase_19 | AC | 82 ms
38,224 KB |
testcase_20 | AC | 86 ms
40,132 KB |
testcase_21 | AC | 85 ms
39,676 KB |
testcase_22 | AC | 89 ms
40,092 KB |
testcase_23 | AC | 97 ms
40,016 KB |
testcase_24 | AC | 93 ms
39,980 KB |
testcase_25 | AC | 86 ms
38,456 KB |
testcase_26 | AC | 83 ms
38,436 KB |
testcase_27 | AC | 98 ms
39,980 KB |
testcase_28 | AC | 90 ms
40,116 KB |
testcase_29 | AC | 194 ms
45,052 KB |
testcase_30 | AC | 171 ms
43,644 KB |
testcase_31 | AC | 147 ms
42,428 KB |
testcase_32 | AC | 158 ms
43,024 KB |
testcase_33 | AC | 189 ms
44,196 KB |
testcase_34 | AC | 164 ms
43,280 KB |
testcase_35 | AC | 103 ms
40,284 KB |
testcase_36 | AC | 125 ms
41,400 KB |
testcase_37 | AC | 129 ms
41,444 KB |
testcase_38 | AC | 150 ms
42,960 KB |
testcase_39 | AC | 104 ms
40,184 KB |
testcase_40 | AC | 130 ms
41,948 KB |
testcase_41 | AC | 130 ms
41,692 KB |
testcase_42 | AC | 178 ms
43,976 KB |
testcase_43 | AC | 129 ms
41,460 KB |
testcase_44 | AC | 180 ms
43,532 KB |
testcase_45 | AC | 171 ms
43,596 KB |
testcase_46 | AC | 105 ms
40,316 KB |
testcase_47 | AC | 91 ms
40,128 KB |
testcase_48 | AC | 164 ms
43,832 KB |
testcase_49 | AC | 123 ms
41,932 KB |
testcase_50 | AC | 82 ms
38,124 KB |
testcase_51 | AC | 79 ms
38,396 KB |
testcase_52 | AC | 85 ms
37,968 KB |
testcase_53 | AC | 88 ms
39,964 KB |
testcase_54 | AC | 96 ms
40,136 KB |
testcase_55 | AC | 98 ms
39,980 KB |
testcase_56 | AC | 82 ms
38,360 KB |
testcase_57 | AC | 98 ms
39,752 KB |
testcase_58 | AC | 84 ms
38,488 KB |
testcase_59 | AC | 83 ms
38,328 KB |
testcase_60 | AC | 108 ms
39,672 KB |
testcase_61 | AC | 116 ms
40,048 KB |
testcase_62 | AC | 98 ms
38,156 KB |
testcase_63 | AC | 111 ms
40,016 KB |
testcase_64 | AC | 112 ms
39,904 KB |
ソースコード
import java.io.*; import java.util.*; class Main { static String s; static int[]zero,one; static int g(int[]x,int a){ int ans=0; int[]oldx=x.clone(); int n=x.length; if(x[a]==1) if(a==n-1)return 0x3fffffff; else{ x[a]=0; x[a+1]=1-x[a+1]; ans+=2; } int p=a; int last=-1; for(int i=a;i<n;++i) if(x[i]==1)last=i; while(true){ int p2=p+1; while(p2<=last&&x[p2]!=0)p2++; if(p2>last){ ans+=Math.max(last-p,0); break; } x[p2]=1; x[p2+1]=1-x[p2+1]; if(last==p2+1)last=p2; ans+=p2-p+2; p=p2; } //System.err.println("g("+Arrays.toString(oldx)+","+a+")="+ans); return ans; } public static void main(String[] args) { MyScanner sc = new MyScanner(); out = new PrintWriter(new BufferedOutputStream(System.out)); int n=sc.nextInt()-1; s=sc.next(); int l=s.length(); int p=0,q=0; zero=new int[s.length()]; one=new int[s.length()]; for(int i=0;i<s.length();++i) if(s.charAt(i)=='.') zero[p++]=i; else one[q++]=i; zero=Arrays.copyOf(zero,p); one=Arrays.copyOf(one,q); int[]t=new int[l]; for(int i=0;i<l;++i) t[i]=s.charAt(i)=='#'?1:0; int[]u=t.clone(); int x=one[0],y=one[q-1]; System.err.println("x="+x+" y="+y); int m=Integer.MAX_VALUE; int st=-1; if(x<n){ for(int i=x;i<n;++i)u[i]=1-u[i]; st=x; }else st=n; m=Math.min(m,Math.max(0,n-x)+g(u,st)); u=t.clone(); if(n<y){ for(int i=n+1;i<=y;++i)u[i]=1-u[i]; st=y; }else st=n; for(int i=0;i<l/2;++i){ int temp=u[i]; u[i]=u[l-1-i]; u[l-1-i]=temp; } m=Math.min(m,Math.max(0,y-n)+g(u,l-1-st)); out.println(m); out.close(); } // http://codeforces.com/blog/entry/7018 //-----------PrintWriter for faster output--------------------------------- public static PrintWriter out; //-----------MyScanner class for faster input---------- public static class MyScanner { BufferedReader br; StringTokenizer st; public MyScanner() { br = new BufferedReader(new InputStreamReader(System.in)); } String next() { while (st == null || !st.hasMoreElements()) { try { st = new StringTokenizer(br.readLine()); } catch (IOException e) { e.printStackTrace(); } } return st.nextToken(); } int nextInt() { return Integer.parseInt(next()); } long nextLong() { return Long.parseLong(next()); } double nextDouble() { return Double.parseDouble(next()); } String nextLine(){ String str = ""; try { str = br.readLine(); } catch (IOException e) { e.printStackTrace(); } return str; } } }