AtCoder Beginner Contest 373(A - D)

最新推荐文章于 2024-10-03 23:44:20 发布

2004xjh

最新推荐文章于 2024-10-03 23:44:20 发布

阅读量555

点赞数 29

分类专栏： atcoder 文章标签： c++ 算法 c语言

本文链接：https://blog.csdn.net/anran1110/article/details/142622956

版权

atcoder 专栏收录该内容

3 篇文章 0 订阅

订阅专栏

传送门

A - September

分析

这一题是个模拟题，对当前第 $i$ 个字符串的长度与 $i$ 进行比较，相等时答案 $+ 1$

#include<bits/stdc++.h>
using std::cin;
using std::cout;
using i32 = int;
using u32 = unsigned int;
using i64 = long long;
using u64 = unsigned long long;
using pii = std::pair<int, int>;
#define TESTS int _; std::cin >> _; while(_--)
#define all(a) a.begin(), a.end()
#define all1(a) a.begin() + 1, a.end()
#define pb push_back
#define fi first
#define se second
#define SUM(v) std::accumulate(all(v), 0LL)
#define SUM1(v) std::accumulate(all1(v), 0LL)
#define MIN(v) *std::min_element(all(v))
#define MIN1(v) *std::min_element(all1(v))
#define MAX(v) *std::max_element(all(v))
#define MAX1(v) *std::max_element(all1(v))
#define UNIQUE(v) std::sort(all(v)), v.erase(std::unique(all(v), v.end()))
#define UNIQUE1(v) std::sort(all1(v)), v.erase(std::unique(all1(v), v.end()))

constexpr i64 inf = 1E18, Md3 = 998244353, Md7 = 1e9 + 7;
constexpr double eps = 1E-9;


int main() {
	
	std::ios::sync_with_stdio(false);
	std::cin.tie(0);
		
	int ans = 0;
	for(int i = 0; i < 12; i++) {
		std::string s;
		std::cin >> s;
		if(s.size() == i + 1) {
			ans++;
		}
	}
	cout << ans;

	return 0;
}

B - 1D Keyboard

分析

这一题由于 $ABCDEFG\dots$ 的顺序是固定的，所以依次记录 $ABCDEFG\dots$ 的位置，直接进行取绝对值即可

#include<bits/stdc++.h>
using std::cin;
using std::cout;
using i32 = int;
using u32 = unsigned int;
using i64 = long long;
using u64 = unsigned long long;
using pii = std::pair<int, int>;
#define TESTS int _; std::cin >> _; while(_--)
#define all(a) a.begin(), a.end()
#define all1(a) a.begin() + 1, a.end()
#define pb push_back
#define fi first
#define se second
#define SUM(v) std::accumulate(all(v), 0LL)
#define SUM1(v) std::accumulate(all1(v), 0LL)
#define MIN(v) *std::min_element(all(v))
#define MIN1(v) *std::min_element(all1(v))
#define MAX(v) *std::max_element(all(v))
#define MAX1(v) *std::max_element(all1(v))
#define UNIQUE(v) std::sort(all(v)), v.erase(std::unique(all(v), v.end()))
#define UNIQUE1(v) std::sort(all1(v)), v.erase(std::unique(all1(v), v.end()))

constexpr i64 inf = 1E18, Md3 = 998244353, Md7 = 1e9 + 7;
constexpr double eps = 1E-9;


int main() {
	
	std::ios::sync_with_stdio(false);
	std::cin.tie(0);
		
	std::map<char, int> mp;
	std::string s;
	std::cin >> s;
	for(int i = 0; i < s.size(); i++) {
		mp[s[i]] = i;
	}

	int ans = 0;
	for(char i = 'B'; i <= 'Z'; i++) {
		ans += abs(mp[char(i - 1)] - mp[i]);
	}
	cout << ans;
	return 0;
}

C - Max Ai+Bj

分析

这题纸老虎，虽然在 $C$ ，其实和 $A$ 题差不多，只需要让 $A$ 和 $B$ 数组中的最大值相加即可

#include<bits/stdc++.h>
using std::cin;
using std::cout;
using i32 = int;
using u32 = unsigned int;
using i64 = long long;
using u64 = unsigned long long;
using pii = std::pair<int, int>;
#define TESTS int _; std::cin >> _; while(_--)
#define all(a) a.begin(), a.end()
#define all1(a) a.begin() + 1, a.end()
#define pb push_back
#define fi first
#define se second
#define SUM(v) std::accumulate(all(v), 0LL)
#define SUM1(v) std::accumulate(all1(v), 0LL)
#define MIN(v) *std::min_element(all(v))
#define MIN1(v) *std::min_element(all1(v))
#define MAX(v) *std::max_element(all(v))
#define MAX1(v) *std::max_element(all1(v))
#define UNIQUE(v) std::sort(all(v)), v.erase(std::unique(all(v), v.end()))
#define UNIQUE1(v) std::sort(all1(v)), v.erase(std::unique(all1(v), v.end()))

constexpr i64 inf = 1E18, Md3 = 998244353, Md7 = 1e9 + 7;
constexpr double eps = 1E-9;


int main() {
	
	std::ios::sync_with_stdio(false);
	std::cin.tie(0);
		
	int n;
	cin >> n;
	std::vector<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];
	}
	cout << MAX(a) + MAX(b);
	return 0;
}

D - Hidden Weights

分析

这题由于 $v - u = w$ ，那么等式 $u - v = - w$ ，所以可以直接建双边，然后直接对 $1$ 进行dfs即可

#include<bits/stdc++.h>
using std::cin;
using std::cout;
using i32 = int;
using u32 = unsigned int;
using i64 = long long;
using u64 = unsigned long long;
using pii = std::pair<int, int>;
#define TESTS int _; std::cin >> _; while(_--)
#define all(a) a.begin(), a.end()
#define all1(a) a.begin() + 1, a.end()
#define pb push_back
#define fi first
#define se second
#define SUM(v) std::accumulate(all(v), 0LL)
#define SUM1(v) std::accumulate(all1(v), 0LL)
#define MIN(v) *std::min_element(all(v))
#define MIN1(v) *std::min_element(all1(v))
#define MAX(v) *std::max_element(all(v))
#define MAX1(v) *std::max_element(all1(v))
#define UNIQUE(v) std::sort(all(v)), v.erase(std::unique(all(v), v.end()))
#define UNIQUE1(v) std::sort(all1(v)), v.erase(std::unique(all1(v), v.end()))

constexpr i64 inf = 1E18, Md3 = 998244353, Md7 = 1e9 + 7;
constexpr double eps = 1E-9;


int main() {
	
	std::ios::sync_with_stdio(false);
	std::cin.tie(0);
		
	int N, M;
	cin >> N >> M;

	std::vector<std::vector<pii>> adj(N);
	std::vector<i64> ans(N);
	for(int i = 0; i < M; i++) {
		int u, v, w;
		cin >> u >> v >> w;
		u--;
		v--;
		adj[u].push_back({v, w});
		adj[v].push_back({u, -w});
	}

	std::vector<bool> vis(N);


	auto dfs = [&](auto self, int u, int fa) -> void {
		vis[u] = true;
		for(auto [v, w] : adj[u]) {
			if(v == fa || vis[v]) {
				continue;
			}
			ans[v] = ans[u] + w;
			self(self, v, u);
		}
	};

	for(int i = 0; i < N; i++) {
		if(!vis[i]) {
			dfs(dfs, i, -1);
		}
	}


	
	for(int i = 0; i < N; i++) {
		cout << ans[i] << " \n"[i == N - 1];
	}


	return 0;
}