oj.uz

답안 #761495

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
761495 2023-06-19T20:00:11 Z bLIC Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
 261 ms 29496 KB 
/**
 *  Author: Anil Byar
**/

#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>

// using namespace __gnu_pbds;
using namespace std;

// template<class T>
// using ordered_set = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;



#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) (int)(x).size()
#define uniq(v) v.erase(unique(all(v)), v.end())
#define ft first
#define sd second
#define pb push_back
#define eb emplace_back

// Source: https://codeforces.com/blog/entry/68809
// { start
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '"' << x << '"';}
void __print(const string &x) {cerr << '"' << x << '"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifndef ONLINE_JUDGE
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif
// } end


typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<pii> vii;
typedef vector<ll> vl;
typedef vector<pll> vll;
typedef vector<vi> vvi;
typedef vector<vii> vvii;
typedef vector<vl> vvl;

#define dbg if(0)

const ll MOD = 1e9+7;
const ll MOD9 = 998244353;
const ll INFLL = 1e18+5;
const int INF = 1e9;

void printbit(int x, int len) {string s="\n";while(len--){s=((x%2)?'1':'0')+s;x/=2;} cout<<s;}
ll power(ll x, ll y, ll mod){if (y==0) return 1;ll ret = power(x, y/2, mod);ret *= ret;ret%=mod;if (y&1) ret *= x;return ret%mod;}
ll modinv(ll x, ll mod = MOD) {return power(x, mod-2, mod);}

template<class T>
istream& operator>>(istream&in, vector<T>&v){
    for (T& x:v) in>>x;
    return in;
}
template<class T>
ostream& operator<<(ostream&out, vector<T>&v){
    for (T& x:v) out<<x<<' ';
    cout<<'\n';
    return out;
}
// use ?: with brackets (?:)
// check for overflow
// think about dp
// Read the statement carefully

const int maxN = 1e5+5;
const int maxK = 8001;


vll adj[maxN];
vl par[maxN];
int n, m;

vl dijkstra(int s, bool storepar){
    vl dist(n+1, INFLL);
    dist[s] = 0;
    priority_queue<pll, vll, greater<pll>> pq;
    pq.emplace(0, s);
    while(!pq.empty()){
        auto [d, u] = pq.top();
        pq.pop();

        if (d!=dist[u]) continue;
        for (auto& [v, w]:adj[u]){
            if (dist[v]>dist[u] + w){
                dist[v] = dist[u] + w;
                pq.emplace(dist[v], v);
                if (storepar){
                    par[v].clear();
                    par[v].pb(u);
                }
            } else if (dist[v] == dist[u] + w && storepar){
                par[v].pb(u);
            }
        }
    }
    return dist;
}
ll ans;
bool vis[maxN];

ll lu[maxN];
ll lv[maxN];
vl ds, dt, du, dv;
void dfs(int node, ll cu = INFLL, ll cv = INFLL){
    cu = min(cu, du[node]);
    cv = min(cv, dv[node]);
    if (vis[node]){
        ans = min(ans, cu + lv[node]);
        ans = min(ans, cv + lu[node]);
        return;
    }

    vis[node] = true;
    lu[node] = du[node];
    lv[node] = dv[node];

    for (int x:par[node]){
        dfs(x, cu, cv);
        lu[node] = min(lu[node], lu[x]);
        lv[node] = min(lv[node], lv[x]);
    }
    ans = min(ans, cu+lv[node]);
    ans = min(ans, cv+lu[node]);
}

void solve(){
    int s, t, u, v;
    cin>>n>>m;
    cin>>s>>t>>u>>v;
    for (int i = 0;i<m;i++){
        int u, v, w;cin>>u>>v>>w;
        adj[u].emplace_back(v, w);
        adj[v].emplace_back(u, w);
    }
    ds = dijkstra(s, true);
    dt = dijkstra(t, false);
    du = dijkstra(u, false);
    dv = dijkstra(v, false);

    ans = du[v];

    dfs(t);
    cout<<ans;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);


#define ONLINE_JUDGE
#ifndef ONLINE_JUDGE
    freopen("input.in", "r", stdin);
    freopen("output.out", "w", stdout);
    freopen("debug.dbg", "w", stderr);
    int tt = clock();
#endif

    int t=1, i = 1;
    // cin>>t;
    while(t--){
        // cout<<"Case #"<<i++<<": ";
        solve();
        cout<<'\n';
    }
#ifndef ONLINE_JUDGE
    cerr << "TIME = " << (float)(clock() - tt)/CLOCKS_PER_SEC << endl;
    tt = clock();
#endif
}

Compilation message

commuter_pass.cpp: In function 'int main()':
commuter_pass.cpp:190:14: warning: unused variable 'i' [-Wunused-variable]
  190 |     int t=1, i = 1;
      |              ^

Subtask #1
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 207 ms 24064 KB Output is correct
2 Correct 219 ms 22792 KB Output is correct
3 Correct 219 ms 29496 KB Output is correct
4 Correct 218 ms 24216 KB Output is correct
5 Correct 213 ms 22988 KB Output is correct
6 Correct 212 ms 24188 KB Output is correct
7 Correct 218 ms 22808 KB Output is correct
8 Correct 214 ms 22828 KB Output is correct
9 Correct 211 ms 22716 KB Output is correct
10 Correct 178 ms 22648 KB Output is correct
11 Correct 75 ms 21072 KB Output is correct
12 Correct 227 ms 22736 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 232 ms 24988 KB Output is correct
2 Correct 221 ms 25164 KB Output is correct
3 Correct 221 ms 24792 KB Output is correct
4 Correct 231 ms 25156 KB Output is correct
5 Correct 237 ms 25572 KB Output is correct
6 Correct 212 ms 27332 KB Output is correct
7 Correct 251 ms 28012 KB Output is correct
8 Correct 229 ms 25228 KB Output is correct
9 Correct 235 ms 25552 KB Output is correct
10 Correct 261 ms 24900 KB Output is correct
11 Correct 80 ms 22712 KB Output is correct
12 Correct 216 ms 27728 KB Output is correct

Subtask #3
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 6356 KB Output is correct
2 Correct 2 ms 5076 KB Output is correct
3 Correct 3 ms 5076 KB Output is correct
4 Correct 13 ms 7788 KB Output is correct
5 Correct 7 ms 6356 KB Output is correct
6 Correct 3 ms 5076 KB Output is correct
7 Correct 3 ms 5076 KB Output is correct
8 Correct 3 ms 5204 KB Output is correct
9 Correct 3 ms 5076 KB Output is correct
10 Correct 7 ms 6412 KB Output is correct
11 Correct 2 ms 5044 KB Output is correct
12 Correct 2 ms 5076 KB Output is correct
13 Correct 3 ms 5076 KB Output is correct
14 Correct 3 ms 5076 KB Output is correct
15 Correct 3 ms 5076 KB Output is correct

Subtask #4
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 207 ms 24064 KB Output is correct
2 Correct 219 ms 22792 KB Output is correct
3 Correct 219 ms 29496 KB Output is correct
4 Correct 218 ms 24216 KB Output is correct
5 Correct 213 ms 22988 KB Output is correct
6 Correct 212 ms 24188 KB Output is correct
7 Correct 218 ms 22808 KB Output is correct
8 Correct 214 ms 22828 KB Output is correct
9 Correct 211 ms 22716 KB Output is correct
10 Correct 178 ms 22648 KB Output is correct
11 Correct 75 ms 21072 KB Output is correct
12 Correct 227 ms 22736 KB Output is correct
13 Correct 232 ms 24988 KB Output is correct
14 Correct 221 ms 25164 KB Output is correct
15 Correct 221 ms 24792 KB Output is correct
16 Correct 231 ms 25156 KB Output is correct
17 Correct 237 ms 25572 KB Output is correct
18 Correct 212 ms 27332 KB Output is correct
19 Correct 251 ms 28012 KB Output is correct
20 Correct 229 ms 25228 KB Output is correct
21 Correct 235 ms 25552 KB Output is correct
22 Correct 261 ms 24900 KB Output is correct
23 Correct 80 ms 22712 KB Output is correct
24 Correct 216 ms 27728 KB Output is correct
25 Correct 8 ms 6356 KB Output is correct
26 Correct 2 ms 5076 KB Output is correct
27 Correct 3 ms 5076 KB Output is correct
28 Correct 13 ms 7788 KB Output is correct
29 Correct 7 ms 6356 KB Output is correct
30 Correct 3 ms 5076 KB Output is correct
31 Correct 3 ms 5076 KB Output is correct
32 Correct 3 ms 5204 KB Output is correct
33 Correct 3 ms 5076 KB Output is correct
34 Correct 7 ms 6412 KB Output is correct
35 Correct 2 ms 5044 KB Output is correct
36 Correct 2 ms 5076 KB Output is correct
37 Correct 3 ms 5076 KB Output is correct
38 Correct 3 ms 5076 KB Output is correct
39 Correct 3 ms 5076 KB Output is correct
40 Correct 210 ms 23756 KB Output is correct
41 Correct 195 ms 22828 KB Output is correct
42 Correct 200 ms 22760 KB Output is correct
43 Correct 76 ms 21792 KB Output is correct
44 Correct 81 ms 21704 KB Output is correct
45 Correct 198 ms 24040 KB Output is correct
46 Correct 219 ms 23324 KB Output is correct
47 Correct 207 ms 24696 KB Output is correct
48 Correct 84 ms 18888 KB Output is correct
49 Correct 200 ms 24948 KB Output is correct
50 Correct 204 ms 23276 KB Output is correct
51 Correct 193 ms 23376 KB Output is correct