# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
28610 | 슈퍼스타 tlwpdus (#68) | Alternative Mart (FXCUP2_mart) | C++11 | 9 ms | 32876 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 <bits/stdc++.h>
using namespace std;
typedef pair<int,int> pii;
int n, m, k, q;
vector<int> mart;
vector<pii> lis[50010];
map<pii,int> fin;
pii rin[2200000];
int p;
int dis[2200000];
int cnt[50010];
map<int,int> rd[50010];
vector<pii> gd[50010];
int msv = 11;
void dijk() {
int i;
priority_queue<pii> pq;
for (i=0;i<2200000;i++) dis[i] = 987654321;
for (i=0;i<k;i++) {
fin[pii(mart[i],mart[i])] = p;
rin[p] = pii(mart[i],mart[i]);
dis[p] = 0;
pq.push(pii(0,p));
p++;
}
while(!pq.empty()) {
pii tmp = pq.top(); pq.pop();
if (dis[tmp.second]!=-tmp.first||cnt[rin[tmp.second].first]>=msv) continue;
int here = rin[tmp.second].first, mar = rin[tmp.second].second, d = -tmp.first;
cnt[here]++;
for (auto &tmp : lis[here]) {
int there = tmp.second, w = tmp.first;
if (cnt[there]>=msv) continue;
auto it = fin.find(pii(there,mar));
int curp;
if (it==fin.end()) {
curp = p;
fin[pii(there,mar)] = p;
rin[p] = pii(there,mar);
p++;
}
else curp = it->second;
if (dis[curp]<=d+w) continue;
dis[curp] = d+w;
pq.push(pii(-d-w,curp));
}
}
for (i=0;i<p;i++) {
if (rd[rin[i].first].find(rin[i].second)!=rd[rin[i].first].end()) {
rd[rin[i].first][rin[i].second] = min(rd[rin[i].first][rin[i].second],dis[i]);
}
else {
rd[rin[i].first][rin[i].second] = dis[i];
}
if (rd[rin[i].first].size()>msv) {
rd[rin[i].first].erase(--rd[rin[i].first].end());
}
}
for (i=0;i<n;i++) {
auto it = rd[i].begin();
while(it!=rd[i].end()) {
gd[i].push_back(pii(it->second,it->first));
it++;
}
sort(gd[i].begin(),gd[i].end());
}
}
vector<int> que;
bool qchk[50010];
int main() {
int i;
scanf("%d%d%d%d",&n,&m,&k,&q);
for (i=0;i<k;i++) {
int a;
scanf("%d",&a); --a;
mart.push_back(a);
}
for (i=0;i<m;i++) {
int a, b, c;
scanf("%d%d%d",&a,&b,&c); --a; --b;
lis[a].push_back(pii(c,b));
lis[b].push_back(pii(c,a));
}
dijk();
for (i=0;i<q;i++) {
int s, x;
que.reserve(12);
scanf("%d%d",&s,&x); --s;
for (int j=0;j<x;j++) {
int a;
scanf("%d",&a); --a;
que.push_back(a);
qchk[a] = 1;
}
for (int j=0;j<gd[s].size();j++) {
if (!qchk[gd[s][j].second]) {
printf("%d %d\n",gd[s][j].second+1,gd[s][j].first);
break;
}
}
for (int j=0;j<x;j++) {
qchk[que[j]] = 0;
}
que.clear();
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |