CodeForces 102A - flody
来源:互联网 发布:mac电脑不能用excel 编辑:程序博客网 时间:2024/04/29 22:25
Description
A little boy Gerald entered a clothes shop and found out something very unpleasant: not all clothes turns out to match. For example, Gerald noticed that he looks rather ridiculous in a smoking suit and a baseball cap.
Overall the shop sells n clothing items, and exactly m pairs of clothing items match. Each item has its price, represented by an integer number of rubles. Gerald wants to buy three clothing items so that they matched each other. Besides, he wants to spend as little money as possible. Find the least possible sum he can spend.
Input
The first input file line contains integers n and m — the total number of clothing items in the shop and the total number of matching pairs of clothing items ().
Next line contains n integers ai (1 ≤ ai ≤ 106) — the prices of the clothing items in rubles.
Next m lines each contain a pair of space-separated integers ui and vi (1 ≤ ui, vi ≤ n, ui ≠ vi). Each such pair of numbers means that theui-th and the vi-th clothing items match each other. It is guaranteed that in each pair ui and vi are distinct and all the unordered pairs (ui, vi)are different.
Output
Print the only number — the least possible sum in rubles that Gerald will have to pay in the shop. If the shop has no three clothing items that would match each other, print "-1" (without the quotes).
Sample Input
3 31 2 31 22 33 1
6
3 22 3 42 32 1
-1
4 41 1 1 11 22 33 44 1
-1
Hint
In the first test there only are three pieces of clothing and they all match each other. Thus, there is only one way — to buy the 3 pieces of clothing; in this case he spends 6 roubles.
The second test only has three pieces of clothing as well, yet Gerald can't buy them because the first piece of clothing does not match the third one. Thus, there are no three matching pieces of clothing. The answer is -1.
In the third example there are 4 pieces of clothing, but Gerald can't buy any 3 of them simultaneously. The answer is -1.
题目意思:
某人要选3件衣服,条件是:选的3件衣服要能两两搭配(也就是两两节点是有边相连的map[i][j] = map[j][i] = 1)
而每个件衣服有自己的价格(也就是每个节点有自己权值),要求选出这样的衣服,使得总的价格最小,要是没有满足条件的,那就输出-1
分析: 其实酒店hi选出最小的环,可以用flody、、、
代码:
#include <iostream>#include <string.h>#include <algorithm>#include <math.h>#include <stdio.h>using namespace std;#define INF 1 << 29int g[150][150];int price[150];int n, m;int ans;int flody () {ans = INF;for(int i = 1;i <= n;i ++)for(int j = i + 1;j <= n;j ++)for(int k = j + 1;k <= n;k ++)if(g[i][j] && g[j][k] && g[k][i]) {ans = min(ans, price[i] + price[j] + price[k]);}return ans;}int main(){int u, v;while (scanf("%d%d",&n, &m) != EOF) {memset(g, 0, sizeof(g));memset(price, 0, sizeof(price));for (int i = 1; i <= n; i ++)scanf("%d", &price[i]);for (int i = 0; i < m; i ++) {scanf("%d%d", &u, &v);g[u][v] = g[v][u] = 1;}//flody();if(flody() == INF) printf("-1\n");else printf("%d\n", flody());}return 0;}
- CodeForces 102A - flody
- flody
- Codeforces 295B——Flody算法求最短路径
- CodeForces 102A
- flody算法
- flody算法
- CodeForces-a
- Codeforces 903A A
- poj 3615flody
- poj 2502Subway flody
- poj 2253 Frogger-flody
- hdu1385 flody+记录路径
- POJ2502 Subway flody
- Flody-最短路
- 图论之Flody
- 最小环flody hdu6080
- CodeForces 18A A - Triangle
- CodeForces 133A A. HQ9+
- Google Map API使用详解(十九)——实现Google Map本地搜索框(上)
- 设计模式--策略模式
- SQL查询数据库名、表名、列名
- selenium WebDriver 驱动选择
- 如果调试erlang程序
- CodeForces 102A - flody
- linux内核SMP负载均衡浅析
- TX2440 看手册学习2440-看门狗理解(ADS1.2编译)
- ubuntu搭建安卓开发环境
- vs2008配置、旧工程转换后的常见错误
- #Sam有话说#你的产品有Plan-B么
- Delphi Webbrowser无Name及ID时自动点击按钮
- C#partial method不能有返回类型
- 全世界只有erlang是正确的