| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 629876 |
2022-08-15T09:50:43 Z |
Karliver |
Robot (JOI21_ho_t4) |
C++17 |
|
859 ms |
98468 KB |
#include <bits/stdc++.h>
#define FIXED_FLOAT(x) std::fixed <<std::setprecision(20) << (x)
#define all(v) (v).begin(), (v).end()
using namespace std;
#define forn(i,n) for (int i = 0; i < (n); ++i)
#define rforn(i, n) for(int i = (n) - 1;i >= 0;--i)
#define sz(x) (int)x.size()
#define ff first
#define se second
#define mp make_pair
using ll = long long;
int mod = (ll)1e9 + 7;
const int INF = 1e9 + 1;
const int N = 2e5 + 100;
const double eps = 1e-7;
const long long inf = 1e18;
template <class T> using V = vector<T>;
template <class T> using VV = V<V<T>>;
template<class T, size_t SZ> using AR = array<T, SZ>;
template<class T> using PR = pair<T, T>;
template <typename XPAX>
bool ckma(XPAX &x, XPAX y) {
return (x < y ? x = y, 1 : 0);
}
template <typename XPAX>
bool ckmi(XPAX &x, XPAX y) {
return (x > y ? x = y, 1 : 0);
}
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
int n, m;
struct E {
int t, c;
ll p;
};
map<int, vector<E>> g[N];
ll dp[N];
map<int, ll> dp2[N], sm[N];
void solve() {
cin >> n >> m;
forn(i, m) {
int a, b, c;
ll p;
cin >> a >> b >> c >> p;
g[a][c].push_back({b, c, p});
g[b][c].push_back({a, c, p});
sm[a][c] += p;
sm[b][c] += p;
}
fill(dp, dp + n + 1, inf);
dp[1] = 0;
priority_queue<tuple<ll, int, int>> pq;
pq.push({0, 1, 0});
while(size(pq)) {
auto [s, v, w] = pq.top();
pq.pop();
if(w) {
if(dp2[v][w] != -s)continue;
for(E &x : g[v][w]) {
ll d = -s+sm[v][w]-x.p;
if(d < dp[x.t]) {
dp[x.t] = d;
pq.push({-dp[x.t], x.t, 0});
}
}
}
else {
if(dp[v] != -s)continue;
for(auto &i : g[v]) {
for(auto x : i.se) {
ll d1 = -s+sm[v][x.c]-x.p;
if(d1 < dp[x.t]) {
dp[x.t] = d1;
pq.push({-d1, x.t, 0});
}
ll d2 = -s+x.p;
if(d2 < dp[x.t]) {
dp[x.t] = d2;
pq.push({-d2, x.t, 0});
}
ll d3 = -s;
if(!dp2[x.t].count(x.c) || d3 < dp2[x.t][x.c]) {
dp2[x.t][x.c] = d3;
pq.push({-d3, x.t, x.c});
}
}
}
}
}
cout << (dp[n] == inf ? -1 : dp[n]) << '\n';
}
void test_case() {
int t;
cin >> t;
forn(p, t) {
//cout << "Case #" << p + 1 << ": ";
solve();
}
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
solve();
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
14 ms |
28500 KB |
Output is correct |
| 2 |
Correct |
14 ms |
28500 KB |
Output is correct |
| 3 |
Correct |
13 ms |
28516 KB |
Output is correct |
| 4 |
Correct |
19 ms |
28420 KB |
Output is correct |
| 5 |
Correct |
15 ms |
28516 KB |
Output is correct |
| 6 |
Correct |
16 ms |
28436 KB |
Output is correct |
| 7 |
Correct |
15 ms |
28660 KB |
Output is correct |
| 8 |
Correct |
14 ms |
28552 KB |
Output is correct |
| 9 |
Correct |
17 ms |
29056 KB |
Output is correct |
| 10 |
Correct |
17 ms |
29012 KB |
Output is correct |
| 11 |
Correct |
15 ms |
28884 KB |
Output is correct |
| 12 |
Correct |
15 ms |
28880 KB |
Output is correct |
| 13 |
Correct |
16 ms |
28828 KB |
Output is correct |
| 14 |
Correct |
16 ms |
28916 KB |
Output is correct |
| 15 |
Correct |
16 ms |
28756 KB |
Output is correct |
| 16 |
Correct |
16 ms |
28884 KB |
Output is correct |
| 17 |
Correct |
16 ms |
28856 KB |
Output is correct |
| 18 |
Correct |
17 ms |
28588 KB |
Output is correct |
| 19 |
Correct |
18 ms |
28756 KB |
Output is correct |
| 20 |
Correct |
16 ms |
28812 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
180 ms |
47040 KB |
Output is correct |
| 2 |
Correct |
78 ms |
38148 KB |
Output is correct |
| 3 |
Correct |
182 ms |
43192 KB |
Output is correct |
| 4 |
Correct |
109 ms |
40868 KB |
Output is correct |
| 5 |
Correct |
839 ms |
92928 KB |
Output is correct |
| 6 |
Correct |
624 ms |
86096 KB |
Output is correct |
| 7 |
Correct |
365 ms |
70440 KB |
Output is correct |
| 8 |
Correct |
376 ms |
64884 KB |
Output is correct |
| 9 |
Correct |
420 ms |
64984 KB |
Output is correct |
| 10 |
Correct |
303 ms |
61868 KB |
Output is correct |
| 11 |
Correct |
130 ms |
46716 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
14 ms |
28500 KB |
Output is correct |
| 2 |
Correct |
14 ms |
28500 KB |
Output is correct |
| 3 |
Correct |
13 ms |
28516 KB |
Output is correct |
| 4 |
Correct |
19 ms |
28420 KB |
Output is correct |
| 5 |
Correct |
15 ms |
28516 KB |
Output is correct |
| 6 |
Correct |
16 ms |
28436 KB |
Output is correct |
| 7 |
Correct |
15 ms |
28660 KB |
Output is correct |
| 8 |
Correct |
14 ms |
28552 KB |
Output is correct |
| 9 |
Correct |
17 ms |
29056 KB |
Output is correct |
| 10 |
Correct |
17 ms |
29012 KB |
Output is correct |
| 11 |
Correct |
15 ms |
28884 KB |
Output is correct |
| 12 |
Correct |
15 ms |
28880 KB |
Output is correct |
| 13 |
Correct |
16 ms |
28828 KB |
Output is correct |
| 14 |
Correct |
16 ms |
28916 KB |
Output is correct |
| 15 |
Correct |
16 ms |
28756 KB |
Output is correct |
| 16 |
Correct |
16 ms |
28884 KB |
Output is correct |
| 17 |
Correct |
16 ms |
28856 KB |
Output is correct |
| 18 |
Correct |
17 ms |
28588 KB |
Output is correct |
| 19 |
Correct |
18 ms |
28756 KB |
Output is correct |
| 20 |
Correct |
16 ms |
28812 KB |
Output is correct |
| 21 |
Correct |
180 ms |
47040 KB |
Output is correct |
| 22 |
Correct |
78 ms |
38148 KB |
Output is correct |
| 23 |
Correct |
182 ms |
43192 KB |
Output is correct |
| 24 |
Correct |
109 ms |
40868 KB |
Output is correct |
| 25 |
Correct |
839 ms |
92928 KB |
Output is correct |
| 26 |
Correct |
624 ms |
86096 KB |
Output is correct |
| 27 |
Correct |
365 ms |
70440 KB |
Output is correct |
| 28 |
Correct |
376 ms |
64884 KB |
Output is correct |
| 29 |
Correct |
420 ms |
64984 KB |
Output is correct |
| 30 |
Correct |
303 ms |
61868 KB |
Output is correct |
| 31 |
Correct |
130 ms |
46716 KB |
Output is correct |
| 32 |
Correct |
156 ms |
42392 KB |
Output is correct |
| 33 |
Correct |
137 ms |
43308 KB |
Output is correct |
| 34 |
Correct |
384 ms |
64256 KB |
Output is correct |
| 35 |
Correct |
279 ms |
55456 KB |
Output is correct |
| 36 |
Correct |
276 ms |
60944 KB |
Output is correct |
| 37 |
Correct |
358 ms |
63316 KB |
Output is correct |
| 38 |
Correct |
303 ms |
69700 KB |
Output is correct |
| 39 |
Correct |
154 ms |
46032 KB |
Output is correct |
| 40 |
Correct |
409 ms |
66204 KB |
Output is correct |
| 41 |
Correct |
427 ms |
66568 KB |
Output is correct |
| 42 |
Correct |
477 ms |
74852 KB |
Output is correct |
| 43 |
Correct |
196 ms |
50980 KB |
Output is correct |
| 44 |
Correct |
402 ms |
56784 KB |
Output is correct |
| 45 |
Correct |
295 ms |
61692 KB |
Output is correct |
| 46 |
Correct |
281 ms |
62060 KB |
Output is correct |
| 47 |
Correct |
293 ms |
63172 KB |
Output is correct |
| 48 |
Correct |
859 ms |
98468 KB |
Output is correct |
