「蓝桥」0405 第 28 场 蓝桥入门赛

Author: gdut-yy

lanqiao/src/main/java/lq250405/LQ250405T1.cpp

@@ -0,0 +1,22 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+typedef long long ll;
+
+void solve() {
+ cout << "I will fight and win" << endl;
+}
+
+signed main() {
+ ios::sync_with_stdio(false);
+ cin.tie(nullptr);
+
+ int t = 1;
+ // cin >> t;
+ while (t--) solve();
+ return 0;
+}
+
+/*
+胜利终将属于你【算法赛】
+ */

lanqiao/src/main/java/lq250405/LQ250405T2.cpp

@@ -0,0 +1,32 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+typedef long long ll;
+
+void solve() {
+ int a, b, c;
+ cin >> a >> b >> c;
+
+ vector<pair<int, char> > v = {{a, 'l'}, {b, 'q'}, {c, 'b'}};
+ sort(v.begin(), v.end());
+
+ if (v[2].first > v[0].first + v[1].first) {
+ cout << v[2].second << endl;
+ } else {
+ cout << -1 << endl;
+ }
+}
+
+signed main() {
+ ios::sync_with_stdio(false);
+ cin.tie(nullptr);
+
+ int t = 1;
+ // cin >> t;
+ while (t--) solve();
+ return 0;
+}
+
+/*
+团队赛【算法赛】
+ */

lanqiao/src/main/java/lq250405/LQ250405T3.cpp

@@ -0,0 +1,40 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+typedef long long ll;
+
+void solve() {
+ int n, q;
+ cin >> n >> q;
+
+ ll ans = 0;
+ vector<int> a(n);
+ for (int i = 0; i < n; ++i) {
+ cin >> a[i];
+ ans += a[i];
+ }
+ while (q--) {
+ int l, r;
+ cin >> l >> r;
+ int cnt = (r - l + 1) / 2;
+ ans -= cnt;
+ if ((r - l + 1) % 2) {
+ ans += r;
+ }
+ }
+ cout << ans << endl;
+}
+
+signed main() {
+ ios::sync_with_stdio(false);
+ cin.tie(nullptr);
+
+ int t = 1;
+ // cin >> t;
+ while (t--) solve();
+ return 0;
+}
+
+/*
+蓝桥速算【算法赛】
+ */

lanqiao/src/main/java/lq250405/LQ250405T4.cpp

@@ -0,0 +1,32 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+typedef long long ll;
+
+void solve() {
+ int n, m;
+ cin >> n >> m;
+
+ vector<int> A(n);
+ for (auto &i: A) cin >> i;
+ sort(A.begin(), A.end());
+ if (A[0] <= m && m <= A[n - 1]) {
+ cout << "YES" << endl;
+ } else {
+ cout << "NO" << endl;
+ }
+}
+
+signed main() {
+ ios::sync_with_stdio(false);
+ cin.tie(nullptr);
+
+ int t = 1;
+ cin >> t;
+ while (t--) solve();
+ return 0;
+}
+
+/*
+浓缩咖啡液【算法赛】
+ */

lanqiao/src/main/java/lq250405/LQ250405T5.cpp

@@ -0,0 +1,76 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+typedef long long ll;
+
+void solve() {
+ int n;
+ cin >> n;
+
+ vector<int> t1(n), t2(n);
+ for (int i = 0; i < n; ++i) {
+ cin >> t1[i];
+ }
+ for (int i = 0; i < n; ++i) {
+ cin >> t2[i];
+ }
+
+ vector<pair<int, int> > gifts(n);
+ for (int i = 0; i < n; ++i) {
+ gifts[i] = {t1[i], t2[i]};
+ }
+
+ vector<pair<int, int> > groupA, groupB;
+ for (const auto &gift: gifts) {
+ if (gift.first <= gift.second) {
+ groupA.push_back(gift);
+ } else {
+ groupB.push_back(gift);
+ }
+ }
+
+ sort(groupA.begin(), groupA.end(),
+ [](const pair<int, int> &a, const pair<int, int> &b) {
+ return a.first < b.first;
+ });
+ sort(groupB.begin(), groupB.end(),
+ [](const pair<int, int> &a, const pair<int, int> &b) {
+ return a.second > b.second;
+ });
+
+ // 合并组A和组B
+ vector<pair<int, int> > sorted_gifts;
+ sorted_gifts.insert(sorted_gifts.end(), groupA.begin(), groupA.end());
+ sorted_gifts.insert(sorted_gifts.end(), groupB.begin(), groupB.end());
+
+ // 计算总时间
+ int sum_t1 = 0;
+ for (const auto &gift: sorted_gifts) {
+ sum_t1 += gift.first;
+ }
+
+ int santa_end = 0;
+ int current_pack_time = 0;
+ for (const auto &gift: sorted_gifts) {
+ current_pack_time += gift.first;
+ int start = max(current_pack_time, santa_end);
+ santa_end = start + gift.second;
+ }
+
+ int total_time = max(sum_t1, santa_end);
+ cout << total_time << endl;
+}
+
+signed main() {
+ ios::sync_with_stdio(false);
+ cin.tie(nullptr);
+
+ int t = 1;
+ // cin >> t;
+ while (t--) solve();
+ return 0;
+}
+
+/*
+破译密码【算法赛】
+ */

lanqiao/src/main/java/lq250405/LQ250405T6.cpp

@@ -0,0 +1,31 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+typedef long long ll;
+
+void solve() {
+ string n;
+ cin >> n;
+ set<string> s;
+
+ for (int i = 0; i <= n.size(); ++i) {
+ for (char j = (i ? '0' : '1'); j <= '9'; ++j) {
+ s.insert(n.substr(0, i) + j + n.substr(i));
+ }
+ }
+ cout << s.size() << endl;
+}
+
+signed main() {
+ ios::sync_with_stdio(false);
+ cin.tie(nullptr);
+
+ int t = 1;
+ // cin >> t;
+ while (t--) solve();
+ return 0;
+}
+
+/*
+插入数字【算法赛】
+ */