# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
488710 |
2021-11-20T06:58:29 Z |
Jarif_Rahman |
Robot (JOI21_ho_t4) |
C++17 |
|
3000 ms |
80796 KB |
#include <bits/stdc++.h>
#define pb push_back
#define f first
#define sc second
using namespace std;
typedef long long int ll;
typedef string str;
const ll inf = 1e17;
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, m; cin >> n >> m;
vector<vector<array<int, 3>>> v(n);
for(int i = 0; i < m; i++){
int a, b, c, p; cin >> a >> b >> c >> p; a--, b--;
v[a].pb({b, c, p});
v[b].pb({a, c, p});
}
for(int i = 0; i < n; i++){
sort(v[i].begin(), v[i].end());
}
vector<vector<vector<ll>>> dis(n);
vector<vector<vector<bool>>> bl(n);
for(int i = 0; i < n; i++){
dis[i].assign(v[i].size(), vector<ll>(2, inf));
bl[i].assign(v[i].size(), vector<bool>(2, 0));
}
priority_queue<pair<ll, array<int, 3>>> pq;
pq.push({0, {0, -1, 0}});
while(!pq.empty()){
auto [nd, e, ch] = pq.top().sc; pq.pop();
array<int, 3> cur = {nd, 0, 0};
if(e == -1){
unordered_map<int, ll> mp;
for(auto [x, c, p]: v[nd]) mp[c]+=p;
for(auto [x, c, p]: v[nd]){
auto it = lower_bound(v[x].begin(), v[x].end(), cur);
int in = it-v[x].begin();
if(p < dis[x][in][1]){
dis[x][in][1] = p;
pq.push({-dis[x][in][1], {x, in, 1}});
}
if(mp[c]-p < dis[x][in][0]){
dis[x][in][0] = mp[c]-p;
pq.push({-dis[x][in][0], {x, in, 0}});
}
}
continue;
}
if(bl[nd][e][ch]) continue;
bl[nd][e][ch] = 1;
unordered_map<int, ll> mp;
for(auto [x, c, p]: v[nd]){
if(x != v[nd][e][0] || !ch) mp[c]+=p;
}
for(auto [x, c, p]: v[nd]){
auto it = lower_bound(v[x].begin(), v[x].end(), cur);
int in = it-v[x].begin();
if(dis[nd][e][ch]+p < dis[x][in][1]){
dis[x][in][1] = dis[nd][e][ch]+p;
pq.push({-dis[x][in][1], {x, in, 1}});
}
if(dis[nd][e][ch]+mp[c]-p < dis[x][in][0]){
dis[x][in][0] = dis[nd][e][ch]+mp[c]-p;
pq.push({-dis[x][in][0], {x, in, 0}});
}
}
}
ll ans = inf;
for(int i = 0; i < v[n-1].size(); i++) ans = min(ans, dis[n-1][i][0]), ans = min(ans, dis[n-1][i][1]);
if(ans >= inf) ans = -1;
cout << ans << "\n";
}
Compilation message
Main.cpp: In function 'int main()':
Main.cpp:74:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::array<int, 3> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
74 | for(int i = 0; i < v[n-1].size(); i++) ans = min(ans, dis[n-1][i][0]), ans = min(ans, dis[n-1][i][1]);
| ~~^~~~~~~~~~~~~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
204 KB |
Output is correct |
2 |
Correct |
0 ms |
204 KB |
Output is correct |
3 |
Correct |
0 ms |
204 KB |
Output is correct |
4 |
Correct |
0 ms |
204 KB |
Output is correct |
5 |
Correct |
1 ms |
332 KB |
Output is correct |
6 |
Correct |
0 ms |
332 KB |
Output is correct |
7 |
Correct |
8 ms |
716 KB |
Output is correct |
8 |
Correct |
3 ms |
588 KB |
Output is correct |
9 |
Correct |
257 ms |
1228 KB |
Output is correct |
10 |
Correct |
158 ms |
1164 KB |
Output is correct |
11 |
Correct |
129 ms |
1228 KB |
Output is correct |
12 |
Correct |
45 ms |
1032 KB |
Output is correct |
13 |
Correct |
126 ms |
1268 KB |
Output is correct |
14 |
Correct |
118 ms |
1340 KB |
Output is correct |
15 |
Correct |
2 ms |
588 KB |
Output is correct |
16 |
Correct |
6 ms |
972 KB |
Output is correct |
17 |
Correct |
4 ms |
972 KB |
Output is correct |
18 |
Correct |
1 ms |
460 KB |
Output is correct |
19 |
Correct |
26 ms |
1352 KB |
Output is correct |
20 |
Correct |
5 ms |
752 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
528 ms |
31532 KB |
Output is correct |
2 |
Correct |
174 ms |
14860 KB |
Output is correct |
3 |
Correct |
1361 ms |
52616 KB |
Output is correct |
4 |
Correct |
290 ms |
20772 KB |
Output is correct |
5 |
Execution timed out |
3081 ms |
80796 KB |
Time limit exceeded |
6 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
204 KB |
Output is correct |
2 |
Correct |
0 ms |
204 KB |
Output is correct |
3 |
Correct |
0 ms |
204 KB |
Output is correct |
4 |
Correct |
0 ms |
204 KB |
Output is correct |
5 |
Correct |
1 ms |
332 KB |
Output is correct |
6 |
Correct |
0 ms |
332 KB |
Output is correct |
7 |
Correct |
8 ms |
716 KB |
Output is correct |
8 |
Correct |
3 ms |
588 KB |
Output is correct |
9 |
Correct |
257 ms |
1228 KB |
Output is correct |
10 |
Correct |
158 ms |
1164 KB |
Output is correct |
11 |
Correct |
129 ms |
1228 KB |
Output is correct |
12 |
Correct |
45 ms |
1032 KB |
Output is correct |
13 |
Correct |
126 ms |
1268 KB |
Output is correct |
14 |
Correct |
118 ms |
1340 KB |
Output is correct |
15 |
Correct |
2 ms |
588 KB |
Output is correct |
16 |
Correct |
6 ms |
972 KB |
Output is correct |
17 |
Correct |
4 ms |
972 KB |
Output is correct |
18 |
Correct |
1 ms |
460 KB |
Output is correct |
19 |
Correct |
26 ms |
1352 KB |
Output is correct |
20 |
Correct |
5 ms |
752 KB |
Output is correct |
21 |
Correct |
528 ms |
31532 KB |
Output is correct |
22 |
Correct |
174 ms |
14860 KB |
Output is correct |
23 |
Correct |
1361 ms |
52616 KB |
Output is correct |
24 |
Correct |
290 ms |
20772 KB |
Output is correct |
25 |
Execution timed out |
3081 ms |
80796 KB |
Time limit exceeded |
26 |
Halted |
0 ms |
0 KB |
- |