제출 #862162

#제출 시각아이디문제언어결과실행 시간메모리
862162efedmrlrCommuter Pass (JOI18_commuter_pass)C++17
100 / 100
721 ms65516 KiB
#include <bits/stdc++.h> using namespace std; #define n_l '\n' #define dbg(...) cout << "[" << #__VA_ARGS__ << "]: "; cout << to_string(__VA_ARGS__) << endl template <typename T, size_t N> int SIZE(const T (&t)[N]){ return N; } template<typename T> int SIZE(const T &t){ return t.size(); } string to_string(const string s, int x1=0, int x2=1e9){ return '"' + ((x1 < s.size()) ? s.substr(x1, x2-x1+1) : "") + '"'; } string to_string(const char* s) { return to_string((string) s); } string to_string(const bool b) { return (b ? "true" : "false"); } string to_string(const char c){ return string({c}); } template<size_t N> string to_string(const bitset<N> &b, int x1=0, int x2=1e9){ string t = ""; for(int __iii__ = min(x1,SIZE(b)), __jjj__ = min(x2, SIZE(b)-1); __iii__ <= __jjj__; ++__iii__){ t += b[__iii__] + '0'; } return '"' + t + '"'; } template <typename A, typename... C> string to_string(const A (&v), int x1=0, int x2=1e9, C... coords); int l_v_l_v_l = 0, t_a_b_s = 0; template <typename A, typename B> string to_string(const pair<A, B> &p) { l_v_l_v_l++; string res = "(" + to_string(p.first) + ", " + to_string(p.second) + ")"; l_v_l_v_l--; return res; } template <typename A, typename... C> string to_string(const A (&v), int x1, int x2, C... coords) { int rnk = rank<A>::value; string tab(t_a_b_s, ' '); string res = ""; bool first = true; if(l_v_l_v_l == 0) res += n_l; res += tab + "["; x1 = min(x1, SIZE(v)), x2 = min(x2, SIZE(v)); auto l = begin(v); advance(l, x1); auto r = l; advance(r, (x2-x1) + (x2 < SIZE(v))); for (auto e = l; e != r; e = next(e)) { if (!first) { res += ", "; } first = false; l_v_l_v_l++; if(e != l){ if(rnk > 1) { res += n_l; t_a_b_s = l_v_l_v_l; }; } else{ t_a_b_s = 0; } res += to_string(*e, coords...); l_v_l_v_l--; } res += "]"; if(l_v_l_v_l == 0) res += n_l; return res; } void dbgm(){;} template<typename Heads, typename... Tails> void dbgm(Heads H, Tails... T){ cout << to_string(H) << " | "; dbgm(T...); } #define dbgm(...) cout << "[" << #__VA_ARGS__ << "]: "; dbgm(__VA_ARGS__); cout << endl #define int long long int #define MP make_pair #define pb push_back #define REP(i,n) for(int (i) = 0; (i) < (n); (i)++) void fastio() { ios_base::sync_with_stdio(false); cin.tie(NULL); } const double EPS = 0.00001; const int INF = 1e9+500; const int N = 3e5+5; const int ALPH = 26; const int LGN = 25; const int MOD = 1e9+7; int n,m,q; int s,t,u,v; vector<array<int,2> > adj[N]; vector<vector<int> > sadj(N); vector<vector<int> > tmpadj; vector<int> vis(N, 0); void dijkstra(vector<int> &spath, int sour) { priority_queue<array<int,3> , vector<array<int,3> > , greater<array<int,3> > > que; //length, target, source que.push({0, sour, 0}); while(que.size()) { auto cur = que.top(); que.pop(); if(spath[cur[1]] != INF) { if(spath[cur[1]] == cur[0]) { sadj[cur[1]].pb(cur[2]); } continue; } spath[cur[1]] = cur[0]; sadj[cur[1]].pb(cur[2]); for(auto c : adj[cur[1]]) { que.push({cur[0] + c[1], c[0], cur[1]}); } } } void dijkstra2(vector<array<int,2> > &spath, int sour) { priority_queue<array<int,3> , vector<array<int,3> > , greater<array<int,3> > > que; //length, target, powerup que.push({0, sour, 0}); while(que.size()) { auto cur = que.top(); que.pop(); if(spath[cur[1]][cur[2]] != INF) { continue; } spath[cur[1]][cur[2]] = cur[0]; if(!cur[2] && !vis[cur[1]]) { queue<int> bfs; bfs.push(cur[1]); while(bfs.size()) { int el = bfs.front(); bfs.pop(); vis[el] = 1; que.push({cur[0], el, 1}); for(auto c : sadj[el]) { if(vis[c]) continue; bfs.push(c); } } } for(auto c : adj[cur[1]]) { que.push({cur[0] + c[1], c[0], cur[2]}); } } } void dfs(int node) { vis[node] = 1; for(auto c : sadj[node]) { tmpadj[node].pb(c); if(vis[c]) continue; dfs(c); } } inline void solve() { cin>>n>>m; cin>>s>>t; cin>>u>>v; for(int i = 0; i<m; i++) { int a,b,c; cin>>a>>b>>c; adj[a].pb({b,c}); adj[b].pb({a,c}); } vector<int> spath(n+1, INF); dijkstra(spath, s); tmpadj.assign(n+1, vector<int>()); dfs(t); vis.assign(n+2, 0); swap(tmpadj, sadj); vector<array<int ,2> > spat(n+1, {INF,INF}); dijkstra2(spat, u); int ans = min(spat[v][0], spat[v][1]); spat.assign(n+1, {INF, INF}); vis.assign(n+1, 0); dijkstra2(spat, v); ans = min(ans, min(spat[u][0], spat[u][1])); cout<<ans<<"\n"; } signed main() { //freopen("milkvisits.in", "r", stdin); //freopen("milkvisits.out", "w", stdout); fastio(); int test = 1; //cin>>test; while(test--) { solve(); } }

컴파일 시 표준 에러 (stderr) 메시지

commuter_pass.cpp: In function 'std::string to_string(std::string, int, int)':
commuter_pass.cpp:7:208: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    7 | template <typename T, size_t N> int SIZE(const T (&t)[N]){ return N; } template<typename T> int SIZE(const T &t){ return t.size(); } string to_string(const string s, int x1=0, int x2=1e9){ return '"' + ((x1 < s.size()) ? s.substr(x1, x2-x1+1) : "") + '"'; } string to_string(const char* s) { return to_string((string) s); } string to_string(const bool b) { return (b ? "true" : "false"); } string to_string(const char c){ return string({c}); } template<size_t N> string to_string(const bitset<N> &b, int x1=0, int x2=1e9){ string t = ""; for(int __iii__ = min(x1,SIZE(b)),  __jjj__ = min(x2, SIZE(b)-1); __iii__ <= __jjj__; ++__iii__){ t += b[__iii__] + '0'; } return '"' + t + '"'; } template <typename A, typename... C> string to_string(const A (&v), int x1=0, int x2=1e9, C... coords); int l_v_l_v_l = 0, t_a_b_s = 0; template <typename A, typename B> string to_string(const pair<A, B> &p) { l_v_l_v_l++; string res = "(" + to_string(p.first) + ", " + to_string(p.second) + ")"; l_v_l_v_l--; return res; } template <typename A, typename... C> string to_string(const A (&v), int x1, int x2, C... coords) { int rnk = rank<A>::value; string tab(t_a_b_s, ' '); string res = ""; bool first = true; if(l_v_l_v_l == 0) res += n_l; res += tab + "["; x1 = min(x1, SIZE(v)), x2 = min(x2, SIZE(v)); auto l = begin(v); advance(l, x1); auto r = l; advance(r, (x2-x1) + (x2 < SIZE(v))); for (auto e = l; e != r; e = next(e)) { if (!first) { res += ", "; } first = false; l_v_l_v_l++; if(e != l){ if(rnk > 1) { res += n_l; t_a_b_s = l_v_l_v_l; }; } else{ t_a_b_s = 0; } res += to_string(*e, coords...); l_v_l_v_l--; } res += "]"; if(l_v_l_v_l == 0) res += n_l; return res; } void dbgm(){;} template<typename Heads, typename... Tails> void dbgm(Heads H, Tails... T){ cout << to_string(H) << " | "; dbgm(T...); }
      |                                                                                                                                                                                                             ~~~^~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...