ACGO欢乐赛#50 AC代码
2025-06-29 22:00:07
发布于：浙江
36阅读
0回复
0点赞
非官方题解，请以官方为准！【注：本题解于比赛结束后发布，不存在违规行为。】
T1
#include<iostream>
using namespace std;
int main() {
cout << "###.###" << endl;
cout << "#...#.#" << endl;
cout << "###.#.#" << endl;
cout << "..#.#.#" << endl;
cout << "###.###";
return 0;
}
T2
#include<iostream>
#include<algorithm>
using namespace std;
int n, m, a, q, b[10005];
int main() {
cin >> n >> m >> a >> q;
for (int i = 0; i < q; i++) cin >> b[i];
sort(b, b + q);
int ans = (n - a) * (m - b[q - 1]);
for (int i = 0; i < q; i++) {
ans = max(ans, (n - a) * (m - b[i]));
}
cout << ans;
return 0;
}
T3
#include<iostream>
using namespace std;
int main() {
int n, score = 0;
cin >> n;
int a[n], b[n];
for (int i = 0; i < n; ++i) cin >> a[i];
for (int i = 0; i < n; ++i) cin >> b[i];
for (int i = 0; i < n; ++i) {
if (a[i] > b[i]) score += 3;
else if (a[i] < b[i]) score -= 3;
}
cout << score;
return 0;
}
T4
#include<iostream>
#include<set>
using namespace std;
set<int> p;
int main() {
int n, m;
cin >> n >> m;
for (int i = 0; i < m; ++i) {
int x;
cin >> x;
p.insert(x);
}
for (int i = 1; i < n; ++i) {
set<int> t;
for (int j = 0; j < m; ++j) {
int x;
cin >> x;
t.insert(x);
}
set<int> tmp;
for (auto x : p) if (t.count(x)) tmp.insert(x);
p = tmp;
}
cout << p.size();
return 0;
}
T5
#include<iostream>
#include<cmath>
using namespace std;
int a, b;
int main() {
cin >> a >> b;
double h = a * 30 + b * 0.5, m = b * 6;
double ang = fabs(h - m);
if (ang > 180) ang = 360 - ang;
printf("%.2f", ang);
return 0;
}
T6
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
struct T {
int s, p, id;
};
bool cmp(const T &a, const T &b) {
if (a.s != b.s) return a.s > b.s;
if (a.p != b.p) return a.p < b.p;
return a.id < b.id;
}
int n, m, t, p, r;
vector<T> v;
int main() {
cin >> n;
v.resize(n);
for (int i = 0; i < n; ++i) {
v[i].id = i + 1;
cin >> m;
vector<pair<int, int>> s(13, {0, 0});
for (int j = 0; j < m; ++j) {
cin >> t >> p >> r;
p--;
if (r == 0) s[p].first++;
else if (r == 1 && s[p].second == 0) {
v[i].s++;
v[i].p += t + s[p].first * 15;
s[p].second = 1;
}
}
}
sort(v.begin(), v.end(), cmp);
for (auto &x : v) cout << x.id << " ";
return 0;
}
有帮助，赞一个