結果

問題 No.45 回転寿司
ユーザー amyuamyu
提出日時 2015-12-19 18:38:38
言語 Java21
(openjdk 21)
結果
TLE  
(最新)
AC  
(最初)
実行時間 -
コード長 4,397 bytes
コンパイル時間 2,445 ms
コンパイル使用メモリ 79,800 KB
実行使用メモリ 92,388 KB
最終ジャッジ日時 2024-11-24 10:44:00
合計ジャッジ時間 67,973 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 890 ms
63,232 KB
testcase_01 AC 2,142 ms
69,476 KB
testcase_02 TLE -
testcase_03 TLE -
testcase_04 AC 2,475 ms
73,736 KB
testcase_05 AC 138 ms
42,232 KB
testcase_06 AC 1,658 ms
63,972 KB
testcase_07 TLE -
testcase_08 AC 366 ms
48,304 KB
testcase_09 TLE -
testcase_10 AC 907 ms
57,784 KB
testcase_11 AC 274 ms
45,668 KB
testcase_12 TLE -
testcase_13 AC 150 ms
42,184 KB
testcase_14 AC 111 ms
39,156 KB
testcase_15 AC 1,201 ms
57,500 KB
testcase_16 AC 423 ms
48,500 KB
testcase_17 AC 826 ms
57,828 KB
testcase_18 AC 473 ms
48,300 KB
testcase_19 AC 3,854 ms
73,168 KB
testcase_20 AC 108 ms
39,584 KB
testcase_21 AC 127 ms
41,724 KB
testcase_22 AC 51 ms
36,720 KB
testcase_23 AC 51 ms
36,816 KB
testcase_24 AC 51 ms
36,516 KB
testcase_25 AC 51 ms
36,716 KB
testcase_26 AC 970 ms
57,692 KB
testcase_27 AC 4,055 ms
73,624 KB
testcase_28 AC 1,361 ms
63,740 KB
testcase_29 AC 3,000 ms
73,428 KB
testcase_30 AC 3,198 ms
73,264 KB
testcase_31 AC 53 ms
37,028 KB
testcase_32 AC 52 ms
36,512 KB
testcase_33 TLE -
権限があれば一括ダウンロードができます

ソースコード

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();
    	ArrayList<Integer> list = new ArrayList<Integer>();
    	ArrayList<Integer> list2 = new ArrayList<Integer>();
    	ArrayList<Integer> list3 = new ArrayList<Integer>();
    	list.add(0);
    	boolean[] judge = new boolean[1000*100+1];
    	boolean flag = false;
    	for(int i=0;i<n;i++){
    		int v = sc.nextInt();
    		if(i%2==0){
	    		for(int j=0;j<list.size();j++){
    				int x = list.get(j);
    				if(!judge[x+v]){
						judge[x+v] = true;
						list2.add(x+v);
					}
    			}
    			for(int j=0;j<list3.size();j++){
    				list.add(list3.get(j));
    			}
    		}
    		else{
    			for(int j=0;j<list.size();j++){
    				int x = list.get(j);
    				if(!judge[x+v]){
    					judge[x+v] = true;
    					list3.add(x+v);
    				}
    			}
    			for(int j=0;j<list2.size();j++){
    				list.add(list2.get(j));
    			}
    		}		
    	}
    	for(int i=100000;i>0;i--){
    		if(judge[i]){
    			out.println(i);
    			out.flush();
    			break;
    		}
    	}
        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