結果

問題 No.204 ゴールデン・ウィーク(2)
ユーザー uwiuwi
提出日時 2015-05-09 00:15:32
言語 Java21
(openjdk 21)
結果
AC  
実行時間 87 ms / 1,000 ms
コード長 3,486 bytes
コンパイル時間 4,520 ms
コンパイル使用メモリ 85,556 KB
実行使用メモリ 53,904 KB
最終ジャッジ日時 2023-08-25 23:39:07
合計ジャッジ時間 9,203 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge12
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 67 ms
51,304 KB
testcase_01 AC 68 ms
52,628 KB
testcase_02 AC 63 ms
51,192 KB
testcase_03 AC 76 ms
53,156 KB
testcase_04 AC 68 ms
50,776 KB
testcase_05 AC 79 ms
52,464 KB
testcase_06 AC 76 ms
51,076 KB
testcase_07 AC 76 ms
51,312 KB
testcase_08 AC 78 ms
50,896 KB
testcase_09 AC 67 ms
50,832 KB
testcase_10 AC 70 ms
52,800 KB
testcase_11 AC 79 ms
52,656 KB
testcase_12 AC 67 ms
52,796 KB
testcase_13 AC 68 ms
52,168 KB
testcase_14 AC 78 ms
51,548 KB
testcase_15 AC 80 ms
53,404 KB
testcase_16 AC 78 ms
52,236 KB
testcase_17 AC 81 ms
52,360 KB
testcase_18 AC 78 ms
51,356 KB
testcase_19 AC 87 ms
53,668 KB
testcase_20 AC 80 ms
53,228 KB
testcase_21 AC 85 ms
51,364 KB
testcase_22 AC 79 ms
52,468 KB
testcase_23 AC 71 ms
51,300 KB
testcase_24 AC 69 ms
53,236 KB
testcase_25 AC 66 ms
50,812 KB
testcase_26 AC 69 ms
53,208 KB
testcase_27 AC 78 ms
53,592 KB
testcase_28 AC 72 ms
53,036 KB
testcase_29 AC 67 ms
50,928 KB
testcase_30 AC 67 ms
51,220 KB
testcase_31 AC 68 ms
52,060 KB
testcase_32 AC 66 ms
51,112 KB
testcase_33 AC 77 ms
51,928 KB
testcase_34 AC 68 ms
51,128 KB
testcase_35 AC 82 ms
52,772 KB
testcase_36 AC 87 ms
52,644 KB
testcase_37 AC 70 ms
51,028 KB
testcase_38 AC 79 ms
53,904 KB
testcase_39 AC 68 ms
50,696 KB
testcase_40 AC 70 ms
53,640 KB
testcase_41 AC 77 ms
49,008 KB
testcase_42 AC 66 ms
51,068 KB
testcase_43 AC 66 ms
50,904 KB
testcase_44 AC 75 ms
53,508 KB
testcase_45 AC 68 ms
53,404 KB
testcase_46 AC 78 ms
52,696 KB
testcase_47 AC 75 ms
50,988 KB
testcase_48 AC 74 ms
52,544 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest;

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 Q490 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int D = ni();
		String s = "xxxxxxxxxxxxxxx" + ns() + ns() + "xxxxxxxxxxxxxxx";
		int[] d = new int[16];
		char[] ox = new char[16];
		int p = 0;
		for(int i = 0;i < s.length();i++){
			if(i == 0 || s.charAt(i) != ox[p-1]){
				ox[p] = s.charAt(i);
				d[p++]++;
			}else{
				d[p-1]++;
			}
		}
		int ret = 0;
		if(p == 1 && ox[0] == 'x')ret = D;
		for(int i = 0;i < p;i++){
			if(ox[i] == 'o'){
				ret = Math.max(ret, d[i]);
				if(i-1 >= 0)ret = Math.max(ret, d[i]+Math.min(d[i-1], D));
				if(i+1 < p)ret = Math.max(ret, d[i]+Math.min(d[i+1], D));
			}
		}
		for(int i = 1;i < p-1;i++){
			if(ox[i] == 'x' && d[i] <= D){
				ret = Math.max(ret, d[i-1] + d[i] + d[i+1]);
			}
		}
		out.println(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");
	}
	
	public static void main(String[] args) throws Exception { new Q490().run(); }
	
	private byte[] inbuf = new byte[1024];
	private 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 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 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();
		}
	}
	
	private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); }
}
0