結果

問題 No.297 カードの数式
ユーザー uwiuwi
提出日時 2015-11-07 01:39:28
言語 Java21
(openjdk 21)
結果
AC  
実行時間 75 ms / 1,000 ms
コード長 4,125 bytes
コンパイル時間 3,995 ms
コンパイル使用メモリ 83,520 KB
実行使用メモリ 38,292 KB
最終ジャッジ日時 2024-06-07 18:14:52
合計ジャッジ時間 6,786 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 75 ms
37,584 KB
testcase_01 AC 72 ms
38,064 KB
testcase_02 AC 70 ms
37,832 KB
testcase_03 AC 72 ms
37,748 KB
testcase_04 AC 71 ms
37,892 KB
testcase_05 AC 71 ms
38,040 KB
testcase_06 AC 72 ms
38,204 KB
testcase_07 AC 72 ms
38,224 KB
testcase_08 AC 71 ms
37,744 KB
testcase_09 AC 72 ms
37,972 KB
testcase_10 AC 72 ms
37,844 KB
testcase_11 AC 72 ms
37,704 KB
testcase_12 AC 71 ms
37,696 KB
testcase_13 AC 75 ms
37,980 KB
testcase_14 AC 70 ms
38,012 KB
testcase_15 AC 73 ms
37,968 KB
testcase_16 AC 74 ms
38,148 KB
testcase_17 AC 70 ms
37,796 KB
testcase_18 AC 74 ms
37,640 KB
testcase_19 AC 72 ms
37,988 KB
testcase_20 AC 71 ms
38,292 KB
testcase_21 AC 72 ms
38,236 KB
testcase_22 AC 72 ms
37,892 KB
testcase_23 AC 71 ms
37,716 KB
testcase_24 AC 72 ms
38,188 KB
testcase_25 AC 71 ms
37,876 KB
権限があれば一括ダウンロードができます

ソースコード

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 Q464 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni();
		int[] f = new int[128];
		for(int i = 0;i < n;i++)f[nc()]++;
		
		int[] g = Arrays.copyOf(f, 128);
		{
			long v = 0;
			for(int i = 0;i < g['-'];i++){
				for(int j = '0';j<='9';j++){
					if(g[j] > 0){
						g[j]--;
						v -= j-'0';
						break;
					}
				}
			}
			for(int i = 0;i < g['+'];i++){
				for(int j = '0';j<='9';j++){
					if(g[j] > 0){
						g[j]--;
						v += j-'0';
						break;
					}
				}
			}
			long w = 0l;
			for(int j = '9';j >= '0';j--){
				for(int k = 0;k < g[j];k++){
					w = w * 10+j-'0';
				}
			}
			long max = w + v;
			out.print(max + " ");
		}
		
		if(f['-'] > 0){
			long v = 0;
			for(int i = 0;i < f['+']+1;i++){
				for(int j = '0';j<='9';j++){
					if(f[j] > 0){
						f[j]--;
						v += j-'0';
						break;
					}
				}
			}
			for(int i = 0;i < f['-']-1;i++){
				for(int j = '0';j<='9';j++){
					if(f[j] > 0){
						f[j]--;
						v -= j-'0';
						break;
					}
				}
			}
			long w = 0l;
			for(int j = '9';j >= '0';j--){
				for(int k = 0;k < f[j];k++){
					w = w * 10+j-'0';
				}
			}
			long min = -w + v;
			out.println(min);
		}else{
			int pl = f['+'] + 1;
			long ret = 0;
			long d = 1;
			int ct = 0;
			for(int i = '9';i >= '0';i--){
				while(f[i] > 0){
					f[i]--;
					ret += d*(i-'0');
					if(++ct == pl){
						ct = 0;
						d *= 10;
					}
				}
			}
			out.println(ret);
		}
	}
	
	void run() throws Exception
	{
		is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
		out = new PrintWriter(System.out);
		
		long s = System.currentTimeMillis();
		solve();
		out.flush();
		if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
	}
	
	public static void main(String[] args) throws Exception { new Q464().run(); }
	
	private byte[] inbuf = new byte[1024];
	private int lenbuf = 0, ptrbuf = 0;
	
	private 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 boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
	private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
	
	private double nd() { return Double.parseDouble(ns()); }
	private char nc() { return (char)skip(); }
	
	private 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 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 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 int[] na(int n)
	{
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}
	
	private 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 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) { System.out.println(Arrays.deepToString(o)); }
}
0