oj.uz

Submission #250460

# Submission time Handle Problem Language Result Execution time Memory
250460 2020-07-18T04:11:04 Z combi1k1 Olympic Bus (JOI20_ho_t4) C++14
100 / 100
 707 ms 3256 KB 
#include<bits/stdc++.h>

using namespace std;

#define ll  long long
#define ld  double

#define sz(x)   (int)x.size()
#define all(x)  x.begin(),x.end()

#define pb  emplace_back
#define X   first
#define Y   second

const int   N   = 205;
const ll    inf = 1e18;

typedef pair<ll,int>    ii;

struct Edge {
    int u, v;
    int cost;

    Edge(int _u = 0,int _v = 0,int _c = 0) : u(_u), v(_v), cost(_c) {}
};
vector<Edge> E;
vector<int>  g[N];

bool use[50009];
ll  ans[50009];
ll  dis[209][209];

int main()  {
    ios_base::sync_with_stdio(false);
    cin.tie(0);cout.tie(0);
 
    int n;  cin >> n;
    int m;  cin >> m;

    for(int i = 1 ; i <= n ; ++i)
    for(int j = 1 ; j <= n ; ++j)
        dis[i][j] = (i == j ? 0 : inf);
    
    for(int i = 0 ; i < m ; ++i)    {
        int x, y;   cin >> x >> y;
        int c, d;   cin >> c >> ans[i];

        g[x].pb(i);
        E.pb(x,y,c);

        if (dis[x][y] > c)
            dis[x][y] = c;
    }
    for(int k = 1 ; k <= n ; ++k)
        for(int i = 1 ; i <= n ; ++i)
        for(int j = 1 ; j <= n ; ++j)
            dis[i][j] = min(dis[i][j],dis[i][k] + dis[k][j]);
        
    auto FindPath = [&](int S,int T)    {
        vector<ll>  d(n + 1,inf);
        vector<int> p(n + 1,-1);

        priority_queue<ii,vector<ii>,greater<ii> >  pq;
        pq.push(ii(0,S));

        d[S] = 0;

        while (pq.size())   {
            int u  = pq.top().Y;
            ll  du = pq.top().X;    pq.pop();

            if (du != d[u])
                continue;
            
            for(int i : g[u])   {
                int v = E[i].v;

                if (d[v] > du + E[i].cost)  {
                    d[v] = du + E[i].cost;
                    p[v] = i;

                    pq.push(ii(d[v],v));
                }
            }
        }
        if (p[T] < 0)   return;

        while (T != S)  {
            int i = p[T];
            use[i] = 1;
            T = E[i].u;
        }
    };
    auto dijkstra = [&](int S,int T,int ban)    {
        vector<ll>  d(n + 1,inf);

        priority_queue<ii,vector<ii>,greater<ii> >  pq;
        pq.push(ii(0,S));

        d[S] = 0;

        while (pq.size())   {
            int u  = pq.top().Y;
            ll  du = pq.top().X;    pq.pop();

            if (du != d[u])
                continue;
            
            for(int i : g[u])   if (i != ban)   {
                int v = E[i].v;

                if (d[v] > du + E[i].cost)  {
                    d[v] = du + E[i].cost;
                    pq.push(ii(d[v],v));
                }
            }
        }
        return  d[T];
    };
    ll  Result = dis[1][n] + dis[n][1];

    FindPath(1,n);

    for(int i = 0 ; i < m ; ++i)    {
        if (use[i]) ans[i] += dijkstra(1,n,i);
        else        ans[i] += min(dis[1][n],dis[1][E[i].v] + E[i].cost + dis[E[i].u][n]);

        use[i] = 0;
    }
    FindPath(n,1);

    for(int i = 0 ; i < m ; ++i)    {
        if (use[i]) ans[i] += dijkstra(n,1,i);
        else        ans[i] += min(dis[n][1],dis[n][E[i].v] + E[i].cost + dis[E[i].u][1]);
    }
    for(int i = 0 ; i < m ; ++i)
        if (Result > ans[i])
            Result = ans[i];
    
    if (Result >= 1e18)
        Result = -1;
    
    cout << Result << endl;
}

Compilation message

ho_t4.cpp: In function 'int main()':
ho_t4.cpp:46:16: warning: unused variable 'd' [-Wunused-variable]
         int c, d;   cin >> c >> ans[i];
                ^

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 768 KB Output is correct
2 Correct 15 ms 640 KB Output is correct
3 Correct 10 ms 768 KB Output is correct
4 Correct 16 ms 768 KB Output is correct
5 Correct 1 ms 512 KB Output is correct
6 Correct 15 ms 748 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 25 ms 792 KB Output is correct
11 Correct 25 ms 768 KB Output is correct
12 Correct 25 ms 896 KB Output is correct
13 Correct 10 ms 768 KB Output is correct
14 Correct 10 ms 768 KB Output is correct
15 Correct 10 ms 768 KB Output is correct
16 Correct 10 ms 768 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 3124 KB Output is correct
2 Correct 33 ms 3000 KB Output is correct
3 Correct 36 ms 3248 KB Output is correct
4 Correct 10 ms 768 KB Output is correct
5 Correct 10 ms 768 KB Output is correct
6 Correct 10 ms 768 KB Output is correct
7 Correct 9 ms 640 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 33 ms 3244 KB Output is correct
10 Correct 32 ms 3240 KB Output is correct
11 Correct 36 ms 3244 KB Output is correct
12 Correct 33 ms 3248 KB Output is correct
13 Correct 37 ms 3256 KB Output is correct
14 Correct 35 ms 3252 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 768 KB Output is correct
2 Correct 9 ms 640 KB Output is correct
3 Correct 30 ms 2760 KB Output is correct
4 Correct 9 ms 640 KB Output is correct
5 Correct 29 ms 2992 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 28 ms 2984 KB Output is correct
9 Correct 29 ms 2984 KB Output is correct
10 Correct 32 ms 2984 KB Output is correct
11 Correct 29 ms 2996 KB Output is correct
12 Correct 30 ms 2988 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 0 ms 384 KB Output is correct
17 Correct 0 ms 384 KB Output is correct
18 Correct 0 ms 384 KB Output is correct
19 Correct 29 ms 3000 KB Output is correct
20 Correct 30 ms 2992 KB Output is correct
21 Correct 28 ms 2992 KB Output is correct
22 Correct 30 ms 3000 KB Output is correct

Subtask #4
63.0 / 63.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 768 KB Output is correct
2 Correct 15 ms 640 KB Output is correct
3 Correct 10 ms 768 KB Output is correct
4 Correct 16 ms 768 KB Output is correct
5 Correct 1 ms 512 KB Output is correct
6 Correct 15 ms 748 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 25 ms 792 KB Output is correct
11 Correct 25 ms 768 KB Output is correct
12 Correct 25 ms 896 KB Output is correct
13 Correct 10 ms 768 KB Output is correct
14 Correct 10 ms 768 KB Output is correct
15 Correct 10 ms 768 KB Output is correct
16 Correct 10 ms 768 KB Output is correct
17 Correct 34 ms 3124 KB Output is correct
18 Correct 33 ms 3000 KB Output is correct
19 Correct 36 ms 3248 KB Output is correct
20 Correct 10 ms 768 KB Output is correct
21 Correct 10 ms 768 KB Output is correct
22 Correct 10 ms 768 KB Output is correct
23 Correct 9 ms 640 KB Output is correct
24 Correct 0 ms 384 KB Output is correct
25 Correct 33 ms 3244 KB Output is correct
26 Correct 32 ms 3240 KB Output is correct
27 Correct 36 ms 3244 KB Output is correct
28 Correct 33 ms 3248 KB Output is correct
29 Correct 37 ms 3256 KB Output is correct
30 Correct 35 ms 3252 KB Output is correct
31 Correct 10 ms 768 KB Output is correct
32 Correct 9 ms 640 KB Output is correct
33 Correct 30 ms 2760 KB Output is correct
34 Correct 9 ms 640 KB Output is correct
35 Correct 29 ms 2992 KB Output is correct
36 Correct 0 ms 384 KB Output is correct
37 Correct 0 ms 384 KB Output is correct
38 Correct 28 ms 2984 KB Output is correct
39 Correct 29 ms 2984 KB Output is correct
40 Correct 32 ms 2984 KB Output is correct
41 Correct 29 ms 2996 KB Output is correct
42 Correct 30 ms 2988 KB Output is correct
43 Correct 0 ms 384 KB Output is correct
44 Correct 0 ms 384 KB Output is correct
45 Correct 0 ms 384 KB Output is correct
46 Correct 0 ms 384 KB Output is correct
47 Correct 0 ms 384 KB Output is correct
48 Correct 0 ms 384 KB Output is correct
49 Correct 29 ms 3000 KB Output is correct
50 Correct 30 ms 2992 KB Output is correct
51 Correct 28 ms 2992 KB Output is correct
52 Correct 30 ms 3000 KB Output is correct
53 Correct 38 ms 3116 KB Output is correct
54 Correct 34 ms 3040 KB Output is correct
55 Correct 44 ms 3084 KB Output is correct
56 Correct 10 ms 768 KB Output is correct
57 Correct 10 ms 768 KB Output is correct
58 Correct 119 ms 2872 KB Output is correct
59 Correct 118 ms 2748 KB Output is correct
60 Correct 138 ms 2736 KB Output is correct
61 Correct 95 ms 2748 KB Output is correct
62 Correct 128 ms 2740 KB Output is correct
63 Correct 123 ms 2744 KB Output is correct
64 Correct 707 ms 3120 KB Output is correct
65 Correct 666 ms 3060 KB Output is correct
66 Correct 627 ms 2996 KB Output is correct
67 Correct 17 ms 2620 KB Output is correct
68 Correct 32 ms 3240 KB Output is correct
69 Correct 33 ms 3240 KB Output is correct
70 Correct 36 ms 3248 KB Output is correct
71 Correct 36 ms 3240 KB Output is correct
72 Correct 34 ms 3244 KB Output is correct
73 Correct 35 ms 3252 KB Output is correct
74 Correct 35 ms 3244 KB Output is correct