oj.uz

Submission #416241

# Submission time Handle Problem Language Result Execution time Memory
416241 2021-06-02T08:19:45 Z alishahali1382 Robot (JOI21_ho_t4) C++14
0 / 100
 3000 ms 45328 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<int, 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];
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) ans=min(ans, dist[st]);
		for (int i:G[v]){
			upd(i<<1 | 1, dist[st]+P[i]);
			if (last){
				if (C[id]==C[i]){
					upd(i<<1, dist[st]+P2[i]-P[i]-P[id]);
				}
				else{
					upd(i<<1, dist[st]+P2[i]-P[i]);	
				}
			}
			else{
				if (C[id]==C[i]){
//					upd(i<<1, dist[st]+P2[i]-P[i]-P[id]);
				}
				else{
					upd(i<<1, dist[st]+P2[i]-P[i]);	
				}
			}
		}
	}
	if (ans>=INF) ans=-1;
	cout<<ans<<"\n";
	
	return 0;
}

Subtask #1
0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 25292 KB Output is correct
2 Correct 15 ms 25292 KB Output is correct
3 Correct 15 ms 25292 KB Output is correct
4 Correct 16 ms 25344 KB Output is correct
5 Correct 16 ms 25380 KB Output is correct
6 Incorrect 16 ms 25404 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #2
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 330 ms 32940 KB Output is correct
2 Correct 88 ms 28988 KB Output is correct
3 Correct 980 ms 38428 KB Output is correct
4 Correct 165 ms 30268 KB Output is correct
5 Execution timed out 3075 ms 45328 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 25292 KB Output is correct
2 Correct 15 ms 25292 KB Output is correct
3 Correct 15 ms 25292 KB Output is correct
4 Correct 16 ms 25344 KB Output is correct
5 Correct 16 ms 25380 KB Output is correct
6 Incorrect 16 ms 25404 KB Output isn't correct
7 Halted 0 ms 0 KB -