oj.uz

Submission #931740

# Submission time Handle Problem Language Result Execution time Memory
931740 2024-02-22T10:21:01 Z sofijavelkovska Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
 267 ms 25240 KB 
#include <bits/stdc++.h>
using namespace std;

const int MAXN=100001;
const long long INF=1e16;

int n, m, s, t, u, v;
vector<pair<int, int> > adj[MAXN];
vector<int> shortadj[MAXN];
long long mincost=INF;
long long mindist[MAXN];

void dijkstra(int root, long long dist[])
{
    for (int i=1; i<=n; i++)
        dist[i]=INF;
    dist[root]=0;
    bool visited[n+1]={false};
    priority_queue<pair<long long, int> > pq;
    pq.push({0, root});
    while (!pq.empty())
    {
        int x=pq.top().second;
        pq.pop();
        if (visited[x])
            continue;
        visited[x]=true;
        for (auto edge : adj[x])
        {
            int y=edge.first;
            int w=edge.second;
            if (dist[x]+w<dist[y])
            {
                dist[y]=dist[x]+w;
                pq.push({-dist[y], y});
            }
        }
    }

    return;
}

long long findmin(int x, long long dist1[], long long dist2[])
{
    if (mindist[x]!=-1)
        return mindist[x];
    mindist[x]=dist1[x];
    for (auto y : shortadj[x])
        mindist[x]=min(mindist[x], findmin(y, dist1, dist2));
    mincost=min(mincost, mindist[x]+dist2[x]);

    return mindist[x];
}

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    cin >> n >> m;
    cin >> s >> t >> u >>  v;
    long long sdist[n+1], tdist[n+1], udist[n+1], vdist[n+1];
    for (int i=0; i<m; i++)
    {
        int x, y, w;
        cin >> x >> y >> w;
        adj[x].push_back({y, w});
        adj[y].push_back({x, w});
    }
    dijkstra(s, sdist);
    dijkstra(t, tdist);
    dijkstra(u, udist);
    dijkstra(v, vdist);
    queue<int> q;
    q.push(s);
    bool visited[n+1]={false};
    while (!q.empty())
    {
        int x=q.front();
        q.pop();
        if (visited[x])
            continue;
        visited[x]=true;
        for (auto edge : adj[x])
        {
            int y=edge.first;
            int w=edge.second;
            if (sdist[x]+w>sdist[y])
                continue;
            if (sdist[y]+tdist[y]!=sdist[t])
                continue;
            shortadj[x].push_back(y);
            q.push(y);
        }
    }
    for (int i=1; i<=n; i++)
        mindist[i]=-1;
    findmin(s, udist, vdist);
    for (int i=1; i<=n; i++)
        mindist[i]=-1;
    findmin(s, vdist, udist);
    mincost=min(mincost, udist[v]);
    cout << mincost;

    return 0;
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 169 ms 22172 KB Output is correct
2 Correct 182 ms 20704 KB Output is correct
3 Correct 221 ms 25240 KB Output is correct
4 Correct 162 ms 22100 KB Output is correct
5 Correct 172 ms 20404 KB Output is correct
6 Correct 197 ms 22728 KB Output is correct
7 Correct 190 ms 20440 KB Output is correct
8 Correct 176 ms 20572 KB Output is correct
9 Correct 185 ms 21416 KB Output is correct
10 Correct 135 ms 21316 KB Output is correct
11 Correct 64 ms 18004 KB Output is correct
12 Correct 176 ms 21224 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 191 ms 20968 KB Output is correct
2 Correct 194 ms 21168 KB Output is correct
3 Correct 185 ms 20620 KB Output is correct
4 Correct 194 ms 21184 KB Output is correct
5 Correct 200 ms 21720 KB Output is correct
6 Correct 178 ms 24224 KB Output is correct
7 Correct 198 ms 24448 KB Output is correct
8 Correct 192 ms 21236 KB Output is correct
9 Correct 189 ms 21800 KB Output is correct
10 Correct 204 ms 20716 KB Output is correct
11 Correct 68 ms 19984 KB Output is correct
12 Correct 185 ms 24460 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 7076 KB Output is correct
2 Correct 2 ms 5724 KB Output is correct
3 Correct 2 ms 5724 KB Output is correct
4 Correct 11 ms 7772 KB Output is correct
5 Correct 6 ms 6748 KB Output is correct
6 Correct 2 ms 5724 KB Output is correct
7 Correct 2 ms 5724 KB Output is correct
8 Correct 3 ms 5724 KB Output is correct
9 Correct 2 ms 5724 KB Output is correct
10 Correct 6 ms 6748 KB Output is correct
11 Correct 2 ms 5724 KB Output is correct
12 Correct 2 ms 5772 KB Output is correct
13 Correct 2 ms 5724 KB Output is correct
14 Correct 2 ms 5724 KB Output is correct
15 Correct 2 ms 5724 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 169 ms 22172 KB Output is correct
2 Correct 182 ms 20704 KB Output is correct
3 Correct 221 ms 25240 KB Output is correct
4 Correct 162 ms 22100 KB Output is correct
5 Correct 172 ms 20404 KB Output is correct
6 Correct 197 ms 22728 KB Output is correct
7 Correct 190 ms 20440 KB Output is correct
8 Correct 176 ms 20572 KB Output is correct
9 Correct 185 ms 21416 KB Output is correct
10 Correct 135 ms 21316 KB Output is correct
11 Correct 64 ms 18004 KB Output is correct
12 Correct 176 ms 21224 KB Output is correct
13 Correct 191 ms 20968 KB Output is correct
14 Correct 194 ms 21168 KB Output is correct
15 Correct 185 ms 20620 KB Output is correct
16 Correct 194 ms 21184 KB Output is correct
17 Correct 200 ms 21720 KB Output is correct
18 Correct 178 ms 24224 KB Output is correct
19 Correct 198 ms 24448 KB Output is correct
20 Correct 192 ms 21236 KB Output is correct
21 Correct 189 ms 21800 KB Output is correct
22 Correct 204 ms 20716 KB Output is correct
23 Correct 68 ms 19984 KB Output is correct
24 Correct 185 ms 24460 KB Output is correct
25 Correct 7 ms 7076 KB Output is correct
26 Correct 2 ms 5724 KB Output is correct
27 Correct 2 ms 5724 KB Output is correct
28 Correct 11 ms 7772 KB Output is correct
29 Correct 6 ms 6748 KB Output is correct
30 Correct 2 ms 5724 KB Output is correct
31 Correct 2 ms 5724 KB Output is correct
32 Correct 3 ms 5724 KB Output is correct
33 Correct 2 ms 5724 KB Output is correct
34 Correct 6 ms 6748 KB Output is correct
35 Correct 2 ms 5724 KB Output is correct
36 Correct 2 ms 5772 KB Output is correct
37 Correct 2 ms 5724 KB Output is correct
38 Correct 2 ms 5724 KB Output is correct
39 Correct 2 ms 5724 KB Output is correct
40 Correct 227 ms 22732 KB Output is correct
41 Correct 208 ms 21332 KB Output is correct
42 Correct 216 ms 21356 KB Output is correct
43 Correct 116 ms 20608 KB Output is correct
44 Correct 87 ms 20604 KB Output is correct
45 Correct 219 ms 21376 KB Output is correct
46 Correct 250 ms 21240 KB Output is correct
47 Correct 226 ms 21944 KB Output is correct
48 Correct 119 ms 17992 KB Output is correct
49 Correct 224 ms 22168 KB Output is correct
50 Correct 267 ms 20928 KB Output is correct
51 Correct 251 ms 21568 KB Output is correct