「蓝桥」0419 第 28 场 蓝桥月赛

Author: gdut-yy

lanqiao/src/main/java/lq250419/LQ250419T1.cpp

@@ -0,0 +1,28 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+typedef long long ll;
+
+void solve() {
+ int red = 123;
+ int yellow = 456;
+ int blue = 789;
+
+ int green = min(yellow, blue);
+ int ans = red + yellow + blue - green;
+ 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/lq250419/LQ250419T2.cpp

@@ -0,0 +1,59 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+typedef long long ll;
+
+void solve() {
+ int n;
+ cin >> n;
+
+ // 存储每天的燃油消耗
+ vector<ll> A(n + 1), B(n + 1);
+ // 前缀和数组
+ vector<ll> prefix_A(n + 1, 0), prefix_B(n + 1, 0);
+
+ for (int i = 1; i <= n; ++i) {
+ cin >> A[i];
+ }
+ for (int i = 1; i <= n; ++i) {
+ cin >> B[i];
+ }
+
+ // 读入燃油消耗
+ for (int i = 1; i <= n; ++i) {
+ // 计算前缀和
+ prefix_A[i] = prefix_A[i - 1] + A[i];
+ prefix_B[i] = prefix_B[i - 1] + B[i];
+ }
+
+ // 初始最小消耗：全程用A或B
+ ll min_cost = min(prefix_A[n], prefix_B[n]);
+
+ // 情况1：从A切换到B
+ for (int k = 1; k < n; ++k) {
+ ll cost = prefix_A[k] + (prefix_B[n] - prefix_B[k]);
+ min_cost = min(min_cost, cost);
+ }
+ // 情况2：从B切换到A
+ for (int k = 1; k < n; ++k) {
+ ll cost = prefix_B[k] + (prefix_A[n] - prefix_A[k]);
+ min_cost = min(min_cost, cost);
+ }
+
+ // 输出结果
+ cout << min_cost << 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/lq250419/LQ250419T3.cpp

@@ -0,0 +1,46 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+typedef long long ll;
+
+void solve() {
+ int n, d;
+ cin >> n >> d;
+
+ set<int> s;
+ for (int i = 0; i < n; ++i) {
+ int x;
+ cin >> x;
+ s.insert(x);
+ }
+
+ int res = 0;
+ set<int> t;
+ for (int v: s) {
+ if (!t.count(v)) {
+ int g = v;
+ int ans = 0;
+ while (s.count(g) && !t.count(g)) {
+ ans++;
+ t.insert(g);
+ g += d;
+ }
+ res += (ans + 1) / 2;
+ }
+ }
+ cout << res << 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/lq250419/LQ250419T4.cpp

@@ -0,0 +1,34 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+typedef long long ll;
+
+void solve() {
+ int n;
+ cin >> n;
+ vector<int> a(n - 1);
+ for (auto &i: a) {
+ cin >> i;
+ }
+
+ int res = 0, p = 0;
+ while (a[p] != n) {
+ res++;
+ p = max_element(a.begin() + p, a.begin() + a[p]) - a.begin();
+ }
+ cout << res + 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/lq250419/LQ250419T5.cpp

@@ -0,0 +1,42 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+typedef long long ll;
+
+const int mod = 1e9 + 7;
+
+void solve() {
+ int n;
+ cin >> n;
+ vector<int> a(n);
+ for (int i = 0; i < n; ++i) {
+ cin >> a[i];
+ }
+ if (n > 3000) {
+ cout << 0 << endl;
+ return;
+ }
+
+ ll ans = 1;
+ for (int i = 0; i < n; ++i) {
+ for (int j = i + 1; j < n; ++j) {
+ ans *= (a[i] ^ a[j]);
+ ans %= mod;
+ }
+ }
+ 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/lq250419/LQ250419T6.cpp

@@ -0,0 +1,31 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+typedef long long ll;
+
+const int mod = 1e9 + 7;
+
+void solve() {
+ ll a, b, c;
+ cin >> a >> b >> c;
+
+ if (a > c) {
+ cout << b + c * 2 << endl;
+ } else {
+ cout << b / 2 * 2 + a * 2 + (c - a) / 2 << endl;
+ }
+}
+
+signed main() {
+ ios::sync_with_stdio(false);
+ cin.tie(nullptr);
+
+ int t = 1;
+ cin >> t;
+ while (t--) solve();
+ return 0;
+}
+
+/*
+吃零食训练【算法赛】
+ */