# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
28484 | 三( ε:) (#68) | Alternative Mart (FXCUP2_mart) | C++14 | 1856 ms | 36320 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <cstdio>
#include <vector>
#include <queue>
#include <set>
using namespace std;
typedef pair<int, int> ii;
typedef pair<int, ii> iii;
int main() {
//freopen("input.txt", "r", stdin);
int n, m, k, q;
scanf("%d%d%d%d", &n, &m, &k, &q);
vector<set<ii>> dist(n); // (distance, from)
vector<vector<ii>> adj(n); // (destination, weight)
priority_queue<iii> pq; // (-distance, (here, from))
while (k--) {
int s;
scanf("%d", &s);
--s;
dist[s].emplace(0, s);
pq.emplace(0, ii(s, s));
}
while (m--) {
int p, q, v;
scanf("%d%d%d", &p, &q, &v);
--p; --q;
adj[p].emplace_back(q, v);
adj[q].emplace_back(p, v);
}
while (!pq.empty()) {
int weight = -pq.top().first;
int here = pq.top().second.first;
int from = pq.top().second.second;
pq.pop();
bool skip = false;
bool hasFrom = false;
for (ii p : dist[here]) {
if (p.second != from)
continue;
hasFrom = true;
if (weight > p.first)
skip = true;
break;
}
if (skip || !hasFrom) continue;
for (ii p : adj[here]) {
int next = p.first;
int nweight = weight + p.second;
bool skip = false;
bool hasFrom = false;
for (auto it = dist[next].begin(); it != dist[next].end(); ++it) {
if (it->second != from) continue;
hasFrom = true;
if (it->first <= nweight)
skip = true;
else
dist[next].erase(it);
break;
}
if (!hasFrom && dist[next].size() >= 11) {
if (dist[next].rbegin()->first <= nweight)
skip = true;
else
dist[next].erase(--dist[next].end());
}
if (skip) continue;
dist[next].emplace(nweight, from);
pq.emplace(-nweight, ii(next, from));
}
}
while (q--) {
int target, x;
scanf("%d%d", &target, &x);
--target;
set<int> closed;
while (x--) {
int c;
scanf("%d", &c);
closed.insert(--c);
}
for (ii p : dist[target]) {
if (closed.find(p.second) == closed.end()) {
printf("%d %d\n", p.second + 1, p.first);
break;
}
}
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |