跳到主要内容
图灵 OJTURING / ONLINE JUDGE

#F2340. Optimize!

  • ID: 2346
  • 传统题
  • 2000ms
  • 256MiB
  • 尝试: 0
  • AC · 已通过: 0
  • 教学难度:挑战
  • 上传者:
  • 数据结构
  • 挑战
  • 难度
  • 共享题库
  • Codeforces
  • 英文题面
  • 题目来源
  • 题面语言

Optimize!

题目描述

E. Optimize!
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

Manao is solving a problem with the following statement:

He came up with a solution that produces the correct answers but is too slow. You are given the pseudocode of his solution, where the function getAnswer calculates the answer to the problem:


getAnswer(a[1..n], b[1..len], h)
answer = 0
for i = 1 to n-len+1
answer = answer + f(a[i..i+len-1], b, h, 1)
return answer

f(s[1..len], b[1..len], h, index)
if index = len+1 then
return 1
for i = 1 to len
if s[index] + b[i] >= h
mem = b[i]
b[i] = 0
res = f(s, b, h, index + 1)
b[i] = mem
if res > 0
return 1
return 0

Your task is to help Manao optimize his algorithm.

Input

The first line contains space-separated integers n, len and h (1≤len≤n≤150000;1≤h≤109). The second line contains len space-separated integers b1,b2,...,blen (1≤bi≤109). The third line contains n space-separated integers a1,a2,...,an (1≤ai≤109).

Output

Print a single number − the answer to Manao's problem.

Examples
Input
5 2 10
5 3
1 8 5 5 7
Output
2

题目来源:fps-www.educg.net-codeforce-1-2833.xml.zip;FPS 共享题包,题包内第 1962 题。保留原作者与原赛事署名。