uva 10895 Matrix Transpose
来源:互联网 发布:print 用法 python 编辑:程序博客网 时间:2024/05/10 18:26
点击打开链接uva 10895
思路: STL的vector模拟
分析:
1 看懂题目之后,直接利用两个vector模拟即可
代码:
#include<vector>#include<cstdio>#include<cstring>#include<iostream>#include<algorithm>using namespace std;const int MAXN = 10010;vector<int>v1[MAXN];vector<int>v2[MAXN];int m , n , num[MAXN];void init(){ for(int i = 0 ; i < MAXN ; i++){ v1[i].clear(); v2[i].clear(); }}void output(){ printf("%d %d\n" , n , m); for(int i = 1 ; i <= n ; i++){ int size = v1[i].size(); printf("%d" , size); for(int j = 0 ; j < size ; j++) printf(" %d" , v1[i][j]); if(size == 0) printf("\n\n"); else{ printf("\n%d" , v2[i][0]); for(int j = 1 ; j < size ; j++) printf(" %d" , v2[i][j]); printf("\n"); } }}int main(){ int r , x; while(scanf("%d" , &m) != EOF){ init(); scanf("%d" , &n); for(int i = 1 ; i <= m ; i++){ scanf("%d" , &r); for(int j = 1 ; j <= r ; j++) scanf("%d" , &num[j]); for(int j = 1 ; j <= r ; j++){ scanf("%d" , &x); v1[num[j]].push_back(i); v2[num[j]].push_back(x); } } output(); } return 0;}
- Uva 10895 - Matrix Transpose
- uva 10895 Matrix Transpose
- UVA 10895 Matrix Transpose
- UVA - 10895 Matrix Transpose
- UVa 10895 Matrix Transpose
- UVa 10895 - Matrix Transpose
- UVA 10895 - Matrix Transpose(STL)
- uva 10895 - Matrix Transpose(STL)
- UVA - 10895Matrix Transpose(vector)
- UVA 10895——Matrix Transpose
- Matrix Transpose
- Inverse transpose matrix
- Sparse Matrix's Transpose
- numpy基础——matrix.transpose() 和 matrix.getA()
- Programming trivia: 4x4 integer matrix transpose in SSE2
- UVA 11019 Matrix Matcher
- Uva 11019 Matrix Matcher
- UVA 11019 Matrix Matcher
- linux下实现将某个目录下的 某种 文件链接到另一个目录下
- 腾讯通RTX提高生产力
- 深入Java集合学习系列:HashMap的实现原理
- 百练-约瑟夫问题
- C语言之内存对齐
- uva 10895 Matrix Transpose
- Exchange 重定向OWA访问后会话超时解决办法
- POJ 1276
- Recursive entry to executePendingTransactions
- cf div2 191 A
- 概率算法
- asp.net单点登录
- 如何找回路由器的登录管理地址【mfxp】
- Xcode 4.1~4.6 + iOS 5、iOS 6免证书(iDP)开发+真机调试+生成IPA全攻略