oj.uz

Submission #718446

# Submission time Handle Problem Language Result Execution time Memory
718446 2023-04-04T05:44:11 Z Kalashnikov Robot (JOI21_ho_t4) C++17
100 / 100
 209 ms 38168 KB 
#include <bits/stdc++.h>
 
#define ios ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define file(s) if (fopen(s".in", "r")) freopen(s".in", "r", stdin), freopen(s".out", "w", stdout)
#define all(a) a.begin() , a.end()
#define F first
#define S second
 
using namespace std;
using ll = long long;
 #define int ll
const int N = 2e5+5 , inf = 2e9 + 7;
const ll INF = 1e18 ,   mod = 1e9+7 , P = 6547;

map<int,vector<pair<int,int>>> mp[N];
vector<array<int,3>> g[N];
ll sum[N];
ll mn[N];

void solve(int tc) {
	int n, m;
	cin >> n >> m;
	vector<array<int,4>> vec;
	for(int i = 1; i <= m; i ++) {
		int a, b,c, p;
		cin >> a >> b >> c >> p;
		g[a].push_back({b,c,p});
		g[b].push_back({a,c,p});
	}
	set<pair<ll,int>> st;
	vector<ll> d(n+1,INF);
	fill(mn, mn+m+1, INF);
	d[1] = 0;
	st.insert({0, 1});
	while(st.size()) {
		pair<int,int> cur = *st.begin();
		st.erase(cur);
		int v = cur.S;
		for(auto to: g[v]) {
			sum[to[1]] += to[2];
			mn[to[1]] = min(mn[to[1]], d[to[0]]);
		}
		for(auto to: g[v]) {
			if(cur.F + min(to[2] , sum[to[1]]-to[2]) < d[to[0]]) {
				st.erase({d[to[0]], to[0]});
				d[to[0]] = cur.F + min(to[2] , sum[to[1]]-to[2]);
				st.insert({d[to[0]], to[0]});
			}
			if(mn[to[1]] + sum[to[1]]-to[2] < d[to[0]]) {
				st.erase({d[to[0]], to[0]});
				d[to[0]] = mn[to[1]] + sum[to[1]]-to[2];
				st.insert({d[to[0]], to[0]});
			}
		}
		for(auto to: g[v]) {
			sum[to[1]] = 0;
			mn[to[1]] = INF;
		}
	}
	
	if(d[n] == INF) d[n] = -1;
	cout << d[n];
}
/*
*/
main() {
    ios;
    int tt = 1 , tc = 0;
    // cin >> tt;
    while(tt --) {
        solve(++tc);
    }
    return 0;
}

Compilation message

Main.cpp:66:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   66 | main() {
      | ^~~~

Subtask #1
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 14420 KB Output is correct
2 Correct 7 ms 14420 KB Output is correct
3 Correct 7 ms 14420 KB Output is correct
4 Correct 7 ms 14396 KB Output is correct
5 Correct 7 ms 14420 KB Output is correct
6 Correct 7 ms 14420 KB Output is correct
7 Correct 8 ms 14420 KB Output is correct
8 Correct 8 ms 14420 KB Output is correct
9 Correct 8 ms 14548 KB Output is correct
10 Correct 8 ms 14536 KB Output is correct
11 Correct 8 ms 14548 KB Output is correct
12 Correct 7 ms 14548 KB Output is correct
13 Correct 8 ms 14548 KB Output is correct
14 Correct 8 ms 14628 KB Output is correct
15 Correct 7 ms 14420 KB Output is correct
16 Correct 9 ms 14548 KB Output is correct
17 Correct 9 ms 14548 KB Output is correct
18 Correct 8 ms 14420 KB Output is correct
19 Correct 8 ms 14548 KB Output is correct
20 Correct 9 ms 14548 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 55 ms 21516 KB Output is correct
2 Correct 29 ms 17596 KB Output is correct
3 Correct 71 ms 26172 KB Output is correct
4 Correct 43 ms 19264 KB Output is correct
5 Correct 156 ms 32692 KB Output is correct
6 Correct 161 ms 35548 KB Output is correct
7 Correct 163 ms 38168 KB Output is correct
8 Correct 176 ms 35460 KB Output is correct
9 Correct 186 ms 35400 KB Output is correct
10 Correct 105 ms 27344 KB Output is correct
11 Correct 64 ms 24276 KB Output is correct

Subtask #3
42.0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 14420 KB Output is correct
2 Correct 7 ms 14420 KB Output is correct
3 Correct 7 ms 14420 KB Output is correct
4 Correct 7 ms 14396 KB Output is correct
5 Correct 7 ms 14420 KB Output is correct
6 Correct 7 ms 14420 KB Output is correct
7 Correct 8 ms 14420 KB Output is correct
8 Correct 8 ms 14420 KB Output is correct
9 Correct 8 ms 14548 KB Output is correct
10 Correct 8 ms 14536 KB Output is correct
11 Correct 8 ms 14548 KB Output is correct
12 Correct 7 ms 14548 KB Output is correct
13 Correct 8 ms 14548 KB Output is correct
14 Correct 8 ms 14628 KB Output is correct
15 Correct 7 ms 14420 KB Output is correct
16 Correct 9 ms 14548 KB Output is correct
17 Correct 9 ms 14548 KB Output is correct
18 Correct 8 ms 14420 KB Output is correct
19 Correct 8 ms 14548 KB Output is correct
20 Correct 9 ms 14548 KB Output is correct
21 Correct 55 ms 21516 KB Output is correct
22 Correct 29 ms 17596 KB Output is correct
23 Correct 71 ms 26172 KB Output is correct
24 Correct 43 ms 19264 KB Output is correct
25 Correct 156 ms 32692 KB Output is correct
26 Correct 161 ms 35548 KB Output is correct
27 Correct 163 ms 38168 KB Output is correct
28 Correct 176 ms 35460 KB Output is correct
29 Correct 186 ms 35400 KB Output is correct
30 Correct 105 ms 27344 KB Output is correct
31 Correct 64 ms 24276 KB Output is correct
32 Correct 69 ms 29540 KB Output is correct
33 Correct 98 ms 26964 KB Output is correct
34 Correct 146 ms 30624 KB Output is correct
35 Correct 140 ms 27844 KB Output is correct
36 Correct 128 ms 28344 KB Output is correct
37 Correct 145 ms 31416 KB Output is correct
38 Correct 160 ms 37952 KB Output is correct
39 Correct 103 ms 34584 KB Output is correct
40 Correct 195 ms 36760 KB Output is correct
41 Correct 209 ms 36880 KB Output is correct
42 Correct 193 ms 35016 KB Output is correct
43 Correct 74 ms 25032 KB Output is correct
44 Correct 112 ms 36700 KB Output is correct
45 Correct 152 ms 30960 KB Output is correct
46 Correct 121 ms 30284 KB Output is correct
47 Correct 148 ms 31924 KB Output is correct
48 Correct 208 ms 37860 KB Output is correct