結果

問題 No.509 塗りつぶしツール
ユーザー uwi
提出日時 2017-04-28 22:28:34
言語 Java11
(openjdk 11.0.6)
結果
AC  
実行時間 80 ms
コード長 3,332 Byte
コンパイル時間 4,112 ms
使用メモリ 30,944 KB
最終ジャッジ日時 2020-01-24 08:07:28

テストケース

テストケース表示
入力 結果 実行時間
使用メモリ
00_sample0.txt AC 72 ms
30,776 KB
00_sample1.txt AC 72 ms
30,516 KB
00_sample2.txt AC 76 ms
30,716 KB
10_gen_case1.txt AC 72 ms
30,944 KB
10_gen_case2.txt AC 72 ms
30,676 KB
10_gen_case3.txt AC 80 ms
30,412 KB
10_gen_case4.txt AC 72 ms
30,436 KB
10_gen_case5.txt AC 76 ms
30,772 KB
10_gen_case6.txt AC 76 ms
30,776 KB
10_gen_case7.txt AC 72 ms
30,624 KB
10_gen_case8.txt AC 76 ms
30,520 KB
10_gen_case9.txt AC 76 ms
30,620 KB
10_gen_case10.txt AC 72 ms
30,744 KB
10_gen_case11.txt AC 76 ms
30,412 KB
10_gen_case12.txt AC 76 ms
30,792 KB
10_gen_case13.txt AC 72 ms
30,508 KB
10_gen_case14.txt AC 72 ms
30,800 KB
10_gen_case15.txt AC 76 ms
30,636 KB
10_gen_case16.txt AC 76 ms
30,436 KB
10_gen_case17.txt AC 80 ms
30,792 KB
10_gen_case18.txt AC 72 ms
30,584 KB
10_gen_case19.txt AC 72 ms
30,800 KB
10_gen_case20.txt AC 72 ms
30,752 KB
20_handmade1.txt AC 76 ms
30,456 KB
20_handmade2.txt AC 76 ms
30,456 KB
20_handmade3.txt AC 80 ms
30,620 KB
20_handmade4.txt AC 72 ms
30,684 KB
99_corner1.txt AC 76 ms
30,656 KB
99_corner2.txt AC 76 ms
30,448 KB
99_corner3.txt AC 80 ms
30,440 KB
テストケース一括ダウンロード

ソースコード

diff #
package contest170428;
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 B {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		char[] s = ns().toCharArray();
		int[] H = {1, 0, 0, 0, 1, 0, 1, 0, 2, 1};
		int hole = 0;
		for(char c : s)hole += H[c-'0'];
		int ret = 0;
		ret += s.length;
		ret++;
		ret += hole;
		ret += s.length;
		int res = 0;
		res++;
		res += hole;
		res += s.length;
		res += 1 + hole;
		out.println(Math.min(res, 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 B().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)); }
}
0