結果

問題 No.78 クジ付きアイスバー
ユーザー uwiuwi
提出日時 2014-11-26 12:38:26
言語 Java
(openjdk 23)
結果
AC  
実行時間 77 ms / 5,000 ms
コード長 4,462 bytes
コンパイル時間 2,327 ms
コンパイル使用メモリ 87,404 KB
実行使用メモリ 38,016 KB
最終ジャッジ日時 2024-11-08 00:18:47
合計ジャッジ時間 6,059 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 35
権限があれば一括ダウンロードができます

ソースコード

diff # 

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 Main {
	static InputStream is;
	static PrintWriter out;
	static String INPUT = "";
	
	static void solve()
	{
		int n = ni(), K = ni();
		char[] s = ns(n);
		int[] pay = new int[n+4];
		int[] next = new int[n+4];
		for(int i = n+3;i >= 0;i--){
			int ice = i;
			int lpay = 0;
			for(int j = 0;j < n;j++){
				if(ice > 0){
					ice--;
				}else{
					lpay++;
				}
				ice += s[j]-'0';
			}
			pay[i] = lpay;
			next[i] = Math.min(ice, n+3);
		}
		int[][] snext = new int[31][n+4];
		int[][] spay = new int[31][n+4];
		snext[0] = Arrays.copyOf(next, n+4);
		spay[0] = Arrays.copyOf(pay, n+4);
		for(int i = 1;i < 31;i++){
			for(int j = 0;j < n+4;j++){
				snext[i][j] = snext[i-1][snext[i-1][j]];
				spay[i][j] = spay[i-1][snext[i-1][j]] + spay[i-1][j];
			}
		}
		
		int step = K/n;
		int paysum = 0;
		int cur = 0;
		for(int i = 0;i < 31;i++){
			if(step<<~i<0){
				paysum += spay[i][cur];
				cur = snext[i][cur];
			}
		}
		{
			int ice = cur;
			int lpay = 0;
			for(int j = 0;j < K%n;j++){
				if(ice > 0){
					ice--;
				}else{
					lpay++;
				}
				ice += s[j]-'0';
			}
			paysum += lpay;
		}
		out.println(paysum);
	}
	
	public static void main(String[] args) throws Exception
	{
		long S = System.currentTimeMillis();
		is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
		out = new PrintWriter(System.out);
		
		solve();
		out.flush();
		long G = System.currentTimeMillis();
		tr(G-S+"ms");
	}
	
	private static boolean eof()
	{
		if(lenbuf == -1)return true;
		int lptr = ptrbuf;
		while(lptr < lenbuf)if(!isSpaceChar(inbuf[lptr++]))return false;
		
		try {
			is.mark(1000);
			while(true){
				int b = is.read();
				if(b == -1){
					is.reset();
					return true;
				}else if(!isSpaceChar(b)){
					is.reset();
					return false;
				}
			}
		} catch (IOException e) {
			return true;
		}
	}
	
	private static byte[] inbuf = new byte[1024];
	static int lenbuf = 0, ptrbuf = 0;
	
	private static 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 static boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
	private static int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
	
	private static double nd() { return Double.parseDouble(ns()); }
	private static char nc() { return (char)skip(); }
	
	private static 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 static 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 static 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 static int[] na(int n)
	{
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}
	
	private static 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 static 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) { if(INPUT.length() != 0)System.out.println(Arrays.deepToString(o)); }
}
0