AtCoder Beginner Contest 247
A Move Right
实现思路
直接把后三位相加即可,然后第一位变成0
代码实现
/*
* @Description: 电影和人生不一样,电影太仁慈了,人生太辛苦了
* @CSDN: https://blog.csdn.net/godhandsjoker?spm=1000.2115.3001.5343
* @Github: https://github.com/godhandsjoker
* @QQ: 3124406837
* @Author: godhands
* @LastEditTime: 2022-04-10 20:06:08
*/
#include <bits/stdc++.h>
using namespace std;
#define int long long
void solve() {
string s;
cin >> s;
string res = "0";
res += s[0], res += s[1], res += s[2];
cout << res << "\n";
}
signed main() {
ios::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
solve();
return 0;
}
B Unique Nicknames
实现思路
每一个人两个名字, 然后我们判断他们两个名字是否同时出现两次以上, 记得特判是否有两个名字相同, 并且都是出现两次的情况
代码实现
/*
* @Description: 电影和人生不一样,电影太仁慈了,人生太辛苦了
* @CSDN: https://blog.csdn.net/godhandsjoker?spm=1000.2115.3001.5343
* @Github: https://github.com/godhandsjoker
* @QQ: 3124406837
* @Author: godhands
* @LastEditTime: 2022-04-10 20:12:57
*/
#include <bits/stdc++.h>
using namespace std;
#define int long long
void solve() {
int n;
cin >> n;
vector<pair<string, string>> a(n);
map<string, int> mp;
for (auto &[u, v] : a) {
cin >> u >> v;
mp[u]++, mp[v]++;
}
for (const auto &[u, v] : a) {
if (mp[u] == 2 and mp[v] == 2 and u == v) continue;
if (mp[u] >= 2 and mp[v] >= 2) {
cout << "No\n";
return;
}
}
cout << "Yes\n";
}
signed main() {
ios::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
solve();
return 0;
}
C 1 2 1 3 1 2 1
实现思路
我们直接递推的去搞就可以, 每次都是前面放两边, 当前的位置放在中间即可
代码实现
/*
* @Description: 电影和人生不一样,电影太仁慈了,人生太辛苦了
* @CSDN: https://blog.csdn.net/godhandsjoker?spm=1000.2115.3001.5343
* @Github: https://github.com/godhandsjoker
* @QQ: 3124406837
* @Author: godhands
* @LastEditTime: 2022-04-10 20:26:37
*/
#include <bits/stdc++.h>
using namespace std;
#define int long long
void solve() {
vector<vector<int>> res(17);
res[1] = {1};
for (int i = 2; i <= 16; i++) {
vector<int> tmp;
for (const auto &it : res[i - 1]) tmp.emplace_back(it);
tmp.emplace_back(i);
for (const auto &it : res[i - 1]) tmp.emplace_back(it);
res[i] = tmp;
}
int n;
cin >> n;
for (const auto &it : res[n]) {
cout << it << " ";
}
cout << "\n";
}
signed main() {
ios::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
solve();
return 0;
}
D_-_Cylinder
实现思路
我们直接模拟这个队列的过程,每次存储的时候存入有多少个球,每一个球的数字是什么,然后我们每次一直拿到满足条件为止,总体时间复杂度就是扫一遍
代码实现
/*
* @Description: 电影和人生不一样,电影太仁慈了,人生太辛苦了
* @CSDN: https://blog.csdn.net/godhandsjoker?spm=1000.2115.3001.5343
* @Github: https://github.com/godhandsjoker
* @QQ: 3124406837
* @Author: godhands
* @LastEditTime: 2022-04-11 19:38:41
*/
#include <bits/stdc++.h>
using namespace std;
#define int long long
void solve() {
int Q;
cin >> Q;
queue<pair<int, int>> q;
while (Q--) {
int op;
cin >> op;
if (op == 1) {
int x, c;
cin >> x >> c;
q.push({x, c});
} else {
int cnt, res = 0;
cin >> cnt;
while (cnt) {
int c = min(q.front().second, cnt);
res += c * q.front().first;
cnt -= c, q.front().second -= c;
if (q.front().second == 0) q.pop();
}
cout << res << "\n";
}
}
}
signed main() {
ios::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
solve();
return 0;
}
E_-_Max_Min
实现思路
其实就是寻找我们有多少个区间满足这样的一个条件,里面所有的数字都是大于等于 X X X,所有的数字都是小于等于 Y Y Y的,然后我们至少有一个数字是等于 X X X或者说是等于 Y Y Y的, 感谢旭哥为我讲解明白了代码,这个每次不断的更新不满足点的位置,和最后一次等于 X X X和等于 Y Y Y的点的位置,我们满足条件的区间就是我们最后一次 X − − Y X--Y X−−Y的区间的左端点到最后一次不满足点(不包含这个点,但是包含我们最后一次 X − − Y X--Y X−−Y的这个区间的左端点的这个点),这个就是我们每一次单次的答案,然后一直到最后,理解起来就是,我们左端点的取值是最后一次 X − − Y X--Y X−−Y的区间的左端点减最后一次不满足点,然后我们每次的 i i i的虽然会变化,但是只要我们前面的这个相减的值不变,那么我们每次就是相当于右端点没变化(针对于满足条件区间的个数来讲),然后如果我们的最后一次 X X X和 Y Y Y变化了,说明我们的满足条件的区间的最左端点要更新了
代码实现
/*
* @Description: 电影和人生不一样,电影太仁慈了,人生太辛苦了
* @CSDN: https://blog.csdn.net/godhandsjoker?spm=1000.2115.3001.5343
* @Github: https://github.com/godhandsjoker
* @QQ: 3124406837
* @Author: godhands
* @LastEditTime: 2022-04-11 21:37:52
*/
#include <bits/stdc++.h>
using namespace std;
#define int long long
void solve() {
int n, x, y, posx = 0, posy = 0, pre = 0, res = 0;
cin >> n >> x >> y;
vector<int> a(n + 1);
for (int i = 1; i <= n; i++) {
cin >> a[i];
if (a[i] > x or a[i] < y) {
pre = i;
}
if (a[i] == x) posx = i;
if (a[i] == y) posy = i;
int left = min(posx, posy);
if (left > pre) res += left - pre;
}
cout << res << "\n";
}
signed main() {
ios::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
solve();
return 0;
}
F_-_Cards
实现思路
这个我们可以首先把一张牌的正反面建一条边,然后我们可以每次连边找环,(这里特别感谢我的好兄弟给我点透了这点为什么建图如何想到的),因为我们可以发现比如我们 2 , 3 , 4 2,3,4 2,3,4成了一个环,那么我们必须需要这三个数字,那么就是转换成为了在这个环里面找这几个数的情况,然后我们对每一个环求有多少个方案数,然后再相乘即可
代码实现
代码实现参考dls,感谢dls代码
/*
* @Description: 电影和人生不一样,电影太仁慈了,人生太辛苦了
* @CSDN: https://blog.csdn.net/godhandsjoker?spm=1000.2115.3001.5343
* @Github: https://github.com/godhandsjoker
* @QQ: 3124406837
* @Author: godhands
* @LastEditTime: 2022-04-12 22:47:47
*/
#include <bits/stdc++.h>
using namespace std;
#define int long long
constexpr int N = 2e5 + 10, mod = 998244353;
int p[N], q[N], f[N], sz[N], n, dp[N][2][2], ans[N], res = 1;
inline int find(int x) {
if (x != f[x]) f[x] = find(f[x]);
return f[x];
}
void solve() {
cin >> n;
for (int i = 1; i <= n; i++) cin >> p[i];
for (int i = 1; i <= n; i++) cin >> q[i];
for (int i = 1; i <= n; i++) f[i] = i;
for (int i = 1; i <= n; i++) f[find(p[i])] = find(q[i]);
for (int i = 1; i <= n; i++) sz[find(f[i])]++;
dp[1][0][0] = 1, dp[1][1][1] = 1, ans[1] = 1;
for (int i = 2; i <= n; i++) {
for (int j = 0; j <= 1; j++) {
dp[i][j][0] = dp[i - 1][j][1];
dp[i][j][1] = (dp[i - 1][j][1] + dp[i - 1][j][0]) % mod;
}
ans[i] = (dp[i][1][1] + dp[i][0][1] + dp[i][1][0]) % mod;
}
for (int i = 1; i <= n; i++) {
if (f[i] == i) res = res * ans[sz[i]] % mod;
}
cout << res << "\n";
}
signed main() {
ios::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
solve();
return 0;
}
G_-_Dream_Team
实现思路
这个直接跑一个最小费用流就可以,代码参考清烛
/*
* @Description: 电影和人生不一样,电影太仁慈了,人生太辛苦了
* @CSDN: https://blog.csdn.net/godhandsjoker?spm=1000.2115.3001.5343
* @Github: https://github.com/godhandsjoker
* @QQ: 3124406837
* @Author: godhands
* @LastEditTime: 2022-04-12 23:08:36
*/
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
constexpr i64 big = 1e12, N = 307;
namespace atcoder {
template <class Cap, class Cost>
struct mcf_graph {
public:
mcf_graph() {}
mcf_graph(int n) : _n(n), g(n) {}
int add_edge(int from, int to, Cap cap, Cost cost) {
assert(0 <= from && from < _n);
assert(0 <= to && to < _n);
int m = int(pos.size());
pos.push_back({from, int(g[from].size())});
int from_id = int(g[from].size());
int to_id = int(g[to].size());
if (from == to) to_id++;
g[from].push_back(_edge{to, to_id, cap, cost});
g[to].push_back(_edge{from, from_id, 0, -cost});
return m;
}
struct edge {
int from, to;
Cap cap, flow;
Cost cost;
};
edge get_edge(int i) {
int m = int(pos.size());
assert(0 <= i && i < m);
auto _e = g[pos[i].first][pos[i].second];
auto _re = g[_e.to][_e.rev];
return edge{
pos[i].first, _e.to, _e.cap + _re.cap, _re.cap, _e.cost,
};
}
std::vector<edge> edges() {
int m = int(pos.size());
std::vector<edge> result(m);
for (int i = 0; i < m; i++) {
result[i] = get_edge(i);
}
return result;
}
std::pair<Cap, Cost> flow(int s, int t) {
return flow(s, t, std::numeric_limits<Cap>::max());
}
std::pair<Cap, Cost> flow(int s, int t, Cap flow_limit) {
return slope(s, t, flow_limit).back();
}
std::vector<std::pair<Cap, Cost>> slope(int s, int t) {
return slope(s, t, std::numeric_limits<Cap>::max());
}
std::vector<std::pair<Cap, Cost>> slope(int s, int t, Cap flow_limit) {
assert(0 <= s && s < _n);
assert(0 <= t && t < _n);
assert(s != t);
// variants (C = maxcost):
// -(n-1)C <= dual[s] <= dual[i] <= dual[t] = 0
// reduced cost (= e.cost + dual[e.from] - dual[e.to]) >= 0 for all edge
std::vector<Cost> dual(_n, 0), dist(_n);
std::vector<int> pv(_n), pe(_n);
std::vector<bool> vis(_n);
auto dual_ref = [&]() {
std::fill(dist.begin(), dist.end(),
std::numeric_limits<Cost>::max());
std::fill(pv.begin(), pv.end(), -1);
std::fill(pe.begin(), pe.end(), -1);
std::fill(vis.begin(), vis.end(), false);
struct Q {
Cost key;
int to;
bool operator<(Q r) const { return key > r.key; }
};
std::priority_queue<Q> que;
dist[s] = 0;
que.push(Q{0, s});
while (!que.empty()) {
int v = que.top().to;
que.pop();
if (vis[v]) continue;
vis[v] = true;
if (v == t) break;
// dist[v] = shortest(s, v) + dual[s] - dual[v]
// dist[v] >= 0 (all reduced cost are positive)
// dist[v] <= (n-1)C
for (int i = 0; i < int(g[v].size()); i++) {
auto e = g[v][i];
if (vis[e.to] || !e.cap) continue;
// |-dual[e.to] + dual[v]| <= (n-1)C
// cost <= C - -(n-1)C + 0 = nC
Cost cost = e.cost - dual[e.to] + dual[v];
if (dist[e.to] - dist[v] > cost) {
dist[e.to] = dist[v] + cost;
pv[e.to] = v;
pe[e.to] = i;
que.push(Q{dist[e.to], e.to});
}
}
}
if (!vis[t]) {
return false;
}
for (int v = 0; v < _n; v++) {
if (!vis[v]) continue;
// dual[v] = dual[v] - dist[t] + dist[v]
// = dual[v] - (shortest(s, t) + dual[s] - dual[t]) +
// (shortest(s, v) + dual[s] - dual[v]) = - shortest(s,
// t) + dual[t] + shortest(s, v) = shortest(s, v) -
// shortest(s, t) >= 0 - (n-1)C
dual[v] -= dist[t] - dist[v];
}
return true;
};
Cap flow = 0;
Cost cost = 0, prev_cost_per_flow = -1;
std::vector<std::pair<Cap, Cost>> result;
result.push_back({flow, cost});
while (flow < flow_limit) {
if (!dual_ref()) break;
Cap c = flow_limit - flow;
for (int v = t; v != s; v = pv[v]) {
c = std::min(c, g[pv[v]][pe[v]].cap);
}
for (int v = t; v != s; v = pv[v]) {
auto& e = g[pv[v]][pe[v]];
e.cap -= c;
g[v][e.rev].cap += c;
}
Cost d = -dual[s];
flow += c;
cost += c * d;
if (prev_cost_per_flow == d) {
result.pop_back();
}
result.push_back({flow, cost});
prev_cost_per_flow = d;
}
return result;
}
private:
int _n;
struct _edge {
int to, rev;
Cap cap;
Cost cost;
};
std::vector<std::pair<int, int>> pos;
std::vector<std::vector<_edge>> g;
};
} // namespace atcoder
atcoder::mcf_graph<int, i64> G(N);
int s, t, n;
void solve() {
cin >> n;
s = 301, t = 302;
for (int i = 1; i <= 150; i++) {
G.add_edge(s, i, 1, 0), G.add_edge(i + 150, t, 1, 0);
}
for (int i = 1; i <= n; i++) {
int a, b, c;
cin >> a >> b >> c;
G.add_edge(a, b + 150, 1, big - c);
}
vector<i64> res;
for (int i = 1; i <= n; i++) {
auto g = G;
auto p = g.flow(s, t, i);
if (p.first < i) break;
res.emplace_back(big * i - p.second);
}
cout << res.size() << "\n";
for (const auto& it : res) {
cout << it << "\n";
}
}
signed main() {
ios::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
solve();
return 0;
}