結果

問題 No.297 カードの数式
コンテスト
ユーザー threepipes_s
提出日時 2015-11-06 23:22:34
言語 Java
(openjdk 23)
結果
AC  
実行時間 82 ms / 1,000 ms
コード長 3,519 bytes
コンパイル時間 2,531 ms
コンパイル使用メモリ 89,440 KB
実行使用メモリ 38,324 KB
最終ジャッジ日時 2024-12-26 02:15:11
合計ジャッジ時間 5,317 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 23
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Collections;
import java.util.HashMap;
import java.util.List;

public class Main {
	public static void main(String[] args) throws NumberFormatException,
	IOException {Solve solve = new Solve();solve.solve();}
}
class Solve{
	void solve() throws NumberFormatException, IOException{
		ContestScanner in = new ContestScanner();
		Writer out = new Writer();
		int n = in.nextInt();
		char[] s = new char[n];
		List<Integer> num = new ArrayList<>();
		int plus = 1;
		int min = 0;
		for(int i=0; i<n; i++){
			s[i] = in.nextToken().charAt(0);
			if(s[i]=='+') plus++;
			else if(s[i] == '-') min++;
			else num.add(s[i]-'0');
		}
		Collections.sort(num);
		// max
		long val = 0;
		for(int i=0; i<min; i++){
			val -= num.get(i);
		}
		for(int i=min; i<min+plus-1; i++){
			val += num.get(i);
		}
		long tmp = 0;
		for(int i=num.size()-1; i>=min+plus-1; i--){
			tmp *= 10;
			tmp += num.get(i);
		}
		System.out.print((val+tmp)+" ");
		if(min==0){
			val = 0;
			int[] p = new int[plus];
			for(int i=0; i<num.size(); i++){
				p[i%plus] *= 10;
				p[i%plus] += num.get(i);
			}
			for(int i=0; i<plus; i++){
				val += p[i];
			}
			System.out.println(val);
//			Collections.reverse(num);
//			int ave = num.size()/plus;
//			int mod = num.size()%plus;
//			int idx = 0;
//			for(int i=0; i<plus; i++){
//				int len = ave+(i<mod?1:0);
//				tmp = 0;
//				for(int j=0; j<len; j++){
//					tmp *= 10;
//					tmp += num.get(idx++);
//				}
//				System.err.println(tmp);
//				val += tmp;
//			}
//			System.out.println(val);
			return;
		}
		// min
		val = 0;
		for(int i=0; i<plus; i++){
			val += num.get(i);
		}
		for(int i=plus; i<min+plus-1; i++){
			val -= num.get(i);
		}
		System.out.println(val-tmp);
	}
}

class MultiSet<T> extends HashMap<T, Integer>{
	@Override
	public Integer get(Object key){return containsKey(key)?super.get(key):0;}
	public void add(T key,int v){put(key,get(key)+v);}
	public void add(T key){put(key,get(key)+1);}
}
class Timer{
	long time;
	public void set(){time = System.currentTimeMillis();}
	public long stop(){return System.currentTimeMillis()-time;}
}
class Writer extends PrintWriter{
	public Writer(String filename) throws IOException
	{super(new BufferedWriter(new FileWriter(filename)));}
	public Writer() throws IOException{super(System.out);}
}
class ContestScanner {
	private BufferedReader reader;
	private String[] line;
	private int idx;
	public ContestScanner() throws FileNotFoundException 
	{reader = new BufferedReader(new InputStreamReader(System.in));}
	public ContestScanner(String filename) throws FileNotFoundException
	{reader = new BufferedReader(new InputStreamReader(new FileInputStream(filename)));}
	public String nextToken() throws IOException {
		if (line == null || line.length <= idx) {
			line = reader.readLine().trim().split(" ");
			idx = 0;
		}
		return line[idx++];
	}
	public String readLine() throws IOException{return reader.readLine();}
	public long nextLong() throws IOException, NumberFormatException
	{return Long.parseLong(nextToken());}
	public int nextInt() throws NumberFormatException, IOException
	{return (int) nextLong();}
	public double nextDouble() throws NumberFormatException, IOException 
	{return Double.parseDouble(nextToken());}
}
0