oj.uz

Submission #377289

# Submission time Handle Problem Language Result Execution time Memory
377289 2021-03-13T17:24:19 Z YJU Robot (JOI21_ho_t4) C++14
100 / 100
 1100 ms 82992 KB 
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int n, m;
struct node {
	ll dis;
	int u, c;
	node() {}
	node(int _u, int _c, ll _d) { u = _u, c = _c, dis = _d; }
	friend bool operator < (node a, node b) { return a.dis > b.dis; }
};
priority_queue<node> Q;

const int maxn = 100005;
const int maxm = 400005;

int last[maxn], Next[maxm], to[maxm], w[maxm], col[maxm], cnt;
unordered_map <int, ll> Map[maxn], sum[maxn];
unordered_map <int, vector<pair<int, int> > > out[maxn];

inline void addedge(int x, int y, int z, int c) {
	Next[++cnt] = last[x], last[x] = cnt; 
	to[cnt] = y, w[cnt] = z, col[cnt] = c;
	out[x][c].push_back(make_pair(y, z));
	sum[x][c] += z;
} 


int main() {
	scanf("%d%d", &n, &m);
	for(int i = 1, x, y, z, c; i <= m; i++) {
		scanf("%d%d%d%d", &x, &y, &c, &z);
		addedge(x, y, z, c), addedge(y, x, z, c);
	} 
	auto check = [=] (int u, int c, ll dis) -> void {
		if(!Map[u].count(c) || Map[u][c] > dis) 
			Map[u][c] = dis, Q.push(node(u, c, dis));
	};
	
	check(1, 0, 0);
	while(!Q.empty()) {
		node tmp = Q.top();
		Q.pop();
		int u = tmp.u, c = tmp.c;
		ll dis = tmp.dis;
		if(Map[u][c] != dis) continue;
		
		if(!c) {
			for(int i = last[u]; i; i = Next[i]) {
				int v = to[i];
				check(v, col[i], dis);
				check(v, 0, dis + min(sum[u][col[i]] - w[i], (ll)w[i]));
			}
		}
		else {
			if(out[u].count(c)) {
				for(auto tp : out[u][c]) {
					int v = tp.first, w = tp.second;
					check(v, 0, dis + sum[u][c] - w);
				}
			}
		}
	}
	
	Map[n].count(0) ? printf("%lld\n", Map[n][0]) : puts("-1");
	return 0;
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:30:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   30 |  scanf("%d%d", &n, &m);
      |  ~~~~~^~~~~~~~~~~~~~~~
Main.cpp:32:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   32 |   scanf("%d%d%d%d", &x, &y, &c, &z);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 16748 KB Output is correct
2 Correct 14 ms 16748 KB Output is correct
3 Correct 13 ms 16748 KB Output is correct
4 Correct 13 ms 16748 KB Output is correct
5 Correct 13 ms 16876 KB Output is correct
6 Correct 13 ms 16748 KB Output is correct
7 Correct 15 ms 17004 KB Output is correct
8 Correct 13 ms 16876 KB Output is correct
9 Correct 20 ms 17388 KB Output is correct
10 Correct 16 ms 17388 KB Output is correct
11 Correct 15 ms 17260 KB Output is correct
12 Correct 15 ms 17184 KB Output is correct
13 Correct 15 ms 17260 KB Output is correct
14 Correct 15 ms 17260 KB Output is correct
15 Correct 14 ms 17132 KB Output is correct
16 Correct 16 ms 17132 KB Output is correct
17 Correct 15 ms 17132 KB Output is correct
18 Correct 13 ms 17004 KB Output is correct
19 Correct 15 ms 17024 KB Output is correct
20 Correct 17 ms 17132 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 346 ms 34148 KB Output is correct
2 Correct 131 ms 26088 KB Output is correct
3 Correct 404 ms 31480 KB Output is correct
4 Correct 217 ms 29152 KB Output is correct
5 Correct 999 ms 77480 KB Output is correct
6 Correct 902 ms 75180 KB Output is correct
7 Correct 502 ms 58796 KB Output is correct
8 Correct 571 ms 56556 KB Output is correct
9 Correct 634 ms 56556 KB Output is correct
10 Correct 507 ms 48424 KB Output is correct
11 Correct 188 ms 35820 KB Output is correct

Subtask #3
42.0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 16748 KB Output is correct
2 Correct 14 ms 16748 KB Output is correct
3 Correct 13 ms 16748 KB Output is correct
4 Correct 13 ms 16748 KB Output is correct
5 Correct 13 ms 16876 KB Output is correct
6 Correct 13 ms 16748 KB Output is correct
7 Correct 15 ms 17004 KB Output is correct
8 Correct 13 ms 16876 KB Output is correct
9 Correct 20 ms 17388 KB Output is correct
10 Correct 16 ms 17388 KB Output is correct
11 Correct 15 ms 17260 KB Output is correct
12 Correct 15 ms 17184 KB Output is correct
13 Correct 15 ms 17260 KB Output is correct
14 Correct 15 ms 17260 KB Output is correct
15 Correct 14 ms 17132 KB Output is correct
16 Correct 16 ms 17132 KB Output is correct
17 Correct 15 ms 17132 KB Output is correct
18 Correct 13 ms 17004 KB Output is correct
19 Correct 15 ms 17024 KB Output is correct
20 Correct 17 ms 17132 KB Output is correct
21 Correct 346 ms 34148 KB Output is correct
22 Correct 131 ms 26088 KB Output is correct
23 Correct 404 ms 31480 KB Output is correct
24 Correct 217 ms 29152 KB Output is correct
25 Correct 999 ms 77480 KB Output is correct
26 Correct 902 ms 75180 KB Output is correct
27 Correct 502 ms 58796 KB Output is correct
28 Correct 571 ms 56556 KB Output is correct
29 Correct 634 ms 56556 KB Output is correct
30 Correct 507 ms 48424 KB Output is correct
31 Correct 188 ms 35820 KB Output is correct
32 Correct 251 ms 30960 KB Output is correct
33 Correct 349 ms 33248 KB Output is correct
34 Correct 693 ms 50012 KB Output is correct
35 Correct 547 ms 43100 KB Output is correct
36 Correct 443 ms 52184 KB Output is correct
37 Correct 505 ms 54872 KB Output is correct
38 Correct 554 ms 62924 KB Output is correct
39 Correct 296 ms 34788 KB Output is correct
40 Correct 651 ms 57856 KB Output is correct
41 Correct 735 ms 58092 KB Output is correct
42 Correct 797 ms 62404 KB Output is correct
43 Correct 324 ms 36964 KB Output is correct
44 Correct 750 ms 43692 KB Output is correct
45 Correct 506 ms 53860 KB Output is correct
46 Correct 423 ms 52692 KB Output is correct
47 Correct 500 ms 54360 KB Output is correct
48 Correct 1100 ms 82992 KB Output is correct