oj.uz

Submission #416286

# Submission time Handle Problem Language Result Execution time Memory
416286 2021-06-02T09:26:04 Z alishahali1382 Robot (JOI21_ho_t4) C++14
34 / 100
 3000 ms 49780 KB 
#include <bits/stdc++.h>
#pragma GCC optimize ("O2,unroll-loops")
//#pragma GCC optimize("no-stack-protector,fast-math")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<pii, int> piii;
typedef pair<ll, int> pll;
#define debug(x) cerr<<#x<<'='<<(x)<<endl;
#define debugp(x) cerr<<#x<<"= {"<<(x.first)<<", "<<(x.second)<<"}"<<endl;
#define debug2(x, y) cerr<<"{"<<#x<<", "<<#y<<"} = {"<<(x)<<", "<<(y)<<"}"<<endl;
#define debugv(v) {cerr<<#v<<" : ";for (auto x:v) cerr<<x<<' ';cerr<<endl;}
#define all(x) x.begin(), x.end()
#define pb push_back
#define kill(x) return cout<<x<<'\n', 0;

const int inf=1000000010;
const ll INF=1000000000000001000LL;
const int mod=1000000007;
const int MAXN=800010, LOG=20;

int n, m, k, u, v, x, y, t, a, b;
int A[MAXN], B[MAXN], C[MAXN], P[MAXN];
ll P2[MAXN], sum[MAXN];
ll dist[MAXN], ans;
bool mark[MAXN];
int col[MAXN];
vector<int> G[MAXN];
priority_queue<pll, vector<pll>, greater<pll>> pq;

inline void upd(int v, ll d){ if (dist[v]>d) pq.push({dist[v]=d, v});}

int main(){
	ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	//freopen("input.txt", "r", stdin);
	//freopen("output.txt", "w", stdout);
	cin>>n>>m;
	for (int i=0; i<2*m; i++){
		cin>>u>>v>>x>>y;
		A[i]=u, B[i]=v, C[i]=x, P[i]=y, G[u].pb(i);
		swap(u, v);
		i++;
		A[i]=u, B[i]=v, C[i]=x, P[i]=y, G[u].pb(i);
	}
	for (int i=1; i<=n; i++){
		for (int j:G[i]) sum[C[j]]=0;
		for (int j:G[i]) sum[C[j]]+=P[j];
		for (int j:G[i]) P2[j]+=sum[C[j]];
	}
	memset(dist, 63, sizeof(dist));
	for (int i:G[1]){
		upd(i<<1, P2[i]-P[i]);
		upd(i<<1 | 1, P[i]);
	}
	ans=INF;
	while (pq.size()){
		int st=pq.top().second;
		pq.pop();
		if (mark[st]) continue ;
		mark[st]=1;
		int id=(st>>1), last=(st&1);
		int v=B[id];
		if (v==n) kill(dist[st]);
		if (!col[v]){
			for (int i:G[v]){
				upd(i<<1 | 1, dist[st]+P[i]);
				if (C[id]!=C[i]) upd(i<<1, dist[st]+P2[i]-P[i]);
				else if (last) upd(i<<1, dist[st]+P2[i]-P[i]-P[id]);
			}
			col[v]=C[id];
			continue ;
		}
		else if (col[v]!=C[id]){
			for (int i:G[v]){
				if (C[id]!=C[i]) upd(i<<1, dist[st]+P2[i]-P[i]);
				else if (last) upd(i<<1, dist[st]+P2[i]-P[i]-P[id]);
			}
		}
		else{
			for (int i:G[v]){
				if (C[id]==C[i] && last) upd(i<<1, dist[st]+P2[i]-P[i]-P[id]);
			}
		}
		
	}
	if (ans>=INF) ans=-1;
	cout<<ans<<"\n";
	
	return 0;
}

Subtask #1
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 25420 KB Output is correct
2 Correct 15 ms 25300 KB Output is correct
3 Correct 16 ms 25312 KB Output is correct
4 Correct 15 ms 25424 KB Output is correct
5 Correct 15 ms 25360 KB Output is correct
6 Correct 15 ms 25408 KB Output is correct
7 Correct 16 ms 25492 KB Output is correct
8 Correct 16 ms 25420 KB Output is correct
9 Correct 25 ms 25728 KB Output is correct
10 Correct 23 ms 25676 KB Output is correct
11 Correct 25 ms 25704 KB Output is correct
12 Correct 19 ms 25548 KB Output is correct
13 Correct 23 ms 25804 KB Output is correct
14 Correct 24 ms 25724 KB Output is correct
15 Correct 18 ms 25420 KB Output is correct
16 Correct 18 ms 25492 KB Output is correct
17 Correct 18 ms 25548 KB Output is correct
18 Correct 16 ms 25420 KB Output is correct
19 Correct 18 ms 25740 KB Output is correct
20 Correct 16 ms 25420 KB Output is correct

Subtask #2
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 138 ms 35120 KB Output is correct
2 Correct 74 ms 30088 KB Output is correct
3 Correct 97 ms 34500 KB Output is correct
4 Correct 58 ms 30296 KB Output is correct
5 Execution timed out 3069 ms 49780 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #3
0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 25420 KB Output is correct
2 Correct 15 ms 25300 KB Output is correct
3 Correct 16 ms 25312 KB Output is correct
4 Correct 15 ms 25424 KB Output is correct
5 Correct 15 ms 25360 KB Output is correct
6 Correct 15 ms 25408 KB Output is correct
7 Correct 16 ms 25492 KB Output is correct
8 Correct 16 ms 25420 KB Output is correct
9 Correct 25 ms 25728 KB Output is correct
10 Correct 23 ms 25676 KB Output is correct
11 Correct 25 ms 25704 KB Output is correct
12 Correct 19 ms 25548 KB Output is correct
13 Correct 23 ms 25804 KB Output is correct
14 Correct 24 ms 25724 KB Output is correct
15 Correct 18 ms 25420 KB Output is correct
16 Correct 18 ms 25492 KB Output is correct
17 Correct 18 ms 25548 KB Output is correct
18 Correct 16 ms 25420 KB Output is correct
19 Correct 18 ms 25740 KB Output is correct
20 Correct 16 ms 25420 KB Output is correct
21 Correct 138 ms 35120 KB Output is correct
22 Correct 74 ms 30088 KB Output is correct
23 Correct 97 ms 34500 KB Output is correct
24 Correct 58 ms 30296 KB Output is correct
25 Execution timed out 3069 ms 49780 KB Time limit exceeded
26 Halted 0 ms 0 KB -