結果
問題 | No.1373 Directed Operations |
ユーザー | McGregorsh |
提出日時 | 2022-07-16 22:14:55 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 558 ms / 2,000 ms |
コード長 | 1,775 bytes |
コンパイル時間 | 588 ms |
コンパイル使用メモリ | 87,088 KB |
実行使用メモリ | 115,840 KB |
最終ジャッジ日時 | 2023-09-11 08:06:24 |
合計ジャッジ時間 | 11,171 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 257 ms
92,116 KB |
testcase_01 | AC | 253 ms
92,288 KB |
testcase_02 | AC | 316 ms
115,840 KB |
testcase_03 | AC | 297 ms
115,240 KB |
testcase_04 | AC | 294 ms
113,768 KB |
testcase_05 | AC | 251 ms
92,248 KB |
testcase_06 | AC | 539 ms
115,004 KB |
testcase_07 | AC | 266 ms
93,864 KB |
testcase_08 | AC | 286 ms
95,032 KB |
testcase_09 | AC | 520 ms
114,660 KB |
testcase_10 | AC | 472 ms
113,368 KB |
testcase_11 | AC | 298 ms
96,124 KB |
testcase_12 | AC | 468 ms
113,720 KB |
testcase_13 | AC | 274 ms
93,140 KB |
testcase_14 | AC | 556 ms
115,020 KB |
testcase_15 | AC | 507 ms
113,652 KB |
testcase_16 | AC | 558 ms
115,200 KB |
testcase_17 | AC | 360 ms
114,240 KB |
testcase_18 | AC | 293 ms
104,820 KB |
testcase_19 | AC | 368 ms
102,504 KB |
testcase_20 | AC | 413 ms
107,896 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 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(): n = int(input()) a = i_list() num_a = [] for i in range(n-1): num_a.append([a[i], i]) num_a.sort() ans = [0] * (n+1) for i in range(n-1): point1, num = num_a[i] score = (i+2) - point1 if 1 <= score <= n - point1: ans[num+2] = score else: print('NO') exit() print('YES') for i in range(2, n+1): print(ans[i]) if __name__ == '__main__': main()