結果
問題 | No.1469 programing |
ユーザー | McGregorsh |
提出日時 | 2023-05-10 11:51:12 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 691 ms / 3,000 ms |
コード長 | 1,777 bytes |
コンパイル時間 | 253 ms |
コンパイル使用メモリ | 82,304 KB |
実行使用メモリ | 352,208 KB |
最終ジャッジ日時 | 2024-05-05 00:46:42 |
合計ジャッジ時間 | 4,713 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 138 ms
89,472 KB |
testcase_01 | AC | 147 ms
89,344 KB |
testcase_02 | AC | 144 ms
89,344 KB |
testcase_03 | AC | 142 ms
89,344 KB |
testcase_04 | AC | 132 ms
89,344 KB |
testcase_05 | AC | 144 ms
89,984 KB |
testcase_06 | AC | 142 ms
89,696 KB |
testcase_07 | AC | 147 ms
89,856 KB |
testcase_08 | AC | 143 ms
93,440 KB |
testcase_09 | AC | 152 ms
96,128 KB |
testcase_10 | AC | 147 ms
94,976 KB |
testcase_11 | AC | 158 ms
106,852 KB |
testcase_12 | AC | 155 ms
100,352 KB |
testcase_13 | AC | 129 ms
89,600 KB |
testcase_14 | AC | 184 ms
120,704 KB |
testcase_15 | AC | 156 ms
102,144 KB |
testcase_16 | AC | 168 ms
111,232 KB |
testcase_17 | AC | 691 ms
352,208 KB |
ソースコード
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(): S = input() juge = [False] * len(S) lenS = len(S) ans = [] for i in range(lenS): if juge[i] == False: if i + 1 < lenS: if S[i] == S[i+1]: juge[i] = True juge[i+1] = True ans.append(S[i]) else: juge[i] = True ans.append(S[i]) else: ans.append(S[i]) print(''.join(ans)) if __name__ == '__main__': main()