| 16871 | 2025-05-14 20:55:35 | algopro | Vázsony vonatjegyet vásárol | cpp17 | Wrong answer 0/100 | 813ms | 57668 KiB |
// UUID: 6660d077-64c5-4fea-ab08-25ca1131e80f
#include <bits/stdc++.h>
#include <queue>
using namespace std;
using ll=long long;
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define vi vector<int>
#define pii pair<int,int>
const int maxn=1e5+1;
vector<pair<int,ll>> g[maxn];
vector<int> g1[maxn];
ll d[maxn];
int n,m,a,b;
vector<int> val(maxn, -1);
vector<int> reach;
int group[maxn];
vector<vector<int>> groups;
int p[maxn];
void dfs(int v){
reach.push_back(v);
val[v]=0;
for (int to : g1[v]){
if (d[to]<d[v] && val[to]>val[v]){
val[v]=val[to];
p[v]=to;
}
}
for (int to : g1[v]){
if (val[to]!=-1) continue;
dfs(to);
if (val[to]>val[v]){
val[v]=val[to];
p[v]=p[to];
}
}
}
void solve(){
cin>>n>>m>>a>>b;
for (int i=0;i<m;i++){
int u,v,c;
cin>>u>>v>>c;
g[u].push_back({v,c});
g[v].push_back({u,c});
}
priority_queue<pair<ll,int>> q;
q.push({0, b});
vector<pair<ll,int>> srt = {{0,b}};
fill(d, d+maxn, -1);
d[b]=0;
while (!q.empty()){
auto [dist, v] = q.top();
q.pop();
if (d[v]< -dist) continue;
for (auto [to,c] : g[v]){
if (d[to]==-1){
d[to]=d[v]+c;
srt.push_back({d[to], to});
q.push({-d[to], to});
}
}
}
sort(all(srt));
for (int i=1;i<=n;i++){
for (auto [to, c] : g[i]) if (d[i]>=d[to]) g1[i].push_back(to);
}
for (auto [_, v] : srt){
if (val[v]!=-1) continue;
reach.clear();
dfs(v);
val[v]+=reach.size();
groups.push_back({});
for (int i : reach){
groups.back().push_back(i);
group[i]=groups.size()-1;
val[i] = val[v];
}
}
cout<<val[a]<<"\n";
int track=a;
while(track!=b){
for (int i : groups[group[track]]) cout<<i<<" ";
track=p[track];
}
cout<<b;
}
int main() {
ios_base::sync_with_stdio(0);cin.tie(0);
int t=1;
//cin>>t;
while (t--){
solve();
}
}
| Subtask | Sum | Test | Verdict | Time | Memory | ||
|---|---|---|---|---|---|---|---|
| subtask1 | 0/0 | ||||||
| 1 | Accepted | 4ms | 6196 KiB | ||||
| 2 | Wrong answer | 119ms | 16984 KiB | ||||
| subtask2 | 0/20 | ||||||
| 3 | Accepted | 61ms | 11756 KiB | ||||
| 4 | Wrong answer | 382ms | 38044 KiB | ||||
| 5 | Wrong answer | 280ms | 29524 KiB | ||||
| 6 | Wrong answer | 305ms | 28060 KiB | ||||
| 7 | Wrong answer | 335ms | 29596 KiB | ||||
| 8 | Wrong answer | 266ms | 25264 KiB | ||||
| 9 | Wrong answer | 497ms | 45464 KiB | ||||
| subtask3 | 0/15 | ||||||
| 10 | Wrong answer | 150ms | 23604 KiB | ||||
| 11 | Wrong answer | 14ms | 7404 KiB | ||||
| 12 | Wrong answer | 14ms | 7412 KiB | ||||
| 13 | Wrong answer | 37ms | 10288 KiB | ||||
| 14 | Wrong answer | 68ms | 15924 KiB | ||||
| subtask4 | 0/20 | ||||||
| 15 | Wrong answer | 65ms | 13188 KiB | ||||
| 16 | Accepted | 289ms | 23120 KiB | ||||
| 17 | Accepted | 48ms | 12456 KiB | ||||
| 18 | Wrong answer | 93ms | 18852 KiB | ||||
| 19 | Wrong answer | 45ms | 11696 KiB | ||||
| 20 | Wrong answer | 87ms | 15276 KiB | ||||
| subtask5 | 0/45 | ||||||
| 21 | Accepted | 7ms | 6388 KiB | ||||
| 22 | Wrong answer | 813ms | 57668 KiB | ||||
| 23 | Wrong answer | 46ms | 10928 KiB | ||||
| 24 | Wrong answer | 194ms | 24404 KiB | ||||
| 25 | Wrong answer | 204ms | 22352 KiB | ||||
| 26 | Wrong answer | 314ms | 32332 KiB | ||||
| 27 | Wrong answer | 186ms | 22180 KiB | ||||
| 28 | Wrong answer | 583ms | 46336 KiB | ||||
| 29 | Wrong answer | 112ms | 16812 KiB | ||||
| 30 | Wrong answer | 437ms | 41884 KiB | ||||
| 31 | Accepted | 250ms | 24904 KiB | ||||
| 32 | Wrong answer | 41ms | 10804 KiB | ||||
| 33 | Wrong answer | 328ms | 30588 KiB | ||||
| 34 | Accepted | 360ms | 31356 KiB | ||||
| 35 | Accepted | 300ms | 29368 KiB | ||||
| 36 | Accepted | 352ms | 27408 KiB | ||||
| 37 | Accepted | 300ms | 26644 KiB | ||||