結果
問題 | No.717 ファッションへのこだわり |
ユーザー | McGregorsh |
提出日時 | 2023-04-12 14:17:44 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 144 ms / 2,000 ms |
コード長 | 1,851 bytes |
コンパイル時間 | 286 ms |
コンパイル使用メモリ | 82,360 KB |
実行使用メモリ | 90,160 KB |
最終ジャッジ日時 | 2024-04-17 03:08:59 |
合計ジャッジ時間 | 2,928 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 138 ms
89,420 KB |
testcase_01 | AC | 143 ms
89,568 KB |
testcase_02 | AC | 142 ms
89,216 KB |
testcase_03 | AC | 139 ms
89,540 KB |
testcase_04 | AC | 141 ms
89,216 KB |
testcase_05 | AC | 138 ms
89,600 KB |
testcase_06 | AC | 143 ms
89,984 KB |
testcase_07 | AC | 142 ms
89,856 KB |
testcase_08 | AC | 142 ms
89,984 KB |
testcase_09 | AC | 143 ms
89,844 KB |
testcase_10 | AC | 144 ms
90,160 KB |
testcase_11 | AC | 142 ms
89,856 KB |
testcase_12 | AC | 141 ms
89,600 KB |
ソースコード
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 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 ###N以下の素数列挙### import math def sieve_of_eratosthenes(n): prime = [True for i in range(n+1)] prime[0] = False prime[1] = False sqrt_n = math.ceil(math.sqrt(n)) for i in range(2, sqrt_n+1): if prime[i]: for j in range(2*i, n+1, i): prime[j] = False return prime def main(): N, M = i_map() S = list(input()) T = list(input()) cou1 = Counter(S) cou2 = Counter(T) print(min(cou1['A'], cou2['A']) + min(cou1['B'], cou2['B'])) if __name__ == '__main__': main()