oj.uz

답안 #247538

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
247538 2020-07-11T15:09:30 Z Atill83 Olympic Bus (JOI20_ho_t4) C++14
100 / 100
 64 ms 8556 KB 
#include <bits/stdc++.h>
#define ff first
#define ss second
#define endl '\n'
using namespace std;
const long long INF = (long long) 1e18;
const int mod = (int) 1e9+7;
const int MAXN = (int) 50000;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
ll n, m;


struct ed{
    ll v, i, dist;

    bool operator < (ed other) const {
        return dist > other.dist;
    };
};

pair<ll, ed> edg[MAXN];
vector<ed> adj[MAXN];
int d[MAXN];
ll fw[205][205], fw1[205][205], fw2[205][205];
int p1[MAXN], p2[MAXN];
ll ans[MAXN];


vector<int> dik(int u, int v){
    vector<ll> dst(n + 1, -1);
    vector<ll> to(n + 1, -1);
    priority_queue<ed> pq;
    pq.push({u, -1, 0});
    while(!pq.empty()){
        ed cur = pq.top();
        pq.pop();
        if(dst[cur.v] != -1){
            continue;
        }
        dst[cur.v] = cur.dist;
        to[cur.v] = cur.i;
        for(ed a: adj[cur.v]){
            if(dst[a.v] == -1){
                pq.push({a.v, a.i, dst[cur.v] + a.dist});
            }
        }
    }
    if(dst[v] == -1){
        return {};
    }
    vector<int> res;
    int cur = v;
    while(cur != u){
        res.push_back(to[cur]);
        cur = edg[to[cur]].ff;
    }
    reverse(res.begin(), res.end());
    return res;
}



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

    #ifdef Local
        freopen("C:/Users/Admin/Desktop/Yazilim/C/IO/int.txt","r",stdin);
        freopen("C:/Users/Admin/Desktop/Yazilim/C/IO/out.txt","w",stdout);
    #endif

    cin>>n>>m;
    for(int i = 0; i < m; i++){
        int u, v, c, dd;
        cin>>u>>v>>c>>dd;
        d[i] = dd;
        ed a = {v, i, c};
        adj[u].push_back(a);
        edg[i] = {u, a};
    }

    vector<int> path1 = dik(1, n), path2 = dik(n, 1);

    for(int i = 0; i < path1.size(); i++)
        p1[path1[i]] = i + 1;
    for(int i = 0; i < path2.size(); i++) 
        p2[path2[i]] = i + 1;

    for(int i = 1; i <= n; i++)
        for(int j = 1; j <= n; j++){
            if(i == j){
                fw[i][j] = fw1[i][j] = fw2[i][j] = 0;
            }else{
                fw[i][j] = fw1[i][j] = fw2[i][j] = INF;
            }
        }
    
    for(int i = 0; i < m; i++){
        fw[edg[i].ff][edg[i].ss.v] = min(fw[edg[i].ff][edg[i].ss.v],edg[i].ss.dist);
        if(!p1[i]) fw1[edg[i].ff][edg[i].ss.v] = min(fw1[edg[i].ff][edg[i].ss.v], edg[i].ss.dist);
        if(!p2[i]) fw2[edg[i].ff][edg[i].ss.v] = min(fw2[edg[i].ff][edg[i].ss.v], edg[i].ss.dist);
    }



    for(int k = 1; k <= n; k++)
        for(int i = 1; i <= n; i++)
            for(int j = 1; j <= n; j++){
                fw[i][j] = min(fw[i][j], fw[i][k] + fw[k][j]);
                fw1[i][j] = min(fw1[i][j], fw1[i][k] + fw1[k][j]);
                fw2[i][j] = min(fw2[i][j], fw2[i][k] + fw2[k][j]);
            }

    ll cev = fw[1][n] + fw[n][1];

    for(int i = 0; i < m; i++){
        if(!p1[i]){
            ll sim = INF;
            sim = min(fw[1][n], fw[1][edg[i].ss.v] + fw[edg[i].ff][n] + edg[i].ss.dist);
            ans[i] += sim;
        }else{
            ll sim = INF;
            for(int l = 0; l < p1[i]; l++){
                for(int k = p1[i]; k <= path1.size(); k++){
                    int u = edg[path1[l]].ff, v = edg[path1[k - 1]].ss.v;
                    sim = min(sim, fw[1][u] + fw1[u][v] + fw[v][n]);
                }
            }
            ans[i] += sim;
        }
    }
    //for(int j: path2) cout<<j<<" "; cout<<endl;

    for(int i = 0; i < m; i++){
        if(!p2[i]){
            ll sim = INF;
            sim = min(fw[n][1], fw[n][edg[i].ss.v] + fw[edg[i].ff][1] + edg[i].ss.dist);
            //if(i == 3) cout<<sim<<endl;
            ans[i] += sim;
        }else{
            ll sim = INF;
            for(int l = 0; l < p2[i]; l++){
                for(int k = p2[i]; k <= path2.size(); k++){
                    int u = edg[path2[l]].ff, v = edg[path2[k - 1]].ss.v;
                    sim = min(sim, fw[n][u] + fw2[u][v] + fw[v][1]);
                }
            }
            ans[i] += sim;
        }
    }

    for(int i = 0; i < m; i++){
        //cout<<ans[i]<<endl;
        cev = min(cev, ans[i] + d[i]);
    }


    if(cev >= INF) cev = -1;


    cout<<cev<<endl;


    #ifdef Local
        cout<<endl<<fixed<<setprecision(2)<<1000.0 * clock() / CLOCKS_PER_SEC<< " milliseconds ";
    #endif
}

Compilation message

ho_t4.cpp: In function 'int main()':
ho_t4.cpp:88:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 0; i < path1.size(); i++)
                    ~~^~~~~~~~~~~~~~
ho_t4.cpp:90:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 0; i < path2.size(); i++) 
                    ~~^~~~~~~~~~~~~~
ho_t4.cpp:128:38: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                 for(int k = p1[i]; k <= path1.size(); k++){
                                    ~~^~~~~~~~~~~~~~~
ho_t4.cpp:147:38: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                 for(int k = p2[i]; k <= path2.size(); k++){
                                    ~~^~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 2688 KB Output is correct
2 Correct 27 ms 2560 KB Output is correct
3 Correct 28 ms 2688 KB Output is correct
4 Correct 27 ms 2688 KB Output is correct
5 Correct 6 ms 1792 KB Output is correct
6 Correct 27 ms 2560 KB Output is correct
7 Correct 5 ms 1536 KB Output is correct
8 Correct 5 ms 1536 KB Output is correct
9 Correct 6 ms 1664 KB Output is correct
10 Correct 35 ms 2688 KB Output is correct
11 Correct 35 ms 2688 KB Output is correct
12 Correct 35 ms 2688 KB Output is correct
13 Correct 29 ms 2560 KB Output is correct
14 Correct 37 ms 2560 KB Output is correct
15 Correct 27 ms 2560 KB Output is correct
16 Correct 27 ms 2680 KB Output is correct

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 59 ms 7592 KB Output is correct
2 Correct 57 ms 7440 KB Output is correct
3 Correct 61 ms 7940 KB Output is correct
4 Correct 28 ms 2816 KB Output is correct
5 Correct 28 ms 2680 KB Output is correct
6 Correct 27 ms 2688 KB Output is correct
7 Correct 26 ms 2560 KB Output is correct
8 Correct 5 ms 1536 KB Output is correct
9 Correct 59 ms 7796 KB Output is correct
10 Correct 52 ms 7856 KB Output is correct
11 Correct 59 ms 7764 KB Output is correct
12 Correct 56 ms 8280 KB Output is correct
13 Correct 57 ms 7892 KB Output is correct
14 Correct 58 ms 8084 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 2688 KB Output is correct
2 Correct 26 ms 2560 KB Output is correct
3 Correct 47 ms 6396 KB Output is correct
4 Correct 27 ms 2560 KB Output is correct
5 Correct 54 ms 7532 KB Output is correct
6 Correct 5 ms 1536 KB Output is correct
7 Correct 5 ms 1536 KB Output is correct
8 Correct 51 ms 7644 KB Output is correct
9 Correct 49 ms 7584 KB Output is correct
10 Correct 53 ms 8088 KB Output is correct
11 Correct 50 ms 7624 KB Output is correct
12 Correct 60 ms 7508 KB Output is correct
13 Correct 6 ms 1536 KB Output is correct
14 Correct 5 ms 1536 KB Output is correct
15 Correct 5 ms 1536 KB Output is correct
16 Correct 5 ms 1536 KB Output is correct
17 Correct 5 ms 1536 KB Output is correct
18 Correct 5 ms 1536 KB Output is correct
19 Correct 50 ms 8128 KB Output is correct
20 Correct 54 ms 7512 KB Output is correct
21 Correct 53 ms 7624 KB Output is correct
22 Correct 53 ms 7364 KB Output is correct

Subtask #4
63.0 / 63.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 2688 KB Output is correct
2 Correct 27 ms 2560 KB Output is correct
3 Correct 28 ms 2688 KB Output is correct
4 Correct 27 ms 2688 KB Output is correct
5 Correct 6 ms 1792 KB Output is correct
6 Correct 27 ms 2560 KB Output is correct
7 Correct 5 ms 1536 KB Output is correct
8 Correct 5 ms 1536 KB Output is correct
9 Correct 6 ms 1664 KB Output is correct
10 Correct 35 ms 2688 KB Output is correct
11 Correct 35 ms 2688 KB Output is correct
12 Correct 35 ms 2688 KB Output is correct
13 Correct 29 ms 2560 KB Output is correct
14 Correct 37 ms 2560 KB Output is correct
15 Correct 27 ms 2560 KB Output is correct
16 Correct 27 ms 2680 KB Output is correct
17 Correct 59 ms 7592 KB Output is correct
18 Correct 57 ms 7440 KB Output is correct
19 Correct 61 ms 7940 KB Output is correct
20 Correct 28 ms 2816 KB Output is correct
21 Correct 28 ms 2680 KB Output is correct
22 Correct 27 ms 2688 KB Output is correct
23 Correct 26 ms 2560 KB Output is correct
24 Correct 5 ms 1536 KB Output is correct
25 Correct 59 ms 7796 KB Output is correct
26 Correct 52 ms 7856 KB Output is correct
27 Correct 59 ms 7764 KB Output is correct
28 Correct 56 ms 8280 KB Output is correct
29 Correct 57 ms 7892 KB Output is correct
30 Correct 58 ms 8084 KB Output is correct
31 Correct 28 ms 2688 KB Output is correct
32 Correct 26 ms 2560 KB Output is correct
33 Correct 47 ms 6396 KB Output is correct
34 Correct 27 ms 2560 KB Output is correct
35 Correct 54 ms 7532 KB Output is correct
36 Correct 5 ms 1536 KB Output is correct
37 Correct 5 ms 1536 KB Output is correct
38 Correct 51 ms 7644 KB Output is correct
39 Correct 49 ms 7584 KB Output is correct
40 Correct 53 ms 8088 KB Output is correct
41 Correct 50 ms 7624 KB Output is correct
42 Correct 60 ms 7508 KB Output is correct
43 Correct 6 ms 1536 KB Output is correct
44 Correct 5 ms 1536 KB Output is correct
45 Correct 5 ms 1536 KB Output is correct
46 Correct 5 ms 1536 KB Output is correct
47 Correct 5 ms 1536 KB Output is correct
48 Correct 5 ms 1536 KB Output is correct
49 Correct 50 ms 8128 KB Output is correct
50 Correct 54 ms 7512 KB Output is correct
51 Correct 53 ms 7624 KB Output is correct
52 Correct 53 ms 7364 KB Output is correct
53 Correct 59 ms 7436 KB Output is correct
54 Correct 60 ms 7596 KB Output is correct
55 Correct 58 ms 7432 KB Output is correct
56 Correct 31 ms 2688 KB Output is correct
57 Correct 27 ms 2688 KB Output is correct
58 Correct 59 ms 6824 KB Output is correct
59 Correct 60 ms 6820 KB Output is correct
60 Correct 60 ms 6804 KB Output is correct
61 Correct 61 ms 6804 KB Output is correct
62 Correct 60 ms 6916 KB Output is correct
63 Correct 60 ms 6832 KB Output is correct
64 Correct 62 ms 6956 KB Output is correct
65 Correct 61 ms 7064 KB Output is correct
66 Correct 60 ms 6840 KB Output is correct
67 Correct 32 ms 7020 KB Output is correct
68 Correct 53 ms 7868 KB Output is correct
69 Correct 52 ms 7832 KB Output is correct
70 Correct 64 ms 7808 KB Output is correct
71 Correct 58 ms 8556 KB Output is correct
72 Correct 58 ms 7736 KB Output is correct
73 Correct 61 ms 7924 KB Output is correct
74 Correct 59 ms 7692 KB Output is correct