A12386 | Zero Quantity Maximization
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
You are given two arrays $a$ and $b$ , each contains $n$ integers.
You want to create a new array $c$ as follows: choose some real (i.e. not necessarily integer) number $d$ , and then for every $i \in [1, n]$ let $c_i := d \cdot a_i + b_i$ .
Your goal is to maximize the number of zeroes in array $c$ . What is the largest possible answer, if you choose $d$ optimally?
You want to create a new array $c$ as follows: choose some real (i.e. not necessarily integer) number $d$ , and then for every $i \in [1, n]$ let $c_i := d \cdot a_i + b_i$ .
Your goal is to maximize the number of zeroes in array $c$ . What is the largest possible answer, if you choose $d$ optimally?
输入格式
The first line contains one integer $n$ ( $1 \le n \le 2 \cdot 10^5$ ) — the number of elements in both arrays.
The second line contains $n$ integers $a_1$ , $a_2$ , ..., $a_n$ ( $-10^9 \le a_i \le 10^9$ ).
The third line contains $n$ integers $b_1$ , $b_2$ , ..., $b_n$ ( $-10^9 \le b_i \le 10^9$ ).
The second line contains $n$ integers $a_1$ , $a_2$ , ..., $a_n$ ( $-10^9 \le a_i \le 10^9$ ).
The third line contains $n$ integers $b_1$ , $b_2$ , ..., $b_n$ ( $-10^9 \le b_i \le 10^9$ ).
输出格式
Print one integer — the maximum number of zeroes in array $c$ , if you choose $d$ optimally.
输入输出样例
输入 #1
5 1 2 3 4 5 2 4 7 11 3
输出 #1
2
输入 #2
3 13 37 39 1 2 3
输出 #2
2
输入 #3
4 0 0 0 0 1 2 3 4
输出 #3
0
输入 #4
3 1 2 -1 -6 -12 6
输出 #4
3
In the first example, we may choose $d = -2$ .
In the second example, we may choose $d = -\frac{1}{13}$ .
In the third example, we cannot obtain any zero in array $c$ , no matter which $d$ we choose.
In the fourth example, we may choose $d = 6$ .
In the second example, we may choose $d = -\frac{1}{13}$ .
In the third example, we cannot obtain any zero in array $c$ , no matter which $d$ we choose.
In the fourth example, we may choose $d = 6$ .
C++ 编辑器
输入
输出
可保存默认模板；新题优先使用已保存模板。
当前快捷键仅展示，暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好，我是作答助手。可以问思路、复杂度、样例含义或代码报错原因；不会直接给出完整 AC 代码。
确定要清空代码吗？
提交通过
评测结果：Accepted