zoj 1021

来源：互联网发布：mac系统怎么看配置编辑：程序博客网时间：2024/05/17 20:36

大模拟。。我去你妹的。。

狗狗40题的第一题。。没错就是他让我放弃了。。

代码力差啊，。跳过吧。

粘shi哥代码

#include <set>#include <list>#include <queue>#include <cstdio>#include <utility>using namespace std;const int MAXN = 64;list<pair<int, int> > e[MAXN];int main() {int re, n, m, a, b;set<int> sy;int x[MAXN], y[MAXN], z[MAXN], h[MAXN], xx, yy, zz;scanf("%d", &re);for (int ri = 1; ri <= re; ++ri) {scanf("%d", &n);for (int i = 0; i < n; ++i) {e[i].clear();scanf("%d%d%d", &x[i], &y[i], &z[i]);z[i] += y[i];h[i] = -1;}scanf("%d", &m);sy.clear();for (int i = 0; i < m; ++i) {scanf("%d%d%d", &xx, &yy, &zz);zz += xx;a = b = -1;for (int j = 0; j < n; ++j) {if (y[j] <= yy && yy <= z[j]) {if (x[j] == xx - 1) {a = j;} else if (x[j] == zz) {b = j;}}}sy.insert(yy);e[a].push_back(make_pair(yy, b));e[b].push_back(make_pair(yy, a));}scanf("%d%d", &xx, &yy);sy.insert(yy);if (y[xx - 1] <= yy && yy <= z[xx - 1]) {e[xx - 1].push_back(make_pair(yy, -2));}for (int i = 0; i < n; ++i) {for (set<int>::const_iterator j = sy.lower_bound(y[i]); j != sy.end() && *j < z[i]; ++j) {e[i].push_back(make_pair(*j, i));}e[i].push_back(make_pair(z[i], i));e[i].push_back(make_pair(y[i], -1));e[i].sort();e[i].reverse();while (!e[i].empty() && e[i].front().first > z[i]) {e[i].pop_front();}while (!e[i].empty() && e[i].back().first < y[i]) {e[i].pop_back();}}bool flag = false;priority_queue<pair<int, int> > pq;zz = 0;h[0] = z[0];pq.push(make_pair(h[0], 0));while (!pq.empty()) {b = pq.top().first;a = pq.top().second;pq.pop();if (a == -1) {break;} else if (a == -2) {flag = true;break;}zz += h[a] - b;h[a] = b;while (!e[a].empty() && e[a].front().first == h[a]) {b = e[a].front().second;if (b < 0) {pq.push(e[a].front());} else if (h[b] == -1) {h[b] = z[b];pq.push(make_pair(h[b], b));}e[a].pop_front();}if (!e[a].empty()) {pq.push(make_pair(e[a].front().first, a));}}if (flag) {printf("%d\n", zz);} else {puts("No Solution");}}return 0;}

0 0