/*************************************
* author: marvinthang *
* created: 07.01.2024 16:50:40 *
*************************************/
#include "escape_route.h"
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define left ___left
#define right ___right
#define TIME (1.0 * clock() / CLOCKS_PER_SEC)
#define MASK(i) (1LL << (i))
#define BIT(x, i) ((x) >> (i) & 1)
#define __builtin_popcount __builtin_popcountll
#define ALL(v) (v).begin(), (v).end()
#define REP(i, n) for (int i = 0, _n = (n); i < _n; ++i)
#define REPD(i, n) for (int i = (n); i-- > 0; )
#define FOR(i, a, b) for (int i = (a), _b = (b); i < _b; ++i)
#define FORD(i, b, a) for (int i = (b), _a = (a); --i >= _a; )
#define FORE(i, a, b) for (int i = (a), _b = (b); i <= _b; ++i)
#define FORDE(i, b, a) for (int i = (b), _a = (a); i >= _a; --i)
#define scan_op(...) istream & operator >> (istream &in, __VA_ARGS__ &u)
#define print_op(...) ostream & operator << (ostream &out, const __VA_ARGS__ &u)
#ifdef LOCAL
#include "debug.h"
#else
#define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
#define DB(...) 23
#define db(...) 23
#define debug(...) 23
#endif
template <class U, class V> scan_op(pair <U, V>) { return in >> u.first >> u.second; }
template <class T> scan_op(vector <T>) { for (size_t i = 0; i < u.size(); ++i) in >> u[i]; return in; }
template <class U, class V> print_op(pair <U, V>) { return out << '(' << u.first << ", " << u.second << ')'; }
template <size_t i, class T> ostream & print_tuple_utils(ostream &out, const T &tup) { if constexpr(i == tuple_size<T>::value) return out << ")"; else return print_tuple_utils<i + 1, T>(out << (i ? ", " : "(") << get<i>(tup), tup); }
template <class ...U> print_op(tuple<U...>) { return print_tuple_utils<0, tuple<U...>>(out, u); }
template <class Con, class = decltype(begin(declval<Con>()))> typename enable_if <!is_same<Con, string>::value, ostream&>::type operator << (ostream &out, const Con &con) { out << '{'; for (__typeof(con.begin()) it = con.begin(); it != con.end(); ++it) out << (it == con.begin() ? "" : ", ") << *it; return out << '}'; }
template <class A, class B> bool minimize(A &a, B b) { return a > b ? a = b, true : false; }
template <class A, class B> bool maximize(A &a, B b) { return a < b ? a = b, true : false; }
// end of template
const long long INF = 1e18;
vector <long long> calculate_necessary_time(
int N, int M, long long S, int Q, vector <int> A, vector <int> B,
vector <long long> L, vector <long long> C, vector <int> U,
vector <int> V, vector <long long> T) {
vector <vector <int>> adj(N);
REP(i, M) {
adj[A[i]].push_back(i);
adj[B[i]].push_back(i);
}
vector <bool> used(N);
vector dist(N, vector(N, INF)), max_time(N, vector(N, -1LL));
REP(s, N) {
fill(ALL(used), false);
dist[s][s] = 0;
REP(love, N - 1) {
int u = -1;
REP(i, N) if (!used[i] && (u == -1 || dist[s][i] < dist[s][u])) u = i;
used[u] = true;
long long x = dist[s][u] % S;
for (int i: adj[u]) {
int v = A[i] ^ B[i] ^ u;
minimize(dist[s][v], dist[s][u] + L[i] + (x > C[i] ? S - x : 0));
}
}
fill(ALL(used), false);
max_time[s][s] = S;
REP(love, N - 1) {
int u = -1;
REP(i, N) if (!used[i] && (u == -1 || max_time[s][i] > max_time[s][u])) u = i;
used[u] = true;
for (int i: adj[u]) {
int v = A[i] ^ B[i] ^ u;
maximize(max_time[s][v], min(max_time[s][u], C[i]) - L[i]);
}
}
}
vector <long long> res(Q, INF);
vector <vector <int>> queriesAt(N);
REP(i, Q) {
REP(w, N) if (T[i] <= max_time[w][U[i]]) minimize(res[i], S + dist[w][V[i]] - T[i]);
if (dist[U[i]][V[i]] < S) queriesAt[U[i]].push_back(i);
}
REP(s, N) {
sort(ALL(queriesAt[s]), [&] (int x, int y) { return T[x] > T[y]; });
vector <long long> dist(N, INF);
dist[s] = 0;
set <pair <long long, int>> blocked_edge;
fill(ALL(used), false);
for (int i: queriesAt[s]) {
int t = T[i];
while (!blocked_edge.empty() && blocked_edge.rbegin()->fi >= t) {
int i = blocked_edge.rbegin()->se;
if (minimize(dist[A[i]], dist[B[i]] + L[i])) used[A[i]] = false;
else if (minimize(dist[B[i]], dist[A[i]] + L[i])) used[B[i]] = false;
blocked_edge.erase(*blocked_edge.rbegin());
}
while (true) {
int u = -1;
REP(i, N) if (!used[i] && (u == -1 || dist[i] < dist[u])) u = i;
if (u == -1) break;
used[u] = true;
for (int i: adj[u]) {
int v = A[i] ^ B[i] ^ u;
if (t + dist[u] <= C[i] - L[i]) {
if (minimize(dist[v], dist[u] + L[i])) used[v] = false;
} else {
blocked_edge.emplace(C[i] - L[i] - dist[u], i);
}
}
}
minimize(res[i], dist[V[i]]);
}
}
return res;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
14 ms |
65116 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
1481 ms |
112136 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
14 ms |
65116 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
14 ms |
65116 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
14 ms |
65116 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
