結果

問題 No.78 クジ付きアイスバー
ユーザー amyuamyu
提出日時 2015-12-27 21:41:57
言語 Java21
(openjdk 21)
結果
AC  
実行時間 55 ms / 5,000 ms
コード長 4,345 bytes
コンパイル時間 3,090 ms
コンパイル使用メモリ 78,664 KB
実行使用メモリ 36,856 KB
最終ジャッジ日時 2024-11-08 01:36:07
合計ジャッジ時間 5,633 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 53 ms
36,636 KB
testcase_01 AC 53 ms
36,384 KB
testcase_02 AC 51 ms
36,672 KB
testcase_03 AC 54 ms
36,696 KB
testcase_04 AC 54 ms
36,804 KB
testcase_05 AC 54 ms
36,620 KB
testcase_06 AC 53 ms
36,804 KB
testcase_07 AC 53 ms
36,844 KB
testcase_08 AC 53 ms
36,500 KB
testcase_09 AC 54 ms
36,760 KB
testcase_10 AC 53 ms
36,768 KB
testcase_11 AC 53 ms
36,548 KB
testcase_12 AC 54 ms
36,672 KB
testcase_13 AC 53 ms
36,800 KB
testcase_14 AC 53 ms
36,732 KB
testcase_15 AC 52 ms
36,856 KB
testcase_16 AC 53 ms
36,692 KB
testcase_17 AC 53 ms
36,360 KB
testcase_18 AC 53 ms
36,760 KB
testcase_19 AC 54 ms
36,820 KB
testcase_20 AC 54 ms
36,776 KB
testcase_21 AC 53 ms
36,608 KB
testcase_22 AC 53 ms
36,820 KB
testcase_23 AC 54 ms
36,384 KB
testcase_24 AC 53 ms
36,652 KB
testcase_25 AC 52 ms
36,524 KB
testcase_26 AC 53 ms
36,556 KB
testcase_27 AC 52 ms
36,504 KB
testcase_28 AC 55 ms
36,344 KB
testcase_29 AC 53 ms
36,636 KB
testcase_30 AC 52 ms
36,340 KB
testcase_31 AC 53 ms
36,688 KB
testcase_32 AC 53 ms
36,624 KB
testcase_33 AC 53 ms
36,464 KB
testcase_34 AC 53 ms
36,652 KB
testcase_35 AC 54 ms
36,488 KB
testcase_36 AC 53 ms
36,560 KB
testcase_37 AC 53 ms
36,416 KB
testcase_38 AC 53 ms
36,688 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.util.*;
import java.io.*;

public class Main{
    static final Reader sc = new Reader();
    static final PrintWriter out = new PrintWriter(System.out,false);
    public static void main(String[] args) throws Exception {
    	int n = sc.nextInt();
    	long k = sc.nextLong();
    	String s = sc.next();
    	long ans = (long)0;
    	long count = (long)0;
    	int now = 0;
    	long next = (long)0;
    	for(int i=0;i<n;i++){
    		if(next==0){
    			ans++;
    			next = (int)s.charAt(now%n)-(int)'0';
    			now = (now + 1)%n;
    		}
    		else{
    			next += (int)s.charAt(now%n)-(int)'1';
    			now = (now + 1)%n;
    		}
    	}
    	if(next<ans){
    		count = ans - next;
    	}
    	else{
    		count = 0;
    	}
    	long x = (long)(k/n);
    	if(x!=0){
    		ans += (x-(long)1)*count;
    	}
    	else{
    		ans = (long)0;
    		next = (long)0;
    	}

    	if(k%n!=0){
    		for(int i=0;i<k%n;i++){
    			if(next==0){
    				ans++;
    				next = (int)s.charAt(now%n)-(int)'0';
    				now = (now+1)%n;
    			}
    			else{
    				next += (int)s.charAt(now%n)-(int)'1';
    				now = (now+1)%n;
    			}
    		}
    	}
    	out.println(ans);
    	out.flush();
        sc.close();
        out.close();
    }

    static void trace(Object... o) { System.out.println(Arrays.deepToString(o));}
}

class Reader {

    private final InputStream in;
    private final byte[] buf = new byte[1024];
    private int ptr = 0;
    private int buflen = 0;

    public Reader() { this(System.in);}
    public Reader(InputStream source) { this.in = source;}

    private boolean hasNextByte() {
        if (ptr < buflen) return true;
        ptr = 0;
        try{
            buflen = in.read(buf);
        }catch (IOException e) {e.printStackTrace();}
        if (buflen <= 0) return false;
        return true;
    }

    private int readByte() { if (hasNextByte()) return buf[ptr++]; else return -1;}

    private boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}

    private void skip() { while(hasNextByte() && !isPrintableChar(buf[ptr])) ptr++;}

    public boolean hasNext() {skip(); return hasNextByte();}

    public String next() {
        if (!hasNext()) throw new NoSuchElementException();
        StringBuilder sb = new StringBuilder();
        int b = readByte();
        while (isPrintableChar(b)) {
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    }

    public long nextLong() {
        if (!hasNext()) throw new NoSuchElementException();
        boolean minus = false;
        long num = readByte();

        if(num == '-'){
            num = 0;
            minus = true;
        }else if (num < '0' || '9' < num){
            throw new NumberFormatException();
        }else{
            num -= '0';
        }

        while(true){
            int b = readByte();
            if('0' <= b && b <= '9')
                num = num * 10 + (b - '0');
            else if(b == -1 || !isPrintableChar(b))
                return minus ? -num : num;
            else
                throw new NoSuchElementException();
        }
    }

    public int nextInt() {
        long num = nextLong();
        if (num < Integer.MIN_VALUE || Integer.MAX_VALUE < num)
            throw new NumberFormatException();
        return (int)num;
    }

    public double nextDouble() {
        return Double.parseDouble(next());
    }

    public char nextChar() {
        if (!hasNext()) throw new NoSuchElementException();
        return (char)readByte();
    }

    public String nextLine() {
        while (hasNextByte() && (buf[ptr] == '\n' || buf[ptr] == '\r')) ptr++;
        if (!hasNextByte()) throw new NoSuchElementException();

        StringBuilder sb = new StringBuilder();
        int b = readByte();
        while (b != '\n' && b != '\r') {
            sb.appendCodePoint(b);
            b = readByte();
        }

        return sb.toString();
    }

    public int[] nextIntArray(int n) {
        int[] res = new int[n];
        for (int i=0; i<n; i++) res[i] = nextInt();
        return res;
    }

    public char[] nextCharArray(int n) {
        char[] res = new char[n];
        for (int i=0; i<n; i++) res[i] = nextChar();
        return res;
    }

    public void close() {try{ in.close();}catch(IOException e){ e.printStackTrace();}};
}
0