Problem 2623 --Binary Search - Binary Search

2623: Binary Search - Binary Search

"
Time Limit $1$ 秒/Second(s) Memory Limit $512$ 兆字节/Megabyte(s)
提交总数 $17$ 正确数量 $12$
裁判形式 标准裁判/Standard Judge 我的状态 尚未尝试
难度 分类标签 STL
For a given sequence A={a0,a1,...,an−1} which is sorted by ascending order, find a specific value k given as a query.

The input is given in the following format.

a0 a1,...,an−1 

k1 

k2 

kq 

The number of elements n and each element ai are given in the first line and the second line respectively. 

In the third line, the number of queries q is given and the following q lines, q integers ki are given as queries.

For each query, print 1 if any element in A is equivalent to k, and 0 otherwise.
4
1 2 2 4
3
2
3
5
1
0
0

1≤n≤100,000

1≤q≤200,000 

0≤a0≤a1≤...≤an−1≤1,000,000,000 

0≤ki≤1,000,000,000

推荐代码 查看2623 所有题解 上传题解视频得图灵币

本题记录 用 户(点击查看用户) 运行号(点击购买题解) 时 间
算法最快[$0 $ms] AOJ大管家 436922 2019-06-06 18:42:37
内存最少[$2020 $KB] 卑微小赵 386580 2019-03-26 20:15:56
第一AC 计爱玲 282591 2018-10-07 20:54:15
第一挑战 计爱玲 282591 2018-10-07 20:54:15

赛题来源/所属竞赛 会津大学《C++ Programming II》 C++程序设计(高级)

竞赛编号 竞赛名称 竞赛时间 访问比赛