QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#732572#8777. Passport Stampsjiujiu#WA 88ms15876kbPython3363b2024-11-10 15:13:132024-11-10 15:13:13

Judging History

你现在查看的是最新测评结果

  • [2024-11-10 15:13:13]
  • 评测
  • 测评结果:WA
  • 用时:88ms
  • 内存:15876kb
  • [2024-11-10 15:13:13]
  • 提交

answer

n, p = list(map(int, input().split()))
# print(n, p)
v = [0] * (n + 1)
s = [0] * (n + 1)
for i in range(1, n + 1):
	x = int(input())
	v[i] = x
	s[i] = s[i - 1] + x
def f(x : int):
	temp = s[x - 1]
	temp += (x - 1) * (v[x] - 1)
	return p - temp < v[x]
l, r = 0, n + 1
while l + 1 != r:
	m = (l + r) // 2
	if f(m):
		r = m
	else:
		l = m
print(l)

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 13ms
memory: 10612kb

input:

5 15
1
2
3
4
5

output:

3

result:

ok single line: '3'

Test #2:

score: 0
Accepted
time: 81ms
memory: 15340kb

input:

100000 559309580160692839
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
...

output:

84437

result:

ok single line: '84437'

Test #3:

score: -100
Wrong Answer
time: 88ms
memory: 15876kb

input:

100000 890934113082207108
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
...

output:

100000

result:

wrong answer 1st lines differ - expected: '53636', found: '100000'