牛客周赛round46vp个人题解/学习笔记
比赛链接:牛客竞赛_ACM/NOI/CSP/CCPC/ICPC算法编程高难度练习赛_牛客竞赛OJ (nowcoder.com)
problem A
签到题
冰的食物都可以吃完,热的食物要消耗两倍的冰的食物吃掉
#include<bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ll a,b;
cin >> a >> b;
ll ans = a + min(a/2,b);
cout<<ans;
}
problem B
签到题
判断当前红茶是不是美味值最大的,如果是,选择美味值最大的红茶的数量减一或者选择美味值次大的红茶,如果不是,选择美味值最大的红茶
#include<bits/stdc++.h>
#define ll long long
#define alls(x) x.begin(),x.end()
using namespace std;
int main() {
int n,m;
cin>> n>> m;
vector<int>a(n);
for(auto &x:a)cin >>x;
int x = a[m-1];
sort(alls(a));
int ans = 1;
if(x==a[n-1])
{
for(int i = n-3;i>=0;i--){
if(a[i]==a[n-2])
ans++;
}
}
else{
for(int i =n-2;i>=0;i--)
{
if(a[i]==a[n-1])ans++;
}
}
cout<<ans;
}
problem C
签到题
判断在n内的函数的x的因数数量即可
#include<bits/stdc++.h>
#define ll long long
#define alls(x) x.begin(),x.end()
using namespace std;
int main() {
ll n,x;
cin >> n >> x;
n = min(n,x);
int cnt = 0;
for(ll i = 1;i<=sqrt(x);i++)
{
if(x%i==0)
{
if(i<=n)
cnt = !cnt;
if(x/i<=n && x/i!=i)
cnt = !cnt;
}
}
if(cnt)puts("ON");
else puts("OFF");
}
problem D
简单dfs搜索即可
#include<bits/stdc++.h>
#define ll long long
#define alls(x) x.begin(),x.end()
#define lc p<<1
#define rc p<<1|1
using namespace std;
int mex(int a,int b)
{
for(int i = 0;;i++)
{
if(i!=a && i!=b)return i;
}
}
int ans = 0;
int a,b,c,d;
void dfs(int x,int y,int z,int dep)
{
if(dep>5)return;
if(x==d || y == d || z==d)
{
ans = min(dep,ans);
return;
}
dfs(x,y,mex(x,y),dep+1);
dfs(z,y,mex(z,y),dep+1);
dfs(x,z,mex(x,z),dep+1);
}
int main()
{
int _ = 1;
cin >> _;
while(_--) {
cin >> a >> b >> c >> d;
ans = 114514;
dfs(a,b,c,0);
if(ans==114514)cout<<-1<<'\n';
else cout<<ans<<'\n';
}
}
problem E
由于数据范围不支持暴力求解,采用二分优化
#include<bits/stdc++.h>
#define ll long long
#define alls(x) x.begin(),x.end()
#define lc p<<1
#define rc p<<1|1
using namespace std;
int n;
const int N = 1e5+10;
ll a[N],b[N],s[N],s1[N];
pair<ll,ll>c[N];
void solve() {
cin >> n;
for(int i = 1;i<=n;i++)cin >> a[i];
for(int i = 1;i<=n;i++)
{
cin >> b[i];
c[i] = {b[i],a[i]};
}
sort(c+1,c+1+n);
for(int i = 1;i<=n;i++)
{
b[i] = c[i].first,a[i] = c[i].second;
}
for(int i = 1;i<=n;i++)
{
s[i] = s[i-1] + b[i] * a[i];
s1[i] = s1[i-1] + a[i];
}
int q;
cin >> q;
while(q--)
{
int x;
cin >> x;
if(x>=b[n])
{
cout<<s[n]<<'\n';
continue;
}
int y = upper_bound(b+1,b+1+n,x) - b - 1;
ll ans = s[y] + x*(s1[n] - s1[y]);
cout<<ans<<'\n';
}
}
int main() {
ios::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
int _ = 1;
// cin >> _;
while (_--)solve();
}
problem F
前置知识:欧拉筛筛质数,快速幂/扩展欧几里得求逆元,组合数(隔板法)
将原数进行质因数分解,提前筛好质数加速这个过程。
易知,对于每个任意两个不同的质因数之间选择是独立的,所以对每个质因数进行隔板法求可分数量之后再相乘即可
隔板法 n个物品分m份 不允许0:,允许0:
#include<bits/stdc++.h>
#define ll long long
#define alls(x) x.begin(),x.end()
#define lc p<<1
#define rc p<<1|1
#define PII pair<int,int>
using namespace std;
int n;
const int N = 1e6 + 10;
int inv[N];
const int mod = 1e9 + 7;
/*void get_inv(int n) {
//线性筛逆元
inv[1] = 1;
for (int i = 2; i <= n; i++) {
inv[i] = 1ll * inv[mod % i] * (mod - mod / i) % mod;
}
}*/
int primes[N];
bool vis[N];
int cnt;
void euler(int n) {
for (int i = 2; i <= n; i++) {
if (!vis[i]) {
primes[cnt++] = i;
}
for (int j = 0; j < cnt && primes[j] * i <= n; j++) {
vis[primes[j] * i] = true;
if (i % primes[j] == 0)break;
}
}
}
int x, y;
ll qmi(ll a, ll b) {
ll ans = 1;
while (b) {
if (b & 1) {
ans = ans * a % mod;
}
b >>= 1;
a = a * a % mod;
}
return ans;
}
ll cal(int x, int y) {
//C(x+y-1,y-1)
ll ans = 1;
for (int i = y; i <= x + y - 1; i++) {
ans = ans * i % mod;
}
ll b = 1;
for (int i = 1; i <= x; i++) {
b = b * i % mod;
}
return ans * qmi(b, mod - 2) % mod;
}
void solve() {
cin >> x >> y;
int k = 0;
vector<PII > a;
for (int i = 0; i < cnt; i++) {
if (primes[i] * primes[i] > x)break;
if (x % primes[i] == 0) {
k = 0;
while (x % primes[i] == 0) {
k++;
x /= primes[i];
}
a.push_back({primes[i], k});
}
}
if (x > 1)
a.push_back({x, 1});
ll ans = 1;
for (auto [u, v]: a) {
ans = ans * cal(v, y) % mod;
}
cout << ans << '\n';
}
int maxn = sqrt(1e9) + 10;
void pre_work() {
euler(maxn);
}
int main() {
ios::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
int _ = 1;
cin >> _;
pre_work();
while (_--)solve();
}