当前位置:网站首页>POJ 1258 Agri-Net
POJ 1258 Agri-Net
2022-07-06 15:10:00 【全栈程序员站长】
大家好,又见面了,我是全栈君。
最小生成树问题。
矩阵输入。
这只是很伤心G++ 服从AC。
C++ 已经RE。
唯一的问题,说的最多的 100 X 100 矩阵啊。
Logically, they are N lines of N space-separated integers. Physically, they are limited in length to 80 characters, so some lines continue onto others.
→_→ 不知各位怎么理解这句。
#include<cstdio>
#include<cstring>
#include<string>
#include<queue>
#include<algorithm>
#include<queue>
#include<map>
#include<stack>
#include<iostream>
#include<list>
#include<set>
#include<cmath>
#define INF 0x7fffffff
#define eps 1e-6
using namespace std;
int n;
struct lx
{
int u,v,len;
} l[500*1001];
int fa[1001];
bool cmp(lx a,lx b)
{
return a.len<b.len;
}
int father(int x)
{
if(x!=fa[x])
return fa[x]=father(fa[x]);
}
int main()
{
while(scanf("%d",&n)!=EOF)
{
for(int i=0; i<=n; i++)
fa[i]=i;
int cot=0;
for(int i=1; i<=n; i++)
for(int j=1; j<=n; j++)
{
int len;
scanf("%d",&len);
if(i==j)continue;
l[cot].u=i;
l[cot].v=j;
l[cot++].len=len;
}
sort(l,l+cot,cmp);
int ans=0;
for(int i=0; i<cot; i++)
{
int fu=father(l[i].u);
int fv=father(l[i].v);
if(fu==fv)continue;
fa[fv]=fu;
ans+=l[i].len;
}
printf("%d\n",ans);
}
}
版权声明:本文博主原创文章,博客,未经同意不得转载。
发布者:全栈程序员栈长,转载请注明出处:https://javaforall.cn/116986.html原文链接:https://javaforall.cn
边栏推荐
- qt quick项目offscreen模式下崩溃的问题处理
- Dealing with the crash of QT quick project in offscreen mode
- 剑指offer刷题记录1
- Leetcode exercise - Sword finger offer 26 Substructure of tree
- GD32F4XX串口接收中断和闲时中断配置
- Installation and use of labelimg
- Web APIs DOM time object
- 重磅新闻 | Softing FG-200获得中国3C防爆认证 为客户现场测试提供安全保障
- Daily question 1: force deduction: 225: realize stack with queue
- 自制J-Flash烧录工具——Qt调用jlinkARM.dll方式
猜你喜欢
(18) LCD1602 experiment
LeetCode 练习——剑指 Offer 26. 树的子结构
RESNET rs: Google takes the lead in tuning RESNET, and its performance comprehensively surpasses efficientnet series | 2021 arXiv
Self made j-flash burning tool -- QT calls jlinkarm DLL mode
MySQL----初识MySQL
Common sense: what is "preservation" in insurance?
Leetcode: interview question 17.24 Maximum cumulative sum of submatrix (to be studied)
Chapter 3: detailed explanation of class loading process (class life cycle)
AdaViT——自适应选择计算结构的动态网络
Balanced Multimodal Learning via On-the-fly Gradient Modulation(CVPR2022 oral)
随机推荐
二叉(搜索)树的最近公共祖先 ●●
pytorch_ Yolox pruning [with code]
Attack and defense world miscall
Unity3d minigame-unity-webgl-transform插件转换微信小游戏报错To use dlopen, you need to use Emscripten‘s...问题
【编译原理】做了一半的LR(0)分析器
SQL server generates auto increment sequence number
void关键字
【数字IC手撕代码】Verilog无毛刺时钟切换电路|题目|原理|设计|仿真
MySQL教程的天花板,收藏好,慢慢看
Daily question 1: force deduction: 225: realize stack with queue
做国外LEAD2022年下半年几点建议
ThreadLocal详解
UE4蓝图学习篇(四)--流程控制ForLoop和WhileLoop
extern关键字
Management background --1 Create classification
Applet system update prompt, and force the applet to restart and use the new version
Mise en place d'un environnement de développement OP - tee basé sur qemuv8
uniapp设置背景图效果demo(整理)
How do I write Flask's excellent debug log message to a file in production?
sizeof关键字