Submission #72574685

Source Code Expand

import sys,bisect
from heapq import heappop, heappush
from collections import deque, Counter, defaultdict
sys.setrecursionlimit(10**7)
input = lambda: sys.stdin.readline().rstrip()
ii = lambda: int(input())
mi = lambda: map(int, input().split())
li = lambda: list(mi())
inf = 2 ** 63 - 1
mod = 998244353

N = ii()
S = list(input())
for i in range(N):
    if S[i]=="F":
        S[i]="G"
        
    elif S[i]=="G":S[i] = "F"
print("".join(S))

Submission Info

Submission Time
Task B - EGF置換
User guild2026_288
Language Python (PyPy 3.11-v7.3.20)
Score 100
Code Size 460 Byte
Status AC
Exec Time 69 ms
Memory 96896 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 3
AC × 21
Set Name Test Cases
Sample 00_sample_00.txt, 00_sample_01.txt, 00_sample_02.txt
All 00_sample_00.txt, 00_sample_01.txt, 00_sample_02.txt, 01_random_00.txt, 01_random_01.txt, 01_random_02.txt, 01_random_03.txt, 01_random_04.txt, 01_random_05.txt, 01_random_06.txt, 01_random_07.txt, 01_random_08.txt, 01_random_09.txt, 01_random_10.txt, 01_random_11.txt, 01_random_12.txt, 01_random_13.txt, 01_random_14.txt, 01_random_15.txt, 01_random_16.txt, 01_random_17.txt
Case Name Status Exec Time Memory
00_sample_00.txt AC 68 ms 96572 KiB
00_sample_01.txt AC 68 ms 96648 KiB
00_sample_02.txt AC 69 ms 96564 KiB
01_random_00.txt AC 69 ms 96684 KiB
01_random_01.txt AC 69 ms 96684 KiB
01_random_02.txt AC 68 ms 96460 KiB
01_random_03.txt AC 69 ms 96460 KiB
01_random_04.txt AC 69 ms 96792 KiB
01_random_05.txt AC 68 ms 96572 KiB
01_random_06.txt AC 69 ms 96460 KiB
01_random_07.txt AC 69 ms 96620 KiB
01_random_08.txt AC 69 ms 96432 KiB
01_random_09.txt AC 69 ms 96728 KiB
01_random_10.txt AC 69 ms 96700 KiB
01_random_11.txt AC 69 ms 96772 KiB
01_random_12.txt AC 69 ms 96672 KiB
01_random_13.txt AC 68 ms 96400 KiB
01_random_14.txt AC 68 ms 96672 KiB
01_random_15.txt AC 68 ms 96492 KiB
01_random_16.txt AC 68 ms 96896 KiB
01_random_17.txt AC 68 ms 96564 KiB