結果
問題 | No.297 カードの数式 |
ユーザー | threepipes_s |
提出日時 | 2015-11-06 22:39:43 |
言語 | Java21 (openjdk 21) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,985 bytes |
コンパイル時間 | 3,148 ms |
コンパイル使用メモリ | 89,576 KB |
実行使用メモリ | 53,240 KB |
最終ジャッジ日時 | 2024-09-13 13:20:28 |
合計ジャッジ時間 | 5,905 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 75 ms
51,132 KB |
testcase_01 | AC | 75 ms
51,264 KB |
testcase_02 | WA | - |
testcase_03 | AC | 74 ms
50,956 KB |
testcase_04 | WA | - |
testcase_05 | AC | 79 ms
51,124 KB |
testcase_06 | WA | - |
testcase_07 | WA | - |
testcase_08 | WA | - |
testcase_09 | AC | 75 ms
51,012 KB |
testcase_10 | WA | - |
testcase_11 | WA | - |
testcase_12 | WA | - |
testcase_13 | WA | - |
testcase_14 | WA | - |
testcase_15 | WA | - |
testcase_16 | WA | - |
testcase_17 | AC | 75 ms
51,080 KB |
testcase_18 | WA | - |
testcase_19 | WA | - |
testcase_20 | WA | - |
testcase_21 | WA | - |
testcase_22 | AC | 81 ms
51,188 KB |
testcase_23 | WA | - |
testcase_24 | WA | - |
testcase_25 | WA | - |
ソースコード
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; i++){ val += num.get(i); } long tmp = 0; for(int i=min+plus; i<num.size(); i++){ tmp *= 10; tmp += num.get(i); } System.out.print((val+tmp)+" "); val = 0; for(int i=0; i<plus; i++){ val += num.get(i); } for(int i=plus; i<min+plus; i++){ val -= num.get(i); } tmp = 0; for(int i=min+plus; i<num.size(); i++){ tmp*=10; tmp += 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());} }