結果
| 問題 |
No.859 路線A、路線B、路線C
|
| コンテスト | |
| ユーザー |
MarcusAureliusAntoninus
|
| 提出日時 | 2019-08-09 22:03:55 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 1,350 bytes |
| コンパイル時間 | 2,081 ms |
| コンパイル使用メモリ | 205,292 KB |
| 最終ジャッジ日時 | 2025-01-07 11:20:58 |
|
ジャッジサーバーID (参考情報) |
judge1 / judge1 |
(要ログイン)
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 4 WA * 8 |
コンパイルメッセージ
main.cpp: In function ‘int main()’:
main.cpp:6:45: warning: format ‘%lld’ expects argument of type ‘long long int*’, but argument 2 has type ‘int64_t*’ {aka ‘long int*’} [-Wformat=]
6 | for (int i{}; i < 3; i++) scanf("%lld", x + i);
| ~~~^ ~~~~~
| | |
| | int64_t* {aka long int*}
| long long int*
| %ld
main.cpp:26:30: warning: format ‘%lld’ expects argument of type ‘long long int*’, but argument 3 has type ‘int64_t*’ {aka ‘long int*’} [-Wformat=]
26 | scanf(" %c%lld", S + i, index + i);
| ~~~^ ~~~~~~~~~
| | |
| long long int* int64_t* {aka long int*}
| %ld
main.cpp:50:20: warning: format ‘%lld’ expects argument of type ‘long long int’, but argument 2 has type ‘__gnu_cxx::__alloc_traits<std::allocator<long int>, long int>::value_type’ {aka ‘long int’} [-Wformat=]
50 | printf("%lld\n", dist[7]);
| ~~~^
| |
| long long int
| %ld
main.cpp:6:40: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
6 | for (int i{}; i < 3; i++) scanf("%lld", x + i);
| ~~~~~^~~~~~~~~~~~~~~
main.cpp:26:22: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
26 | scanf(" %c%lld", S + i, index + i);
| ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ソースコード
#include <bits/stdc++.h>
int main()
{
int64_t x[3];
for (int i{}; i < 3; i++) scanf("%lld", x + i);
using vpi = std::vector<std::pair<int, int64_t>>;
using vvpi = std::vector<vpi>;
vvpi edges(8);
for (int i{}; i < 3; i++)
for (int j{}; j < 2; j++)
{
int diff{(i + j) % 3};
edges[1 + i].push_back({1 + diff, 1ll});
edges[4 + i].push_back({4 + diff, 1ll});
}
for (int i{}; i < 3; i++)
{
edges[1 + i].push_back({4 + i, x[i] - 1});
edges[4 + i].push_back({1 + i, x[i] - 1});
}
char S[2];
int64_t index[2];
for (int i{}; i < 2; i++)
scanf(" %c%lld", S + i, index + i);
edges[0].push_back({1 + S[0] - 'A', index[0] - 1});
edges[0].push_back({4 + S[0] - 'A', x[S[0] - 'A'] - index[0]});
edges[1 + S[1] - 'A'].push_back({7, index[1] - 1});
edges[4 + S[1] - 'A'].push_back({7, x[S[1] - 'A'] - index[1]});
using P = std::pair<int64_t, int>;
std::priority_queue<P, std::vector<P>, std::greater<P>> dij;
std::vector<int64_t> dist(8, 1ll << 60);
dij.push({0, 0});
dist[0] = 0;
while (!dij.empty())
{
auto now{dij.top()};
dij.pop();
if (now.first > dist[now.second]) continue;
for (auto& e: edges[now.second])
{
P next{now.first + e.second, e.first};
if (next.first >= dist[next.second]) continue;
dist[next.second] = next.first;
dij.push(next);
}
}
printf("%lld\n", dist[7]);
return 0;
}
MarcusAureliusAntoninus