#448235 (Java) No.297 カードの数式

• 問題: No.297 カードの数式
• ユーザー: 37zigen
• 提出日時: 2020-03-23 02:02:32
• 言語: Java (openjdk 23)
• 結果: AC
• 実行時間: 105 ms / 1,000 ms
• コード長: 3,777 bytes
• コンパイル時間: 2,999 ms
• コンパイル使用メモリ: 85,376 KB
• 実行使用メモリ: 39,560 KB
• 最終ジャッジ日時: 2024-12-26 05:48:19
• 合計ジャッジ時間: 6,693 ms
• ジャッジサーバーID （参考情報）: judge1 / judge4

ファイルパターン	結果
sample	AC * 3
other	AC * 23

ソースコード

import java.io.FileNotFoundException;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.NoSuchElementException;

public class Main {
	public static void main(String[] args) throws FileNotFoundException {
		long t = System.currentTimeMillis();
		new Main().run();
		System.err.println(System.currentTimeMillis() - t);
	}
	
	//plus>=1
	long max(int[] val,int plus,int minus) {
		int n=val.length;
		long ret=0;
		if(minus==0) {
			for(int i=plus-1;i<n;++i) {
				ret=10*ret+val[n-1-(i-(plus-1))];
			}
			for(int i=0;i<plus-1;++i)ret+=val[i];
			return ret;
		}else {
			for(int i=0;i<minus;++i) {
				ret-=val[i];
			}
			ret+=max(Arrays.copyOfRange(val, minus, n),plus,0);
		}
		return ret;
	}
	
	//plus>=1
	long min(int[] val,int plus,int minus) {
		int n=val.length;
		long ret=0;
		if(minus==0) {
			int[] v=new int[plus];
			for(int i=0;i<n;++i) {
				v[i%plus]=v[i%plus]*10+val[i];
			}
			for(int w:v)ret+=w;
			return ret;
		}else {
			for(int i=plus+minus-1;i<n;++i) {
				ret=10*ret+val[n-1-(i-(plus+minus-1))];
			}
			ret*=-1;
			for(int i=0;i<plus;++i) {
				ret+=val[i];
			}
			for(int i=plus;i<plus+minus-1;++i) {
				ret-=val[i];
			}
			return ret;
		}
	}
	
	void run() {
		FastScanner sc = new FastScanner();
		int N=sc.nextInt();
		int[] val=new int[N];
		char[] cs=new char[N+1];
		for(int i=0;i<N;++i) {
			cs[i]=sc.next().charAt(0);
		}
		cs[N]='+';
		int plus=0,minus=0,q=0;
		for(char c:cs) {
			if(c=='+') {
				++plus;
			}else if(c=='-') {
				++minus;
			}else {
				val[q++]=(int)(c-'0');
			}
		}
		val=Arrays.copyOf(val, q);
		Arrays.sort(val);
		System.out.println(max(val,plus,minus)+" "+min(val,plus,minus));
	}
	
	static void tr(Object... objects) {
		System.out.println(Arrays.deepToString(objects));
	}

}


class FastScanner {
    private final InputStream in = System.in;
    private final byte[] buffer = new byte[1024];
    private int ptr = 0;
    private int buflen = 0;
    private boolean hasNextByte() {
        if (ptr < buflen) {
            return true;
        }else{
            ptr = 0;
            try {
                buflen = in.read(buffer);
            } catch (IOException e) {
                e.printStackTrace();
            }
            if (buflen <= 0) {
                return false;
            }
        }
        return true;
    }
    private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}
    private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}
    private void skipUnprintable() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;}
    public boolean hasNext() { skipUnprintable(); 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();
        long n = 0;
        boolean minus = false;
        int b = readByte();
        if (b == '-') {
            minus = true;
            b = readByte();
        }
        if (b < '0' || '9' < b) {
            throw new NumberFormatException();
        }
        while(true){
            if ('0' <= b && b <= '9') {
                n *= 10;
                n += b - '0';
            }else if(b == -1 || !isPrintableChar(b)){
                return minus ? -n : n;
            }else{
                throw new NumberFormatException();
            }
            b = readByte();
        }
    }
    
    public int nextInt() {
    	return (int)nextLong();
    }
}