結果
| 問題 |
No.807 umg tours
|
| コンテスト | |
| ユーザー |
 mai
|
| 提出日時 | 2019-03-22 22:25:53 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 7,971 bytes |
| コンパイル時間 | 3,330 ms |
| コンパイル使用メモリ | 229,984 KB |
| 最終ジャッジ日時 | 2025-01-06 23:57:23 |
|
ジャッジサーバーID （参考情報） |
judge3 / judge2 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| other | AC * 22 WA * 4 |
コンパイルメッセージ
main.cpp: In function ‘int main()’:
main.cpp:195:16: warning: ISO C++ forbids converting a string constant to ‘char*’ [-Wwrite-strings]
195 | printer << "0\n";
| ^~~~~
ソースコード
#pragma GCC optimize ("O3")
#include "bits/stdc++.h"
using namespace std;
using ll = long long int;
#define debugos cout
#define debug(v) {printf("L%d %s > ",__LINE__,#v);debugos<<(v)<<endl;}
#define debugv(v) {printf("L%d %s > ",__LINE__,#v);for(auto e:(v)){debugos<<e<<" ";}debugos<<endl;}
#define debuga(m,w) {printf("L%d %s > ",__LINE__,#m);for(int x=0;x<(w);x++){debugos<<(m)[x]<<" ";}debugos<<endl;}
#define debugaa(m,h,w) {printf("L%d %s >\n",__LINE__,#m);for(int y=0;y<(h);y++){for(int x=0;x<(w);x++){debugos<<(m)[y][x]<<" ";}debugos<<endl;}}
#define ALL(v) (v).begin(),(v).end()
#define repeat(cnt,l) for(auto cnt=decltype(l)();(cnt)<(l);++(cnt))
#define rrepeat(cnt,l) for(auto cnt=(l)-1;0<=(cnt);--(cnt))
#define iterate(cnt,b,e) for(auto cnt=(b);(cnt)!=(e);++(cnt))
#define diterate(cnt,b,e) for(auto cnt=(b);(cnt)!=(e);--(cnt))
const ll MD = 1000000007ll; const long double PI = 3.1415926535897932384626433832795L;
inline void assert_call(bool assertion, function<void()> f) { if (!assertion) { cerr << "assertion fault:" << endl; f(); abort(); } }
template<typename T1, typename T2> inline ostream& operator <<(ostream &o, const pair<T1, T2> p) { o << '(' << p.first << ':' << p.second << ')'; return o; }
template<typename Vec> inline ostream& _ostream_vecprint(ostream& os, const Vec& a) {
os << '['; for (const auto& e : a) os << ' ' << e << ' '; os << ']'; return os; }
template<typename T> inline ostream& operator<<(ostream& o, const vector<T>& v) { return _ostream_vecprint(o, v); }
template<typename T, size_t S> inline ostream& operator<<(ostream& o, const array<T, S>& v) { return _ostream_vecprint(o, v); }
template<typename T> inline T& chmax(T& to, const T& val) { return to = max(to, val); }
template<typename T> inline T& chmin(T& to, const T& val) { return to = min(to, val); }
void bye(string s, int code = 0) { cout << s << endl; exit(code); }
mt19937_64 randdev(8901016);
template<typename T> inline T rand(T l, T h) { return uniform_int_distribution<T>(l, h)(randdev); }
template<> inline double rand<double>(double l, double h) { return uniform_real_distribution<double>(l, h)(randdev); }
template<> inline float rand<float>(float l, float h) { return uniform_real_distribution<float>(l, h)(randdev); }
#if defined(_WIN32) || defined(_WIN64)
#define getchar_unlocked _getchar_nolock
#define putchar_unlocked _putchar_nolock
#elif defined(__GNUC__)
#else
#define getchar_unlocked getchar
#define putchar_unlocked putchar
#endif
namespace {
#define isvisiblechar(c) (0x21<=(c)&&(c)<=0x7E)
class MaiScanner {
public:
template<typename T> void input_integer(T& var) {
var = 0; T sign = 1;
int cc = getchar_unlocked();
for (; cc<'0' || '9'<cc; cc = getchar_unlocked())
if (cc == '-') sign = -1;
for (; '0' <= cc && cc <= '9'; cc = getchar_unlocked())
var = (var << 3) + (var << 1) + cc - '0';
var = var * sign;
}
inline int c() { return getchar_unlocked(); }
inline MaiScanner& operator>>(int& var) { input_integer<int>(var); return *this; }
inline MaiScanner& operator>>(long long& var) { input_integer<long long>(var); return *this; }
inline MaiScanner& operator>>(string& var) {
int cc = getchar_unlocked();
for (; !isvisiblechar(cc); cc = getchar_unlocked());
for (; isvisiblechar(cc); cc = getchar_unlocked())
var.push_back(cc);
return *this;
}
template<typename IT> void in(IT begin, IT end) { for (auto it = begin; it != end; ++it) *this >> *it; }
};
class MaiPrinter {
public:
template<typename T>
void output_integer(T var) {
if (var == 0) { putchar_unlocked('0'); return; }
if (var < 0)
putchar_unlocked('-'),
var = -var;
char stack[32]; int stack_p = 0;
while (var)
stack[stack_p++] = '0' + (var % 10),
var /= 10;
while (stack_p)
putchar_unlocked(stack[--stack_p]);
}
inline MaiPrinter& operator<<(char c) { putchar_unlocked(c); return *this; }
inline MaiPrinter& operator<<(int var) { output_integer<int>(var); return *this; }
inline MaiPrinter& operator<<(long long var) { output_integer<long long>(var); return *this; }
inline MaiPrinter& operator<<(char* str_p) { while (*str_p) putchar_unlocked(*(str_p++)); return *this; }
inline MaiPrinter& operator<<(const string& str) {
const char* p = str.c_str();
const char* l = p + str.size();
while (p < l) putchar_unlocked(*p++);
return *this;
}
template<typename IT> void join(IT begin, IT end, char sep = ' ') { for (bool b = 0; begin != end; ++begin, b = 1) b ? *this << sep << *begin : *this <<* begin; }
};
}
MaiScanner scanner;
MaiPrinter printer;
// Edge構造体を定義する無向グラフ
class GraphE {
public:
using W_T = long long;
struct Edge {
int u, v;
W_T value;
Edge(int from = 0, int to = 0, W_T value = 0) :u(from), v(to), value(value) {}
inline int to(int _v) const { return _v == v ? u : v; }
};
size_t n;
vector<vector<int>> vertex_to;
vector<Edge> edges;
GraphE(int n = 1) :n(n), vertex_to(n) { }
inline size_t size() const noexcept { return n; }
void resize(size_t _n) { vertex_to.resize(n = _n); }
void connect(int from, int to, W_T val = 0) {
vertex_to[(size_t)from].push_back((int)edges.size());
vertex_to[(size_t)to].push_back((int)edges.size());
edges.emplace_back(from, to, val);
}
void connect(vector<Edge>&& es) {
edges = move(es);
for (int i = 0; (size_t)i < edges.size(); ++i) {
vertex_to[edges[i].u].push_back(i);
vertex_to[edges[i].v].push_back(i);
}
}
};
vector<GraphE::W_T> dijkstraEdgeWeighted(const GraphE& graph, int startIndex) {
using T = GraphE::W_T;
vector<T> dist(graph.size(), numeric_limits<T>::max());
priority_queue<pair<T, int>> que; // <dist, idx>
que.emplace(0, startIndex);
dist[startIndex] = 0;
while (!que.empty()) {
int d = -que.top().first;
int v = que.top().second;
que.pop();
if (dist[v] < d) continue;
for (int ei : graph.vertex_to[v]) {
auto e = graph.edges[ei];
int u = e.to(v);
if (d + e.value < dist[u]) {
que.emplace(-(dist[u] = d + e.value), u);
}
}
}
return move(dist);
}
vector<GraphE::W_T> specialDijkstraEdgeWeighted(const GraphE& graph, const vector<GraphE::W_T>& normal, int startIndex) {
using T = GraphE::W_T;
vector<T> dist(graph.size(), numeric_limits<T>::max());
priority_queue<pair<T, int>> que; // <dist, idx>
que.emplace(0, startIndex);
dist[startIndex] = 0;
while (!que.empty()) {
int d = -que.top().first;
int v = que.top().second;
que.pop();
if (dist[v] < d) continue;
for (int ei : graph.vertex_to[v]) {
auto e = graph.edges[ei];
int u = e.to(v);
T vol = min<T>(d + e.value, normal[v]);
if (vol < dist[u]) {
que.emplace(-(dist[u] = vol), u);
}
}
}
return move(dist);
}
//
int N;
int M;
GraphE graph;
int main(){
scanner >> N >> M;
graph = GraphE(N);
repeat(i, M) {
int a, b, c;
scanner >> a >> b >> c;
--a; --b;
graph.connect(a, b, c);
}
auto dt = dijkstraEdgeWeighted(graph, 0);
auto dtSp = specialDijkstraEdgeWeighted(graph, dt, 0);
printer << "0\n";
iterate(i, 1, N) {
ll dist = dt[i] + dtSp[i];
// cout << make_pair(dt[i], dtSp[i]) << endl;
printer << dist << '\n';
}
return 0;
}