#849354 (PyPy3) No.2073 Concon Substrings (Swap Version)

• 問題: No.2073 Concon Substrings (Swap Version)
• ユーザー: buey_t
• 提出日時: 2023-03-15 17:25:43
• 言語: PyPy3 (7.3.15)
• 結果: WA
• 実行時間: -
• コード長: 2,340 bytes
• コンパイル時間: 206 ms
• コンパイル使用メモリ: 82,244 KB
• 実行使用メモリ: 119,268 KB
• 最終ジャッジ日時: 2024-09-18 08:49:08
• 合計ジャッジ時間: 8,613 ms
• ジャッジサーバーID （参考情報）: judge1 / judge4

ファイルパターン	結果
sample	AC * 5
other	AC * 29 WA * 8

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
def main():
    try:
        import pypyjit
        pypyjit.set_param('max_unroll_recursion=-1')
    except:
        pass
    try:
        import sys
        sys.setrecursionlimit(10**7)
    except:
        pass
    from math import sqrt,sin,cos,tan,ceil,radians,floor,gcd,exp,log,log10,log2,factorial,fsum
    from heapq import heapify, heappop, heappush
    from bisect import bisect_left, bisect_right
    from copy import deepcopy
    import copy
    import random
    from collections import deque,Counter,defaultdict
    from itertools import permutations,combinations
    from decimal import Decimal,ROUND_HALF_UP
    #tmp = Decimal(mid).quantize(Decimal('0'), rounding=ROUND_HALF_UP)
    from functools import lru_cache, reduce
    #@lru_cache(maxsize=None)
    from operator import add,sub,mul,xor,and_,or_,itemgetter
    INF = 10**18
    mod1 = 10**9+7
    mod2 = 998244353
    
    #DecimalならPython
    
    
    '''
    これもスワップか
    3で割った余りみたいなのが大事そう
    回数の最小値はいらないから
    %3 = 0
    %3 = 1
    %3 = 2
    でc,o,nの数数えて
    それの最小のやつ
    
    concononc で落ちる
    猶予がないとダメって感じか
    '''
    
    N = int(input())
    S = list(input())
    
    c0 = 0
    o0 = 0
    n0 = 0
    for i in range(0,3*N,3):
        if S[i] == 'c':
            c0 += 1
        elif S[i] == 'o':
            o0 += 1
        elif S[i] == 'n':
            n0 += 1
    
    c1 = 0
    o1 = 0
    n1 = 0
    for i in range(1,3*N,3):
        if S[i] == 'c':
            c1 += 1
        elif S[i] == 'o':
            o1 += 1
        elif S[i] == 'n':
            n1 += 1
    
    c2 = 0
    o2 = 0
    n2 = 0
    for i in range(2,3*N,3):
        if S[i] == 'c':
            c2 += 1
        elif S[i] == 'o':
            o2 += 1
        elif S[i] == 'n':
            n2 += 1
    
    a = min(c0,o1,n2)
    b = min(o0,n1,c2)
    c = min(n0,c1,o2)
    
    ls = [a,b,c]
    ls.sort()
    if ls[0] == ls[1] == 0:
        print(ls[2])
    else:
        if (a+b+c)*3+2 > 3*N:
            print(a+b+c-1)
        else:
            print(a+b+c)
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
if __name__ == '__main__':
    main()
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX