oj.uz

Submission #372831

# Submission time Handle Problem Language Result Execution time Memory
372831 2021-03-01T21:57:51 Z AmineWeslati Commuter Pass (JOI18_commuter_pass) C++14
100 / 100
 422 ms 24232 KB 
//Never stop trying
#include "bits/stdc++.h"
using namespace std;
#define boost ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)

typedef long long ll;
#define int ll
typedef string str;
typedef long double ld;
typedef pair<int, int> pi;
#define fi first
#define se second
typedef vector<int> vi;
typedef vector<pi> vpi;
#define pb push_back
#define eb emplace_back
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define endl "\n"
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)

const int MOD = 1e9 + 7; //998244353
const ll INF = 1e18;
const int MX = 1e5 + 10;
const int nx[4] = {0, 0, 1, -1}, ny[4] = {1, -1, 0, 0}; //right left down up


template<class T> bool ckmin(T& a, const T& b) { return a > b ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
ll cdiv(ll a, ll b) { return a / b + ((a ^ b) > 0 && a % b); } // divide a by b rounded up
//constexpr int log2(int x) { return 31 - __builtin_clz(x); } // floor(log2(x))

mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
//mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());
ll random(ll a, ll b){
    return a + rng() % (b - a + 1);
}
#ifndef LOCAL  
#define cerr if(false) cerr
#endif
#define dbg(x) cerr << #x << " : " << x << endl; 
#define dbgs(x,y) cerr << #x << " : " << x << " / " << #y << " : " << y << endl;
#define dbgv(v) cerr << #v << " : " << "[ "; for(auto it : v) cerr << it << ' '; cerr << ']' << endl;
#define here() cerr << "here" << endl;

void IO() {
#ifdef LOCAL
    freopen("input.txt", "r", stdin); 
    freopen("output.txt", "w", stdout);
#endif
}
/////////////////////////ONLY CLEAN CODES ALLOWED/////////////////////////


int N,M,S,T,U,V;
vpi adj[MX];
vi dist(MX),DS(MX),DT(MX),DU(MX),DV(MX);

bool cmp(int u, int v){
	return DS[u]<DS[v];
}

void sp(int st){
	priority_queue<pi,vpi,greater<pi>>q; 
	q.push({0,st});
	FOR(i,1,N+1) dist[i]=INF;
	dist[st]=0;

	while(!q.empty()){
		int u=q.top().se,d=q.top().fi;
		q.pop();

		if(d>dist[u]) continue;

		for(auto it: adj[u]){
			int v=it.fi,w=it.se;
			if(dist[v]>d+w){
				dist[v]=d+w;
				q.push({dist[v],v});
			}
		}
	}
}

void precompute(){
	sp(U);
	FOR(i,1,N+1) DU[i]=dist[i];

	sp(V);
	FOR(i,1,N+1) DV[i]=dist[i];

	sp(S);
	FOR(i,1,N+1) DS[i]=dist[i];

	sp(T);
	FOR(i,1,N+1) DT[i]=dist[i];
}

int32_t main() {
    boost; IO();

    cin>>N>>M>>S>>T>>U>>V;
    FOR(i,0,M){
    	int u,v,w; cin>>u>>v>>w; 
    	adj[u].eb(v,w);
    	adj[v].eb(u,w);
    }

    precompute();

    vi vec(N);
    iota(all(vec),1);
    sort(all(vec),cmp);

    int ans=DU[V];
    vi dp(N+1,INF),dp2(N+1,INF);
    for(auto y: vec) if(DS[y]+DT[y]==DS[T]){
    	dp[y]=DU[y];
    	for(auto it: adj[y]){
    		int x=it.fi,w=it.se;
    		if(DS[x]+w==DS[y]) ckmin(dp[y],dp[x]);
    	}
    	ckmin(ans,dp[y]+DV[y]);

    	dp2[y]=DV[y];
    	for(auto it: adj[y]){
    		int x=it.fi,w=it.se;
    		if(DS[x]+w==DS[y]) ckmin(dp2[y],dp2[x]);
    	}
    	ckmin(ans,dp2[y]+DU[y]);
    }
    cout << ans << endl;


    

    return 0;
}
//Change your approach

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 356 ms 20156 KB Output is correct
2 Correct 382 ms 22920 KB Output is correct
3 Correct 405 ms 23892 KB Output is correct
4 Correct 351 ms 23860 KB Output is correct
5 Correct 377 ms 22804 KB Output is correct
6 Correct 379 ms 24104 KB Output is correct
7 Correct 403 ms 22900 KB Output is correct
8 Correct 372 ms 22820 KB Output is correct
9 Correct 386 ms 23664 KB Output is correct
10 Correct 309 ms 23756 KB Output is correct
11 Correct 152 ms 16236 KB Output is correct
12 Correct 407 ms 23648 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 372 ms 19384 KB Output is correct
2 Correct 418 ms 19440 KB Output is correct
3 Correct 422 ms 19452 KB Output is correct
4 Correct 417 ms 19504 KB Output is correct
5 Correct 386 ms 19588 KB Output is correct
6 Correct 393 ms 19516 KB Output is correct
7 Correct 375 ms 19312 KB Output is correct
8 Correct 405 ms 19448 KB Output is correct
9 Correct 380 ms 19444 KB Output is correct
10 Correct 419 ms 19456 KB Output is correct
11 Correct 154 ms 14332 KB Output is correct
12 Correct 378 ms 19436 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 8044 KB Output is correct
2 Correct 5 ms 6636 KB Output is correct
3 Correct 5 ms 6636 KB Output is correct
4 Correct 23 ms 10092 KB Output is correct
5 Correct 13 ms 8428 KB Output is correct
6 Correct 6 ms 6764 KB Output is correct
7 Correct 6 ms 6764 KB Output is correct
8 Correct 7 ms 6892 KB Output is correct
9 Correct 6 ms 6764 KB Output is correct
10 Correct 16 ms 8428 KB Output is correct
11 Correct 5 ms 6764 KB Output is correct
12 Correct 6 ms 6636 KB Output is correct
13 Correct 5 ms 6636 KB Output is correct
14 Correct 6 ms 6636 KB Output is correct
15 Correct 5 ms 6764 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 356 ms 20156 KB Output is correct
2 Correct 382 ms 22920 KB Output is correct
3 Correct 405 ms 23892 KB Output is correct
4 Correct 351 ms 23860 KB Output is correct
5 Correct 377 ms 22804 KB Output is correct
6 Correct 379 ms 24104 KB Output is correct
7 Correct 403 ms 22900 KB Output is correct
8 Correct 372 ms 22820 KB Output is correct
9 Correct 386 ms 23664 KB Output is correct
10 Correct 309 ms 23756 KB Output is correct
11 Correct 152 ms 16236 KB Output is correct
12 Correct 407 ms 23648 KB Output is correct
13 Correct 372 ms 19384 KB Output is correct
14 Correct 418 ms 19440 KB Output is correct
15 Correct 422 ms 19452 KB Output is correct
16 Correct 417 ms 19504 KB Output is correct
17 Correct 386 ms 19588 KB Output is correct
18 Correct 393 ms 19516 KB Output is correct
19 Correct 375 ms 19312 KB Output is correct
20 Correct 405 ms 19448 KB Output is correct
21 Correct 380 ms 19444 KB Output is correct
22 Correct 419 ms 19456 KB Output is correct
23 Correct 154 ms 14332 KB Output is correct
24 Correct 378 ms 19436 KB Output is correct
25 Correct 14 ms 8044 KB Output is correct
26 Correct 5 ms 6636 KB Output is correct
27 Correct 5 ms 6636 KB Output is correct
28 Correct 23 ms 10092 KB Output is correct
29 Correct 13 ms 8428 KB Output is correct
30 Correct 6 ms 6764 KB Output is correct
31 Correct 6 ms 6764 KB Output is correct
32 Correct 7 ms 6892 KB Output is correct
33 Correct 6 ms 6764 KB Output is correct
34 Correct 16 ms 8428 KB Output is correct
35 Correct 5 ms 6764 KB Output is correct
36 Correct 6 ms 6636 KB Output is correct
37 Correct 5 ms 6636 KB Output is correct
38 Correct 6 ms 6636 KB Output is correct
39 Correct 5 ms 6764 KB Output is correct
40 Correct 341 ms 24232 KB Output is correct
41 Correct 391 ms 23596 KB Output is correct
42 Correct 362 ms 23852 KB Output is correct
43 Correct 195 ms 16492 KB Output is correct
44 Correct 198 ms 16364 KB Output is correct
45 Correct 377 ms 22956 KB Output is correct
46 Correct 371 ms 22700 KB Output is correct
47 Correct 364 ms 24168 KB Output is correct
48 Correct 197 ms 15852 KB Output is correct
49 Correct 318 ms 23716 KB Output is correct
50 Correct 342 ms 22900 KB Output is correct
51 Correct 360 ms 22836 KB Output is correct