結果

問題 No.2774 Wake up Record 2
ユーザー _a_a
提出日時 2024-06-07 22:35:21
言語 Python3
(3.12.2 + numpy 1.26.4 + scipy 1.12.0)
結果
AC  
実行時間 102 ms / 2,000 ms
コード長 1,717 bytes
コンパイル時間 85 ms
コンパイル使用メモリ 13,056 KB
実行使用メモリ 24,576 KB
最終ジャッジ日時 2024-06-07 22:35:24
合計ジャッジ時間 1,918 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 36 ms
11,776 KB
testcase_01 AC 37 ms
11,776 KB
testcase_02 AC 35 ms
11,776 KB
testcase_03 AC 36 ms
11,904 KB
testcase_04 AC 35 ms
11,904 KB
testcase_05 AC 36 ms
11,904 KB
testcase_06 AC 36 ms
11,776 KB
testcase_07 AC 37 ms
11,776 KB
testcase_08 AC 36 ms
11,776 KB
testcase_09 AC 37 ms
12,416 KB
testcase_10 AC 35 ms
12,032 KB
testcase_11 AC 54 ms
15,488 KB
testcase_12 AC 45 ms
13,952 KB
testcase_13 AC 85 ms
19,840 KB
testcase_14 AC 83 ms
24,576 KB
testcase_15 AC 83 ms
24,444 KB
testcase_16 AC 80 ms
24,572 KB
testcase_17 AC 102 ms
24,444 KB
testcase_18 AC 78 ms
22,272 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import os, sys
import math, decimal, queue, heapq, bisect, itertools, functools, collections, string
from bisect import bisect, bisect_left
from collections import defaultdict, OrderedDict, deque, Counter
from functools import cmp_to_key, lru_cache, reduce
from heapq import heapify, heappush, heappushpop, heappop, heapreplace, nlargest, nsmallest
from itertools import accumulate, chain, combinations, combinations_with_replacement, compress, count, cycle, dropwhile, filterfalse, groupby, islice, permutations, product, repeat, starmap, takewhile, tee, zip_longest
from math import gcd, factorial, isqrt, comb, perm, prod, inf
from queue import Queue, PriorityQueue, LifoQueue
from string import ascii_letters, ascii_lowercase, ascii_uppercase, digits, hexdigits, octdigits

LOCAL = sys.argv[0] if '4a' in sys.argv[0] else None

P = lambda *p: [print(i, end='	') for i in p] if LOCAL else None
PI = lambda *p: print(' '.join(map(str, p))) or None
PII = lambda X: [PI(*row) for row in X]

sys.stdin = open(os.path.join(os.getcwd(), 'a1.txt'), 'r') if LOCAL else sys.stdin
I = lambda: [int(a) for l in sys.stdin for a in l.strip().split()]
S = lambda: [a for l in sys.stdin for a in l.strip().split()]
IM = lambda: [[int(a) for a in l.split()] for l in sys.stdin]
SM = lambda: [[a for a in l.split()] for l in sys.stdin]

az, AZ, mod = ascii_lowercase, ascii_uppercase, 1_000_000_007

A = IM()
# P(A)


def solution(A):
    N, K = A[0]
    B = A[1]
    C = sorted(B)
    D = C[:K]
    mx = 0
    if D:
        mx = D[-1]
    res = []
    c = 0
    res = []
    for i in range(1, len(B)):
        if B[i - 1] <= mx and B[i] > mx:
            c += 1
            res += [i + 1]
    print(c)
    PI(* res)


solution(A)
0