//============================================================================
// Name : 1062.cpp
// Author :
// Version :
// Copyright : Your copyright notice
// Description : Hello World in C++, Ansi-style
//============================================================================
#include <iostream>
#include <vector>
#include <set>
#define MAX_N 100
#define SIZE 101
using namespace std;
struct good;
typedef struct good Good;
typedef struct good {
int price;
int level;
vector<Good*> next;
vector<int> price_adds;
int newprice;
int ok;
} Good;
Good g[SIZE];
struct compare {
bool operator()(Good* const & a, Good* const & b) {
if (a->newprice != b->newprice) {
return a->newprice <b->newprice;
} else {
return a < b;
}
}
};
int calPrice(int minLevel, int maxLevel) {
set<Good*, compare> myset;
for (int i = 1; i < SIZE; i++) {
if (g[i].level >= minLevel && g[i].level <= maxLevel) {
g[i].newprice = g[i].price;
g[i].ok = 1;
myset.insert(&g[i]);
} else {
g[i].ok = 0;
}
}
while (true) {
set<Good*, compare>::iterator it = myset.begin();
Good* good = *it;
if (good == &g[1]) {
return good->newprice;
}
myset.erase(good);
int s = good->next.size();
for (int i = 0; i < s; i++) {
Good* nt = good->next[i];
if (nt->ok) {
int sum = good->newprice + good->price_adds[i];
if (sum < nt->newprice) {
myset.erase(nt);
nt->newprice = sum;
myset.insert(nt);
}
}
}
}
return 0;
}
int main() {
std::ios::sync_with_stdio(false);
int m, n;
cin >> m >> n;
int index;
int price;
int size;
for (int i = 1; i <= n; i++) {
cin >> g[i].price >> g[i].level >> size;
for (int j = 0; j < size; j++) {
cin >> index >> price;
g[index].next.push_back(&g[i]);
g[index].price_adds.push_back(price);
}
}
int out = g[1].price;
int mid = g[1].level;
for (int j = 0; j <= m; j++) {
int nprice = calPrice(mid - j, mid + m - j);
if (out > nprice) {
out = nprice;
}
}
cout << out << endl;
return 0;
}
poj1062
最新推荐文章于 2021-05-21 06:42:43 发布