![](https://img-blog.csdnimg.cn/20201014180756919.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
Hash
战南城
学习笔记,不喜勿喷!
展开
-
PAT A1134
用二维数组(a[10010][10010]) 会超内存 用hash标记每一条边解题最好,如下: #include<iostream> #include<vector> using namespace std; const int maxn = 10010; int n, m, k; vector<int> G[maxn]; int main() { cin >> n >> m; for(int i = 0; i < m; i++) .原创 2021-03-07 16:40:45 · 42 阅读 · 0 评论 -
PAT A1149(测试点2运行超时)
暴力解题,错误代码如下 #include<iostream> #include<vector> #include<algorithm> using namespace std; int n, m, k, temp; vector<pair<int, int>> incompatible; vector<int> list; int main() { scanf("%d%d", &n, &m); .原创 2021-03-03 16:21:17 · 31 阅读 · 0 评论