結果
問題 | No.1469 programing |
ユーザー | McGregorsh |
提出日時 | 2023-05-10 11:51:12 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 799 ms / 3,000 ms |
コード長 | 1,777 bytes |
コンパイル時間 | 735 ms |
コンパイル使用メモリ | 86,876 KB |
実行使用メモリ | 338,204 KB |
最終ジャッジ日時 | 2023-08-17 18:03:53 |
合計ジャッジ時間 | 7,992 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 258 ms
92,260 KB |
testcase_01 | AC | 251 ms
92,236 KB |
testcase_02 | AC | 242 ms
92,412 KB |
testcase_03 | AC | 248 ms
92,232 KB |
testcase_04 | AC | 256 ms
92,428 KB |
testcase_05 | AC | 264 ms
92,804 KB |
testcase_06 | AC | 262 ms
92,448 KB |
testcase_07 | AC | 262 ms
92,952 KB |
testcase_08 | AC | 273 ms
97,256 KB |
testcase_09 | AC | 279 ms
100,032 KB |
testcase_10 | AC | 275 ms
98,824 KB |
testcase_11 | AC | 293 ms
112,324 KB |
testcase_12 | AC | 280 ms
105,032 KB |
testcase_13 | AC | 250 ms
92,160 KB |
testcase_14 | AC | 295 ms
114,492 KB |
testcase_15 | AC | 279 ms
106,288 KB |
testcase_16 | AC | 311 ms
113,416 KB |
testcase_17 | AC | 799 ms
338,204 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()