oj.uz

Submission #479831

# Submission time Handle Problem Language Result Execution time Memory
479831 2021-10-13T10:05:04 Z Yuisuyuno Commuter Pass (JOI18_commuter_pass) C++14
100 / 100
 567 ms 31388 KB 
//Nguyen Huu Hoang Minh
#include <bits/stdc++.h>
#define sz(x) int(x.size())
#define all(x) x.begin(),x.end()
#define reset(x) memset(x, 0,sizeof(x))
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define N 100005
#define remain(x) if (x > MOD) x -= MOD
#define ii pair<int, int>
#define iiii pair< ii , ii >
#define viiii vector< iiii >
#define vi vector<int>
#define vii vector< ii >
#define bit(x, i) (((x) >> (i)) & 1)
#define Task "test"
#define int long long

using namespace std;

typedef long double ld;
typedef int ll;
const int inf = LLONG_MAX/2;
const int minf = -1e10;

int n, m;
int s, t, u, v;
vector<ii> g[N];
int ds[N], dv[N], du[N];
bool vst[N];
int ans;
int dp[3][N];

void readfile()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);cout.tie(0);
    if (fopen(Task".inp","r"))
    {
        freopen(Task".inp","r",stdin);
        //freopen(Task".out","w",stdout);
    }
    cin >> n >> m >> s >> t >> u >> v;
    for(int i=1; i<=m; i++){
        int u, v, z;
        cin >> u >> v >> z;
        g[u].pb(ii(v,z));
        g[v].pb(ii(u,z));
    }
}

void dijkstra1(ll start, ll arr[]) {
	fill(vst, vst + 100001, false);

	priority_queue<pair<ll, ll>> pq;
	pq.push({0, start});
	while (!pq.empty()) {
		ll c, node;
		tie(c, node) = pq.top();
		pq.pop();

		if (!vst[node]) {
			arr[node] = -c;
			vst[node] = true;
			for (auto& i : g[node]) pq.push({c - i.second, i.first});
		}
	}
}

void djk2(int st, int en){
    fill(vst, vst+100001, false);
    fill(dp[0], dp[0]+100001, inf);
    fill(dp[1], dp[1]+100001, inf);

    priority_queue<pair<int,pair<int,int>>> q;
    q.push({0,{st,0}});
    dp[0][0] = dp[1][0] = inf;
    while (q.size()){
        int node, c, par;
        ii temp;
        tie(c,temp) = q.top();
        tie(node,par) = temp;
        q.pop();
        if (!vst[node]){
            vst[node] = 1;
            ds[node] = -c;
            dp[0][node] = min(dp[0][par],du[node]);
            dp[1][node] = min(dp[1][par],dv[node]);
            for(auto &i : g[node]) q.push({c-i.se,{i.fi,node}});
        }
        else if (-c == ds[node]){
            int tmp1 = min(dp[0][par],du[node]);
            int tmp2 = min(dp[1][par],dv[node]);
            if (tmp1 + tmp2 < dp[0][node]+dp[1][node]){
                dp[0][node] = tmp1;
                dp[1][node] = tmp2;
            }
        }
    }
    ans = min(ans,dp[0][en]+dp[1][en]);
}

void proc()
{
    dijkstra1(u,du);
    dijkstra1(v,dv);
    ans = du[v];
    djk2(s,t);
    djk2(t,s);
    cout << ans;
}

signed main()
{
    readfile();
    proc();
    return 0;
}

Compilation message

commuter_pass.cpp: In function 'void readfile()':
commuter_pass.cpp:42:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   42 |         freopen(Task".inp","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 545 ms 27204 KB Output is correct
2 Correct 507 ms 26608 KB Output is correct
3 Correct 499 ms 26360 KB Output is correct
4 Correct 556 ms 26304 KB Output is correct
5 Correct 490 ms 23128 KB Output is correct
6 Correct 567 ms 27024 KB Output is correct
7 Correct 511 ms 26496 KB Output is correct
8 Correct 493 ms 26928 KB Output is correct
9 Correct 562 ms 27084 KB Output is correct
10 Correct 526 ms 27108 KB Output is correct
11 Correct 138 ms 11896 KB Output is correct
12 Correct 560 ms 27224 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 545 ms 27160 KB Output is correct
2 Correct 484 ms 23116 KB Output is correct
3 Correct 511 ms 26488 KB Output is correct
4 Correct 504 ms 23284 KB Output is correct
5 Correct 476 ms 22852 KB Output is correct
6 Correct 504 ms 26248 KB Output is correct
7 Correct 486 ms 22960 KB Output is correct
8 Correct 483 ms 23180 KB Output is correct
9 Correct 535 ms 23628 KB Output is correct
10 Correct 492 ms 27016 KB Output is correct
11 Correct 142 ms 12652 KB Output is correct
12 Correct 500 ms 27016 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 44 ms 7124 KB Output is correct
2 Correct 4 ms 4300 KB Output is correct
3 Correct 4 ms 4300 KB Output is correct
4 Correct 89 ms 9856 KB Output is correct
5 Correct 42 ms 8096 KB Output is correct
6 Correct 5 ms 4428 KB Output is correct
7 Correct 7 ms 4556 KB Output is correct
8 Correct 8 ms 4720 KB Output is correct
9 Correct 5 ms 4428 KB Output is correct
10 Correct 41 ms 8040 KB Output is correct
11 Correct 3 ms 4300 KB Output is correct
12 Correct 3 ms 4300 KB Output is correct
13 Correct 3 ms 4300 KB Output is correct
14 Correct 4 ms 4428 KB Output is correct
15 Correct 4 ms 4428 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 545 ms 27204 KB Output is correct
2 Correct 507 ms 26608 KB Output is correct
3 Correct 499 ms 26360 KB Output is correct
4 Correct 556 ms 26304 KB Output is correct
5 Correct 490 ms 23128 KB Output is correct
6 Correct 567 ms 27024 KB Output is correct
7 Correct 511 ms 26496 KB Output is correct
8 Correct 493 ms 26928 KB Output is correct
9 Correct 562 ms 27084 KB Output is correct
10 Correct 526 ms 27108 KB Output is correct
11 Correct 138 ms 11896 KB Output is correct
12 Correct 560 ms 27224 KB Output is correct
13 Correct 545 ms 27160 KB Output is correct
14 Correct 484 ms 23116 KB Output is correct
15 Correct 511 ms 26488 KB Output is correct
16 Correct 504 ms 23284 KB Output is correct
17 Correct 476 ms 22852 KB Output is correct
18 Correct 504 ms 26248 KB Output is correct
19 Correct 486 ms 22960 KB Output is correct
20 Correct 483 ms 23180 KB Output is correct
21 Correct 535 ms 23628 KB Output is correct
22 Correct 492 ms 27016 KB Output is correct
23 Correct 142 ms 12652 KB Output is correct
24 Correct 500 ms 27016 KB Output is correct
25 Correct 44 ms 7124 KB Output is correct
26 Correct 4 ms 4300 KB Output is correct
27 Correct 4 ms 4300 KB Output is correct
28 Correct 89 ms 9856 KB Output is correct
29 Correct 42 ms 8096 KB Output is correct
30 Correct 5 ms 4428 KB Output is correct
31 Correct 7 ms 4556 KB Output is correct
32 Correct 8 ms 4720 KB Output is correct
33 Correct 5 ms 4428 KB Output is correct
34 Correct 41 ms 8040 KB Output is correct
35 Correct 3 ms 4300 KB Output is correct
36 Correct 3 ms 4300 KB Output is correct
37 Correct 3 ms 4300 KB Output is correct
38 Correct 4 ms 4428 KB Output is correct
39 Correct 4 ms 4428 KB Output is correct
40 Correct 545 ms 30936 KB Output is correct
41 Correct 561 ms 31388 KB Output is correct
42 Correct 554 ms 31276 KB Output is correct
43 Correct 140 ms 14096 KB Output is correct
44 Correct 135 ms 13992 KB Output is correct
45 Correct 488 ms 25040 KB Output is correct
46 Correct 489 ms 24812 KB Output is correct
47 Correct 544 ms 26916 KB Output is correct
48 Correct 149 ms 13380 KB Output is correct
49 Correct 544 ms 29456 KB Output is correct
50 Correct 485 ms 25132 KB Output is correct
51 Correct 496 ms 25116 KB Output is correct