牛客周赛 Round 46 题解 C++

目录

 A 乐奈吃冰

B 素世喝茶

C 爱音开灯

D 小灯做题

E 立希喂猫

F 祥子拆团

---

 A 乐奈吃冰

#include <iostream>
#include <cstring>
#include <algorithm>
#include <cmath> 
#include <queue>
#include <set>
#include <vector>
#include <unordered_map>using namespace std;typedef pair<int,int> PII;
typedef long long ll;const int N = 3e5 + 10,M = 1e9 + 7;int n,m;
int a[N],b[N];
bool st[N];
ll cnt;void solve()
{cin >> n >> m;if(n == 1){cout << 1;return ;}if(m > n / 2){cout << n / 2 + n;}else{cout << n + m;}
}int main()
{std::ios::sync_with_stdio(false);cin.tie(nullptr);int t = 1;while(t --){solve();}return 0;
}

B 素世喝茶

#include <iostream>
#include <cstring>
#include <algorithm>
#include <cmath> 
#include <queue>
#include <set>
#include <vector>
#include <unordered_map>using namespace std;typedef pair<int,int> PII;
typedef long long ll;const int N = 3e5 + 10,M = 1e9 + 7;int n,m;
int a[N];
bool st[N];
ll cnt;void solve()
{cin >> n >> m;int mx = 0;for(int i = 1; i <= n; i ++){int x;cin >> x;if(i == m) continue;if(x > mx){mx = x;cnt = 1;}else if(x == mx){cnt ++;}}cout << cnt;
}int main()
{std::ios::sync_with_stdio(false);cin.tie(nullptr);int t = 1;while(t --){solve();}return 0;
}

C 爱音开灯

#include <iostream>
#include <cmath>using namespace std;void solve() {long long n, m;cin >> n >> m;long long cnt = 0;for (long long i = 1; i * i <= m; i++) {if(m % i == 0){if(i<=n) cnt++;if(m/i!=i&&m/i<=n) cnt++;}}if (cnt % 2 == 1) {cout << "ON";} else {cout << "OFF";}
}int main() {std::ios::sync_with_stdio(false);cin.tie(nullptr);int t = 1;while (t--) {solve();}return 0;
}

D 小灯做题

#include <iostream>
#include <cstring>
#include <algorithm>
#include <cmath> 
#include <queue>
#include <set>
#include <vector>
#include <unordered_map>using namespace std;typedef pair<int,int> PII;
typedef long long ll;const int N = 3e5 + 10,M = 1e9 + 7;ll n,m;
int a[N];
bool st[N];
ll cnt;
int k,res;int mex(int a,int b){if(a + b == 1){return 2;}else{if(a == 0 || b == 0){return 1;}else{return 0;}}
}void dfs(int a,int b,int c,int sum){if(sum > 3 || a == k || b == k || c == k){res=min(res,sum);return ;}dfs(a,b,mex(a,b),sum+1);dfs(a,mex(a,c),c,sum+1);dfs(mex(b,c),b,c,sum+1);
}void solve()
{cin >> n;while(n --){int a,b,c;cin >> a >> b >> c >> k;res = N;if(a == k || b == k || c == k){cout << 0 << "\n";continue;}if(k >= 3){cout << -1 << "\n";continue;}dfs(a,b,c,0);cout << res << "\n";}}
int main()
{std::ios::sync_with_stdio(false);cin.tie(nullptr);int t = 1;while(t --){solve();}return 0;
}

E 立希喂猫

#include <iostream>
#include <cstring>
#include <algorithm>
#include <cmath> 
#include <queue>
#include <set>
#include <vector>
#include <unordered_map>using namespace std;typedef pair<int,int> PII;
typedef long long ll;
#define x first
#define y secondconst int N = 3e5 + 10,M = 1e9 + 7;ll n,m;
ll s1[N],s2[N];
ll c[N];
bool st[N];
ll cnt;PII a[N];void solve()
{cin >> n;for(int i = 1; i <= n ;i ++){cin >> a[i].y;}for(int i = 1; i <= n ;i ++){cin >> a[i].x;}sort(a+1,a+1+n);for(int i = 1; i <= n ; i ++){s1[i] += s1[i-1] + a[i].y * a[i].x;s2[i] += s2[i-1] + a[i].y;}cin >> m;while(m --){int t;cin >> t;ll res = 0;pair<int,int> p(t,0);int id_1 = upper_bound(a + 1,a+ n + 1,p) - a;res += s1[id_1 - 1];res += (s2[n] - s2[id_1 - 1]) * t; cout << res << "\n";}return ;
}
int main()
{std::ios::sync_with_stdio(false);cin.tie(nullptr);int t = 1;while(t --){solve();}return 0;
}

F 祥子拆团

没代码思路，后面补