oj.uz

답안 #716564

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
716564 2023-03-30T10:41:34 Z ono_de206 Robot (JOI21_ho_t4) C++14
100 / 100
 1074 ms 100240 KB 
#include<bits/stdc++.h>
using namespace std;

#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define in insert
#define all(x) x.begin(),x.end()
#define pb push_back
#define eb emplace_back
#define ff first
#define ss second

#define int long long
 
typedef long long ll;
typedef vector<int> vi;
typedef set<int> si;
typedef multiset<int> msi;
typedef pair<int, int> pii;
typedef vector<pii> vpii;

template<typename T, typename U>
ostream & operator << (ostream &out, const pair<T, U> &c) {
	out << c.first << ' ' << c.second;
    return out;
}

template<typename T>
ostream & operator << (ostream &out, vector<T> &v) {
	const int sz = v.size();
	for (int i = 0; i < sz; i++) {
		if (i) out << ' ';
		out << v[i];
	}
    return out;
}

template<typename T>
istream & operator >> (istream &in, vector<T> &v) {
	for (T &x : v) in >> x;
    return in;
}


template<typename T>
void mxx(T &a, T b){if(b > a) a = b;}
template<typename T>
void mnn(T &a, T b){if(b < a) a = b;}

const int mxn = 1e5 + 10, inf = 1e18 + 10;
int dp[mxn];
map<int, int> mn[mxn], sum[mxn];
map<int, vector<pair<int, int>>> adj[mxn];
vector<array<int, 3>> g[mxn];

void go() {
	int n, m;
	cin >> n >> m;
	for(int i = 1; i <= m; i++) {
		int a, b, c, p;
		cin >> a >> b >> c >> p;
		g[a].pb({b, c, p});
		g[b].pb({a, c, p});
		adj[a][c].pb({b, p});
		adj[b][c].pb({a, p});
		sum[a][c] += p;
		sum[b][c] += p;
	}
	for(int i = 1; i <= n; i++) {
		dp[i] = inf;
	}
	dp[1] = 0;
	priority_queue<array<int, 3>, vector<array<int, 3>>, greater<array<int, 3>>> q;
	q.push({0, 1, 0});
	while(q.size()) {
		auto tmp = q.top();
		int my = tmp[0];
		int to = tmp[1];
		int tp = tmp[2];
		q.pop();
		if(tp) {
			if(my != mn[to][tp]) continue;
			for(auto it : adj[to][tp]) {
				int x = it.ff;
				int p = it.ss;
				int kk = sum[to][tp]; 
				if(my + kk - p < dp[x]) {
					dp[x] = my + kk - p;
					q.push({dp[x], x, 0});
				}
			}
			continue;
		}
		if(my != dp[to]) continue;
		for(auto it : g[to]) {
			int x = it[0];
			int c = it[1];
			int p = it[2];
			int kk = sum[to][c];
			if(my + kk - p < dp[x]) {
				dp[x] = my + kk - p;
				q.push({dp[x], x, 0});
			}
			if(my + p < dp[x]) {
				dp[x] = my + p;
				q.push({dp[x], x, 0});
			}
			if(!mn[x].count(c) || mn[x][c] > my) {
				mn[x][c] = my;
				q.push({my, x, c});
			}
		}
	}
	if(dp[n] == inf) dp[n] = -1;
	cout << dp[n] << '\n';
}

signed main() {
	fast;
	int t = 1;
	// cin >> t;
	while(t--) {
		go();
	}
	return 0;
}

Subtask #1
34.0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 16724 KB Output is correct
2 Correct 9 ms 16724 KB Output is correct
3 Correct 8 ms 16724 KB Output is correct
4 Correct 9 ms 16724 KB Output is correct
5 Correct 9 ms 16724 KB Output is correct
6 Correct 9 ms 16724 KB Output is correct
7 Correct 10 ms 16980 KB Output is correct
8 Correct 9 ms 16852 KB Output is correct
9 Correct 13 ms 17468 KB Output is correct
10 Correct 12 ms 17492 KB Output is correct
11 Correct 12 ms 17236 KB Output is correct
12 Correct 10 ms 17232 KB Output is correct
13 Correct 16 ms 17316 KB Output is correct
14 Correct 15 ms 17276 KB Output is correct
15 Correct 11 ms 17108 KB Output is correct
16 Correct 16 ms 17236 KB Output is correct
17 Correct 12 ms 17236 KB Output is correct
18 Correct 14 ms 16984 KB Output is correct
19 Correct 12 ms 17108 KB Output is correct
20 Correct 11 ms 17108 KB Output is correct

Subtask #2
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 290 ms 41256 KB Output is correct
2 Correct 127 ms 28864 KB Output is correct
3 Correct 286 ms 41244 KB Output is correct
4 Correct 173 ms 32980 KB Output is correct
5 Correct 988 ms 94380 KB Output is correct
6 Correct 820 ms 84272 KB Output is correct
7 Correct 370 ms 71364 KB Output is correct
8 Correct 503 ms 62936 KB Output is correct
9 Correct 503 ms 63000 KB Output is correct
10 Correct 351 ms 56552 KB Output is correct
11 Correct 173 ms 39752 KB Output is correct

Subtask #3
42.0 / 42.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 16724 KB Output is correct
2 Correct 9 ms 16724 KB Output is correct
3 Correct 8 ms 16724 KB Output is correct
4 Correct 9 ms 16724 KB Output is correct
5 Correct 9 ms 16724 KB Output is correct
6 Correct 9 ms 16724 KB Output is correct
7 Correct 10 ms 16980 KB Output is correct
8 Correct 9 ms 16852 KB Output is correct
9 Correct 13 ms 17468 KB Output is correct
10 Correct 12 ms 17492 KB Output is correct
11 Correct 12 ms 17236 KB Output is correct
12 Correct 10 ms 17232 KB Output is correct
13 Correct 16 ms 17316 KB Output is correct
14 Correct 15 ms 17276 KB Output is correct
15 Correct 11 ms 17108 KB Output is correct
16 Correct 16 ms 17236 KB Output is correct
17 Correct 12 ms 17236 KB Output is correct
18 Correct 14 ms 16984 KB Output is correct
19 Correct 12 ms 17108 KB Output is correct
20 Correct 11 ms 17108 KB Output is correct
21 Correct 290 ms 41256 KB Output is correct
22 Correct 127 ms 28864 KB Output is correct
23 Correct 286 ms 41244 KB Output is correct
24 Correct 173 ms 32980 KB Output is correct
25 Correct 988 ms 94380 KB Output is correct
26 Correct 820 ms 84272 KB Output is correct
27 Correct 370 ms 71364 KB Output is correct
28 Correct 503 ms 62936 KB Output is correct
29 Correct 503 ms 63000 KB Output is correct
30 Correct 351 ms 56552 KB Output is correct
31 Correct 173 ms 39752 KB Output is correct
32 Correct 150 ms 37456 KB Output is correct
33 Correct 182 ms 37932 KB Output is correct
34 Correct 420 ms 59280 KB Output is correct
35 Correct 344 ms 49368 KB Output is correct
36 Correct 328 ms 55344 KB Output is correct
37 Correct 386 ms 60768 KB Output is correct
38 Correct 355 ms 70972 KB Output is correct
39 Correct 160 ms 43968 KB Output is correct
40 Correct 516 ms 62896 KB Output is correct
41 Correct 515 ms 62952 KB Output is correct
42 Correct 532 ms 71472 KB Output is correct
43 Correct 238 ms 43624 KB Output is correct
44 Correct 441 ms 55152 KB Output is correct
45 Correct 378 ms 56436 KB Output is correct
46 Correct 362 ms 56092 KB Output is correct
47 Correct 355 ms 58972 KB Output is correct
48 Correct 1074 ms 100240 KB Output is correct