oj.uz

답안 #329309

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
329309 2020-11-20T12:49:37 Z HoneyBadger Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
 382 ms 24940 KB 
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <vector>
#include <bitset>
#include <string>
#include <cstring>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <utility>
#include <algorithm>
#include <random>
#include <cmath>
#include <cassert>
#include <climits>
#include <ctime>
#include <chrono>



#pragma GCC optimize("Ofast")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,sse4.1,sse4.2,popcnt,abm,mmx,avx,avx2,tune=native")



#ifdef LOCAL
    #define dbg(x) cout << #x << " : " << x << endl;
#else
    #define dbg(x)
#endif

#define int long long
#define pb push_back
#define ppb pop_back()
#define mp make_pair
#define fi(a, b) for (int i = a; i < b; i++)
#define fj(a, b) for (int j = a; j < b; j++)
#define fk(a, b) for (int k = a; k < b; k++)
#define fi1(a, b) for (int i = a - 1; i >= b; i--)
#define fj1(a, b) for (int j = a - 1; j >= b; j--)
#define fk1(a, b) for (int k = a - 1; k >= b; k--)
#define fx(x, a) for (auto& x : a)
#define rep(i, a, b) for (int i = a; i < b; ++i)
#define rep1(i, a, b) for (int i = a - 1; i >= b; --i)
#define siz(x) (int)x.size()
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()

using namespace std;

template<typename T1, typename T2>inline void mine(T1 &x, const T2 &y) { if (y < x) x = y; }
template<typename T1, typename T2>inline void maxe(T1 &x, const T2 &y) { if (x < y) x = y; }

ostream& operator << (ostream &out, const vector<int> &b) {
    for (auto k : b) out << k << ' ';
    return out;
}

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef char ch;
typedef string str;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vpii;
typedef vector<vpii> vvpii;
typedef vector<ch> vch;
typedef vector<vch> vvch;
typedef vector<str> vs;



const int MOD = 1000000007;
const int INF = 1000000050;
const long long BIG = (long long)2e18 + 50;
const int MX = 100010;
const double EPS = 1e-9;


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

int n;
vpii g[MX];

vi dij(int s) {
	vi dist(n, BIG);
	dist[s] = 0;
	priority_queue<pii> q;
	q.push({0, s});
	while (q.size()) {
		auto[dv, v] = q.top();
		dv = -dv;
		q.pop();
		if (dv > dist[v]) continue;
		for (auto[to, c] : g[v]) {
			if (dist[to] > dv + c) {
				dist[to] = dv + c;
				q.push({-dist[to], to});
			}
		}
	}
	return dist;
}

int32_t main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int m, s, t, u, v;
    cin >> n >> m >> s >> t >> u >> v;
    --s, --t, --u, --v;
    while (m--) {
    	int a, b, c;
    	cin >> a >> b >> c;
    	--a, --b;
    	g[a].pb({b, c});
    	g[b].pb({a, c}); 
    }
   	vi ds = dij(s);
   	vi p(n);
   	fi(0, n) {
   		p[i] = i;
   	}
   	sort(all(p), [&](int a, int b){return ds[a] > ds[b];});
   	vch can(n, 0);
   	fx(x, p) {
   		can[x] = x == t;
   		for (auto[to, c] : g[x]) {
   			if (ds[x] + c == ds[to]) {
   				can[x] |= can[to];
   			}
   		}
   	}
   	vi dpu(n, BIG);
   	vi dpv(n, BIG);
   	vi du = dij(u);
   	vi dv = dij(v);
   	//assert(du[v] == dv[u]);
   	//assert(du[v] < BIG);
   	ll ans = du[v];
   	fx(x, p) {
   		if (!can[x]) continue;
   		//dbg(x);
		for (auto[to, c] : g[x]) {
			if (!can[to] || ds[x] + c != ds[to]) continue;
			mine(dpu[x], dpu[to]);
			mine(dpv[x], dpv[to]);
		}	
		mine(ans, dpu[x] + dv[x]);
		mine(ans, dpv[x] + du[x]);
		mine(dpu[x], du[x]);
		mine(dpv[x], dv[x]);
   	}
   	cout << ans << '\n';
}

Subtask #1
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 335 ms 21272 KB Output is correct
2 Correct 344 ms 23300 KB Output is correct
3 Correct 359 ms 23308 KB Output is correct
4 Correct 327 ms 24700 KB Output is correct
5 Correct 346 ms 23528 KB Output is correct
6 Correct 346 ms 24940 KB Output is correct
7 Correct 347 ms 23220 KB Output is correct
8 Correct 349 ms 23184 KB Output is correct
9 Correct 338 ms 24288 KB Output is correct
10 Correct 287 ms 24020 KB Output is correct
11 Correct 180 ms 14828 KB Output is correct
12 Correct 368 ms 24076 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 382 ms 20452 KB Output is correct
2 Correct 359 ms 23348 KB Output is correct
3 Correct 356 ms 23236 KB Output is correct
4 Correct 351 ms 23336 KB Output is correct
5 Correct 376 ms 23212 KB Output is correct
6 Correct 347 ms 23564 KB Output is correct
7 Correct 366 ms 23228 KB Output is correct
8 Correct 368 ms 23344 KB Output is correct
9 Correct 365 ms 23212 KB Output is correct
10 Correct 367 ms 23212 KB Output is correct
11 Correct 170 ms 14956 KB Output is correct
12 Correct 357 ms 23428 KB Output is correct

Subtask #3
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 4460 KB Output is correct
2 Correct 2 ms 2796 KB Output is correct
3 Correct 2 ms 2796 KB Output is correct
4 Correct 17 ms 6252 KB Output is correct
5 Correct 11 ms 4460 KB Output is correct
6 Correct 3 ms 2796 KB Output is correct
7 Correct 5 ms 2924 KB Output is correct
8 Correct 4 ms 2924 KB Output is correct
9 Correct 3 ms 2796 KB Output is correct
10 Correct 10 ms 4460 KB Output is correct
11 Correct 2 ms 2668 KB Output is correct
12 Correct 3 ms 2668 KB Output is correct
13 Correct 3 ms 2796 KB Output is correct
14 Correct 3 ms 2796 KB Output is correct
15 Correct 3 ms 2796 KB Output is correct

Subtask #4
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 335 ms 21272 KB Output is correct
2 Correct 344 ms 23300 KB Output is correct
3 Correct 359 ms 23308 KB Output is correct
4 Correct 327 ms 24700 KB Output is correct
5 Correct 346 ms 23528 KB Output is correct
6 Correct 346 ms 24940 KB Output is correct
7 Correct 347 ms 23220 KB Output is correct
8 Correct 349 ms 23184 KB Output is correct
9 Correct 338 ms 24288 KB Output is correct
10 Correct 287 ms 24020 KB Output is correct
11 Correct 180 ms 14828 KB Output is correct
12 Correct 368 ms 24076 KB Output is correct
13 Correct 382 ms 20452 KB Output is correct
14 Correct 359 ms 23348 KB Output is correct
15 Correct 356 ms 23236 KB Output is correct
16 Correct 351 ms 23336 KB Output is correct
17 Correct 376 ms 23212 KB Output is correct
18 Correct 347 ms 23564 KB Output is correct
19 Correct 366 ms 23228 KB Output is correct
20 Correct 368 ms 23344 KB Output is correct
21 Correct 365 ms 23212 KB Output is correct
22 Correct 367 ms 23212 KB Output is correct
23 Correct 170 ms 14956 KB Output is correct
24 Correct 357 ms 23428 KB Output is correct
25 Correct 10 ms 4460 KB Output is correct
26 Correct 2 ms 2796 KB Output is correct
27 Correct 2 ms 2796 KB Output is correct
28 Correct 17 ms 6252 KB Output is correct
29 Correct 11 ms 4460 KB Output is correct
30 Correct 3 ms 2796 KB Output is correct
31 Correct 5 ms 2924 KB Output is correct
32 Correct 4 ms 2924 KB Output is correct
33 Correct 3 ms 2796 KB Output is correct
34 Correct 10 ms 4460 KB Output is correct
35 Correct 2 ms 2668 KB Output is correct
36 Correct 3 ms 2668 KB Output is correct
37 Correct 3 ms 2796 KB Output is correct
38 Correct 3 ms 2796 KB Output is correct
39 Correct 3 ms 2796 KB Output is correct
40 Correct 320 ms 24780 KB Output is correct
41 Correct 333 ms 24224 KB Output is correct
42 Correct 333 ms 24040 KB Output is correct
43 Correct 180 ms 14956 KB Output is correct
44 Correct 172 ms 14828 KB Output is correct
45 Correct 335 ms 22328 KB Output is correct
46 Correct 336 ms 22724 KB Output is correct
47 Correct 325 ms 24768 KB Output is correct
48 Correct 177 ms 14444 KB Output is correct
49 Correct 285 ms 24596 KB Output is correct
50 Correct 333 ms 23120 KB Output is correct
51 Correct 338 ms 22988 KB Output is correct