結果

問題 No.297 カードの数式
ユーザー nCk_cvnCk_cv
提出日時 2016-02-17 16:21:24
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 4,741 bytes
コンパイル時間 2,364 ms
コンパイル使用メモリ 86,164 KB
実行使用メモリ 58,608 KB
最終ジャッジ日時 2023-10-22 06:14:28
合計ジャッジ時間 7,903 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge10
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 150 ms
58,444 KB
testcase_01 AC 148 ms
58,264 KB
testcase_02 AC 150 ms
58,440 KB
testcase_03 AC 138 ms
57,920 KB
testcase_04 AC 142 ms
57,856 KB
testcase_05 AC 150 ms
58,212 KB
testcase_06 WA -
testcase_07 AC 147 ms
58,436 KB
testcase_08 AC 149 ms
58,424 KB
testcase_09 AC 158 ms
58,224 KB
testcase_10 AC 150 ms
58,492 KB
testcase_11 AC 139 ms
57,936 KB
testcase_12 AC 153 ms
58,260 KB
testcase_13 AC 150 ms
58,480 KB
testcase_14 AC 150 ms
58,444 KB
testcase_15 AC 148 ms
58,148 KB
testcase_16 AC 149 ms
58,396 KB
testcase_17 AC 153 ms
58,356 KB
testcase_18 AC 149 ms
58,424 KB
testcase_19 WA -
testcase_20 WA -
testcase_21 WA -
testcase_22 AC 153 ms
56,372 KB
testcase_23 WA -
testcase_24 WA -
testcase_25 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.NoSuchElementException;
import java.util.Scanner;
 
 
 
public class Main {
	static int cnt;
	static PrintWriter out = new PrintWriter(System.out);
	static FastScanner sc = new FastScanner();
	static Scanner stdIn = new Scanner(System.in);
	public static void main (String[] args) {
		int n = sc.nextInt();
		int p = 0;
		int m = 0;
		int[] count = new int[10];
		char[] inx = new char[n];
		for(int i = 0; i < n; i++) {
			inx[i] = sc.next().charAt(0);
		}
		for(int i = 0; i < n; i++) {
			char in = inx[i];
			if(in == '+') p++;
			else if(in == '-') m++;
			else count[in - '0']++;
		}
		long[] a = new long[p + m + 1];
		int c = (n - p - p - m - m);
		
		IN:for(int i = 9; i >= 0; i--) {
			while(count[i] > 0) {
				if(c == 0) break IN;
				a[0] *= 10;
				a[0] += i;
				count[i]--;
				c--;
			}
		}
		for(int i = 1; i < a.length; i++) {
			for(int j = 9; j >= 0; j--) {
				if(count[j] == 0) continue;
				a[i] = j;
				count[j]--;
				break;
			}
		}
		long sumA = a[0];
		for(int i = 1; i < a.length; i++) {
			if(p != 0) {
				sumA += a[i];
				p--;
			}
			else {
				sumA -= a[i];
			}
		}
		
		p = 0;
		m = 0;
		count = new int[10];
		for(int i = 0; i < n; i++) {
			char in = inx[i];
			if(in == '+') p++;
			else if(in == '-') m++;
			else count[in - '0']++;
		}
		a = new long[p + m + 1];
		
		c = (n - p - p - m - m);
		
		IN:for(int i = 9; i >= 0; i--) {
			while(count[i] > 0) {
				if(c == 0) break IN;
				a[a.length-1] *= 10;
				a[a.length-1] += i;
				count[i]--;
				c--;
			}
		}
		
		for(int i = 0; i < a.length-1; i++) {
			for(int j = 0; j < 10; j++) {
				if(count[j] == 0) continue;
				a[i] = j;
				count[j]--;
				break;
			}
		}
		long sumB = a[0];
		
		for(int i = 1; i < a.length; i++) {
			if(p != 0) {
				sumB += a[i];
				p--;
			}
			else {
				sumB -= a[i];
			}
		}
		System.out.println(sumA + " " + sumB);
	}
}
 
 
//------------------------------//
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() {
         if (!hasNext()) throw new NoSuchElementException();
         int 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 double nextDouble() {
        return Double.parseDouble(next());
    }
    
 
}
0