A - A Knight’s Journey
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <string>
#include <vector>
using namespace std;
int visited[27][27]; //用于标记某一位置是否走过
int N, p, q;
int sum; //用于判断临界条件
int visiting; //记录已走的步数与sum比较
int Count = 0; //记录样例的顺序
int flag = 0; //判断是否找到路
struct path {
int p;
int q;
};
path ans[1000];
void dfs(int i, int j) {
if (i > p || i < 1)
return; //临界条件
if (j > q || j < 1)
return;
if (visited[i][j] == 1)
return;
visited[i][j] = 1;
visiting++;
ans[visiting].p = i, ans[visiting].q = j;
if (visiting == sum) {
flag = 1;
for (int k = 1; k <= visiting; k++) {
printf("%c%d", ans[k].q - 1 + 'A', ans[k].p);
}
return;
}
if (flag)
return; // j按照从小到大顺序
dfs(i - 1, j - 2);
if (flag)
return;
dfs(i + 1, j - 2);
if (flag)
return;
dfs(i - 2, j - 1);
if (flag)
return;
dfs(i + 2, j - 1);
if (flag)
return;
dfs(i - 2, j + 1);
if (flag)
return;
dfs(i + 2, j + 1);
if (flag)
return;
dfs(i - 1, j + 2);
if (flag)
return;
dfs(i + 1, j + 2);
visited[i][j] = 0;
visiting--;
}
int main() {
cin >> N;
while (N--) {
cin >> p >> q;
memset(visited, 0, sizeof(visited)); //初始化条件
sum = p * q;
Count++;
flag = 0;
printf("Scenario #%d:\n", Count);
for (int i = 1; i <= p; i++) {
for (int j = 1; j <= q; j++) {
visiting = 0;
dfs(i, j);
}
}
if (flag == 0)
cout << "impossible";
if (N != 0)
cout << endl << endl;
}
return 0;
}
题解:用dfs按字典序每一个格子一个一个地搜。
B - Dungeon Master
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <string>
#include <vector>
using namespace std;
const int N = 40;
int l, r, c;
int flag;
char a[N][N][N], s[N];
bool vis[N][N][N];
int dx[10] = {0, 0, -1, 1, 0, 0};
int dy[10] = {-1, 1, 0, 0, 0, 0};
int dz[10] = {0, 0, 0, 0, -1, 1};
struct node {
int x, y, z;
int num;
friend bool operator<(node a, node b) { return a.num > b.num; }
} sta;
priority_queue<node> q;
void bfs() {
sta.num = 0;
q.push(sta);
while (q.size()) {
node t = q.top();
q.pop();
int nx = t.x, ny = t.y, nz = t.z;
if (a[nz][ny][nx] == 'E') {
flag = 1;
cout << "Escaped in " << t.num << " minute(s)." << endl;
return;
}
for (int i = 0; i < 6; ++i) {
int nx = t.x + dx[i];
int ny = t.y + dy[i];
int nz = t.z + dz[i];
if (nx > 0 && ny > 0 && nz > 0 && nx <= c && ny <= r && nz <= l &&
!vis[nz][ny][nx] && !flag) {
vis[nz][ny][nx] = true;
node d;
d.x = nx, d.y = ny, d.z = nz, d.num = t.num + 1;
q.push(d);
}
}
}
}
int main() {
while (1) {
scanf("%d%d%d", &l, &r, &c);
if (l == 0 && r == 0 && c == 0)
break;
flag = 0;
memset(vis, false, sizeof(vis));
for (int i = 1; i <= l; ++i)
for (int j = 1; j <= r; ++j) {
scanf("%s", s + 1);
for (int k = 1; k <= c; ++k) {
if (s[k] == 'S')
sta.z = i, sta.x = k, sta.y = j, vis[i][j][k] = true;
if (s[k] == '#')
vis[i][j][k] = true;
a[i][j][k] = s[k];
}
}
bfs();
if (flag == 0)
cout << "Trapped!" << endl;
}
return 0;
}
题解:这里也是遍历,不过是bfs遍历,而且是三维的,而且是bfs+优先队列,模板题。
C - Gym Class
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
const int M = 100010;
int n, t, m;
int tot, maxx;
int ver[M], Next[M], head[M];
int deg[M];
int as[M], pre;
void add(int x, int y) { //链式前向星
ver[++tot] = y;
Next[tot] = head[x];
head[x] = tot;
}
void Toposort() {
priority_queue<int> q;
for (int i = 1; i <= n; ++i)
if (deg[i] == 0)
q.push(i);
while (!q.empty()) {
int k = q.top();
as[pre++] = k;
q.pop();
for (int i = head[k]; i; i = Next[i]) {
deg[ver[i]]--;
if (deg[ver[i]] == 0)
q.push(ver[i]);
}
}
}
int main() {
cin >> t;
while (t--) {
scanf("%d%d", &n, &m);
int a, b;
maxx = 0, tot = 0, pre = 0;
memset(ver, 0, sizeof(ver));
memset(Next, 0, sizeof(Next));
memset(head, 0, sizeof(head));
memset(deg, 0, sizeof(deg));
for (int i = 0; i < m; ++i) {
scanf("%d%d", &a, &b);
add(a, b);
deg[b]++;
}
Toposort();
int minn = 0x7fffffff;
ll sum = 0;
for (int i = 0; i < n; ++i) {
minn = min(minn, as[i]);
sum += minn;
}
cout << sum << endl;
};
return 0;
}
用了优先队列+拓扑排序还有链式前向星。
D - 逃生
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
const int M = 100010;
int n, t, m;
int tot, maxx;
int ver[M], Next[M], head[M];
int deg[M];
int as[M], pre;
void add(int x, int y) { //链式前向星
ver[++tot] = y;
Next[tot] = head[x];
head[x] = tot;
}
void Toposort() {
priority_queue<int, vector<int>, less<int> > q;
for (int i = 1; i <= n; ++i)
if (deg[i] == 0)
q.push(i);
while (!q.empty()) {
int k = q.top();
as[pre++] = k;
q.pop();
for (int i = head[k]; i; i = Next[i]) {
deg[ver[i]]--;
if (deg[ver[i]] == 0)
q.push(ver[i]);
}
}
}
int main() {
cin >> t;
while (t--) {
scanf("%d%d", &n, &m);
int a, b;
maxx = 0, tot = 0, pre = 0;
memset(ver, 0, sizeof(ver));
memset(Next, 0, sizeof(Next));
memset(head, 0, sizeof(head));
memset(deg, 0, sizeof(deg));
for (int i = 0; i < m; ++i) {
scanf("%d%d", &a, &b);
add(b, a);
deg[a]++;
}
Toposort();
for (int i = n - 1; i > 0; --i) {
cout << as[i] << ' ';
}
cout << as[0] << endl;
}
return 0;
}
题解:不可以直接上小根堆,因为无法保证一个序列前面小的后面一定会小,当一个序列后面小的它一定会小。转载于这里
E - Ponds
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e4 + 100;
vector<int> G[maxn];
int vis[maxn];
int degree[maxn];
ll sum1;
int num[maxn];
int n, m;
int count_;
void init(int n) {
for (int i = 1; i <= n; i++)
G[i].clear();
memset(vis, 0, sizeof(vis));
memset(degree, 0, sizeof(degree));
}
void topcode() {
queue<int> Q;
for (int i = 1; i <= n; i++) {
if (degree[i] <= 1) {
vis[i] = 1;
Q.push(i);
}
}
while (!Q.empty()) {
int u = Q.front();
Q.pop();
for (int i = 0; i < G[u].size(); i++) {
int v = G[u][i];
if (!vis[v]) {
degree[v]--;
if (degree[v] <= 1) {
vis[v] = 1;
Q.push(v);
}
}
}
}
}
void dfs(int u) {
vis[u] = 1;
for (int i = 0; i < G[u].size(); i++) {
int v = G[u][i];
if (vis[v] == 0) {
sum1 += num[v];
count_++;
dfs(v);
}
}
}
int main() {
int t;
scanf("%d", &t);
while (t--) {
scanf("%d%d", &n, &m);
init(n);
for (int i = 1; i <= n; i++)
scanf("%d", &num[i]);
int u, v;
for (int i = 0; i < m; i++) {
scanf("%d%d", &u, &v);
G[u].push_back(v);
G[v].push_back(u);
degree[u]++;
degree[v]++;
}
topcode();
ll sum = 0;
for (int i = 1; i <= n; i++) {
if (vis[i] == 0) {
sum1 = num[i];
count_ = 1;
dfs(i);
if (count_ & 1)
sum += sum1;
}
}
printf("%I64d\n", sum);
}
return 0;
}
题解:因为是双向流通,所以一条边可以同时对两边都产生一个入度,所以先用拓扑排序把入度小于1的边点都去掉;然后再用dfs对每一个点进行遍历,看看是否会产生奇数个点的环。
[HAOI2016]食物链
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
const int N = 1008611;
int n, m, f[N], rd[N];
vector<int> e[N];
inline int JI_DE_DIAN_GE_ZAN() {
queue<int> q;
int ans = 0;
for (int i = 1; i <= n; i++)
if (!rd[i] && e[i].size()) // 单个点不算方案
q.push(i), f[i] = 1;
while (!q.empty()) {
int x = q.front();
q.pop();
if (!e[x].size())
ans += f[x];
for (auto t : e[x]) {
f[t] += f[x], rd[t]--; // f来统计方案
if (!rd[t])
q.push(t);
}
}
return ans;
} // 裸的
int main() {
ios::sync_with_stdio(false);
cin >> n >> m;
for (int i = 1, x, y; i <= m; i++) {
cin >> x >> y;
rd[y]++;
e[x].push_back(y);
}
cout << JI_DE_DIAN_GE_ZAN();
return ~~(0 ^ 0);
}
题解:真正关键点是这个DAG图,所以可以利用拓扑排序的一些小细节来算(其实我感觉和拓扑排序没啥关系),保存好每个点的入度,然后从入度为0的结点出发(这一步还是和拓扑排序一样),然后遇到每个指向的结点都把自身的权值加到指向的结点权值上面去,遍历到最终结点(即出度为0)就用ans把权值都加起来,点的权值是只通过自身能产生多少条食物链。题解链接
1192. 奖金
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
const int N = 10010, M = 20010;
int n, m;
int h[N], e[M], ne[M], idx;
int q[N];
int d[N];
int dist[N];
void add(int a, int b) {
e[idx] = b, ne[idx] = h[a], h[a] = idx++;
}
bool topsort() {
int hh = 0, tt = -1;
for (int i = 1; i <= n; i++)
if (!d[i])
q[++tt] = i;
while (hh <= tt) {
int t = q[hh++];
for (int i = h[t]; ~i; i = ne[i]) {
int j = e[i];
if (--d[j] == 0)
q[++tt] = j;
}
}
return tt == n - 1;
}
int main() {
scanf("%d%d", &n, &m);
memset(h, -1, sizeof h);
while (m--) {
int a, b;
scanf("%d%d", &a, &b);
add(b, a);
d[a]++;
}
if (!topsort())
puts("Poor Xed");
else {
for (int i = 1; i <= n; i++)
dist[i] = 100;
for (int i = 0; i < n; i++) {
int j = q[i];
for (int k = h[j]; ~k; k = ne[k])
dist[e[k]] = max(dist[e[k]], dist[j] + 1);
}
int res = 0;
for (int i = 1; i <= n; i++)
res += dist[i];
printf("%d\n", res);
}
return 0;
}
题解:拓扑排序的逆向过程,就是先把后面的元素选出来,再选前面的元素。实现的过程就是建图的时候反过来建图。这题还有一个点要注意,就是要最后枚举所有的边来确定到底是选择哪一条边可以使得奖金最少。