結果

問題 No.2073 Concon Substrings (Swap Version)
ユーザー McGregorshMcGregorsh
提出日時 2022-09-16 22:36:59
言語 PyPy3
(7.3.15)
結果
WA  
実行時間 -
コード長 1,995 bytes
コンパイル時間 662 ms
コンパイル使用メモリ 86,944 KB
実行使用メモリ 132,388 KB
最終ジャッジ日時 2023-08-23 16:12:22
合計ジャッジ時間 13,546 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 238 ms
92,344 KB
testcase_01 AC 233 ms
92,304 KB
testcase_02 AC 230 ms
92,304 KB
testcase_03 AC 229 ms
92,340 KB
testcase_04 AC 230 ms
92,400 KB
testcase_05 AC 298 ms
132,268 KB
testcase_06 AC 293 ms
132,232 KB
testcase_07 AC 229 ms
92,344 KB
testcase_08 AC 270 ms
115,056 KB
testcase_09 AC 279 ms
122,280 KB
testcase_10 AC 297 ms
132,312 KB
testcase_11 AC 300 ms
131,980 KB
testcase_12 AC 231 ms
92,412 KB
testcase_13 AC 236 ms
93,108 KB
testcase_14 AC 293 ms
126,716 KB
testcase_15 AC 253 ms
102,956 KB
testcase_16 AC 296 ms
132,188 KB
testcase_17 AC 237 ms
92,332 KB
testcase_18 AC 237 ms
93,172 KB
testcase_19 AC 295 ms
132,388 KB
testcase_20 AC 275 ms
118,476 KB
testcase_21 AC 272 ms
115,396 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 -
権限があれば一括ダウンロードができます

ソースコード

diff # 

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()
0