oj.uz

답안 #332105

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
332105 2020-12-01T13:19:56 Z soroush Commuter Pass (JOI18_commuter_pass) C++14
100 / 100
 500 ms 43740 KB 
//*
//#pragma GCC optimize("O2")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC target("avx,avx2,sse,sse2,fma")
//*/
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
#define int ll
typedef long double ld;
typedef pair<int  ,int > pii;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const ll maxn  = 2e5 + 10;
const ll mod =1e9+7;
const ld PI = acos((ld)-1);

#define pb push_back
#define endl '\n'
#define dokme(x) cout << x , exit(0)
#define migmig ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define ms(x , y) memset(x , y , sizeof x)
ll pw(ll a, ll b, ll md = mod){ll res = 1;while(b){if(b&1){res=(a*res)%md;}a=(a*a)%md;b>>=1;}return(res);}

struct tr{
	int u , w;
	tr(int a , int b):
		u(a) , w(b){}
	friend bool operator < (tr a  , tr b){
		if(a.w == b.w)return(a.u < b.u);
		return(a.w > b.w);
	}
};

int n , m;
vector < tr > adj[maxn];
int s , t;
int a , b;
vector < int > ds , dt;
priority_queue < tr > st;
bool mark[maxn];

#define insert push
#define erase pop

void djk(int v, vector < int > &dist){
	ms(mark , 0);
	for(int i = 0 ; i <= n ; i ++)
		dist.pb(1e18);
	dist[v] = 0;
	st.insert({v , dist[v]});
	while(!st.empty()){
		auto vw = (st.top());
		auto v = vw.u;
		st.erase();
		if(mark[v])continue;
		mark[v] = 1;
		for(auto uw : adj[v])
			if(dist[uw.u] > dist[v] + uw.w)
				dist[uw.u] = dist[v] + uw.w,
				st.insert({uw.u , dist[uw.u]});
	}
}

vector < int > du , dv;

bool sp(int u , int v , int w){
	return((ds[u] + dt[v] + w == ds[t]));
}

int mn[maxn] , mnr[maxn];
int ans = 1e18;

vector < int > in[maxn] , out[maxn];

int d[maxn];

vector < int > topo;

void dfs(int v){
	topo.pb(v);
	mark[v] = 1;
	for(auto u : out[v]){
		d[u] -- ;
		if(d[u] == 0)
			dfs(u);
	}
}

int32_t main(){
    migmig;
	cin >> n >> m;
	cin >> s >> t;
	cin >> a >> b;
	for(int i = 1;  i <= m ; i ++){
		int u , v , w;
		cin >> u >> v >> w;
		adj[u].pb({v , w});
		adj[v].pb({u , w});
	}
	djk(s , ds);
	djk(t , dt);
	djk(a , du);
	djk(b , dv);
	for(int v = 1 ; v <= n ; v ++){
		for(auto uw : adj[v]){
			auto u = uw.u;
			auto w = uw.w;
			if(sp(v , u , w))in[u].pb(v) , out[v].pb(u) , d[u] ++ ;
		}
	}
	ms(mark , 0);
	for(int i = 1; i <= n ; i ++)if(d[i] == 0 and !mark[i])dfs(i);
	for(int i = 1; i <= n ; i ++)mn[i] = 1e18 , mnr[i] = 1e18;
	for(auto v : topo){
		mn[v] = du[v];
		for(auto u : in[v])
			mn[v] = min(mn[v] , mn[u]);
	}
	reverse(topo.begin() , topo.end());
	for(auto v : topo){
		mnr[v] = du[v];
		for(auto u : out[v])
			mnr[v] = min(mnr[v] , mnr[u]);
	}
	for(int i = 1 ; i <= n ; i ++)mn[i] = min(mn[i] , mnr[i]);
	for(int i = 1 ; i <= n ; i ++)
		ans = min(ans , dv[i] + mn[i]);
	cout << ans;
    return(0);
}

Subtask #1
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 397 ms 36572 KB Output is correct
2 Correct 426 ms 37092 KB Output is correct
3 Correct 464 ms 43740 KB Output is correct
4 Correct 381 ms 36576 KB Output is correct
5 Correct 407 ms 38384 KB Output is correct
6 Correct 423 ms 36584 KB Output is correct
7 Correct 430 ms 39144 KB Output is correct
8 Correct 430 ms 38772 KB Output is correct
9 Correct 387 ms 35808 KB Output is correct
10 Correct 359 ms 35828 KB Output is correct
11 Correct 188 ms 32764 KB Output is correct
12 Correct 414 ms 35808 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 451 ms 38416 KB Output is correct
2 Correct 467 ms 38628 KB Output is correct
3 Correct 439 ms 37864 KB Output is correct
4 Correct 433 ms 38536 KB Output is correct
5 Correct 452 ms 39272 KB Output is correct
6 Correct 453 ms 42184 KB Output is correct
7 Correct 500 ms 42340 KB Output is correct
8 Correct 442 ms 38572 KB Output is correct
9 Correct 453 ms 39136 KB Output is correct
10 Correct 423 ms 38404 KB Output is correct
11 Correct 215 ms 35044 KB Output is correct
12 Correct 434 ms 42616 KB Output is correct

Subtask #3
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 22 ms 16492 KB Output is correct
2 Correct 10 ms 14700 KB Output is correct
3 Correct 10 ms 14700 KB Output is correct
4 Correct 26 ms 18156 KB Output is correct
5 Correct 18 ms 16364 KB Output is correct
6 Correct 11 ms 14828 KB Output is correct
7 Correct 12 ms 14828 KB Output is correct
8 Correct 12 ms 14956 KB Output is correct
9 Correct 11 ms 14828 KB Output is correct
10 Correct 18 ms 16364 KB Output is correct
11 Correct 10 ms 14700 KB Output is correct
12 Correct 10 ms 14700 KB Output is correct
13 Correct 10 ms 14700 KB Output is correct
14 Correct 11 ms 14700 KB Output is correct
15 Correct 10 ms 14700 KB Output is correct

Subtask #4
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 397 ms 36572 KB Output is correct
2 Correct 426 ms 37092 KB Output is correct
3 Correct 464 ms 43740 KB Output is correct
4 Correct 381 ms 36576 KB Output is correct
5 Correct 407 ms 38384 KB Output is correct
6 Correct 423 ms 36584 KB Output is correct
7 Correct 430 ms 39144 KB Output is correct
8 Correct 430 ms 38772 KB Output is correct
9 Correct 387 ms 35808 KB Output is correct
10 Correct 359 ms 35828 KB Output is correct
11 Correct 188 ms 32764 KB Output is correct
12 Correct 414 ms 35808 KB Output is correct
13 Correct 451 ms 38416 KB Output is correct
14 Correct 467 ms 38628 KB Output is correct
15 Correct 439 ms 37864 KB Output is correct
16 Correct 433 ms 38536 KB Output is correct
17 Correct 452 ms 39272 KB Output is correct
18 Correct 453 ms 42184 KB Output is correct
19 Correct 500 ms 42340 KB Output is correct
20 Correct 442 ms 38572 KB Output is correct
21 Correct 453 ms 39136 KB Output is correct
22 Correct 423 ms 38404 KB Output is correct
23 Correct 215 ms 35044 KB Output is correct
24 Correct 434 ms 42616 KB Output is correct
25 Correct 22 ms 16492 KB Output is correct
26 Correct 10 ms 14700 KB Output is correct
27 Correct 10 ms 14700 KB Output is correct
28 Correct 26 ms 18156 KB Output is correct
29 Correct 18 ms 16364 KB Output is correct
30 Correct 11 ms 14828 KB Output is correct
31 Correct 12 ms 14828 KB Output is correct
32 Correct 12 ms 14956 KB Output is correct
33 Correct 11 ms 14828 KB Output is correct
34 Correct 18 ms 16364 KB Output is correct
35 Correct 10 ms 14700 KB Output is correct
36 Correct 10 ms 14700 KB Output is correct
37 Correct 10 ms 14700 KB Output is correct
38 Correct 11 ms 14700 KB Output is correct
39 Correct 10 ms 14700 KB Output is correct
40 Correct 424 ms 36700 KB Output is correct
41 Correct 392 ms 35708 KB Output is correct
42 Correct 409 ms 35812 KB Output is correct
43 Correct 232 ms 36836 KB Output is correct
44 Correct 248 ms 36708 KB Output is correct
45 Correct 475 ms 42008 KB Output is correct
46 Correct 483 ms 41828 KB Output is correct
47 Correct 395 ms 36896 KB Output is correct
48 Correct 264 ms 34648 KB Output is correct
49 Correct 326 ms 36444 KB Output is correct
50 Correct 438 ms 40548 KB Output is correct
51 Correct 492 ms 42084 KB Output is correct