結果
| 問題 | No.1599 Hikyaku |
| ユーザー |
👑  hitonanode
|
| 提出日時 | 2021-07-09 23:20:43 |
| 言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 14,789 bytes |
| コンパイル時間 | 2,677 ms |
| コンパイル使用メモリ | 178,616 KB |
| 実行使用メモリ | 115,836 KB |
| 最終ジャッジ日時 | 2023-09-14 10:53:57 |
| 合計ジャッジ時間 | 79,535 ms |
|
ジャッジサーバーID （参考情報） |
judge15 / judge12 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 826 ms
68,080 KB |
| testcase_01 | AC | 857 ms
70,408 KB |
| testcase_02 | AC | 847 ms
69,628 KB |
| testcase_03 | AC | 1,275 ms
68,064 KB |
| testcase_04 | AC | 1,819 ms
85,012 KB |
| testcase_05 | AC | 1,822 ms
67,728 KB |
| testcase_06 | AC | 1,687 ms
71,532 KB |
| testcase_07 | AC | 1,687 ms
71,332 KB |
| testcase_08 | AC | 1,725 ms
69,748 KB |
| testcase_09 | AC | 1,771 ms
68,892 KB |
| testcase_10 | AC | 1,726 ms
71,744 KB |
| testcase_11 | AC | 1,798 ms
74,464 KB |
| testcase_12 | AC | 1,390 ms
68,688 KB |
| testcase_13 | AC | 1,253 ms
66,608 KB |
| testcase_14 | AC | 1,790 ms
101,208 KB |
| testcase_15 | AC | 850 ms
70,264 KB |
| testcase_16 | AC | 1,109 ms
68,288 KB |
| testcase_17 | WA | - |
| testcase_18 | AC | 1,702 ms
83,064 KB |
| testcase_19 | AC | 1,606 ms
70,080 KB |
| testcase_20 | AC | 1,592 ms
71,692 KB |
| testcase_21 | AC | 1,600 ms
68,916 KB |
| testcase_22 | AC | 1,616 ms
68,988 KB |
| testcase_23 | AC | 1,607 ms
70,124 KB |
| testcase_24 | AC | 1,605 ms
71,728 KB |
| testcase_25 | AC | 1,586 ms
68,640 KB |
| testcase_26 | AC | 1,455 ms
71,576 KB |
| testcase_27 | AC | 1,230 ms
68,728 KB |
| testcase_28 | AC | 1,261 ms
68,088 KB |
| testcase_29 | AC | 1,191 ms
68,504 KB |
| testcase_30 | AC | 1,002 ms
68,740 KB |
| testcase_31 | AC | 867 ms
66,748 KB |
| testcase_32 | AC | 865 ms
66,764 KB |
| testcase_33 | AC | 852 ms
68,716 KB |
| testcase_34 | AC | 1,271 ms
68,052 KB |
| testcase_35 | AC | 1,341 ms
68,084 KB |
| testcase_36 | AC | 1,641 ms
68,640 KB |
| testcase_37 | AC | 1,645 ms
66,680 KB |
| testcase_38 | AC | 1,614 ms
66,812 KB |
| testcase_39 | AC | 1,669 ms
67,388 KB |
| testcase_40 | AC | 1,628 ms
68,476 KB |
| testcase_41 | AC | 1,723 ms
115,836 KB |
| testcase_42 | AC | 870 ms
66,684 KB |
| testcase_43 | AC | 1,700 ms
115,668 KB |
| testcase_44 | WA | - |
| testcase_45 | AC | 1,117 ms
68,732 KB |
| testcase_46 | WA | - |
| testcase_47 | WA | - |
| testcase_48 | WA | - |
| testcase_49 | AC | 867 ms
66,672 KB |
| testcase_50 | AC | 984 ms
68,656 KB |
| testcase_51 | AC | 1,118 ms
68,848 KB |
| testcase_52 | AC | 1,615 ms
68,672 KB |
コンパイルメッセージ
次のファイルから読み込み: /usr/local/gcc7/include/c++/12.2.0/bits/stl_algobase.h:64,
次から読み込み: /usr/local/gcc7/include/c++/12.2.0/algorithm:60,
次から読み込み: main.cpp:1:
コンストラクタ ‘constexpr std::pair<_T1, _T2>::pair(_U1&&, _U2&&) [with _U1 = int; _U2 = std::pair<int, int>; typename std::enable_if<(std::_PCC<true, _T1, _T2>::_MoveConstructiblePair<_U1, _U2>() && std::_PCC<true, _T1, _T2>::_ImplicitlyMoveConvertiblePair<_U1, _U2>()), bool>::type <anonymous> = true; _T1 = double; _T2 = std::pair<int, int>]’ 内,
inlined from ‘void std::__new_allocator<_Tp>::construct(_Up*, _Args&& ...) [with _Up = std::pair<double, std::pair<int, int> >; _Args = {int, std::pair<int, int>}; _Tp = std::pair<double, std::pair<int, int> >]’ at /usr/local/gcc7/include/c++/12.2.0/bits/new_allocator.h:175:4,
inlined from ‘static void std::allocator_traits<std::allocator<_CharT> >::construct(allocator_type&, _Up*, _Args&& ...) [with _Up = std::pair<double, std::pair<int, int> >; _Args = {int, std::pair<int, int>}; _Tp = std::pair<double, std::pair<int, int> >]’ at /usr/local/gcc7/include/c++/12.2.0/bits/alloc_traits.h:516:17,
inlined from ‘void std::vector<_Tp, _Alloc>::_M_realloc_insert(iterator, _Args&& ...) [with _Args = {int, std::pair<int, int>}; _Tp = std::pair<double, std::pair<int, int> >; _Alloc = std::allocator<std::pair<double, std::pair<int, int> > >]’ at /usr/local/gcc7/include/c++/12.2.0/bits/vector.tcc:462:28,
inlined from ‘std::vector<_Tp, _Alloc>::reference std::vector<_Tp, _Alloc>::emplace_back(_Args&& ...) [with _Args = {int, std::pair<int, int>}; _Tp = std::pair<double, std::pair<int, int> >; _Alloc = std::allocator<std::pair<double, std::pair<int, int> > >]’ at /usr/local/gcc7/include/c++/12.2.0/bits/vector.tcc:123:21,
inlined from ‘void std::priority_queue<_Tp, _Sequence, _Compare>::emplace(_Args&& ...) [with _Args = {int, std::pair<int, int>}; _Tp = std::pair<dou
ソースコード
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <forward_list>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using lint = long long;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(20); }; } fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template <typename T, typename V>
void ndarray(vector<T>& vec, const V& val, int len) { vec.assign(len, val); }
template <typename T, typename V, typename... Args> void ndarray(vector<T>& vec, const V& val, int len, Args... args) { vec.resize(len), for_each(begin(vec), end(vec), [&](T& v) { ndarray(v, val, args...); }); }
template <typename T> bool chmax(T &m, const T q) { return m < q ? (m = q, true) : false; }
template <typename T> bool chmin(T &m, const T q) { return m > q ? (m = q, true) : false; }
int floor_lg(long long x) { return x <= 0 ? -1 : 63 - __builtin_clzll(x); }
template <typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }
template <typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }
template <typename T> vector<T> sort_unique(vector<T> vec) { sort(vec.begin(), vec.end()), vec.erase(unique(vec.begin(), vec.end()), vec.end()); return vec; }
template <typename T> int arglb(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::lower_bound(v.begin(), v.end(), x)); }
template <typename T> int argub(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::upper_bound(v.begin(), v.end(), x)); }
template <typename T> istream &operator>>(istream &is, vector<T> &vec) { for (auto &v : vec) is >> v; return is; }
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) { os << '['; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <typename T, size_t sz> ostream &operator<<(ostream &os, const array<T, sz> &arr) { os << '['; for (auto v : arr) os << v << ','; os << ']'; return os; }
#if __cplusplus >= 201703L
template <typename... T> istream &operator>>(istream &is, tuple<T...> &tpl) { std::apply([&is](auto &&... args) { ((is >> args), ...);}, tpl); return is; }
template <typename... T> ostream &operator<<(ostream &os, const tuple<T...> &tpl) { os << '('; std::apply([&os](auto &&... args) { ((os << args << ','), ...);}, tpl); return os << ')'; }
#endif
template <typename T> ostream &operator<<(ostream &os, const deque<T> &vec) { os << "deq["; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <typename T> ostream &operator<<(ostream &os, const set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T, typename TH> ostream &operator<<(ostream &os, const unordered_set<T, TH> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa) { os << '(' << pa.first << ',' << pa.second << ')'; return os; }
template <typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
template <typename TK, typename TV, typename TH> ostream &operator<<(ostream &os, const unordered_map<TK, TV, TH> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
#ifdef HITONANODE_LOCAL
const string COLOR_RESET = "\033[0m", BRIGHT_GREEN = "\033[1;32m", BRIGHT_RED = "\033[1;31m", BRIGHT_CYAN = "\033[1;36m", NORMAL_CROSSED = "\033[0;9;37m", RED_BACKGROUND = "\033[1;41m", NORMAL_FAINT = "\033[0;2m";
#define dbg(x) cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << endl
#define dbgif(cond, x) ((cond) ? cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << endl : cerr)
#else
#define dbg(x) (x)
#define dbgif(cond, x) 0
#endif
template <typename T, T INF = std::numeric_limits<T>::max() / 2, int INVALID = -1> struct ShortestPath {
int V, E;
bool single_positive_weight;
T wmin, wmax;
std::vector<std::vector<std::pair<int, T>>> to;
ShortestPath(int V = 0) : V(V), E(0), single_positive_weight(true), wmin(0), wmax(0), to(V) {}
void add_edge(int s, int t, T w) {
assert(0 <= s and s < V);
assert(0 <= t and t < V);
to[s].emplace_back(t, w);
E++;
if (w > 0 and wmax > 0 and wmax != w) single_positive_weight = false;
wmin = std::min(wmin, w);
wmax = std::max(wmax, w);
}
std::vector<T> dist;
std::vector<int> prev;
// Dijkstra algorithm
// Complexity: O(E log E)
void Dijkstra(int s) {
assert(0 <= s and s < V);
dist.assign(V, INF);
dist[s] = 0;
prev.assign(V, INVALID);
using P = std::pair<T, int>;
std::priority_queue<P, std::vector<P>, std::greater<P>> pq;
pq.emplace(0, s);
while (!pq.empty()) {
T d;
int v;
std::tie(d, v) = pq.top();
pq.pop();
if (dist[v] < d) continue;
for (auto nx : to[v]) {
T dnx = d + nx.second;
if (dist[nx.first] > dnx) {
dist[nx.first] = dnx, prev[nx.first] = v;
pq.emplace(dnx, nx.first);
}
}
}
}
// Dijkstra algorithm, O(V^2 + E)
void DijkstraVquad(int s) {
assert(0 <= s and s < V);
dist.assign(V, INF);
dist[s] = 0;
prev.assign(V, INVALID);
std::vector<char> fixed(V, false);
while (true) {
int r = INVALID;
T dr = INF;
for (int i = 0; i < V; i++) {
if (!fixed[i] and dist[i] < dr) r = i, dr = dist[i];
}
if (r == INVALID) break;
fixed[r] = true;
int nxt;
T dx;
for (auto p : to[r]) {
std::tie(nxt, dx) = p;
if (dist[nxt] > dist[r] + dx) dist[nxt] = dist[r] + dx, prev[nxt] = r;
}
}
}
// Bellman-Ford algorithm
// Complexity: O(VE)
bool BellmanFord(int s, int nb_loop) {
assert(0 <= s and s < V);
dist.assign(V, INF), prev.assign(V, INVALID);
dist[s] = 0;
for (int l = 0; l < nb_loop; l++) {
bool upd = false;
for (int v = 0; v < V; v++) {
if (dist[v] == INF) continue;
for (auto nx : to[v]) {
T dnx = dist[v] + nx.second;
if (dist[nx.first] > dnx) dist[nx.first] = dnx, prev[nx.first] = v, upd = true;
}
}
if (!upd) return true;
}
return false;
}
// Bellman-ford algorithm using queue (deque)
// Complexity: O(VE)
// Requirement: no negative loop
void SPFA(int s) {
assert(0 <= s and s < V);
dist.assign(V, INF);
prev.assign(V, INVALID);
std::deque<int> q;
std::vector<char> in_queue(V);
dist[s] = 0;
q.push_back(s), in_queue[s] = 1;
while (!q.empty()) {
int now = q.front();
q.pop_front(), in_queue[now] = 0;
for (auto nx : to[now]) {
T dnx = dist[now] + nx.second;
int nxt = nx.first;
if (dist[nxt] > dnx) {
dist[nxt] = dnx;
if (!in_queue[nxt]) {
if (q.size() and dnx < dist[q.front()]) { // Small label first optimization
q.push_front(nxt);
} else {
q.push_back(nxt);
}
prev[nxt] = now, in_queue[nxt] = 1;
}
}
}
}
}
void ZeroOneBFS(int s) {
assert(0 <= s and s < V);
dist.assign(V, INF), prev.assign(V, INVALID);
dist[s] = 0;
std::deque<int> que;
que.push_back(s);
while (!que.empty()) {
int v = que.front();
que.pop_front();
for (auto nx : to[v]) {
T dnx = dist[v] + nx.second;
if (dist[nx.first] > dnx) {
dist[nx.first] = dnx, prev[nx.first] = v;
if (nx.second) {
que.push_back(nx.first);
} else {
que.push_front(nx.first);
}
}
}
}
}
// Retrieve a sequence of vertex ids that represents shortest path [s, ..., goal]
// If not reachable to goal, return {}
std::vector<int> retrieve_path(int goal) const {
assert(int(prev.size()) == V);
assert(0 <= goal and goal < V);
if (dist[goal] == INF) return {};
std::vector<int> ret{goal};
while (prev[goal] != INVALID) {
goal = prev[goal];
ret.push_back(goal);
}
std::reverse(ret.begin(), ret.end());
return ret;
}
void solve(int s) {
if (wmin >= 0) {
if (single_positive_weight) {
ZeroOneBFS(s);
} else {
if ((long long)V * V < (E << 4)) {
DijkstraVquad(s);
} else {
Dijkstra(s);
}
}
} else {
BellmanFord(s, V);
}
}
// Warshall-Floyd algorithm
// Complexity: O(E + V^3)
std::vector<std::vector<T>> dist2d;
void WarshallFloyd() {
dist2d.assign(V, std::vector<T>(V, INF));
for (int i = 0; i < V; i++) {
dist2d[i][i] = 0;
for (auto p : to[i]) dist2d[i][p.first] = std::min(dist2d[i][p.first], p.second);
}
for (int k = 0; k < V; k++) {
for (int i = 0; i < V; i++) {
if (dist2d[i][k] == INF) continue;
for (int j = 0; j < V; j++) {
if (dist2d[k][j] == INF) continue;
dist2d[i][j] = std::min(dist2d[i][j], dist2d[i][k] + dist2d[k][j]);
}
}
}
}
void dump_graphviz(std::string filename = "shortest_path") const {
std::ofstream ss(filename + ".DOT");
ss << "digraph{\n";
for (int i = 0; i < V; i++) {
for (const auto &e : to[i]) ss << i << "->" << e.first << "[label=" << e.second << "];\n";
}
ss << "}\n";
ss.close();
return;
}
};
int main() {
int X, Y, N;
cin >> X >> Y >> N;
X--, Y--;
vector<vector<pint>> v2xy(8);
constexpr int H = 600;
constexpr double inf = 1e50;
int sx, sy;
REP(i, N) {
int x, y, v;
cin >> x >> y >> v;
x--, y--;
if (i == 0) sx = x, sy = y;
v2xy[v].emplace_back(x, y);
}
dbg(v2xy);
vector<double> vinv(20), vinv1(20);
FOR(d, 1, vinv.size()) vinv[d] = 1000.0 / d;
FOR(d, 1, vinv.size()) vinv1[d] = 1.0 / d;
dbg(vinv);
dbg(vinv1);
vector<vector<vector<double>>> D(8, vector(H, vector<double>(H, inf)));
FOR(v, 1, 8) {
ShortestPath<lint> graph(H * H + 1);
auto f = [&](int i, int j) { return i * H + j; };
for (auto [x, y] : v2xy[v]) graph.add_edge(H * H, f(x, y), 0);
REP(i, H) REP(j, H - 1) graph.add_edge(f(i, j), f(i, j + 1), 1);
REP(i, H) REP(j, H - 1) graph.add_edge(f(i, j + 1), f(i, j), 1);
REP(i, H - 1) REP(j, H) graph.add_edge(f(i, j), f(i + 1, j), 1);
REP(i, H - 1) REP(j, H) graph.add_edge(f(i + 1, j), f(i, j), 1);
graph.solve(H * H);
REP(i, H) REP(j, H) D[v][i][j] = graph.dist[f(i, j)] * vinv[v];
}
vector mat(H, vector<double>(H, inf));
mat[sx][sy] = 0;
using P = pair<double, pint>;
priority_queue<P, vector<P>, greater<P>> pq;
pq.emplace(0, pint(sx, sy));
while (pq.size()) {
auto [dnow, xy] = pq.top();
pq.pop();
auto [x, y] = xy;
if (mat[x][y] < dnow) continue;
array<int, 4> dx{1, -1, 0, 0};
array<int, 4> dy{0, 0, 1, -1};
FOR(v, 1, 8) {
double tstart = max(D[v][x][y], dnow);
if (tstart == inf) continue;
REP(d, 4) {
int nx = x + dx[d], ny = y + dy[d];
if (nx < 0 or ny < 0 or nx >= H or ny >= H) continue;
if (chmin(mat[nx][ny], tstart + vinv[v])) pq.emplace(mat[nx][ny], pint(nx, ny));
FOR(vnxt, v + 1, 8) {
if (D[vnxt][nx][ny] < mat[nx][ny] and mat[nx][ny] > mat[x][y]) {
dbgif(x == 1 and y == 0 and nx == 2 and v == 1 and vnxt == 2, mat[nx][ny]);
dbgif(x == 1 and y == 0 and nx == 2 and v == 1 and vnxt == 2, D[vnxt][nx][ny]);
double dt = (1000.0 + (tstart - D[vnxt][nx][ny]) * v) * vinv1[vnxt + v];
if (dt >= 0 and dt * vnxt <= 1000 and chmin(mat[nx][ny], D[vnxt][nx][ny] + dt * 2)) {
pq.emplace(mat[nx][ny], pint(nx, ny));
}
}
}
}
}
}
FOR(d, 1, 8) {
dbg(d);
REP(x, 5) {
vector<double> v(10);
REP(j, v.size()) v[j] = D[d][x][j];
dbg(v);
}
}
REP(x, 10) {
REP(y, 10) cerr << mat[x][y] << ' ';
cerr << '\n';
}
cout << mat[X][Y] << '\n';
}