oj.uz

Submission #484821

# Submission time Handle Problem Language Result Execution time Memory
484821 2021-11-05T14:50:50 Z BackNoob Robot (JOI21_ho_t4) C++14
34 / 100
 3000 ms 37292 KB 
#include <bits/stdc++.h>
#define ll long long
#define fi first
#define se second
#define endl '\n'
#define MASK(i) (1LL << (i))
#define ull unsigned long long
#define ld long double
#define pb push_back
#define all(x) (x).begin() , (x).end()
#define BIT(x , i) ((x >> (i)) & 1) 
#define TASK "task"
#define sz(s) (int) (s).size()
 
using namespace std;
const int mxN = 3e5 + 227;
const int inf = 1e9 + 277;
const int mod = 1e9 + 7;
const ll infll = 1e18 + 7;
const int base = 307;
const int LOG = 20;
 
template <typename T1, typename T2> bool minimize(T1 &a, T2 b) {
	if (a > b) {a = b; return true;} return false;
}
template <typename T1, typename T2> bool maximize(T1 &a, T2 b) {
	if (a < b) {a = b; return true;} return false;
}
 
struct item{
	int u;
	int pre;
	ll d;
};
 
struct cmp{
	bool operator()(const item &a , const item &b)
	{
		return a.d > b.d;
	}
};
 
struct EDGE{
	int v , color , cost;
};
 
int n , m;
vector<EDGE> adj[mxN];
ll dist[mxN];
map<int , ll> dp[mxN];
int cnt[mxN];
ll sumcost[mxN];
 
void solve()
{
	cin >> n >> m;
	for(int i = 1 ; i <= m ; i++) {
		int u , v , color , cost;
		cin >> u >> v >> color >> cost;
		adj[u].pb({v , color , cost});
		adj[v].pb({u , color , cost});
	}
 	
	memset(dist , 0x3f , sizeof(dist));
	priority_queue<item , vector<item> , cmp> pq;
	pq.push({1 , 0 , dist[1] = 0});
	while(!pq.empty()) {
		int u , pre;
		ll d;
		u = pq.top().u;
		pre = pq.top().pre;
		d = pq.top().d;
		pq.pop();
 
		if(pre == 0 && dist[u] != d) continue;
		if(pre != 0 && dp[u][pre] != d) continue;
 
		for(auto it : adj[u]) sumcost[it.color] += it.cost;
 
		if(pre == 0) {
			for(auto it : adj[u]) {
				if(!dp[it.v].count(it.color) || dp[it.v][it.color] > d) {
					dp[it.v][it.color] = d;
					pq.push({it.v , it.color , d});
				}
				if(minimize(dist[it.v] , d + sumcost[it.color] - it.cost) == true) {
					pq.push({it.v , 0 , d + sumcost[it.color] - it.cost});
				}
				if(minimize(dist[it.v] , d + it.cost) == true) {
					pq.push({it.v , 0 , d + it.cost});
				}
			}
		}
		if(pre != 0) {
			for(auto it : adj[u]) {
				if(it.color != pre) continue;
				if(minimize(dist[it.v] , d + sumcost[it.color] - it.cost) == true) {
					pq.push({it.v , 0 , d + sumcost[it.color] - it.cost});
				}
			}
		}
 
		for(auto it : adj[u]) sumcost[it.color] -= it.cost;
	}
	ll ans = dist[n];
	if(ans == dist[0]) cout << -1;
	else cout << ans;
}
 
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    //freopen(TASK".inp" , "r" , stdin);
    //freopen(TASK".out" , "w" , stdout);
    
    int tc = 1;
    //cin >> tc;
    while(tc--) {
    	solve();
    }
    return 0;
}

Subtask #1
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 23712 KB Output is correct
2 Correct 13 ms 23772 KB Output is correct
3 Correct 10 ms 23756 KB Output is correct
4 Correct 10 ms 23756 KB Output is correct
5 Correct 11 ms 23756 KB Output is correct
6 Correct 11 ms 23756 KB Output is correct
7 Correct 11 ms 23808 KB Output is correct
8 Correct 11 ms 23796 KB Output is correct
9 Correct 22 ms 24016 KB Output is correct
10 Correct 15 ms 24056 KB Output is correct
11 Correct 11 ms 23984 KB Output is correct
12 Correct 13 ms 23884 KB Output is correct
13 Correct 13 ms 24032 KB Output is correct
14 Correct 12 ms 24012 KB Output is correct
15 Correct 12 ms 23932 KB Output is correct
16 Correct 15 ms 24012 KB Output is correct
17 Correct 13 ms 24012 KB Output is correct
18 Correct 11 ms 23756 KB Output is correct
19 Correct 11 ms 24012 KB Output is correct
20 Correct 12 ms 23884 KB Output is correct

Subtask #2
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 95 ms 33024 KB Output is correct
2 Correct 41 ms 28236 KB Output is correct
3 Correct 92 ms 33736 KB Output is correct
4 Correct 61 ms 29872 KB Output is correct
5 Execution timed out 3077 ms 37292 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #3
0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 23712 KB Output is correct
2 Correct 13 ms 23772 KB Output is correct
3 Correct 10 ms 23756 KB Output is correct
4 Correct 10 ms 23756 KB Output is correct
5 Correct 11 ms 23756 KB Output is correct
6 Correct 11 ms 23756 KB Output is correct
7 Correct 11 ms 23808 KB Output is correct
8 Correct 11 ms 23796 KB Output is correct
9 Correct 22 ms 24016 KB Output is correct
10 Correct 15 ms 24056 KB Output is correct
11 Correct 11 ms 23984 KB Output is correct
12 Correct 13 ms 23884 KB Output is correct
13 Correct 13 ms 24032 KB Output is correct
14 Correct 12 ms 24012 KB Output is correct
15 Correct 12 ms 23932 KB Output is correct
16 Correct 15 ms 24012 KB Output is correct
17 Correct 13 ms 24012 KB Output is correct
18 Correct 11 ms 23756 KB Output is correct
19 Correct 11 ms 24012 KB Output is correct
20 Correct 12 ms 23884 KB Output is correct
21 Correct 95 ms 33024 KB Output is correct
22 Correct 41 ms 28236 KB Output is correct
23 Correct 92 ms 33736 KB Output is correct
24 Correct 61 ms 29872 KB Output is correct
25 Execution timed out 3077 ms 37292 KB Time limit exceeded
26 Halted 0 ms 0 KB -