AtCoder Beginner Contest 192

A - Star
B - uNrEaDaBlE sTrInG
C - Kaprekar Numbe
E - Train

导读：
简单的题目，只说明题意，或者直接说明结论
下面的难题，会做详细的解释和证明
立个flag，在座的大佬们做个见证：一个月刷60场ABC，现在2021/6/20，第五天，已打卡八场。

A - Star

当前值到100的整数倍还差多少，如果不差就输出100

void work()
{int x; cin >> x;cout << (x % 100 ? 100 - x % 100 : 100) << "\n";
}

B - uNrEaDaBlE sTrInG

判断奇数位置是不是全是小写，偶数位置全是大写

void work()
{char s[N]; cin >> (s + 1);int n = strlen(s + 1);// cout << s + 1<< endl;// cout << s[3] << endl;for (int i = 1; i <= n; i ++ )if (i & 1){      if (s[i] < 'a' || s[i] > 'z'){cout << "No" << endl;return;}}else{if (s[i] < 'A' || s[i] > 'Z'){cout << "No" << endl;return;}}cout << "Yes" << endl;
}

C - Kaprekar Numbe

K不大，可以直接暴力模拟

void work()
{int n, k; cin >> n >> k;int t = 100;set<int> S;while (k -- ){string t = to_string(n);sort(t.begin(), t.end());string s = t;reverse(t.begin(), t.end());int a = stoi(t);int b = stoi(s);n = a - b;}cout << n << endl;return;
}

E - Train

题目中说，只有我们的现在已经使用的时间为ki的整数倍的时候，才能上i这辆列车，那么我们在跑dijkstra的时候，每次更新dist数组的时候就按照这个规则来就好了

#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = a; i < b; i ++ )
using ll = int64_t;
typedef pair<ll, ll> PLL;
const int N = 100010, M = 200010;
int n, m, sx, sy;
ll head[N], ver[M], Next[M], edge[M], kk[M], tot;
void add(int a, int b, int c, int d)
{ver[++ tot] = b, edge[tot] = c, kk[tot] = d, Next[tot] = head[a], head[a] = tot;
}
ll dijkstra()
{// ll dist[N];// memset(dist, 0x7f, sizeof dist);vector<ll> dist(n + 1, (ll)1 << 60);dist[sx] = 0;bool st[N] = {0};priority_queue<PLL, vector<PLL>, greater<PLL> > q;q.push({0, sx});while (q.size()){PLL t = q.top(); q.pop();ll x = t.second;if (x == sy) {return dist[sy];}if (st[x]) continue;st[x] = true;for (int i = head[x]; i; i = Next[i]){ll y = ver[i];if (st[y]) continue;ll distance = (dist[x] + kk[i] - 1) / kk[i] * kk[i] + edge[i];if (dist[y] > distance){dist[y] = (dist[x] + kk[i] - 1) / kk[i] * kk[i] + edge[i];q.push({dist[y], y});}}}return -1;
}
int main()
{cin >> n >> m >> sx >> sy;while (m -- ){ll x, y, t, k; scanf("%lld%lld%lld%lld", &x, &y, &t, &k);add(x, y, t, k);add(y, x, t, k);}ll val = dijkstra();cout << val << endl;return 0;
}

AtCoder Beginner Contest 192相关推荐

AtCoder Beginner Contest 192 A~D题解
ABC192 A~D [A - Star](https://atcoder.jp/contests/abc192/tasks/abc192_a) 题目大意输入格式输出格式样例分析代码 [B ...
AtCoder Beginner Contest 192 F - Potion 背包dp
传送门题意: 给你nnn个数,让后让你选出来kkk个AAA,把他们求和,之后再递增kkk直到正好达到xxx,求最小的递增次数. 思路: 转化一下题意就是求∑A=x(modlen)\sum A=x(\ ...
AtCoder Beginner Contest 202 D - aab aba baa（组合计数，字典序）
整理的算法模板合集: ACM模板点我看算法全家桶系列!!! 实际上是一个全新的精炼模板整合计划 Problem 有 AAA 和 aaa,BBB 个 bbb ,可以使用这 A+BA+BA+B 个字符任 ...
AtCoder Beginner Contest 197 题解（A ~ F）
整理的算法模板合集: ACM模板点我看算法全家桶系列!!! 实际上是一个全新的精炼模板整合计划目录 A - Rotate B - Visibility C - ORXOR D - Opposite ...
AtCoder Beginner Contest 198 （A ~ F）题解
目录 A. Div B. Palindrome with leading zeros C. Compass Walking D. Send More Money E. Unique Color F. ...
AtCoder Beginner Contest 215 G - Colorful Candies 2
AtCoder Beginner Contest 215 G - Colorful Candies 2 有n个糖果,每个糖果有着一个颜色a[i],每次拿k个糖果期望拿到E(x)个不同颜色的糖果,求出k ...
AtCoder Beginner Contest 215 F - Dist Max 2
AtCoder Beginner Contest 215 F - Dist Max 2 平面上有一系列的点(xi,yi)(x_i,y_i)(xi,yi),定义两点(xi,yi),(xj,yj)(x ...
AtCoder Beginner Contest 215 E - Chain Contestant
AtCoder Beginner Contest 215 E - Chain Contestant 给出一个只包括A~J的字符串,定义一种子序列为:在这个子序列中,相同的字符必定连续出现,求出这样的子 ...
AtCoder Beginner Contest 204 F Hanjo 2
AtCoder Beginner Contest 204 F Hanjo 2 H宽,W长的二维平面上,用1 * 1或者2 * 1的地砖来铺,要求铺满,求出方案数. 数据范围H <= 6, W & ...

AtCoder Beginner Contest 192

AtCoder Beginner Contest 192

A - Star

B - uNrEaDaBlE sTrInG

C - Kaprekar Numbe

E - Train

AtCoder Beginner Contest 192相关推荐

最新文章

热门文章