oj.uz

답안 #435034

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
435034 2021-06-22T20:44:04 Z arwaeystoamneg Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
 666 ms 26540 KB 
// EXPLOSION!
#define _CRT_SECURE_NO_WARNINGS
#include<bits/stdc++.h>
#include<unordered_set>
#include<unordered_map>
#include<chrono>

using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pair<int, int>> vpi;
typedef vector<pair<ll, ll>> vpll;

#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)

#define pb push_back
#define mp make_pair
#define rsz resize
#define sz(x) int(x.size())
#define all(x) x.begin(),x.end()
#define f first
#define s second
#define cont continue
#define endl '\n'
//#define ednl '\n'
#define test int testc;cin>>testc;while(testc--)
#define pr(a, b) trav(x,a)cerr << x << b; cerr << endl;
#define message cout << "Hello World" << endl;
const int dx[4] = { 1,0,-1,0 }, dy[4] = { 0,1,0,-1 }; // for every grid problem!!
const ll linf = 4000000000000000000LL;
const ll inf = 1000000007;//998244353    

void pv(vi a) { trav(x, a)cout << x << " "; cout << endl; }void pv(vll a) { trav(x, a)cout << x << " "; cout << endl; }void pv(vector<vi>a) {
	F0R(i, sz(a)) { cout << i << endl; pv(a[i]); cout << endl; }
}void pv(vector<vll>a) { F0R(i, sz(a)) { cout << i << endl; pv(a[i]); }cout << endl; }void pv(vector<string>a) { trav(x, a)cout << x << endl; cout << endl; }
void setIO(string s) {
	ios_base::sync_with_stdio(0); cin.tie(0);
#ifdef arwaeystoamneg
	if (sz(s))
	{
		freopen((s + ".in").c_str(), "r", stdin);
		if (s != "test1")
			freopen((s + ".out").c_str(), "w", stdout);
	}
#endif
}
const int MAX = 111111;
int n, m, a, b, x, y;
struct edge
{
	int a, b, c;
	int get(int i)
	{
		return a + b - i;
	}
};
vi adj[MAX];
edge e[2 * MAX];
ll dista[MAX], distb[MAX], distx[MAX], disty[MAX];
ll dpx[2 * MAX], dpy[2 * MAX];
void dijkstra(int a, ll* d)
{
	fill(d, d + n, linf);
	d[a] = 0;
	priority_queue<pll, vpll, greater<pll>>todo;
	todo.push({ 0,a });
	while (sz(todo))
	{
		ll di = todo.top().f;
		int i = todo.top().s;
		todo.pop();
		if (d[i] != di)continue;
		trav(x, adj[i])
		{
			int j = e[x].get(i);
			if (d[j] > d[i] + e[x].c)
			{
				d[j] = d[i] + e[x].c;
				todo.push({ d[j],j });
			}
		}
	}
}
void Do(int st, ll* dp, ll* d)
{
	priority_queue<pll, vpll, greater<pll>>todo;
	F0R(i, m)
	{
		if (dista[e[i].b] < dista[e[i].a])swap(e[i].b, e[i].a);
		if (dista[e[i].a] + e[i].c + distb[e[i].b] != dista[b])
		{
			dp[i] = linf;
		}
		else
		{
			dp[i] = d[e[i].a];
			todo.push({ dp[i],i });
		}
	}
	while (sz(todo))
	{
		ll val = todo.top().f;
		int idx = todo.top().s;
		todo.pop();
		if (dp[idx] != val)continue;
		int i = e[idx].b;
		trav(x, adj[i])
		{
			int j = e[x].get(i);
			if (dista[i] + e[x].c + distb[j] != dista[b])continue;
			if (dp[x] > dp[idx])
			{
				dp[x] = dp[idx];
				todo.push({ dp[x],x });
			}
		}
	}
}
int main()
{
	setIO("test1");
	cin >> n >> m >> a >> b >> x >> y;
	a--, b--, x--, y--;
	F0R(i, m)
	{
		int x, y, z;
		cin >> x >> y >> z;
		adj[--x].pb(i);
		adj[--y].pb(i);
		e[i] = { x,y,z };
	}
	dijkstra(a, dista);
	dijkstra(b, distb);
	dijkstra(x, distx);
	dijkstra(y, disty);
	Do(x, dpx, distx);
	Do(y, dpy, disty);
	ll ans = distx[y];
	F0R(i, m)
	{
		ans = min(ans, dpx[i] + disty[e[i].b]);
		ans = min(ans, dpy[i] + distx[e[i].b]);
	}
	cout << ans << endl;
}

Subtask #1
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 394 ms 19672 KB Output is correct
2 Correct 453 ms 20792 KB Output is correct
3 Correct 477 ms 22632 KB Output is correct
4 Correct 386 ms 19616 KB Output is correct
5 Correct 467 ms 22224 KB Output is correct
6 Correct 395 ms 19720 KB Output is correct
7 Correct 475 ms 22404 KB Output is correct
8 Correct 484 ms 21056 KB Output is correct
9 Correct 382 ms 20252 KB Output is correct
10 Correct 311 ms 20320 KB Output is correct
11 Correct 242 ms 15632 KB Output is correct
12 Correct 396 ms 20124 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 506 ms 20348 KB Output is correct
2 Correct 431 ms 20116 KB Output is correct
3 Correct 474 ms 20056 KB Output is correct
4 Correct 432 ms 20116 KB Output is correct
5 Correct 480 ms 20744 KB Output is correct
6 Correct 471 ms 21320 KB Output is correct
7 Correct 479 ms 22312 KB Output is correct
8 Correct 499 ms 20156 KB Output is correct
9 Correct 468 ms 20756 KB Output is correct
10 Correct 426 ms 20068 KB Output is correct
11 Correct 262 ms 16036 KB Output is correct
12 Correct 466 ms 21348 KB Output is correct

Subtask #3
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 36 ms 4780 KB Output is correct
2 Correct 3 ms 3020 KB Output is correct
3 Correct 3 ms 3020 KB Output is correct
4 Correct 21 ms 5556 KB Output is correct
5 Correct 17 ms 4196 KB Output is correct
6 Correct 4 ms 3020 KB Output is correct
7 Correct 4 ms 3148 KB Output is correct
8 Correct 4 ms 3148 KB Output is correct
9 Correct 3 ms 3020 KB Output is correct
10 Correct 12 ms 4216 KB Output is correct
11 Correct 3 ms 3020 KB Output is correct
12 Correct 3 ms 2976 KB Output is correct
13 Correct 3 ms 3020 KB Output is correct
14 Correct 3 ms 3020 KB Output is correct
15 Correct 3 ms 3020 KB Output is correct

Subtask #4
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 394 ms 19672 KB Output is correct
2 Correct 453 ms 20792 KB Output is correct
3 Correct 477 ms 22632 KB Output is correct
4 Correct 386 ms 19616 KB Output is correct
5 Correct 467 ms 22224 KB Output is correct
6 Correct 395 ms 19720 KB Output is correct
7 Correct 475 ms 22404 KB Output is correct
8 Correct 484 ms 21056 KB Output is correct
9 Correct 382 ms 20252 KB Output is correct
10 Correct 311 ms 20320 KB Output is correct
11 Correct 242 ms 15632 KB Output is correct
12 Correct 396 ms 20124 KB Output is correct
13 Correct 506 ms 20348 KB Output is correct
14 Correct 431 ms 20116 KB Output is correct
15 Correct 474 ms 20056 KB Output is correct
16 Correct 432 ms 20116 KB Output is correct
17 Correct 480 ms 20744 KB Output is correct
18 Correct 471 ms 21320 KB Output is correct
19 Correct 479 ms 22312 KB Output is correct
20 Correct 499 ms 20156 KB Output is correct
21 Correct 468 ms 20756 KB Output is correct
22 Correct 426 ms 20068 KB Output is correct
23 Correct 262 ms 16036 KB Output is correct
24 Correct 466 ms 21348 KB Output is correct
25 Correct 36 ms 4780 KB Output is correct
26 Correct 3 ms 3020 KB Output is correct
27 Correct 3 ms 3020 KB Output is correct
28 Correct 21 ms 5556 KB Output is correct
29 Correct 17 ms 4196 KB Output is correct
30 Correct 4 ms 3020 KB Output is correct
31 Correct 4 ms 3148 KB Output is correct
32 Correct 4 ms 3148 KB Output is correct
33 Correct 3 ms 3020 KB Output is correct
34 Correct 12 ms 4216 KB Output is correct
35 Correct 3 ms 3020 KB Output is correct
36 Correct 3 ms 2976 KB Output is correct
37 Correct 3 ms 3020 KB Output is correct
38 Correct 3 ms 3020 KB Output is correct
39 Correct 3 ms 3020 KB Output is correct
40 Correct 369 ms 20048 KB Output is correct
41 Correct 379 ms 20116 KB Output is correct
42 Correct 382 ms 20040 KB Output is correct
43 Correct 273 ms 17576 KB Output is correct
44 Correct 270 ms 17664 KB Output is correct
45 Correct 666 ms 26540 KB Output is correct
46 Correct 643 ms 26296 KB Output is correct
47 Correct 390 ms 19624 KB Output is correct
48 Correct 282 ms 17156 KB Output is correct
49 Correct 332 ms 19744 KB Output is correct
50 Correct 636 ms 25768 KB Output is correct
51 Correct 660 ms 26496 KB Output is correct