PTA
_Yuh_
...
展开
-
天梯地图 (30 分)
天梯地图跑两次Dijkstra,最后输出有点啰嗦,太懒了,不想改了#include <bits/stdc++.h>using namespace std;const int N = 500+10;typedef pair<int,int> PII;int n,m,k,st,ed;int u,v,len,op,ti;int g[N][N],cost[N][N],path[N];int dist[N],vis[N],dis[N];int cnt[N],sum[N原创 2021-10-15 21:20:37 · 229 阅读 · 0 评论 -
L2-001 紧急救援 (25 分)
输入:4 5 0 320 30 40 100 1 11 3 20 3 30 2 22 3 2输出:2 600 1 3优先队列:#include <bits/stdc++.h>#define inf 0x3f3f3f3fusing namespace std;int dist[505],path[505],num[505],pathNum[505],cnt[505];int n,m,s,d,g[505][505],vis[505];struct node..原创 2021-04-15 17:26:59 · 80 阅读 · 0 评论 -
L2-034 口罩发放 (25 分)
好恶心的一道题,就因为我把有症状的人用set存,结果一直卡在后三个样例,把我恶心吐了,最后实在没法把set改成vector顺便标记一下看看是否访问过一次,然后就过了,我tm改了接近两个小时,结果就卡在这…#include <iostream>#include <cstdio>#include <cstdlib>#include <cmath>#include <algorithm>#include <string>#..原创 2021-04-10 11:26:20 · 736 阅读 · 1 评论 -
PTA-网红点打卡攻略
#include <iostream>#include <cstdio>#include <cstdlib>#include <cmath>#include <algorithm>#include <string>#include <cstring>#include <vector>#include <map>#include <set>#include <qu.原创 2021-04-10 08:48:00 · 612 阅读 · 0 评论 -
L2-022 重排链表 (25 分)
#include <iostream>#include <cstdio>#include <cstdlib>#include <cmath>#include <algorithm>#include <string>#include <cstring>#include <vector>#include <map>#include <set>#include <s..原创 2021-04-05 20:14:19 · 58 阅读 · 0 评论 -
L3-010 是否完全二叉搜索树 (30 分)
根据节点的编号判断是否是完全二叉搜索树,如果最大的节点编号不等于n就不是,否则就是。#include <iostream>#include <cstdio>#include <cstdlib>#include <cmath>#include <algorithm>#include <string>#include <cstring>#include <vector>#include <m.原创 2021-04-05 15:27:45 · 132 阅读 · 0 评论 -
L1-025 正整数A+B (15 分)
#include <iostream>#include <cstdio>#include <cstdlib>#include <cmath>#include <algorithm>#include <string>#include <cstring>#include <vector>#include <map>#include <set>#include <q..原创 2021-04-05 15:22:24 · 62 阅读 · 0 评论 -
PTA-列车调度 (25 分)
#include <iostream>#include <cstdio>#include <cstdlib>#include <cmath>#include <algorithm>#include <string>#include <cstring>#include <vector>#include <map>#include <set>#include <qu.原创 2021-04-05 14:43:30 · 267 阅读 · 0 评论 -
PTA-分而治之
思路:计算一下除去Np个点之后的连通分量,如果去掉的点数+此时的连通分量==n,就输出YES,否则输出NO。#include <iostream>#include <cstdio>#include <cstdlib>#include <cmath>#include <algorithm>#include <string>#include <cstring>#include <vector>..原创 2021-03-31 15:37:36 · 355 阅读 · 0 评论