今天完成了昨天的flag,学习时长六个小时(下午3-6,晚上7:50-10:50,miui180分钟专注模式两次),明天继续,考虑游泳卡需要游出来+晚上不下雨出去玩玩,暂定七个小时,循序渐进。与其不学习,还不如直接退出。而且,说实话,这东西做起来时间过的挺快,而且不像玩游戏玩完还要自责,干嘛不学?毕竟,乐趣还是有的。争取年底前真正的入门。
今天手机亮屏两小时33分,其中刷知乎+水群两小时,吃饭+等外卖的时间也要两三个小时;另外,上午没有起床,一直睡到下午一点半,这些地方需要改善。
不过,这也感觉出之前划水的博客太水了。
简单总结下学的东西:
1、带空格的读入
2、拓扑排序(尤其是基于bfs的)写代码基本没问题了,虽然容易碰到莫名其妙的bug。慢慢来,多写代码。
3、基于dfs的拓扑排序个人感觉可分为两类:指定递归次数达标后退出和针对某个点的dfs。这方面练习较少。
因为本周划水也挺严重,明天练习看看能做多少算多少,剩下时间继续学习。
虽然效率不算太理想,万事开头难,一定会越来越好的。
poj 1270
这个bug要注意:在递归函数里用了全局定义的i,j导致全部错乱
递归里用i,g一定要在for循环里定义
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
map<char, int> mp;
char alpha[28], c[250], v[50], temp1, temp2, ans[28];
int G[28][28], in_degree[28], k, i, j, len;
void init() {
mp.clear();
memset(G, 0, sizeof(G));
memset(in_degree, 0, sizeof(in_degree));
memset(alpha, 0, sizeof(alpha));
memset(ans, 0, sizeof(ans));
k = 1;
}
void toposort(int depenth) { /教训
if (depenth == len) {
for (int h = 1; h <= len; h++) {
cout << ans[h];
}
cout << endl;
return;
}
// for (int i = 1; i <= len; i++) {
// if (in_degree[i] == 0) {
// cout << i << " ";
// }
// }
for (int i = 1; i <= len; i++) {
if (in_degree[i] == 0) {
ans[depenth + 1] = alpha[i];
in_degree[i]--;
for (int j = 1; j <= len; j++) {
if (G[i][j]) {
in_degree[j]--;
}
}
toposort(depenth + 1); //更新减完后的顺序
// cout << "topo " << depenth + 1 << endl;
in_degree[i]++;
for (int j = 1; j <= len; j++) {
if (G[i][j]) {
in_degree[j]++;
}
} //回溯
}
}
}
int main() {
#ifdef LOCAL
freopen("zz_in.txt", "r", stdin);
freopen("zz_op.txt", "w", stdout);
#endif
int first = 1;
while (cin.getline(v, 50)) {
if (first)
first = 0;
else
cout << endl;
cin.getline(c, 250);
init();
for (i = 0; i < strlen(v); i++) {
if (v[i] != ' ') {
alpha[k] = v[i];
k++;
}
}
sort(alpha + 1, alpha + k); //保证输出顺序符合字典序
// alpha写成了v,debug一小时
// for (i = 1; i < k; i++) {
// cout << alpha[i] << endl
// << endl;
// }
len = k - 1;
for (i = 1; i <= len; i++)
mp[alpha[i]] = i;
int flag = 1;
for (i = 0; i < strlen(c); i++) {
if (c[i] == ' ') continue;
if (flag) {
temp1 = c[i];
flag = 0;
} else {
temp2 = c[i];
G[mp[temp1]][mp[temp2]] = 1;
in_degree[mp[temp2]]++;
flag = 1;
}
}
toposort(0);
}
#ifdef LOCAL
printf("Time used = %.2f\n", (double) clock() / CLOCKS_PER_SEC);
#endif
return 0;
}
hdu 1285
非常无语,忽视了多组数据输入wa了好久
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
const int MAXN = 505;
// vector<int> G_in[MAXN];
// vector<int> G_out[MAXN];
//用邻接表不好确定顺序
int in_degree[MAXN];
int ans[MAXN];
int G[MAXN][MAXN];
int n, m, t1, t2, i, j;
void init() {
// for (i = 0; i < MAXN; i++) {
// G_in[i].clear();
// G_out[i].clear();
// }
memset(G, 0, sizeof(G));
memset(ans, 0, sizeof(ans));
memset(in_degree, 0, sizeof(in_degree));
// cout << "INIT\n";
}
void toposort() {
// cout << "qqq";
for (i = 1; i <= n; i++) {
for (j = 1; j <= n; j++) { //j写成i,无语
if (G[i][j]) in_degree[j]++;
}
}
for (i = 1; i <= n; i++) {
int k = 1;
while (in_degree[k] != 0) {
k++;
}
// cout << k << endl;
//找第一个入度不为0的点???
//有点明白,如果不需要顺序可以全找一遍
ans[i] = k;
in_degree[k] = -1;
for (j = 1; j <= n; j++) {
if (G[k][j]) in_degree[j]--; //所有连接的点入度减一;
}
}
}
int main() {
#ifdef LOCAL
freopen("zz_in.txt", "r", stdin);
freopen("zz_op.txt", "w", stdout);
#endif
while (cin >> n >> m) {
init();
for (i = 0; i < m; i++) {
cin >> t1 >> t2;
G[t1][t2] = 1;
}
// for (i = 1; i <= n; i++) {
// for (j = 1; j <= n; j++)
// cout << G[i][j] << " ";
// cout << endl;
// }
// cout << "INput\n";
toposort();
for (i = 1; i < n; i++)
cout << ans[i] << " ";
cout << ans[n] << endl;
}
#ifdef LOCAL
printf("Time used = %.2f\n", (double) clock() / CLOCKS_PER_SEC);
#endif
return 0;
}
hdu 1285 priority_queue + 邻接表
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
int n, m, t1, t2, i, j, temp;
int first = 1;
const int MAXN = 505;
vector<int> in[MAXN];
vector<int> out[MAXN];
int vis[MAXN];
priority_queue<int, vector<int>, greater<int>> q;
// int ans[MAXN];
int in_degree[MAXN];
void init() {
first = 1; //非常无语
for (i = 0; i < MAXN; i++) {
in[i].clear();
out[i].clear();
}
memset(vis, 0, sizeof(vis));
// memset(ans, 0, sizeof(ans));
memset(in_degree, 0, sizeof(in_degree));
}
void toposort() {
for (i = 1; i <= n; i++) {
in_degree[i] = in[i].size();
}
for (i = 1; i <= n; i++) {
if (in_degree[i] == 0) {
q.push(i);
vis[i] = 1;
}
}
while (!q.empty()) {
temp = q.top();
q.pop();
if (first) {
cout << temp;
first = 0;
} else {
cout << " " << temp;
}
// while (!out[temp].empty()) { //BUG
for (i = 0; i < out[temp].size(); i++) {
in_degree[out[temp][i]]--;
if (in_degree[out[temp][i]] == 0) {
if (!vis[out[temp][i]]) {
vis[out[temp][i]] = 1;
q.push(out[temp][i]);
}
}
}
// }
}
}
int main() {
#ifdef LOCAL
freopen("zz_in.txt", "r", stdin);
freopen("zz_op.txt", "w", stdout);
#endif
while (cin >> n >> m) {
init();
for (i = 0; i < m; i++) {
cin >> t1 >> t2;
in[t2].push_back(t1);
out[t1].push_back(t2);
}
toposort();
cout << endl;
}
#ifdef LOCAL
printf("Time used = %.2f\n", (double) clock() / CLOCKS_PER_SEC);
#endif
return 0;
}
hdu 2647
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
const int MAXN = 10010;
vector<int> out[MAXN];
int in_degree[MAXN], vis[MAXN], num[MAXN];
queue<int> q;
int xinshui = 888;
long long ans = 0;
int n, m;
//个人思路:每个元素用结构体表示,加一个属性:比xx高;然后加一个数组
//参考别人博客,不用那么麻烦,只用一个数组就可以
void init() {
for (int i = 0; i < MAXN; i++)
out[i].clear();
memset(in_degree, 0, sizeof(in_degree));
memset(vis, 0, sizeof(vis));
memset(num, 0, sizeof(num));
while (!q.empty())
q.pop();
// xinshui = 888;
ans = 0;
}
void toposort() {
for (int i = 1; i <= n; i++) {
if (in_degree[i] == 0) {
num[i] = 888; //*
ans += num[i]; //*
q.push(i);
}
}
// xinshui++;
while (!q.empty()) { //BUG 假设第一次入度为0的有两个1,2 ;3,4为比1多的;5,6为比2多的;3,4,5,6的薪水可以一样
int tmp = q.front();
q.pop();
vis[tmp] = 1;
// int jiaxin = 0;
for (int i = 0; i < out[tmp].size(); i++) { //*这里能看出来自哪里,没必要再用结构体
in_degree[out[tmp][i]]--;
if (in_degree[out[tmp][i]] == 0) {
num[out[tmp][i]] = num[tmp] + 1; //*
// jiaxin = 1;
ans += num[out[tmp][i]]; //*
q.push(out[tmp][i]);
}
}
// xinshui += jiaxin;
}
}
int main() {
#ifdef LOCAL
freopen("zz_in.txt", "r", stdin);
freopen("zz_op.txt", "w", stdout);
#endif
int a, b, i, j;
// int first = 1;
while (cin >> n >> m) {
// if (first)
// first = 0;
// else
// cout << endl;
init();
for (i = 0; i < m; i++) {
cin >> a >> b;
out[b].push_back(a);
in_degree[a]++;
}
int ok = 1;
toposort();
for (i = 1; i <= n; i++) {
if (vis[i] == 0) ok = 0;
}
if (ok == 0)
cout << "-1\n";
else
cout << ans << endl;
}
#ifdef LOCAL
printf("Time used = %.2f\n", (double) clock() / CLOCKS_PER_SEC);
#endif
return 0;
}
hdu 3342
//bfs dfs搞混了
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
const int MAXN = 105;
int n, m, ok;
vector<int> out[MAXN];
int vis[MAXN];
int in_degree[MAXN];
queue<int> q;
void init() {
memset(in_degree, 0, sizeof(in_degree));
memset(vis, 0, sizeof(vis));
for (int i = 0; i < MAXN; i++) {
out[i].clear();
}
ok = 1;
while (!q.empty()) {
q.pop();
}
}
void toposort() {
// int final = 1;
// for (int i = 0; i < n; i++) {
// if (vis[i] != 1) final = 0;
// }
// if (final) return;
for (int i = 0; i < n; i++) {
if (in_degree[i] == 0) {
q.push(i);
vis[i] = 1;
}
}
while (!q.empty()) {
int tmp = q.front();
vis[tmp] = 1;
q.pop();
for (int i = 0; i < out[tmp].size(); i++) {
in_degree[out[tmp][i]]--;
if (in_degree[out[tmp][i]] == 0) q.push(out[tmp][i]); //漏了判断,结果内存溢出
}
}
}
int main() {
#ifdef LOCAL
freopen("zz_in.txt", "r", stdin);
freopen("zz_op.txt", "w", stdout);
#endif
int i, j, t1, t2;
while (cin >> n >> m) {
if (n == 0) break;
init();
for (i = 0; i < m; i++) {
cin >> t1 >> t2;
out[t1].push_back(t2);
in_degree[t2]++;
}
int exist = 0;
for (i = 0; i < n; i++) {
if (in_degree[i] == 0) exist = 1;
}
toposort();
for (i = 0; i < n; i++) {
if (vis[i] == 0) ok = 0;
}
if (ok)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
//int t, i, j, k, n;
//cin>>t;
//while(t--)
//{
//}
#ifdef LOCAL
printf("Time used = %.2f\n", (double) clock() / CLOCKS_PER_SEC);
#endif
return 0;
}