题目描述
题意
n个1~m的整数中选择n-2个数, 使得选择的数之和为m的倍数
思路
将选择n-2个数转为选择2各剩下的数
枚举第一个数, 二分符合条件的第二个数是否存在
code
#include<iostream>
#include<algorithm>
using namespace std;
typedef long long ll;
const int N = 2e5 + 10;
ll a[N];
void solv()
{
int n, m;
cin >> n >> m;
ll sum = 0;
ll t;
for(int i = 0; i < n; i ++)
{
cin >> a[i];
sum += a[i];
}
sort(a, a + n);
ll aim = (sum - 1) % m + 1;
for(int i = 0; i < n - 1; i ++)
{
int l = i + 1, r = n - 1;
ll key = aim - a[i];
if(a[l] > key) break;
while(l < r)
{
int mid = l + r >> 1;
if(a[mid] >= key) r = mid;
else l = mid + 1;;
}
if(a[l] == key)
{
if(aim % m == 0) cout << m << '\n';
else cout << aim % m << '\n';
return;
}
}
aim += m;
for(int i = 0; i < n - 1; i ++)
{
int l = i + 1, r = n - 1;
ll key = aim - a[i];
if(a[l] > key) break;
while(l < r)
{
int mid = l + r >> 1;
if(a[mid] >= key) r = mid;
else l = mid + 1;
}
// cout << i << ' ' << a[i] << ' ' << key << ' ' << l << ' ' << a[l] << '\n';
if(a[l] == key)
{
if(aim % m == 0) cout << m << '\n';
else cout << aim % m << '\n';
return;
}
}
cout << 0 << '\n';
}
int main()
{
int T;
cin >> T;
while(T --)
{
solv();
}
return 0;
}
以下代码摘自
https://ac.nowcoder.com/acm/discuss/blogs?tagId=153411
注意与总结
使用stl代码更简洁些
学习使用上面这种不重复的枚举方法