結果
問題 | No.2073 Concon Substrings (Swap Version) |
ユーザー | McGregorsh |
提出日時 | 2022-09-16 22:36:59 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,995 bytes |
コンパイル時間 | 232 ms |
コンパイル使用メモリ | 82,236 KB |
実行使用メモリ | 131,472 KB |
最終ジャッジ日時 | 2024-06-01 13:39:47 |
合計ジャッジ時間 | 9,259 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 144 ms
89,540 KB |
testcase_01 | AC | 142 ms
89,612 KB |
testcase_02 | AC | 139 ms
89,648 KB |
testcase_03 | AC | 139 ms
89,568 KB |
testcase_04 | AC | 143 ms
89,344 KB |
testcase_05 | AC | 213 ms
131,472 KB |
testcase_06 | AC | 213 ms
131,304 KB |
testcase_07 | AC | 140 ms
89,176 KB |
testcase_08 | AC | 184 ms
113,484 KB |
testcase_09 | AC | 205 ms
130,912 KB |
testcase_10 | AC | 221 ms
131,088 KB |
testcase_11 | AC | 218 ms
131,376 KB |
testcase_12 | AC | 140 ms
89,624 KB |
testcase_13 | AC | 151 ms
89,876 KB |
testcase_14 | AC | 216 ms
130,780 KB |
testcase_15 | AC | 166 ms
98,636 KB |
testcase_16 | AC | 214 ms
131,368 KB |
testcase_17 | AC | 144 ms
89,524 KB |
testcase_18 | AC | 152 ms
89,732 KB |
testcase_19 | AC | 205 ms
131,428 KB |
testcase_20 | AC | 188 ms
117,096 KB |
testcase_21 | AC | 178 ms
113,448 KB |
testcase_22 | WA | - |
testcase_23 | WA | - |
testcase_24 | WA | - |
testcase_25 | WA | - |
testcase_26 | WA | - |
testcase_27 | WA | - |
testcase_28 | WA | - |
testcase_29 | WA | - |
testcase_30 | WA | - |
testcase_31 | WA | - |
testcase_32 | WA | - |
testcase_33 | WA | - |
testcase_34 | WA | - |
testcase_35 | WA | - |
testcase_36 | WA | - |
testcase_37 | WA | - |
testcase_38 | WA | - |
testcase_39 | WA | - |
testcase_40 | WA | - |
testcase_41 | 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 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 ###関数コピーしたか?### def main(): N = int(input()) S = input() one = [] two = [] three = [] for i in range(3*N): if i % 3 == 0: one.append(S[i]) elif i % 3 == 1: two.append(S[i]) else: three.append(S[i]) onec = one.count('c') oneo = one.count('o') onen = one.count('n') twoc = two.count('c') twoo = two.count('o') twon = two.count('n') threec = three.count('c') threeo = three.count('o') threen = three.count('n') ans = 0 ans += min(onec, twoo, threen) ans += min(twoc, threeo, onen) ans += min(threec, oneo, twon) print(ans) if __name__ == '__main__': main()