oj.uz

Submission #450199

# Submission time Handle Problem Language Result Execution time Memory
450199 2021-08-02T12:06:27 Z Mestu Robot (JOI21_ho_t4) C++14
100 / 100
 592 ms 125488 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vi vector<int>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vvi vector<vi>
#define vll vector<ll>
#define vvll vector<vector<ll>>
#define vpii vector<pair<int,int>>
#define vpll vector<pair<ll,ll>>
#define vb vector<bool>
#define vs vector<string>
///............x...........///
#define all(a) a.begin(), a.end()
#define allr(a) a.rbegin(), a.rend()
#define mp(a, b) make_pair(a, b)
#define pb push_back
#define ff first
#define ss second
#define bg begin()
#define UNIQUE(X) (X).erase(unique(all(X)), (X).end())
#define ft cout << "for test"<<endl;
#define read(v, a, n) for (int i = a; i<n; i++)cin>>v[i];
#define print(v) for (auto it : v)cout << it<<' ';cout << endl;
#define PI acos(-1.0)
#define yes cout <<"Yes"<< endl
#define no cout<<"No"<<endl
#define FIO ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define t_c int test, cs = 1;cin>>test;while (test--)
#define casep cout<<"Case"<< cs++<<": ";
///................function.....................///

#define D(a) (double)(a)
#define sqr(a) (a * a)
#define siz(s) (int)(s.size())
#define max3(a, b, c) max(a, max(b, c))
#define min3(a, b, c) min(a, min(b, c))
#define Min(a) *min_element(all(a))
///#define mod 1000000007
///.........Graph.........///
int X[] = {1, -1, 0, 0};
int Y[] = {0, 0, 1, -1};
///........constant........///
const ll N = 2e6+5;
const ll inf = 4e18;

int main(){
	FIO;
	ll n,m,i,j;
	cin>>n>>m;
	vector<vector<pair<ll,pll>>>v(n+1);
	vector<vpll>g(N);
	ll a,b,c,p;
	for(i=0; i<m; i++){
		cin>>a>>b>>c>>p;
		v[a].pb(mp(c,mp(p,b)));
		v[b].pb(mp(c,mp(p,a)));
	}
	ll extra=n;
	for(i=1; i<n; i++){
		ll tmp_sz = siz(v[i]);
		if(tmp_sz==0)continue;
		sort(all(v[i]));
		for(ll l=0,r=0; r<tmp_sz ; l=r){

			ll sum=0;
			while(r<tmp_sz and v[i][l].ff == v[i][r].ff)sum +=v[i][r++].ss.ff;

			if(r-l==1)g[i].pb({0,v[i][l].ss.ss});
			else{
				g[i].pb({0,++extra});
				for(j=l; j<r; j++){
					int node = v[i][j].ss.ss,cost = v[i][j].ss.ff;

					g[i].pb({cost,node});
					g[node].pb({0,extra});
					g[extra].pb({sum-cost,node});
				}
			}
		}
	}
	vll dis(N,inf);
	priority_queue<pll>pq;
	pq.push({0ll,1ll});
	while(!pq.empty()){
		pll u = pq.top();
		pq.pop();
		if(dis[u.ss] != inf)continue;
		dis[u.ss] = (ll)(-u.ff);
		for(auto to:g[u.ss]){
			pq.push({(ll)(u.ff-to.ff),(ll)(to.ss)});
		}
	}
	cout<<((dis[n]==inf)?-1:dis[n])<<endl;

}

Subtask #1
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 62832 KB Output is correct
2 Correct 34 ms 62924 KB Output is correct
3 Correct 34 ms 62884 KB Output is correct
4 Correct 34 ms 62940 KB Output is correct
5 Correct 36 ms 62976 KB Output is correct
6 Correct 34 ms 62928 KB Output is correct
7 Correct 35 ms 63172 KB Output is correct
8 Correct 35 ms 63092 KB Output is correct
9 Correct 38 ms 63488 KB Output is correct
10 Correct 38 ms 63540 KB Output is correct
11 Correct 40 ms 63640 KB Output is correct
12 Correct 39 ms 63556 KB Output is correct
13 Correct 37 ms 63616 KB Output is correct
14 Correct 38 ms 63576 KB Output is correct
15 Correct 37 ms 63172 KB Output is correct
16 Correct 38 ms 63428 KB Output is correct
17 Correct 41 ms 63300 KB Output is correct
18 Correct 36 ms 63048 KB Output is correct
19 Correct 37 ms 63568 KB Output is correct
20 Correct 38 ms 63188 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 241 ms 84392 KB Output is correct
2 Correct 109 ms 72456 KB Output is correct
3 Correct 364 ms 100544 KB Output is correct
4 Correct 158 ms 76664 KB Output is correct
5 Correct 428 ms 115168 KB Output is correct
6 Correct 455 ms 114712 KB Output is correct
7 Correct 408 ms 122536 KB Output is correct
8 Correct 536 ms 111856 KB Output is correct
9 Correct 566 ms 111972 KB Output is correct
10 Correct 334 ms 92456 KB Output is correct
11 Correct 188 ms 85952 KB Output is correct

Subtask #3
42.0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 62832 KB Output is correct
2 Correct 34 ms 62924 KB Output is correct
3 Correct 34 ms 62884 KB Output is correct
4 Correct 34 ms 62940 KB Output is correct
5 Correct 36 ms 62976 KB Output is correct
6 Correct 34 ms 62928 KB Output is correct
7 Correct 35 ms 63172 KB Output is correct
8 Correct 35 ms 63092 KB Output is correct
9 Correct 38 ms 63488 KB Output is correct
10 Correct 38 ms 63540 KB Output is correct
11 Correct 40 ms 63640 KB Output is correct
12 Correct 39 ms 63556 KB Output is correct
13 Correct 37 ms 63616 KB Output is correct
14 Correct 38 ms 63576 KB Output is correct
15 Correct 37 ms 63172 KB Output is correct
16 Correct 38 ms 63428 KB Output is correct
17 Correct 41 ms 63300 KB Output is correct
18 Correct 36 ms 63048 KB Output is correct
19 Correct 37 ms 63568 KB Output is correct
20 Correct 38 ms 63188 KB Output is correct
21 Correct 241 ms 84392 KB Output is correct
22 Correct 109 ms 72456 KB Output is correct
23 Correct 364 ms 100544 KB Output is correct
24 Correct 158 ms 76664 KB Output is correct
25 Correct 428 ms 115168 KB Output is correct
26 Correct 455 ms 114712 KB Output is correct
27 Correct 408 ms 122536 KB Output is correct
28 Correct 536 ms 111856 KB Output is correct
29 Correct 566 ms 111972 KB Output is correct
30 Correct 334 ms 92456 KB Output is correct
31 Correct 188 ms 85952 KB Output is correct
32 Correct 327 ms 110932 KB Output is correct
33 Correct 311 ms 98364 KB Output is correct
34 Correct 425 ms 103532 KB Output is correct
35 Correct 364 ms 98744 KB Output is correct
36 Correct 408 ms 107468 KB Output is correct
37 Correct 437 ms 116336 KB Output is correct
38 Correct 421 ms 124700 KB Output is correct
39 Correct 427 ms 113712 KB Output is correct
40 Correct 537 ms 113728 KB Output is correct
41 Correct 592 ms 114044 KB Output is correct
42 Correct 550 ms 112328 KB Output is correct
43 Correct 235 ms 89724 KB Output is correct
44 Correct 534 ms 125488 KB Output is correct
45 Correct 419 ms 100804 KB Output is correct
46 Correct 364 ms 98812 KB Output is correct
47 Correct 467 ms 110368 KB Output is correct
48 Correct 511 ms 121908 KB Output is correct