CodeForces 24A-Ring road
来源:互联网 发布:刚开淘宝店卖什么好 编辑:程序博客网 时间:2024/06/01 16:41
#include <iostream>#include <string.h>#include <stdio.h>using namespace std;int map[101][101];int mark[101][101];int visit[101];int n,m=0,flag=0,k=0;void dfs(int pos){ k++; visit[pos]=1; if(k==n) { m+=map[pos][1]; } for(int i = 1; i <= n; i++) { if(mark[pos][i]==1&&!visit[i]) { m+=map[pos][i]; if(k==n) flag=1; if(flag==1) return ; dfs(i); } }}int main(){ int sum; while (~scanf("%d",&n)) { sum = 0; memset(map,0,sizeof(map)); memset(mark,0,sizeof mark); memset(visit,0,sizeof visit); for(int j = 0 ; j < n; j++) { int t1,t2,t3; scanf("%d%d%d",&t1,&t2,&t3); map[t2][t1] = t3; mark[t1][t2]=1; mark[t2][t1]=1; sum += t3; } dfs(1); if(m>sum-m) m = sum-m; printf("%d\n",m); }}
0 0
- Codeforces 24A. Ring road
- codeforces 24A Ring road
- CodeForces 24A Ring road
- CodeForces 24A-Ring road
- codeforces 24A Ring road DFS
- CodeForces 24A Ring road (简单题)
- codeforces 24A Ring road (dfs)
- CodeForces 24A Ring road(dfs)
- 【DFS+题意】#24 A. Ring road
- A. Ring road
- Codeforces Beta Round #27 D. Ring Road 2
- [Codeforces 27D] Ring Road 2 (二分图染色)
- HHUC-2015-dfs专讲①,A:ring road
- 【codeforces24A】Ring road
- CodeForces 27D - Ring Road 2 构图2-sat..并输出选择方案
- Codeforces Beta Round #27 (Codeforces format, Div. 2) D Ring Road 2(二分图染色版)
- CF 27D Ring Road 2
- Creating a Ring Buffer
- 用grunt搭建自动化的web前端开发环境-完整教程
- Linux相关命令
- Spring MVC之@RequestParam @RequestBody @RequestHeader 等详解
- apache防盗链
- 算法10—海量数据处理之top k算法
- CodeForces 24A-Ring road
- leetcode 111 Minimum Depth of Binary Tree C++
- mybatis
- PostgreSQL与MySQL比较
- windows下搭建react-native
- 自定义AlertDialog弹不出输入法的问题
- 最简单的post和ajax传对象
- 使用GDI+位图数据扫描线处理图像的小技巧
- Java Socket实现多人聊天室---swing做UI