結果
問題 | No.1872 Dictionary Order |
ユーザー | chineristAC |
提出日時 | 2022-03-11 21:47:52 |
言語 | PyPy3 (7.3.13) |
結果 |
AC
|
実行時間 | 270 ms / 2,000 ms |
コード長 | 3,151 bytes |
コンパイル時間 | 1,160 ms |
コンパイル使用メモリ | 86,988 KB |
実行使用メモリ | 109,960 KB |
最終ジャッジ日時 | 2023-10-14 10:48:53 |
合計ジャッジ時間 | 8,232 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge12 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 270 ms
109,960 KB |
testcase_01 | AC | 120 ms
78,980 KB |
testcase_02 | AC | 181 ms
89,328 KB |
testcase_03 | AC | 131 ms
79,544 KB |
testcase_04 | AC | 203 ms
88,400 KB |
testcase_05 | AC | 121 ms
78,884 KB |
testcase_06 | AC | 166 ms
88,980 KB |
testcase_07 | AC | 153 ms
86,892 KB |
testcase_08 | AC | 123 ms
79,164 KB |
testcase_09 | AC | 134 ms
79,484 KB |
testcase_10 | AC | 161 ms
89,020 KB |
testcase_11 | AC | 180 ms
88,628 KB |
testcase_12 | AC | 145 ms
84,432 KB |
testcase_13 | AC | 131 ms
79,256 KB |
testcase_14 | AC | 178 ms
88,608 KB |
testcase_15 | AC | 185 ms
88,564 KB |
testcase_16 | AC | 124 ms
79,520 KB |
testcase_17 | AC | 160 ms
86,796 KB |
testcase_18 | AC | 166 ms
88,972 KB |
testcase_19 | AC | 155 ms
87,332 KB |
testcase_20 | AC | 145 ms
85,328 KB |
testcase_21 | AC | 170 ms
88,140 KB |
testcase_22 | AC | 251 ms
106,500 KB |
testcase_23 | AC | 180 ms
89,840 KB |
testcase_24 | AC | 166 ms
87,492 KB |
testcase_25 | AC | 199 ms
89,588 KB |
testcase_26 | AC | 166 ms
87,228 KB |
testcase_27 | AC | 195 ms
89,528 KB |
testcase_28 | AC | 238 ms
103,112 KB |
testcase_29 | AC | 246 ms
105,492 KB |
testcase_30 | AC | 121 ms
78,896 KB |
testcase_31 | AC | 256 ms
108,748 KB |
testcase_32 | AC | 110 ms
74,612 KB |
testcase_33 | AC | 112 ms
74,276 KB |
testcase_34 | AC | 117 ms
78,932 KB |
ソースコード
class SegmentTree: def __init__(self, init_val, segfunc, ide_ele): n = len(init_val) self.segfunc = segfunc self.ide_ele = ide_ele self.num = 1 << (n - 1).bit_length() self.tree = [ide_ele] * 2 * self.num self.size = n for i in range(n): self.tree[self.num + i] = init_val[i] for i in range(self.num - 1, 0, -1): self.tree[i] = self.segfunc(self.tree[2 * i], self.tree[2 * i + 1]) def update(self, k, x): k += self.num self.tree[k] = x while k > 1: k >>= 1 self.tree[k] = self.segfunc(self.tree[2*k], self.tree[2*k+1]) def query(self, l, r): if r==self.size: r = self.num res = self.ide_ele l += self.num r += self.num right = [] while l < r: if l & 1: res = self.segfunc(res, self.tree[l]) l += 1 if r & 1: right.append(self.tree[r-1]) l >>= 1 r >>= 1 for e in right[::-1]: res = self.segfunc(res,e) return res def bisect(self,l,r,x): if r==self.size: r = self.num l += self.num r += self.num segment = [] segment_r = [] while l<r: if l&1: segment.append(l) l += 1 if r&1: segment_r.append(r-1) l >>= 1 r >>= 1 segment += segment_r[::-1] tmp = self.ide_ele for pos in segment: check = self.segfunc(tmp,self.tree[pos]) if check > x: break else: tmp = check else: return -1 while pos < self.num: check = self.segfunc(tmp,self.tree[2*pos]) if check > x: pos = 2 * pos else: tmp = check pos = 2 * pos + 1 return pos - self.num import sys,random,bisect from collections import deque,defaultdict from heapq import heapify,heappop,heappush from itertools import permutations from math import log,gcd input = lambda :sys.stdin.readline().rstrip() mi = lambda :map(int,input().split()) li = lambda :list(mi()) N,M = mi() A = li() P = li() pos = [-1] * (N+1) for i in range(N): pos[P[i]] = i dp = [[False for j in range(M+1)] for i in range(N+1)] dp[N][0] = True for i in range(N)[::-1]: for j in range(M+1): if A[i] <= j: dp[i][j] = dp[i+1][j]|dp[i+1][j-A[i]] else: dp[i][j] = dp[i+1][j] if not dp[0][M]: exit(print(-1)) res = [] L = 0 S = 0 use = [False] * (N+1) while True: for i in range(1,N+1): tmp_L = max(L,pos[i]+1) tmp_rest = M - S - A[pos[i]] if tmp_rest < 0 or use[i] or pos[i] < L: continue if dp[tmp_L][tmp_rest]: res.append(i) L = max(L,pos[i]+1) S = S + A[pos[i]] use[i] = True break else: break print(len(res)) print(*[pos[i]+1 for i in res])