Problem:


Score : 300 points

Problem Statement

Takahashi participated in a contest on AtCoder.

The contest had N problems.

Takahashi made M submissions during the contest.

The i-th submission was made for the p_i-th problem and received the verdict S_i (AC or WA).

The number of Takahashi's correct answers is the number of problems on which he received an AC once or more.

The number of Takahashi's penalties is the sum of the following count for the problems on which he received an AC once or more: the number of WAs received before receiving an AC for the first time on that problem.

Find the numbers of Takahashi's correct answers and penalties.

Constraints

N, M, and p_i are integers.

1 \leq N \leq 10^5

0 \leq M \leq 10^5

1 \leq p_i \leq N

S_i is AC or WA.

Input

Input is given from Standard Input in the following format:

N M
p_1 S_1
:
p_M S_M

Output

Print the number of Takahashi's correct answers and the number of Takahashi's penalties.

Sample Input 1

2 5
1 WA
1 AC
2 WA
2 AC
2 WA

Sample Output 1

2 2

In his second submission, he received an AC on the first problem for the first time. Before this, he received one WA on this problem.

In his fourth submission, he received an AC on the second problem for the first time. Before this, he received one WA on this problem.

Thus, he has two correct answers and two penalties.

Sample Input 2

100000 3
7777 AC
7777 AC
7777 AC

Sample Output 2

1 0

Note that it is pointless to get an AC more than once on the same problem.

Sample Input 3

6 0

Sample Output 3

0 0



Sample input:
2 5
1 WA
1 AC
2 WA
2 AC
2 WA


Sample output:
2 2

Submission status: Accepted

Solution code:
def main(sample_file = ''):

    """ convenient functions
    # for i, a in enumerate(iterable)
    # q, mod = divmod(a, b)
    # divmod(x, y) returns the tuple (x//y, x%y)
    # Higher-order function: reduce(operator.mul, xyz_count, 1)
    # manage median(s) using two heapq https://atcoder.jp/contests/abc127/tasks/abc127_f
    """

    """convenient decorator
    # @functools.lru_cache():
    # to facilitate use of recursive function
        # ex:
        # from functools import lru_cache
        # import sys
        # sys.setrecursionlimit(10**9)
        # @lru_cache(maxsize=None)
        # def fib(n):
        #     if n < 2:
        #         return n
        #     return fib(n-1) + fib(n-2)
        # print(fib(1000))
    """
    
    # import numpy as np
    import sys
    sys.setrecursionlimit(10**7)
    from itertools import accumulate, combinations, permutations, product # https://docs.python.org/ja/3/library/itertools.html
    # accumulate() returns iterator! to get list: list(accumulate())
    from math import factorial, ceil, floor, sqrt
    def factorize(n):
        """return the factors of the Arg and count of each factor
        
        Args:
            n (long): number to be resolved into factors
        
        Returns:
            list of tuples: factorize(220) returns [(2, 2), (5, 1), (11, 1)]
        """
        fct = []  # prime factor
        b, e = 2, 0  # base, exponent
        while b * b <= n:
            while n % b == 0:
                n = n // b
                e = e + 1
            if e > 0:
                fct.append((b, e))
            b, e = b + 1, 0
        if n > 1:
            fct.append((n, 1))
        return fct
    def combinations_count(n, r):
        """Return the number of selecting r pieces of items from n kinds of items.
        
        Args:
            n (long): number
            r (long): number
        
        Raises:
            Exception: not defined when n or r is negative
        
        Returns:
            long: number
        """
        # TODO: How should I do when n - r is negative?
        if n < 0 or r < 0:
            raise Exception('combinations_count(n, r) not defined when n or r is negative')
        if n - r < r: r = n - r
        if r < 0: return 0
        if r == 0: return 1
        if r == 1: return n
        numerator = [n - r + k + 1 for k in range(r)]
        denominator = [k + 1 for k in range(r)]
        for p in range(2,r+1):
            pivot = denominator[p - 1]
            if pivot > 1:
                offset = (n - r) % p
                for k in range(p-1,r,p):
                    numerator[k - offset] /= pivot
                    denominator[k] /= pivot
        result = 1
        for k in range(r):
            if numerator[k] > 1:
                result *= int(numerator[k])
        return result
    def combinations_with_replacement_count(n, r):
        """Return the number of selecting r pieces of items from n kinds of items allowing individual elements to be repeated more than once.
        
        Args:
            n (long): number
            r (long): number
        
        Raises:
            Exception: not defined when n or r is negative
        
        Returns:
            long: number
        """
        if n < 0 or r < 0:
            raise Exception('combinations_with_replacement_count(n, r) not defined when n or r is negative')
        elif n == 0:
            return 1
        else:
            return combinations_count(n + r - 1, r)
    from bisect import bisect_left, bisect_right
    from collections import deque, Counter, defaultdict # https://docs.python.org/ja/3/library/collections.html#collections.deque
    from heapq import heapify, heappop, heappush, heappushpop, heapreplace,nlargest,nsmallest # https://docs.python.org/ja/3/library/heapq.html
    from copy import deepcopy, copy # https://docs.python.org/ja/3/library/copy.html
    import operator
    from operator import itemgetter #sort 
    # ex1: List.sort(key=itemgetter(1))
    # ex2: sorted(tuples, key=itemgetter(1,2))
    from functools import reduce, lru_cache
    def chmin(x, y):
        """change minimum
        if x > y, x = y and return (x, True).
        convenient when solving problems of dp[i]
        
        Args:
            x (long): current minimum value
            y (long): potential minimum value
        
        Returns:
            (x, bool): (x, True) when updated, else (x, False)
        """
        if x > y:
            x = y
            return (x, True)
        else:
            return (x, False)
    def chmax(x, y):
        """change maximum
        if x < y, x = y and return (x, True).
        convenient when solving problems of dp[i]
        
        Args:
            x (long): current maximum value
            y (long): potential maximum value
        
        Returns:
            (x, bool): (x, True) when updated, else (x, False)
        """
        if x < y:
            x = y
            return (x, True)
        else:
            return (x, False)

    from fractions import gcd # Deprecated since version 3.5: Use math.gcd() instead.
    def gcds(numbers):
        return reduce(gcd, numbers)
    def lcm(x, y):
        return (x * y) // gcd(x, y)
    def lcms(numbers):
        return reduce(lcm, numbers, 1)
    def make_divisors(n, reversed=False):
        """create list of divisors
        
        Args:
            number (int): number from which list of divisors is created
            reversed (bool, optional): ascending order if False. Defaults to False.
        
        Returns:
            list: list of divisors
        """
        divisors = set()
        for i in range(1, int(n**0.5)+1):
            if n % i == 0:
                divisors.add(i)
                divisors.add(n//i)
        return sorted(list(divisors),reverse=reversed)
    
    # first create factorial_list
    # fac_list = mod_factorial_list(n)
    INF = 10 ** 18
    MOD = 10 ** 9 + 7
    modpow = lambda a, n, p = MOD: pow(a, n, p) # Recursive function in python is slow!
    def modinv(a, p = MOD):
        # evaluate reciprocal using Fermat's little theorem:
        # a**(p-1) is identical to 1 (mod p) when a and p is coprime
        return modpow(a, p-2, p)
    def modinv_list(n, p = MOD):
        if n <= 1:
            return [0,1][:n+1]
        else:
            inv_t = [0,1]
            for i in range(2, n+1):
                inv_t += [inv_t[p % i] * (p - int(p / i)) % p]
            return inv_t
    def modfactorial_list(n, p = MOD):
        if n == 0:
            return [1]
        else:
            l = [0] * (n+1)
            tmp = 1
            for i in range(1, n+1):
                tmp = tmp * i % p
                l[i] = tmp
            return l
    def modcomb(n, k, fac_list = [], p = MOD):
        # fac_list = modfactorial_list(100)
        # print(modcomb(100, 5, modfactorial_list(100)))
        from math import factorial
        if n < 0 or k < 0 or n < k: return 0
        if n == 0 or k == 0: return 1
        if len(fac_list) <= n:
            a = factorial(n) % p
            b = factorial(k) % p
            c = factorial(n-k) % p
        else:
            a = fac_list[n]
            b = fac_list[k]
            c = fac_list[n-k]
        return (a * modpow(b, p-2, p) * modpow(c, p-2, p)) % p
    def modadd(a, b, p = MOD):
        return (a + b) % MOD
    def modsub(a, b, p = MOD):
        return (a - b) % p
    def modmul(a, b, p = MOD):
        return ((a % p) * (b % p)) % p
    def moddiv(a, b, p = MOD):
        return modmul(a, modpow(b, p-2, p))

    class UnionFindTree:
        """union find tree class
        TODO: fix this description...
        how to use (example):
        >>  uf = UnionFindTree(N) 
        >>  if uf.find_root(a) == uf.find_root(b):
        >>      do something
        >>  else:
        >>      do something
        >>      uf.unite(a, b)
        """
        def __init__(self, N):
            self.root = [-1] * (N+1)
            self.rank   = [0]  * (N+1)
            self.connected_num = [1] * (N+1)
    
        def find_root(self,x):
            root = self.root
            while root[x] != -1:
                x = root[x]
            return x
    
        def unite(self,x,y):
            root = self.root
            rank = self.rank
            connected_num = self.connected_num
            find_root = self.find_root
    
            rx = find_root(x)
            ry = find_root(y)
            if rx != ry:
                if rank[rx] < rank[ry]:
                    root[rx] = ry
                    rx,ry = ry,rx
                else:
                    if rank[rx] == rank[ry]:
                        rank[rx] += 1
                    root[ry] = rx       
                connected_num[rx] += connected_num[ry]

    # Graph: https://en.wikipedia.org/wiki/Directed_graph
    # Bellman-Ford: O(|V||E|). Use this if there exists an edge with negative length in the graph
    # After N steps, the shortest path has converded if there doesn't exist an cycle of edges with negative
    # Watch out: d[N] == d[2*N] doesn't necessarily mean the graph doesn't have negative cycle
    # ref: https://www.youtube.com/watch?v=1Z6ofKN03_Y

    def BellmanFord(N, M, ABC, vertex_start, vertex_end, value_if_inf = -1, find_shortest = False):
        """to calculate furthest or shortest length between vertex_start and vertex_end using BellmanFord algorithm
        
        Args:
            N (int): number of vertices
            M (int): number of edges
            ABC (list): [(ai, bi, ci) for _ in range(N)] where i-th edge is directed from vertex ai to vertex bi and the length is ci 
            vertex_start (int): start vertex. usually use 0.
            vertex_end (int): end vertex. usually use N-1.
            value_if_inf (int or string as you like, optional): value you want when the furthest (or shortest) distance is infinite (or -infinite). Defaults to -1.
            find_shortest (bool, optional): choose False to find furthest path. Defaults to False.
        
        Returns:
            int or string: normally int (but can be str if you set value_if_inf to str)
            
        Example:
                N, M, P = R()
                ABC = [R() for _ in range(M)]
                ABC = [(a-1, b-1, c-P) for a, b, c in ABC]
                print(BellmanFord(N, M, ABC, 0, N-1, value_if_inf = 'inf'))

        """

        def make_reachable_list(N, M, ABC, vertex_start, vertex_end):
            reachable_to_direct = defaultdict(list)
            reachable_from_direct = defaultdict(list)
            reachable_from_start = [False] * N
            reachable_to_end = [False] * N
            reachable_from_start[vertex_start] = True
            reachable_to_end[vertex_end] = True
            reachable_from_both_sides = [False] * N
            dfs_from_start = []
            dfs_to_end = []
            for a, b, c in ABC:
                reachable_to_direct[a].append(b)
                reachable_from_direct[b].append(a)
                if a == vertex_start:
                    dfs_from_start.append(b)
                    reachable_from_start[b] = True
                if b == vertex_end:
                    dfs_to_end.append(a)
                    reachable_to_end[a] = True
            while dfs_from_start:
                v = dfs_from_start.pop()
                for i in reachable_to_direct[v]:
                    if not reachable_from_start[i]:
                        reachable_from_start[i] = True
                        dfs_from_start.append(i)
            while dfs_to_end:
                v = dfs_to_end.pop()
                for i in reachable_from_direct[v]:
                    if not reachable_to_end[i]:
                        reachable_to_end[i] = True
                        dfs_to_end.append(i)
            for i in range(N):
                reachable_from_both_sides[i] = reachable_from_start[i] and reachable_to_end[i]
            return reachable_from_both_sides
        
        reachable_from_both_sides = make_reachable_list(N, M, ABC, vertex_start, vertex_end)
        
        if find_shortest:
            dist = [INF for i in range(N)]
        else:
            dist = [-INF for i in range(N)]
        
        dist[vertex_start] = 0
        for i in range(N):
            updated = False
            for a, b, c in ABC:
                if not reachable_from_both_sides[a]:
                    continue
                elif find_shortest:
                    update_condition = dist[a] + c < dist[b]
                else:
                    update_condition = dist[a] + c > dist[b]
                if dist[a] != INF and update_condition:
                    dist[b] = dist[a] + c
                    updated = True
                    if i == N-1:
                        return value_if_inf
            if not updated:
                break
        return dist[vertex_end]

    """ initialize variables and set inputs
    # initialize variables
        # to initialize list, use [0] * n
        # to initialize two dimentional array:
            # ex) [[0] * N for _ in range(N)]
            # ex2) dp = [[0] * (N+1) for _ in range(W*2)]
    # set inputs
        # put inputs between specific values (almost as quickly)
        # ex) S = [-INF] + [int(r()) for _ in range(A)] + [INF]
        # open(0).read() is sometimes useful:
        # ex) n, m, *x = map(int, open(0).read().split())
        #     min(x[::2]) - max(x[1::2])
        # ex2) *x, = map(int, open(0).read().split())
        #     don't forget to add comma after *x if only one variable is used
    # preprocessing
        # transpose = [x for x in zip(*data)]
        # ex) [[1, 2, 3], [4, 5, 6], [7, 8, 9]] => [(1, 4, 7), (2, 5, 8), (3, 6, 9)]
        # flat = [flatten for inner in data for flatten in inner]
        # ex) [[1, 2, 3], [4, 5, 6], [7, 8, 9]] => [1, 2, 3, 4, 5, 6, 7, 8, 9]
    # calculate and output
        # output pattern
        # ex1) print(*l) => when l = [2, 5, 6], printed 2 5 6
    """

    # functions to read input
    r = lambda: sys.stdin.readline().strip()
    r_int = lambda: int(r())
    r_float = lambda: float(r())
    R = lambda: list(map(int, r().split()))
    R_str = lambda: r().split()
    R_map = lambda: map(int, r().split())
    R_float = lambda: list(map(float, r().split()))
    R_tuple = lambda: tuple(map(int, r().split()))

    """ how to treat input
    # single int: int(r())
    # single string: r()
    # single float: float(r())
    # line int: R()
    # line string: r().split()
    # line (str, int, int): [j if i == 0 else int(j) for i, j in enumerate(r().split())]
    # lines int: [R() for _ in range(n)]
    """

    # for test
    if sample_file:
        sys.stdin = open(sample_file)
        
    # ----------------------------------
    # main

    N, M = R()
    PS = [R_str() for _ in range(M)]
    l = [0] * N
    cnt = [0] * N
    cnt_a = 0
    ans = 0
    for i, (pp, s) in enumerate(PS):
        p = int(pp) - 1
        if l[p] == 1:
            continue
        else:
            if s == 'WA':
                cnt[p] += 1
            else:
                l[p] = 1
                cnt_a += cnt[p]
                ans += 1
    print(ans, cnt_a)
    
    # to finish code, use return instead of exit()
    # end of main
    # ----------------------------------

    """memo: how to use defaultdict of list
    # initialize
    Dic = defaultdict(list)
    # append / extend
    Dic[x].append(y)
    # three methods for loop: keys(), values(), items()
    for k, v in Dic.items():
    """
    
    """memo: how to solve binary problems
    # to make binary digits text
    >>> a = 5
    >>> bin_str_a = format(a, '#06b')
    >>> print(bin_str_a)
    0b0101 # first 2 strings (='0b') indicates it is binary
    """
    
    """memo: how to solve the problem
    creating simple test/answer
    greed
    simple dp
    graph
    """

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
n, m = map(int, input().split())
a = [False] * (n+1)
b = [0] * (n+1)

ac = 0
wa = 0
for i in range(m):
  p,s = input().split()
  p = int(p)
  
  if (not a[p]) and s == "WA":
    b[p] += 1
  elif (not a[p]) and s == "AC":
    ac += 1
    wa += b[p]
    a[p] = True
    
    
print(ac,wa)

Submission status: Accepted

Solution code:
N,M=map(int,input().split())

ps_dic={}
for i in range(M):
  pi,si=input().split()
  if pi not in ps_dic:
    ps_dic[pi]=[si]
  else:
    ps_dic[pi].append(si)
  
#print(ps_dic)
total_ac=0
total_wa=0
for p in ps_dic:
  num_wa=0
  for s in ps_dic[p]:
    if s == "WA":
      num_wa+=1
    elif s == "AC":
      total_ac+=1
      total_wa+=num_wa
      break

print(str(total_ac) + " " + str(total_wa))

Submission status: Accepted

Solution code:

def main():
    N,M = map(int,input().split())
    P,S = [],[]
    for _ in range(M):
        p,s = map(str,input().split())
        p = int(p)
        P.append(p)
        S.append(s)
    AC = [0 for i in range(N+1)]
    for i in range(M):
        if S[i]=="AC" and AC[P[i]]==0:
            AC[P[i]] += 1
        else:
            pass
    
    WA = [0 for i in range(N+1)]
    WA_flg = [ False for _ in range(N+1)]
    for i in range(M):
        if AC[P[i]]==0:
            pass
        else:
            if WA_flg[P[i]]==True:
                pass
            else:
                if S[i] == "AC":
                    WA_flg[P[i]]=True
                else:
                    WA[P[i]] += 1

    print(sum(AC),end=" ")
    print(sum(WA))

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
n,m = map(int,input().split())
ac = [0 for i in range(n)]
wa = [0 for i in range(n)]
a = 0
b = 0
for i in range(m):
  s,t = map(str,input().split())
  if ac[int(s)-1] == 0:
    if t == "AC":
      a += 1
      ac[int(s)-1] = 1
    else:
      b += 1
      wa[int(s)-1] += 1
for i in range(n):
  if ac[i] == 0:
    b -= wa[i]
print(a,b)

Submission status: Accepted

Solution code:
N,M = map(int,input().split())
C = {str(i):[0,0] for i in range(1,N+1)}
for _ in range(M):
    p,s = input().split()
    if s == "AC":
        if C[p][0]==0:
            C[p][0] = 1
    else:
        if C[p][0]==0:
            C[p][1] += 1
A = [0,0]
for i in range(1,N+1):
    if C[str(i)][0]==1:
        A[0] += 1
        A[1] += C[str(i)][1]
print(*A)

Submission status: Accepted

Solution code:
n,m=map(int,input().split())
sub=[tuple(input().split()) for j in range(m)]
ac=[False for i in range(n)]
wa=[0 for i in range(n)]
for p,s in sub:
    p=int(p)
    if s=='AC':
        ac[p-1]=True
    else:
        if ac[p-1]==False:
            wa[p-1]+=1
# print(ac)
# print(wa)
ans=0
pena=0
for AC,WA in zip(ac,wa):
    if AC:
        ans+=1
        pena+=WA
print(ans,pena)

Submission status: Accepted

Solution code:
n, m = map(int, input().split())
is_ac = [False] * 200050
count_wa = [0] * 100050
numok = 0
numwa = 0
for i in range(m):
    p, s = input().split()
    p = int(p)
    if is_ac[p]: # すでに正解
        continue
    else: # 未正解
        if s == "AC":
            numok += 1
            is_ac[p] = True
        else:
            count_wa[p] += 1
for i in range(100040):
    if is_ac[i]:
        numwa += count_wa[i]
print("{0} {1}".format(numok, numwa))

Submission status: Accepted

Solution code:


def main():
    N, M = map(int, input().split())

    was = [0 for _ in range(N)]
    acs = [False for _ in range(N)]

    for _ in range(M):
        p, s = input().split()
        p = int(p) - 1
        if s == 'AC':
            acs[p] = True
        elif not acs[p]:
            was[p] += 1

    ans, pen = 0, 0
    for s, c in zip(acs, was):
        if s:
            ans += 1
            pen += c

    print(ans, pen)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
n,m=map(int,input().split())
ac = 0
wa = 0
ac_list = [0]*n
wa_list = [0]*n

for _ in range(m):
    p,s=input().split()
    p = int(p) - 1
    if ac_list[p] == 'AC': continue
    ac_list[p] = s
    if s == 'AC':
        ac += 1
        wa += wa_list[p]
    else:
        wa_list[p] += 1
print(ac,wa)

Submission status: Accepted

Solution code:
n, m = map(int, input().split(" "))

count = [0 for x in range(0, n)]
ac_list = set()
ans_ac = 0
ans_pn = 0
for i in range(0, m):
    ps, s = input().split(" ")
    ps = int(ps)

    if s == "AC":
        if ps not in ac_list:
            ans_pn += count[ps - 1]
            ans_ac += 1
            ac_list.add(ps)

    else:  # WA
        count[ps - 1] += 1

print("%d %d" % (ans_ac, ans_pn))

Submission status: Accepted

Solution code:
n,m = map(int,input().split())
pen_list = [0 for i in range(n)]
pen_num = 0
ans_num = 0
for i in range(m):
    p, s = input().split()
    p = int(p)
    if s == 'WA':
        if pen_list[p-1] != -1:
            pen_list[p-1] += 1
    else:
        if pen_list[p - 1] != -1:
            pen_num = pen_num + pen_list[p-1]
            pen_list[p-1] = -1
            ans_num = ans_num + 1
print(ans_num, pen_num)

Submission status: Accepted

Solution code:
def main():
    n,m = map(int,input().split())
    tf = [False]*n
    pnl = [0]*n
    for i in range(m):
        p,s = input().split()
        p = int(p)-1
        if tf[p] is False:
            if s == "WA":
                pnl[p] += 1
            else:
                tf[p] = True
    ac = sum(tf)
    wa_sum = 0
    for i,j in zip(pnl,tf):
        if j:
            wa_sum += i
    print(str(ac)+" "+str(wa_sum))
    
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
N, M = map(int, input().split())

accepted = [False] * N
temp_p = [0] * N
p = 0
for i in range(M):
    pi, Si = input().split()
    pi = int(pi) - 1
    if not accepted[pi]:
        if Si == 'AC':
            p += temp_p[pi]
            accepted[pi] = True
        else:
            temp_p[pi] += 1
print(accepted.count(True), p)

Submission status: Accepted

Solution code:
N, M = map(int, input().split())
wrongnumber = [0] * N
ACset = set()
for i in range(M):
    p, S = input().split()
    if S == "AC":
        ACset.add(int(p)-1)
    else:
        if (int(p) - 1) not in ACset:
            wrongnumber[int(p) - 1] += 1
WAnumber = 0
ACnumber = len(ACset)
for j in ACset:
    WAnumber += wrongnumber[j]

print(ACnumber, WAnumber)

Submission status: Accepted

Solution code:
n, m = map(int, input().split())

n_ac = [0] * n
n_wa = [0] * n
for i in range(m):
    p, s = input().split()
    p = int(p) - 1

    if s == 'AC':
        n_ac[p] += 1
    elif n_ac[p] == 0:
        n_wa[p] += 1

ans1 = ans2 = 0
for i in range(n):
    if n_ac[i] > 0:
        ans1 += 1
        ans2 += n_wa[i]

print(ans1, ans2)

Submission status: Accepted

Solution code:
import sys
def I(): return int(sys.stdin.readline())
def LI(): return [int(x) for x in sys.stdin.readline().split()]

def main():
    N,M = LI()
    WA = [0] * N
    AC = [False] * N

    for _ in range(M):
        P,S = input().split()
        p = int(P)-1
        if S == 'AC':
            AC[p] = True
        if not(AC[p]):
            WA[p] += 1

    for i in range(N):
        if not(AC[i]):
            WA[i] = 0
    print(sum(AC),sum(WA))


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
N, M = map(int, input().split())

ac_set = set()
wa_lst = [0] * (N + 1)  # 1~Nを使う
wa_sum = 0
for _ in range(M):
    p, s = input().split()
    p = int(p)
    if s == 'AC':
        if p not in ac_set:
            ac_set.add(p)
            wa_sum += wa_lst[p]
    else:
        wa_lst[p] += 1

print(len(ac_set), wa_sum)

Submission status: Accepted

Solution code:
N, M = map(int, input().split())
AC, WA = [0]*(N+1), [0]*(N+1)
for _ in range(M):
    p, S = input().split()
    if AC[int(p)] == 0:
        if S == 'AC':
            AC[int(p)] = 1
        else:
            WA[int(p)] += 1

ac, wa = 0, 0
for i in range(N+1):
    ac += AC[i]
    wa += AC[i] * WA[i]
print(ac, wa)

Submission status: Accepted

Solution code:
import numpy as np
N, M = map(int, input().split())

succ = [0] * N
fail = [0] * N

for i in range(M):
    p, S = input().split()
    p = int(p) - 1

    if S == 'AC':
        succ[p] = 1
    else:
        if succ[p] == 0:
            fail[p] += 1


succ = np.array(succ)
fail = np.array(fail) * succ

print(succ.sum(), fail.sum())

Submission status: Accepted

Solution code:
import os
import sys

import numpy as np

if os.getenv("LOCAL"):
    sys.stdin = open("_in.txt", "r")

sys.setrecursionlimit(10 ** 9)
INF = float("inf")
IINF = 10 ** 18
MOD = 10 ** 9 + 7
# MOD = 998244353

N, M = list(map(int, sys.stdin.buffer.readline().split()))
PS = [sys.stdin.buffer.readline().decode().rstrip().split() for _ in range(M)]

ac = np.zeros(N + 1, dtype=int)
wa = np.zeros(N + 1, dtype=int)

for p, s in PS:
    p = int(p)
    if s == 'AC':
        ac[p] = 1
    if s == 'WA':
        if ac[p]:
            continue
        wa[p] += 1
print(ac.sum(), wa[ac > 0].sum())

Submission status: Accepted

Solution code:
N,M=map(int,input().split())

ans=0
pen=0
answered=set()
tp=[0]*(10**5+10)

for _ in range(M):
    P,S=input().split()
    p=int(P)
    if not p in answered:
        if S=='WA':
            tp[p]+=1
        elif S=='AC':
            answered.add(p)
            ans+=1
            pen+=tp[p]

print(ans,pen)

Submission status: Accepted

Solution code:
from collections import defaultdict

n, m = map(int, input().split())
ps = []
p = []
s = []
for i in range(m):
    p_, s_ = input().split()
    p.append(int(p_))
    s.append(str(s_))

ac = 0
pen = 0
d = defaultdict(int)
for p_, s_ in zip(p, s):
    if s_ == "WA":
        if d[p_] != -1:
            d[p_] += 1
        else:
            pass
    else:
        if d[p_] == -1:
            pass
        else:
            pen += d[p_]
            d[p_] = -1
            ac += 1
print(ac, pen)

Submission status: Accepted

Solution code:
N, M = map(int, input().split())


ans_d = {}

cnt_d = {}

for i in range(N):
    cnt_d[i+1] = 0

for i in range(M):
    p, s = input().split()
    if int(p) in ans_d: continue
    if s == 'AC':
        ans_d[int(p)] = cnt_d[int(p)]
    elif s == 'WA':
        cnt_d[int(p)] += 1


ans = 0
for k, v in ans_d.items():
    ans += v


print('{} {}'.format(len(ans_d), ans))

Submission status: Accepted

Solution code:
N, M = map(int, input().split())

goal = [0] * (N + 1)
wrong = [0] * (N + 1)
ans = [0, 0]

for i in range(M):
  p, s =  map(str, input().split())
  if goal[int(p)] == 0:
    if s == "AC":
      ans[0] += 1
      ans[1] += wrong[int(p)]
      goal[int(p)] = 1
    else:
      wrong[int(p)] += 1
      
print(ans[0], ans[1])

Submission status: Accepted

Solution code:
N, M = map(int, input().split())

teishutu = [[] for i in range(N)]

for i in range(M):
    p, s = input().split()
    teishutu[int(p) - 1].append(True if s == "AC" else False)

seitou = 0
penaruthi = 0

for lst in teishutu:
    is_ac = False
    wa_cnt = 0
    for b in lst:
        if b:
            is_ac = True
            break
        wa_cnt += 1

    if is_ac:
        seitou += 1
        penaruthi += wa_cnt

print(seitou, penaruthi)

Submission status: Accepted

Solution code:
import sys
input=sys.stdin.readline

n,m=map(int,input().split())
a=[list(input().split()) for i in range(m)]
a=sorted(a, key=lambda x: x[0])
ac=0
wa=0
if m==0:
    print(0,0)
    exit()
now=a[0][0]
my_bool=True
wa_pre=0
for i in range(m):
    if now!=a[i][0]:
        now=a[i][0]
        my_bool=True
        wa_pre=0
    if not my_bool:
        continue
    if a[i][1]=="AC":
        ac+=1
        wa+=wa_pre
        my_bool=False
    else:
        wa_pre+=1
print(ac,wa)

Submission status: Accepted

Solution code:
nm=list(map(int,input().split()))
ps=[]
for i in range(nm[1]):
    ps.append(list(input().split()))
    ps[-1][0]=int(ps[-1][0])
ac=[0]*nm[0]
wa=[0]*nm[0]
for i in range(nm[1]):
    if ps[i][1]=="AC":
        if ac[ps[i][0]-1]==0:
            ac[ps[i][0]-1]=1
        else:
            pass
    else:
        if ac[ps[i][0]-1]==0:
            wa[ps[i][0]-1]+=1
        else:
            pass
ans=0
for i in range(nm[0]):
    if ac[i]==1:
        ans+=wa[i]
print(sum(ac),ans)

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(1000000000)
import math
from fractions import gcd
from itertools import count, permutations
from functools import lru_cache
from collections import defaultdict
from pprint import pprint
ii = lambda: int(input())
mis = lambda: map(int, input().split())
lmis = lambda: list(mis())
INF = float('inf')
N1097 = 10**9 + 7

def meg(f, ok, ng):
    while abs(ok-ng)>1:
        mid = (ok+ng)//2
        if f(mid):
            ok=mid
        else:
            ng=mid
    return ok
#

def main():
    N,M=mis()
    ac = set()
    pe = defaultdict(int)
    for _ in range(M):
        p, S = input().split()
        p = int(p)
        if S == 'AC':
            ac.add(p)
        elif p not in ac:
            pe[p] += 1
    print(len(ac), sum(pe[p] for p in ac))




main()

Submission status: Accepted

Solution code:
n, m = map(int, input().split())
ps = [list(input().split()) for _ in range(m)]
wa = [0] * n
ac = [0] * n

for p, s in ps:
  p = int(p) - 1
  if s == "AC":
    ac[p] = 1
  else:
    if ac[p] == 0:
      wa[p] += 1
wasum = 0
for i, j in zip(ac, wa):
  if i > 0:
    wasum += j
print(sum(ac), wasum)

Submission status: Accepted

Solution code:
n,m = map(int,input().split())
cnt = [[0,0] for i in range(n)]
for i in range(m):
    p,s = map(str,input().split())
    p = int(p)
    if cnt[p-1][1] >0:
        continue
    if s =='AC':
        cnt[p-1][1] += 1
    else:
        cnt[p-1][0] += 1

ok = 0
no  = 0

for i in range(n):
    if cnt[i][1] > 0:
        ok += 1
        no += cnt[i][0]
print(ok,no)

Submission status: Accepted

Solution code:
N,M=map(int,input().split())
ac=[0]*N
pn=[0]*N
for i in range(M):
  p,s=input().split()
  p=int(p)
  if ac[p-1]==0:
    if s=="AC":
      ac[p-1]=1
    else:
      pn[p-1]+=1

pna=0
for i in range(N):
  if ac[i]==1:
    pna+=pn[i]
print(sum(ac),pna)