oj.uz

Submission #888199

# Submission time Handle Problem Language Result Execution time Memory
888199 2023-12-16T10:37:17 Z Unforgettablepl Olympic Bus (JOI20_ho_t4) C++17
0 / 100
 1000 ms 4900 KB 
#include <bits/stdc++.h>
using namespace std;

#define int long long
const int INF = 1e15;

struct edge{
    int first,second,d;
    edge(int f,int s,int c):first(f),second(s),d(c){}
};

vector<edge> adj[201];
bool visited[201];
int n;

struct comp{
    bool operator()(pair<int,int> a,pair<int,int> b){
        return a.second==b.second ? a.first>b.first : a.second>b.second;
    }
};

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

int32_t main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int m;
    cin >> n >> m;
    for (int i = 1; i <= m; i++) {
        int a,b,c,d;cin>>a>>b>>c>>d;
        adj[a].emplace_back(b,c,d);
    }
    int ans = dijkastra();
    for(int i=1;i<=n;i++){
        for(auto&x:adj[i]){
            adj[x.first].emplace_back(i,x.second,x.d);
            x.second=INF;
            ans = min(ans,dijkastra()+x.d);
            x.second=adj[x.first].back().second;
            adj[x.first].back().second=INF;
        }
    }
    cout << (ans>=INF ? -1 : ans) << '\n';
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 125 ms 596 KB Output is correct
2 Correct 8 ms 348 KB Output is correct
3 Correct 49 ms 600 KB Output is correct
4 Correct 67 ms 596 KB Output is correct
5 Correct 44 ms 616 KB Output is correct
6 Incorrect 2 ms 348 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1040 ms 4900 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 124 ms 596 KB Output is correct
2 Correct 2 ms 348 KB Output is correct
3 Execution timed out 1089 ms 2992 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 63.0

# Verdict Execution time Memory Grader output
1 Correct 125 ms 596 KB Output is correct
2 Correct 8 ms 348 KB Output is correct
3 Correct 49 ms 600 KB Output is correct
4 Correct 67 ms 596 KB Output is correct
5 Correct 44 ms 616 KB Output is correct
6 Incorrect 2 ms 348 KB Output isn't correct
7 Halted 0 ms 0 KB -