結果
問題 | No.1362 [Zelkova 8th Tune] Black Sheep |
ユーザー | McGregorsh |
提出日時 | 2023-05-09 15:47:05 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 316 ms / 1,000 ms |
コード長 | 1,485 bytes |
コンパイル時間 | 358 ms |
コンパイル使用メモリ | 86,912 KB |
実行使用メモリ | 118,016 KB |
最終ジャッジ日時 | 2023-08-17 07:30:20 |
合計ジャッジ時間 | 13,937 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 239 ms
92,428 KB |
testcase_01 | AC | 238 ms
92,392 KB |
testcase_02 | AC | 239 ms
92,408 KB |
testcase_03 | AC | 237 ms
92,456 KB |
testcase_04 | AC | 241 ms
92,288 KB |
testcase_05 | AC | 236 ms
92,532 KB |
testcase_06 | AC | 237 ms
92,364 KB |
testcase_07 | AC | 241 ms
92,536 KB |
testcase_08 | AC | 242 ms
92,540 KB |
testcase_09 | AC | 238 ms
92,420 KB |
testcase_10 | AC | 238 ms
92,508 KB |
testcase_11 | AC | 237 ms
92,568 KB |
testcase_12 | AC | 241 ms
92,640 KB |
testcase_13 | AC | 291 ms
113,412 KB |
testcase_14 | AC | 284 ms
111,664 KB |
testcase_15 | AC | 244 ms
93,496 KB |
testcase_16 | AC | 261 ms
101,816 KB |
testcase_17 | AC | 291 ms
115,664 KB |
testcase_18 | AC | 274 ms
104,880 KB |
testcase_19 | AC | 301 ms
116,748 KB |
testcase_20 | AC | 281 ms
107,328 KB |
testcase_21 | AC | 279 ms
105,624 KB |
testcase_22 | AC | 286 ms
113,004 KB |
testcase_23 | AC | 293 ms
117,720 KB |
testcase_24 | AC | 300 ms
117,876 KB |
testcase_25 | AC | 298 ms
117,976 KB |
testcase_26 | AC | 298 ms
117,964 KB |
testcase_27 | AC | 299 ms
117,856 KB |
testcase_28 | AC | 303 ms
117,972 KB |
testcase_29 | AC | 308 ms
117,708 KB |
testcase_30 | AC | 309 ms
118,016 KB |
testcase_31 | AC | 309 ms
117,952 KB |
testcase_32 | AC | 307 ms
117,836 KB |
testcase_33 | AC | 316 ms
117,744 KB |
testcase_34 | AC | 302 ms
117,876 KB |
testcase_35 | AC | 239 ms
92,568 KB |
testcase_36 | AC | 240 ms
92,392 KB |
testcase_37 | AC | 245 ms
92,500 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 = list(input()) SC = Counter(S) for i in range(len(S)): if SC[S[i]] == 1: print(i+1, S[i]) exit() if __name__ == '__main__': main()