oj.uz

답안 #927805

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
927805 2024-02-15T10:54:04 Z Unforgettablepl Olympic Bus (JOI20_ho_t4) C++17
37 / 100
 1000 ms 6308 KB 
#include <bits/stdc++.h>
using namespace std;

#define int long long

const int INF = 1e15;

struct edge{
    int u,v,c,d;
};

edge edges[50001];
multiset<pair<int,int>> adj[201];
bool visited[50001];
int dist[201][201];
int n;

int dijkastra(){
    priority_queue<pair<int,int>> q;
    for(bool&i:visited)i=false;
    int ans1 = INF;
    q.emplace(0,1);
    while(!q.empty()){
        auto curr = q.top();q.pop();curr.first=-curr.first;
        if(visited[curr.second])continue;
        visited[curr.second]=true;
        if(curr.second==n){ans1=curr.first;break;}
        for(auto&i:adj[curr.second]){
            if(!visited[i.first])q.emplace(-curr.first-i.second,i.first);
        }
    }
    while(!q.empty())q.pop();
    for(bool&i:visited)i=false;
    int ans2 = INF;
    q.emplace(0,n);
    while(!q.empty()){
        auto curr = q.top();q.pop();curr.first=-curr.first;
        if(visited[curr.second])continue;
        visited[curr.second]=true;
        if(curr.second==1){ans2=curr.first;break;}
        for(auto&i:adj[curr.second]){
            if(!visited[i.first])q.emplace(-curr.first-i.second,i.first);
        }
    }
    return ans1+ans2;
}

int32_t main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int m;
    cin >> n >> m;
    for(auto&i:dist)for(int&j:i)j=INF;
    for(int i=1;i<=m;i++){
        int u,v,c,d;
        cin >> u >> v >> c >> d;
        edges[i] = {u,v,c,d};
        adj[u].insert(make_pair(edges[i].v,edges[i].c));
        dist[u][v]=min(dist[u][v],c);
    }
    for(int i=1;i<=n;i++)dist[i][i]=0;
    for(int k=1;k<=n;k++){
        for(int i=1;i<=n;i++){
            for(int j=1;j<=n;j++){
                dist[i][j]=min(dist[i][j],dist[i][k]+dist[k][j]);
            }
        }
    }
    int baseans = dist[1][n]+dist[n][1];
    for(int i=1;i<=m;i++){
        int to = min(dist[1][n],dist[1][edges[i].v]+dist[edges[i].u][n]+edges[i].c);
        int back = min(dist[n][1],dist[n][edges[i].v]+dist[edges[i].u][1]+edges[i].c);
        if(to+back+edges[i].d<baseans){
            adj[edges[i].u].erase(adj[edges[i].u].find(make_pair(edges[i].v,edges[i].c)));
            adj[edges[i].v].insert(make_pair(edges[i].u,edges[i].c));
            baseans = min(baseans,edges[i].d+dijkastra());
            adj[edges[i].v].erase(adj[edges[i].v].find(make_pair(edges[i].u,edges[i].c)));
            adj[edges[i].u].insert(make_pair(edges[i].v,edges[i].c));
        }
    }
    cout << (baseans>=INF ? -1 : baseans) << '\n';
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 888 KB Output is correct
2 Correct 8 ms 812 KB Output is correct
3 Correct 8 ms 856 KB Output is correct
4 Correct 11 ms 860 KB Output is correct
5 Correct 1 ms 860 KB Output is correct
6 Correct 8 ms 820 KB Output is correct
7 Correct 0 ms 604 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 860 KB Output is correct
10 Correct 12 ms 860 KB Output is correct
11 Correct 22 ms 860 KB Output is correct
12 Correct 9 ms 860 KB Output is correct
13 Correct 11 ms 860 KB Output is correct
14 Correct 8 ms 860 KB Output is correct
15 Correct 8 ms 860 KB Output is correct
16 Correct 9 ms 888 KB Output is correct

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 5468 KB Output is correct
2 Correct 32 ms 6308 KB Output is correct
3 Correct 28 ms 5468 KB Output is correct
4 Correct 8 ms 860 KB Output is correct
5 Correct 8 ms 884 KB Output is correct
6 Correct 8 ms 860 KB Output is correct
7 Correct 8 ms 604 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 68 ms 6260 KB Output is correct
10 Correct 50 ms 5952 KB Output is correct
11 Correct 36 ms 5864 KB Output is correct
12 Correct 36 ms 6208 KB Output is correct
13 Correct 32 ms 6068 KB Output is correct
14 Correct 39 ms 5968 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 884 KB Output is correct
2 Correct 8 ms 604 KB Output is correct
3 Correct 33 ms 4424 KB Output is correct
4 Correct 9 ms 604 KB Output is correct
5 Correct 28 ms 5456 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 1 ms 600 KB Output is correct
8 Correct 73 ms 5988 KB Output is correct
9 Correct 87 ms 5936 KB Output is correct
10 Correct 45 ms 5716 KB Output is correct
11 Correct 43 ms 5712 KB Output is correct
12 Correct 34 ms 5548 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 33 ms 5888 KB Output is correct
20 Correct 49 ms 5888 KB Output is correct
21 Correct 35 ms 5848 KB Output is correct
22 Correct 40 ms 5852 KB Output is correct

Subtask #4
0 / 63.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 888 KB Output is correct
2 Correct 8 ms 812 KB Output is correct
3 Correct 8 ms 856 KB Output is correct
4 Correct 11 ms 860 KB Output is correct
5 Correct 1 ms 860 KB Output is correct
6 Correct 8 ms 820 KB Output is correct
7 Correct 0 ms 604 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 860 KB Output is correct
10 Correct 12 ms 860 KB Output is correct
11 Correct 22 ms 860 KB Output is correct
12 Correct 9 ms 860 KB Output is correct
13 Correct 11 ms 860 KB Output is correct
14 Correct 8 ms 860 KB Output is correct
15 Correct 8 ms 860 KB Output is correct
16 Correct 9 ms 888 KB Output is correct
17 Correct 27 ms 5468 KB Output is correct
18 Correct 32 ms 6308 KB Output is correct
19 Correct 28 ms 5468 KB Output is correct
20 Correct 8 ms 860 KB Output is correct
21 Correct 8 ms 884 KB Output is correct
22 Correct 8 ms 860 KB Output is correct
23 Correct 8 ms 604 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 68 ms 6260 KB Output is correct
26 Correct 50 ms 5952 KB Output is correct
27 Correct 36 ms 5864 KB Output is correct
28 Correct 36 ms 6208 KB Output is correct
29 Correct 32 ms 6068 KB Output is correct
30 Correct 39 ms 5968 KB Output is correct
31 Correct 8 ms 884 KB Output is correct
32 Correct 8 ms 604 KB Output is correct
33 Correct 33 ms 4424 KB Output is correct
34 Correct 9 ms 604 KB Output is correct
35 Correct 28 ms 5456 KB Output is correct
36 Correct 1 ms 604 KB Output is correct
37 Correct 1 ms 600 KB Output is correct
38 Correct 73 ms 5988 KB Output is correct
39 Correct 87 ms 5936 KB Output is correct
40 Correct 45 ms 5716 KB Output is correct
41 Correct 43 ms 5712 KB Output is correct
42 Correct 34 ms 5548 KB Output is correct
43 Correct 1 ms 604 KB Output is correct
44 Correct 1 ms 604 KB Output is correct
45 Correct 1 ms 604 KB Output is correct
46 Correct 1 ms 604 KB Output is correct
47 Correct 1 ms 604 KB Output is correct
48 Correct 1 ms 604 KB Output is correct
49 Correct 33 ms 5888 KB Output is correct
50 Correct 49 ms 5888 KB Output is correct
51 Correct 35 ms 5848 KB Output is correct
52 Correct 40 ms 5852 KB Output is correct
53 Correct 31 ms 5468 KB Output is correct
54 Correct 31 ms 5468 KB Output is correct
55 Correct 29 ms 5468 KB Output is correct
56 Correct 11 ms 856 KB Output is correct
57 Correct 8 ms 860 KB Output is correct
58 Correct 50 ms 5320 KB Output is correct
59 Correct 56 ms 5536 KB Output is correct
60 Correct 59 ms 5084 KB Output is correct
61 Correct 57 ms 5300 KB Output is correct
62 Correct 415 ms 5336 KB Output is correct
63 Execution timed out 1041 ms 5352 KB Time limit exceeded
64 Halted 0 ms 0 KB -