結果
問題 | No.297 カードの数式 |
ユーザー | McGregorsh |
提出日時 | 2023-06-08 23:06:22 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,298 bytes |
コンパイル時間 | 293 ms |
コンパイル使用メモリ | 86,908 KB |
実行使用メモリ | 92,456 KB |
最終ジャッジ日時 | 2023-08-30 02:05:45 |
合計ジャッジ時間 | 8,584 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 243 ms
91,700 KB |
testcase_01 | AC | 244 ms
91,424 KB |
testcase_02 | AC | 246 ms
91,500 KB |
testcase_03 | AC | 243 ms
91,780 KB |
testcase_04 | AC | 245 ms
91,756 KB |
testcase_05 | AC | 241 ms
91,436 KB |
testcase_06 | WA | - |
testcase_07 | AC | 241 ms
91,688 KB |
testcase_08 | AC | 238 ms
91,732 KB |
testcase_09 | AC | 238 ms
91,248 KB |
testcase_10 | AC | 241 ms
91,692 KB |
testcase_11 | WA | - |
testcase_12 | AC | 237 ms
91,536 KB |
testcase_13 | WA | - |
testcase_14 | WA | - |
testcase_15 | AC | 239 ms
91,544 KB |
testcase_16 | WA | - |
testcase_17 | WA | - |
testcase_18 | AC | 244 ms
91,260 KB |
testcase_19 | WA | - |
testcase_20 | WA | - |
testcase_21 | WA | - |
testcase_22 | AC | 241 ms
91,524 KB |
testcase_23 | WA | - |
testcase_24 | WA | - |
testcase_25 | WA | - |
ソースコード
import sys, re from fractions import Fraction from math import ceil, floor, sqrt, pi, factorial, gcd from copy import deepcopy from collections import Counter, deque, defaultdict from heapq import heapify, heappop, heappush from itertools import accumulate, product, combinations, combinations_with_replacement, permutations from bisect import bisect, bisect_left, bisect_right from functools import reduce, lru_cache from decimal import Decimal, getcontext, ROUND_HALF_UP def i_input(): return int(input()) def i_map(): return map(int, input().split()) def i_list(): return list(i_map()) def i_row(N): return [i_input() for _ in range(N)] def i_row_list(N): return [i_list() for _ in range(N)] def s_input(): return input() def s_map(): return input().split() def s_list(): return list(s_map()) def s_row(N): return [s_input for _ in range(N)] def s_row_str(N): return [s_list() for _ in range(N)] def s_row_list(N): return [list(s_input()) for _ in range(N)] def lcm(a, b): return a * b // gcd(a, b) def get_distance(x1, y1, x2, y2): d = sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2) return d def rotate(table): n_fild = [] for x in zip(*table[::-1]): n_fild.append(x) return n_fild sys.setrecursionlimit(10 ** 7) INF = float('inf') MOD = 10 ** 9 + 7 MOD2 = 998244353 alpa = 'abcdefghijklmnopqrstuvwxyz' ALPA = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' #input = sys.stdin.readline def main(): N = int(input()) C = s_list() nums = [] pcou = 0 mcou = 0 for i in range(N): if C[i] == '+': pcou += 1 elif C[i] == '-': mcou += 1 else: nums.append(C[i]) nums.sort(reverse=True) amari = N - pcou - mcou base = '' for i in range(amari-pcou-mcou): base += nums[i] nums = nums[amari-pcou-mcou:] base = int(base) maxans = deepcopy(base) for i in range(pcou+mcou): if i < pcou: maxans += int(nums[i]) else: maxans -= int(nums[i]) nums.sort() minans = int(nums[0]) for i in range(1, pcou+mcou): if i < pcou: minans += int(nums[i]) else: minans -= int(nums[i]) if mcou > 0: minans -= base else: minans += base print(maxans, minans) if __name__ == '__main__': main()