oj.uz

Submission #958854

# Submission time Handle Problem Language Result Execution time Memory
958854 2024-04-07T01:26:57 Z shadow_sami Robot (JOI21_ho_t4) C++17
100 / 100
 1167 ms 191436 KB 
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long int ll;
typedef vector<ll> vi;
typedef vector<vector<ll>> vvi;
typedef pair<ll,ll> pi;
typedef map<ll,ll> mi;
typedef long double ld;
typedef vector<ld> vd;
typedef vector<vector<ld>> vvd;
typedef pair<ld,ld> pd;
#define ff first
#define ss second
#define srt(a) sort(a.begin(),a.end());
#define fip(k, n) for (ll i = k; i < n; i++)
#define fjp(k, n) for (ll j = k; j < n; j++)
#define fin(k, n) for (ll i = k; i >= n; i--)
#define fjn(k, n) for (ll j = k; j >= n; j--)
#define fp(k, n, m) for (ll k = n; k < m; k++)
#define fn(k, n, m) for (ll k = n; k >= m; k--)
#define ordered_set tree<pi, null_type,less< pi >, rb_tree_tag,tree_order_statistics_node_update>
#define totalOne(n) __builtin_popcount(n)
#define backZero(n) __builtin_ctzll(n)
#define frontZero(n) __builtin_clzll(n)
#define fx(k) for ( auto x : k )
#define test ll t;cin >> t;while (t--)
#define nli "\n"

// ==========================(debug)============================================================================================== //

#ifndef ONLINE_JUDGE
#define debug(x) cerr << #x <<" "; _printn(x); cerr << nli;
#else
#define debug(x)
#endif

void _printn(ll x){ cerr<<x<<" "; }
void _printn(int x){ cerr<<x<<" "; }
void _printn(ld x){ cerr<<x<<" "; }
void _printn(double x){ cerr<<x<<" "; }
void _printn(string x){ cerr<<x<<" "; }
void _printn(char x){ cerr<<x<<" "; }
void _printn(bool x){ cerr<<x<<" "; }
template<class T,class V>void _printn(pair<T,V> vv);
template<class T> void _printn(vector<T> vv);
template<class T> void _printn(set<T> vv);
template<class T,class V> void _printn(map<T,V> vv);
template<class T> void _printn(multiset<T> vv);
template<class T> void _printn(array<T,3> vv);
template<class T> void _printn(array<T,3> vv){ cerr<<"[ "; for(int i=0;i<3;i++){ _printn(vv[i]);cerr<<" "; } cerr<<"]"; };
template<class T,class V>void _printn(pair<T,V> vv){ cerr<<"( ";_printn(vv.ff);cerr<<",";_printn(vv.ss);cerr<<")";}
template<class T> void _printn(vector<T> vv){ cerr<<"[ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"]"; };
template<class T> void _printn(set<T> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };
template<class T> void _printn(multiset<T> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };
template<class T,class V> void _printn(map<T,V> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };

// ==========================(debug)============================================================================================== //

ll n,m,tp,tp2,res,cnt,sum,tptp,ans;
const ll mx = 5e5+5;
const ll mod = 1e9+7;

// ==========================(MOD)=============================================================================================== //

ll mod_add(ll aa,ll bb){ return ((aa%mod)+(bb%mod))%mod; }
ll mod_minus(ll aa,ll bb){ return (((aa%mod)-(bb%mod))+10*mod)%mod; }
ll mod_mul(ll aa,ll bb){ return ((aa%mod)*(bb%mod))%mod; }
ll mod_power(ll aa,ll bb){ aa%=mod; ll empowered = 1; bb%=mod-1; while(bb > 0){ if(bb & 1) empowered = mod_mul(empowered,aa); bb = bb >> 1; aa = mod_mul(aa,aa); } return empowered; }
ll mod_divi(ll aa,ll bb){ aa=mod_mul(aa,mod_power(bb,mod-2)); return aa; }

// ==========================(MOD)=============================================================================================== //

bool f = false;
map<ll,vector<array<ll,3>>> adj[mx];
priority_queue<array<ll,3>,vector<array<ll,3>>,greater<array<ll,3>>> pq;
ll sr,de,col,wet;
ll dp[mx];
map<ll,ll> mp[mx];
map<ll,ll> pref[mx];

int main(){
    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    // #ifndef ONLINE_JUDGE
    //     freopen("input1.txt", "r", stdin);
    //     freopen("output1.txt", "w", stdout);
    //     freopen("error1.txt", "w", stderr);
    // #endif // ONLINE_JUDGE

        cin>>n>>m;
        fip(0,n+2){
        	adj[i].clear();
        	dp[i] = 1e18;
        }
        fip(0,m){        	
        	cin>>sr>>de>>col>>wet;
        	adj[sr][col].push_back({de,col,wet});
        	adj[de][col].push_back({sr,col,wet});
        	pref[de][col] += wet;
        	pref[sr][col] += wet;
        }
        pq.push({0,1,0});
        vi v;
        while(pq.size()){
        	auto it = pq.top();
        	pq.pop();    
        	// debug(it);
        	// fip(1,n+1)
        	// 	cerr<<dp[i]<<" ";
        	// cerr<<nli;
        	if(it[2]){
        		if(mp[it[1]].count(it[2]))
	        		continue;
	        	mp[it[1]][it[2]] = it[0];
	        	fx(adj[it[1]][it[2]]){
	        		pq.push({it[0]+pref[it[1]][x[1]]-x[2],x[0],0});
	        	}
	        }else{
	        	if(dp[it[1]] <= it[0])
	        		continue;
	        	// debug(it[1]);
	        	dp[it[1]] = it[0];
	        	fx(adj[it[1]]){	        		
	        		for(auto y : x.ss){
	        			pq.push({it[0]+y[2],y[0],0});	        			
		        		pq.push({it[0]+pref[it[1]][y[1]]-y[2],y[0],0});
		        		pq.push({it[0],y[0],y[1]});		        		
		        	}
	        	}
	        }
	        // cerr<<nli;
        }
        if(dp[n]==1e18)
        	dp[n] = -1;
        cout<<dp[n]<<nli;
        
    cerr << "Time elapsed: " << setprecision(6) << 1000.0 * clock() / CLOCKS_PER_SEC << "ms\n";
    return 0;
}

Subtask #1
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 72532 KB Output is correct
2 Correct 15 ms 72732 KB Output is correct
3 Correct 20 ms 72736 KB Output is correct
4 Correct 16 ms 72540 KB Output is correct
5 Correct 15 ms 72796 KB Output is correct
6 Correct 16 ms 72776 KB Output is correct
7 Correct 17 ms 72980 KB Output is correct
8 Correct 16 ms 72796 KB Output is correct
9 Correct 20 ms 73560 KB Output is correct
10 Correct 22 ms 73564 KB Output is correct
11 Correct 19 ms 73540 KB Output is correct
12 Correct 18 ms 73308 KB Output is correct
13 Correct 19 ms 73508 KB Output is correct
14 Correct 18 ms 73504 KB Output is correct
15 Correct 17 ms 73052 KB Output is correct
16 Correct 18 ms 73052 KB Output is correct
17 Correct 17 ms 73308 KB Output is correct
18 Correct 15 ms 72792 KB Output is correct
19 Correct 19 ms 73412 KB Output is correct
20 Correct 18 ms 73052 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 289 ms 105752 KB Output is correct
2 Correct 115 ms 85840 KB Output is correct
3 Correct 426 ms 115940 KB Output is correct
4 Correct 169 ms 91428 KB Output is correct
5 Correct 1061 ms 164984 KB Output is correct
6 Correct 969 ms 156224 KB Output is correct
7 Correct 591 ms 139124 KB Output is correct
8 Correct 510 ms 113920 KB Output is correct
9 Correct 584 ms 113984 KB Output is correct
10 Correct 454 ms 119448 KB Output is correct
11 Correct 137 ms 94012 KB Output is correct

Subtask #3
42.0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 72532 KB Output is correct
2 Correct 15 ms 72732 KB Output is correct
3 Correct 20 ms 72736 KB Output is correct
4 Correct 16 ms 72540 KB Output is correct
5 Correct 15 ms 72796 KB Output is correct
6 Correct 16 ms 72776 KB Output is correct
7 Correct 17 ms 72980 KB Output is correct
8 Correct 16 ms 72796 KB Output is correct
9 Correct 20 ms 73560 KB Output is correct
10 Correct 22 ms 73564 KB Output is correct
11 Correct 19 ms 73540 KB Output is correct
12 Correct 18 ms 73308 KB Output is correct
13 Correct 19 ms 73508 KB Output is correct
14 Correct 18 ms 73504 KB Output is correct
15 Correct 17 ms 73052 KB Output is correct
16 Correct 18 ms 73052 KB Output is correct
17 Correct 17 ms 73308 KB Output is correct
18 Correct 15 ms 72792 KB Output is correct
19 Correct 19 ms 73412 KB Output is correct
20 Correct 18 ms 73052 KB Output is correct
21 Correct 289 ms 105752 KB Output is correct
22 Correct 115 ms 85840 KB Output is correct
23 Correct 426 ms 115940 KB Output is correct
24 Correct 169 ms 91428 KB Output is correct
25 Correct 1061 ms 164984 KB Output is correct
26 Correct 969 ms 156224 KB Output is correct
27 Correct 591 ms 139124 KB Output is correct
28 Correct 510 ms 113920 KB Output is correct
29 Correct 584 ms 113984 KB Output is correct
30 Correct 454 ms 119448 KB Output is correct
31 Correct 137 ms 94012 KB Output is correct
32 Correct 362 ms 115828 KB Output is correct
33 Correct 298 ms 113100 KB Output is correct
34 Correct 578 ms 132828 KB Output is correct
35 Correct 429 ms 111960 KB Output is correct
36 Correct 469 ms 133304 KB Output is correct
37 Correct 594 ms 133984 KB Output is correct
38 Correct 556 ms 136708 KB Output is correct
39 Correct 368 ms 120228 KB Output is correct
40 Correct 475 ms 115552 KB Output is correct
41 Correct 575 ms 115748 KB Output is correct
42 Correct 635 ms 133348 KB Output is correct
43 Correct 237 ms 108268 KB Output is correct
44 Correct 763 ms 128752 KB Output is correct
45 Correct 380 ms 109904 KB Output is correct
46 Correct 311 ms 109700 KB Output is correct
47 Correct 464 ms 133772 KB Output is correct
48 Correct 1167 ms 191436 KB Output is correct