oj.uz

Submission #896475

# Submission time Handle Problem Language Result Execution time Memory
896475 2024-01-01T14:14:43 Z Unforgettablepl Olympic Bus (JOI20_ho_t4) C++17
37 / 100
 1000 ms 5596 KB 
#pragma GCC optimize "Ofast"
//#pragma GCC optimize("unroll-loops")
//#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
/*
ID: samikgo1
TASK:
LANG: C++
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef complex<ll> point;
#define X real()
#define Y imag()
#define all(x) x.begin(),x.end()
#define allr(x) x.rbegin(),x.rend()
//#define f first
//#define s second
//#define x first
//#define y second
const ll INF = 1e17;
const ll sqrtn = 440;
const ll modulo = 1e9+7;
const ll siz = 262144;
const ll hashp = 923981238;
const ll hashm = 932439994;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//using namespace __gnu_pbds;
//#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>

#define int ll

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

edge edgelist[50001];
set<int> adj[201];
int dist[201][201];
bool visited[201];
int n;

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

void solve() {
    int m;
    cin >> n >> m;
    for(int i=1;i<=n;i++)for(int j=1;j<=n;j++)if(i!=j)dist[i][j]=INF;
    for(int i=1;i<=m;i++){
        cin >> edgelist[i].u >> edgelist[i].v >> edgelist[i].c >> edgelist[i].d;
        adj[edgelist[i].u].insert(i);
        dist[edgelist[i].u][edgelist[i].v] = min(dist[edgelist[i].u][edgelist[i].v],edgelist[i].c);
    }
    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 ans = dijkastra();
    for(int i=1;i<=m;i++){
        auto curr = edgelist[i];
        if(min(dist[1][n],dist[1][curr.v]+dist[curr.u][n])+min(dist[n][1],dist[n][curr.v]+dist[curr.u][1])+curr.d<ans){
            adj[curr.u].erase(i);
            adj[curr.v].insert(i);
            swap(edgelist[i].u,edgelist[i].v);
            ans = min(ans,dijkastra()+curr.d);
            adj[curr.v].erase(i);
            adj[curr.u].insert(i);
            swap(edgelist[i].u,edgelist[i].v);
        }
    }
    cout << (ans>=INF ? -1 : ans)<< '\n';
}

int32_t main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
//    freopen("mock.txt","r",stdin);
//    freopen(".out","w",stdout);
//    int t;
//    cin >> t;
//    while(t--)
    solve();
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 856 KB Output is correct
2 Correct 8 ms 604 KB Output is correct
3 Correct 8 ms 860 KB Output is correct
4 Correct 8 ms 860 KB Output is correct
5 Correct 2 ms 604 KB Output is correct
6 Correct 8 ms 812 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 36 ms 888 KB Output is correct
11 Correct 45 ms 860 KB Output is correct
12 Correct 35 ms 860 KB Output is correct
13 Correct 8 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 8 ms 860 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 5596 KB Output is correct
2 Correct 466 ms 5572 KB Output is correct
3 Correct 29 ms 5328 KB Output is correct
4 Correct 9 ms 856 KB Output is correct
5 Correct 9 ms 884 KB Output is correct
6 Correct 9 ms 604 KB Output is correct
7 Correct 8 ms 604 KB Output is correct
8 Correct 1 ms 544 KB Output is correct
9 Correct 139 ms 5412 KB Output is correct
10 Correct 96 ms 5084 KB Output is correct
11 Correct 39 ms 5132 KB Output is correct
12 Correct 38 ms 5464 KB Output is correct
13 Correct 37 ms 5324 KB Output is correct
14 Correct 40 ms 5520 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 872 KB Output is correct
2 Correct 8 ms 604 KB Output is correct
3 Correct 24 ms 4032 KB Output is correct
4 Correct 8 ms 604 KB Output is correct
5 Correct 29 ms 4956 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 78 ms 5148 KB Output is correct
9 Correct 93 ms 5120 KB Output is correct
10 Correct 40 ms 5308 KB Output is correct
11 Correct 33 ms 5104 KB Output is correct
12 Correct 33 ms 5088 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 37 ms 5140 KB Output is correct
20 Correct 42 ms 5208 KB Output is correct
21 Correct 33 ms 4964 KB Output is correct
22 Correct 35 ms 4964 KB Output is correct

Subtask #4
0 / 63.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 856 KB Output is correct
2 Correct 8 ms 604 KB Output is correct
3 Correct 8 ms 860 KB Output is correct
4 Correct 8 ms 860 KB Output is correct
5 Correct 2 ms 604 KB Output is correct
6 Correct 8 ms 812 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 36 ms 888 KB Output is correct
11 Correct 45 ms 860 KB Output is correct
12 Correct 35 ms 860 KB Output is correct
13 Correct 8 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 8 ms 860 KB Output is correct
17 Correct 41 ms 5596 KB Output is correct
18 Correct 466 ms 5572 KB Output is correct
19 Correct 29 ms 5328 KB Output is correct
20 Correct 9 ms 856 KB Output is correct
21 Correct 9 ms 884 KB Output is correct
22 Correct 9 ms 604 KB Output is correct
23 Correct 8 ms 604 KB Output is correct
24 Correct 1 ms 544 KB Output is correct
25 Correct 139 ms 5412 KB Output is correct
26 Correct 96 ms 5084 KB Output is correct
27 Correct 39 ms 5132 KB Output is correct
28 Correct 38 ms 5464 KB Output is correct
29 Correct 37 ms 5324 KB Output is correct
30 Correct 40 ms 5520 KB Output is correct
31 Correct 8 ms 872 KB Output is correct
32 Correct 8 ms 604 KB Output is correct
33 Correct 24 ms 4032 KB Output is correct
34 Correct 8 ms 604 KB Output is correct
35 Correct 29 ms 4956 KB Output is correct
36 Correct 0 ms 344 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 78 ms 5148 KB Output is correct
39 Correct 93 ms 5120 KB Output is correct
40 Correct 40 ms 5308 KB Output is correct
41 Correct 33 ms 5104 KB Output is correct
42 Correct 33 ms 5088 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 0 ms 348 KB Output is correct
45 Correct 1 ms 348 KB Output is correct
46 Correct 0 ms 344 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 37 ms 5140 KB Output is correct
50 Correct 42 ms 5208 KB Output is correct
51 Correct 33 ms 4964 KB Output is correct
52 Correct 35 ms 4964 KB Output is correct
53 Correct 67 ms 5476 KB Output is correct
54 Correct 512 ms 5584 KB Output is correct
55 Correct 108 ms 5488 KB Output is correct
56 Correct 8 ms 856 KB Output is correct
57 Correct 10 ms 864 KB Output is correct
58 Execution timed out 1099 ms 4704 KB Time limit exceeded
59 Halted 0 ms 0 KB -