oj.uz

Submission #321571

# Submission time Handle Problem Language Result Execution time Memory
321571 2020-11-12T18:53:26 Z YJU Olympic Bus (JOI20_ho_t4) C++14
37 / 100
 1000 ms 5100 KB 
#include<bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll,int> pll;
const ll MOD=1e9+7;
const ll MOD2=998244353;
const ll N=2e2+5;
const ll M=5e5+5;
const ld pi=3.14159265359;
const ll INF=(1LL<<59);
#define SQ(i) ((i)*(i))
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define pb push_back
#define mp make_pair
#define X first
#define Y second
#define setp setprecision
#define lwb lower_bound
#define SZ(_a) (ll)_a.size()

pll ed[M];
ll n,m,c[M],d[M],x,y,ans,ck=1;
vector<pll> v[N],rv[N];
ll dis[2][N],rdis[2][N],from[2][N];
ll dist[2][N],rdist[2][N];

priority_queue<pll,vector<pll> ,greater<pll> > pq;

void dij(ll id,ll no){
	REP1(i,n)dist[id][i]=rdist[id][i]=INF;
	x=(id?n:1);
	pq.push(mp(dist[id][x]=0,x));
	while(SZ(pq)){
		x=pq.top().Y;y=pq.top().X;pq.pop();
		if(y!=dist[id][x])continue;
		for(auto i:v[x]){
			if(i.Y==no)continue;
			if(dist[id][i.X]>dist[id][x]+c[i.Y]){
				pq.push(mp(dist[id][i.X]=dist[id][x]+c[i.Y],i.X));
			}
		}
	}
	x=(!id?n:1);
	pq.push(mp(rdist[id][x]=0,x));
	while(SZ(pq)){
		x=pq.top().Y;y=pq.top().X;pq.pop();
		if(y!=rdist[id][x])continue;
		for(auto i:rv[x]){
			if(i.Y==no)continue;
			if(rdist[id][i.X]>rdist[id][x]+c[i.Y]){
				pq.push(mp(rdist[id][i.X]=rdist[id][x]+c[i.Y],i.X));
			}
		}
	}
}

void path(ll id){
	REP1(i,n)dis[id][i]=rdis[id][i]=INF;
	x=(id?n:1);
	pq.push(mp(dis[id][x]=0,x));
	while(SZ(pq)){
		x=pq.top().Y;y=pq.top().X;pq.pop();
		if(y!=dis[id][x])continue;
		for(auto i:v[x]){
			if(dis[id][i.X]>dis[id][x]+c[i.Y]){
				from[id][i.X]=i.Y;
				pq.push(mp(dis[id][i.X]=dis[id][x]+c[i.Y],i.X));
			}
		}
	}
	x=(!id?n:1);
	pq.push(mp(rdis[id][x]=0,x));
	while(SZ(pq)){
		x=pq.top().Y;y=pq.top().X;pq.pop();
		if(y!=rdis[id][x])continue;
		for(auto i:rv[x]){
			if(rdis[id][i.X]>rdis[id][x]+c[i.Y]){
				pq.push(mp(rdis[id][i.X]=rdis[id][x]+c[i.Y],i.X));
			}
		}
	}
}

int main(){
	ios_base::sync_with_stdio(0);cin.tie(0);
	cin>>n>>m;
	REP1(i,m){
		cin>>ed[i].X>>ed[i].Y>>c[i]>>d[i];
		v[ed[i].X].pb(mp(ed[i].Y,i));
		rv[ed[i].Y].pb(mp(ed[i].X,i));
	}
	path(0);
	path(1);
	ans=dis[0][n]+dis[1][1];
	/*REP1(i,n){
		cout<<"1::"<<dis[0][i]<<" "<<rdis[0][i]<<"\n";
		cout<<"N::"<<dis[1][i]<<" "<<rdis[1][i]<<"\n";
	}*/
	REP1(i,m){
		ll res=d[i];
		if(from[0][ed[i].Y]==i){
			dij(0,i);
			res+=min(dist[0][n],dist[0][ed[i].Y]+c[i]+rdist[0][ed[i].X]);
		}else{
			res+=min(dis[0][n],dis[0][ed[i].Y]+c[i]+rdis[0][ed[i].X]);
		}
		if(from[1][ed[i].Y]==i){
			dij(1,i);
			res+=min(dist[1][1],dist[1][ed[i].Y]+c[i]+rdist[1][ed[i].X]);
		}else{
			res+=min(dis[1][1],dis[1][ed[i].Y]+c[i]+rdis[1][ed[i].X]);
		}
		ans=min(ans,res);
	}
	cout<<(ans>=INF?-1:ans)<<"\n";
	return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 492 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 24 ms 492 KB Output is correct
4 Correct 26 ms 492 KB Output is correct
5 Correct 2 ms 492 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 0 ms 364 KB Output is correct
8 Correct 0 ms 364 KB Output is correct
9 Correct 1 ms 492 KB Output is correct
10 Correct 35 ms 492 KB Output is correct
11 Correct 35 ms 492 KB Output is correct
12 Correct 36 ms 492 KB Output is correct
13 Correct 5 ms 492 KB Output is correct
14 Correct 14 ms 492 KB Output is correct
15 Correct 13 ms 492 KB Output is correct
16 Correct 14 ms 492 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 213 ms 4716 KB Output is correct
2 Correct 214 ms 4588 KB Output is correct
3 Correct 213 ms 4844 KB Output is correct
4 Correct 24 ms 620 KB Output is correct
5 Correct 12 ms 492 KB Output is correct
6 Correct 1 ms 492 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 58 ms 4588 KB Output is correct
10 Correct 56 ms 4716 KB Output is correct
11 Correct 148 ms 4716 KB Output is correct
12 Correct 136 ms 4716 KB Output is correct
13 Correct 136 ms 4844 KB Output is correct
14 Correct 133 ms 5100 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 492 KB Output is correct
2 Correct 2 ms 364 KB Output is correct
3 Correct 116 ms 3436 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 146 ms 4588 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 44 ms 4588 KB Output is correct
9 Correct 46 ms 4460 KB Output is correct
10 Correct 100 ms 4588 KB Output is correct
11 Correct 99 ms 4588 KB Output is correct
12 Correct 105 ms 4716 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 102 ms 4716 KB Output is correct
20 Correct 102 ms 4716 KB Output is correct
21 Correct 104 ms 4588 KB Output is correct
22 Correct 101 ms 4588 KB Output is correct

Subtask #4
0 / 63.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 492 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 24 ms 492 KB Output is correct
4 Correct 26 ms 492 KB Output is correct
5 Correct 2 ms 492 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 0 ms 364 KB Output is correct
8 Correct 0 ms 364 KB Output is correct
9 Correct 1 ms 492 KB Output is correct
10 Correct 35 ms 492 KB Output is correct
11 Correct 35 ms 492 KB Output is correct
12 Correct 36 ms 492 KB Output is correct
13 Correct 5 ms 492 KB Output is correct
14 Correct 14 ms 492 KB Output is correct
15 Correct 13 ms 492 KB Output is correct
16 Correct 14 ms 492 KB Output is correct
17 Correct 213 ms 4716 KB Output is correct
18 Correct 214 ms 4588 KB Output is correct
19 Correct 213 ms 4844 KB Output is correct
20 Correct 24 ms 620 KB Output is correct
21 Correct 12 ms 492 KB Output is correct
22 Correct 1 ms 492 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 58 ms 4588 KB Output is correct
26 Correct 56 ms 4716 KB Output is correct
27 Correct 148 ms 4716 KB Output is correct
28 Correct 136 ms 4716 KB Output is correct
29 Correct 136 ms 4844 KB Output is correct
30 Correct 133 ms 5100 KB Output is correct
31 Correct 16 ms 492 KB Output is correct
32 Correct 2 ms 364 KB Output is correct
33 Correct 116 ms 3436 KB Output is correct
34 Correct 1 ms 364 KB Output is correct
35 Correct 146 ms 4588 KB Output is correct
36 Correct 1 ms 364 KB Output is correct
37 Correct 1 ms 364 KB Output is correct
38 Correct 44 ms 4588 KB Output is correct
39 Correct 46 ms 4460 KB Output is correct
40 Correct 100 ms 4588 KB Output is correct
41 Correct 99 ms 4588 KB Output is correct
42 Correct 105 ms 4716 KB Output is correct
43 Correct 1 ms 364 KB Output is correct
44 Correct 1 ms 364 KB Output is correct
45 Correct 1 ms 364 KB Output is correct
46 Correct 1 ms 364 KB Output is correct
47 Correct 1 ms 364 KB Output is correct
48 Correct 1 ms 364 KB Output is correct
49 Correct 102 ms 4716 KB Output is correct
50 Correct 102 ms 4716 KB Output is correct
51 Correct 104 ms 4588 KB Output is correct
52 Correct 101 ms 4588 KB Output is correct
53 Correct 236 ms 4668 KB Output is correct
54 Correct 234 ms 4600 KB Output is correct
55 Correct 226 ms 4588 KB Output is correct
56 Correct 24 ms 492 KB Output is correct
57 Correct 26 ms 620 KB Output is correct
58 Correct 195 ms 3692 KB Output is correct
59 Correct 205 ms 3564 KB Output is correct
60 Correct 206 ms 3692 KB Output is correct
61 Correct 187 ms 3564 KB Output is correct
62 Correct 197 ms 3692 KB Output is correct
63 Correct 200 ms 3692 KB Output is correct
64 Execution timed out 1084 ms 4328 KB Time limit exceeded
65 Halted 0 ms 0 KB -