結果
問題 | No.608 God's Maze |
ユーザー | 夕叢霧香(ゆうむらきりか) |
提出日時 | 2017-12-08 02:41:56 |
言語 | Java21 (openjdk 21) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,320 bytes |
コンパイル時間 | 3,049 ms |
コンパイル使用メモリ | 78,648 KB |
実行使用メモリ | 56,956 KB |
最終ジャッジ日時 | 2023-08-19 12:44:22 |
合計ジャッジ時間 | 10,887 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | WA | - |
testcase_01 | AC | 75 ms
52,440 KB |
testcase_02 | WA | - |
testcase_03 | AC | 71 ms
51,136 KB |
testcase_04 | AC | 70 ms
50,716 KB |
testcase_05 | AC | 73 ms
52,912 KB |
testcase_06 | WA | - |
testcase_07 | WA | - |
testcase_08 | WA | - |
testcase_09 | AC | 88 ms
52,652 KB |
testcase_10 | AC | 84 ms
52,400 KB |
testcase_11 | AC | 85 ms
52,584 KB |
testcase_12 | AC | 89 ms
52,568 KB |
testcase_13 | AC | 82 ms
53,044 KB |
testcase_14 | AC | 84 ms
53,096 KB |
testcase_15 | AC | 76 ms
52,348 KB |
testcase_16 | AC | 76 ms
52,408 KB |
testcase_17 | AC | 76 ms
52,896 KB |
testcase_18 | AC | 87 ms
52,448 KB |
testcase_19 | AC | 79 ms
52,472 KB |
testcase_20 | AC | 92 ms
52,572 KB |
testcase_21 | AC | 91 ms
52,876 KB |
testcase_22 | AC | 83 ms
52,760 KB |
testcase_23 | WA | - |
testcase_24 | AC | 77 ms
52,508 KB |
testcase_25 | AC | 83 ms
52,736 KB |
testcase_26 | AC | 92 ms
52,272 KB |
testcase_27 | AC | 80 ms
53,048 KB |
testcase_28 | AC | 82 ms
52,892 KB |
testcase_29 | AC | 147 ms
56,592 KB |
testcase_30 | AC | 151 ms
56,776 KB |
testcase_31 | AC | 131 ms
56,380 KB |
testcase_32 | AC | 144 ms
56,228 KB |
testcase_33 | AC | 171 ms
54,576 KB |
testcase_34 | AC | 153 ms
56,416 KB |
testcase_35 | AC | 95 ms
52,560 KB |
testcase_36 | AC | 109 ms
52,476 KB |
testcase_37 | AC | 115 ms
54,068 KB |
testcase_38 | AC | 146 ms
56,572 KB |
testcase_39 | AC | 91 ms
53,792 KB |
testcase_40 | AC | 116 ms
54,084 KB |
testcase_41 | AC | 115 ms
51,948 KB |
testcase_42 | AC | 156 ms
56,844 KB |
testcase_43 | AC | 112 ms
54,000 KB |
testcase_44 | AC | 159 ms
56,956 KB |
testcase_45 | AC | 156 ms
56,560 KB |
testcase_46 | AC | 93 ms
54,036 KB |
testcase_47 | AC | 79 ms
52,960 KB |
testcase_48 | AC | 155 ms
56,204 KB |
testcase_49 | AC | 111 ms
54,428 KB |
testcase_50 | AC | 82 ms
53,028 KB |
testcase_51 | AC | 86 ms
52,528 KB |
testcase_52 | AC | 80 ms
52,676 KB |
testcase_53 | AC | 78 ms
52,868 KB |
testcase_54 | AC | 75 ms
50,940 KB |
testcase_55 | AC | 84 ms
52,960 KB |
testcase_56 | AC | 78 ms
52,880 KB |
testcase_57 | AC | 78 ms
52,692 KB |
testcase_58 | WA | - |
testcase_59 | AC | 81 ms
52,460 KB |
testcase_60 | AC | 88 ms
52,876 KB |
testcase_61 | AC | 81 ms
52,376 KB |
testcase_62 | AC | 88 ms
52,516 KB |
testcase_63 | AC | 86 ms
52,856 KB |
testcase_64 | AC | 80 ms
52,348 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; if(x<n) for(int i=x;i<n;++i)u[i]=1-u[i]; m=Math.min(m,Math.max(0,n-x)+g(u,x)); u=t.clone(); if(n<y) for(int i=n+1;i<=y;++i)u[i]=1-u[i]; 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-y)); 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; } } }