oj.uz

Submission #705461

# Submission time Handle Problem Language Result Execution time Memory
705461 2023-03-04T12:41:39 Z blacktulip Olympic Bus (JOI20_ho_t4) C++17
100 / 100
 842 ms 13236 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long lo; 
typedef pair< lo,lo > PII;

#define fi first
#define se second
#define int long long
#define mp make_pair
#define endl "\n"
#define pb push_back
#define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define FOR for(int i=1;i<=n;i++)
#define mid ((start+end)/2)
#define ort ((bas+son)/2)

const lo inf = 10000000000000000;
const lo KOK = 100000;
const lo LOG = 30;
const lo li = 100005;
const lo mod = 1000000007;

int n,m,k,flag,t,y[li],z[li],c[li],d[li],dist[1005][1005],cur1[li],value,par[li],ekstra1,ekstra2,ekstra3,par1[li];
int cev;
bool vis[li],yolda[li],yolda1[li],yasak[li];
string s;
vector<pair<int,pair<int,int>>> v[li],rv[li];

inline int in(){
    int x;
    scanf("%lld",&x);
    return x;
}

inline void sp(bool cont){
	priority_queue<pair<int,int>> pq;
	pq.push({0,1});
	for(int i=1;i<=n;i++){vis[i]=0;cur1[i]=inf;}
	while(pq.size()){
		int node=pq.top().se;
		int co=-pq.top().fi;
		pq.pop();
		if(vis[node])continue;
		vis[node]=1;
		cur1[node]=co;
		for(auto go:v[node]){
			if(!vis[go.fi] && yasak[go.se.se]==0 && go.se.fi+co<cur1[go.fi]){cur1[go.fi]=go.se.fi+co;par[go.fi]=go.se.se;par1[go.fi]=node;pq.push({-co-go.se.fi,go.fi});}
		}
		if(node==ekstra1){
			if(!vis[ekstra2] && co+ekstra3<cur1[ekstra2]){cur1[ekstra2]=ekstra3+co;pq.push({-co-ekstra3,ekstra2});}
		}
	}
	if(cont){value=cur1[n];return ;}
	if(vis[n]==0)return ;
	int node=n;
	while(node!=1){
		yolda[par[node]]=1;
		node=par1[node];
	}
}

inline void sp1(bool cont){
	priority_queue<pair<int,int>> pq;
	pq.push({0,n});
	for(int i=1;i<=n;i++){vis[i]=0;cur1[i]=inf;}
	while(pq.size()){
		int node=pq.top().se;
		int co=-pq.top().fi;
		pq.pop();
		if(vis[node])continue;
		vis[node]=1;
		cur1[node]=co;
		for(auto go:v[node]){
			if(!vis[go.fi] && yasak[go.se.se]==0 && go.se.fi+co<cur1[go.fi]){cur1[go.fi]=go.se.fi+co;par[go.fi]=go.se.se;par1[go.fi]=node;pq.push({-co-go.se.fi,go.fi});}
		}
		if(node==ekstra1){
			if(!vis[ekstra2] && co+ekstra3<cur1[ekstra2]){cur1[ekstra2]=ekstra3+co;pq.push({-co-ekstra3,ekstra2});}
		}
	}
	if(cont){value=cur1[1];return ;}
	if(vis[1]==0)return ;
	int node=1;
	while(node!=n){
		yolda1[par[node]]=1;
		node=par1[node];
	}
}

int32_t main(void){
	//~ freopen("04-10.txt","r",stdin);
    n=in(),m=in();
    FOR{
		for(int j=1;j<=n;j++){dist[i][j]=inf;}
		dist[i][i]=0;
	}
    for(int i=1;i<=m;i++){
		y[i]=in(),z[i]=in(),c[i]=in(),d[i]=in();
		dist[y[i]][z[i]]=min(dist[y[i]][z[i]],c[i]);
		v[y[i]].pb({z[i],{c[i],i}});
		rv[z[i]].pb({y[i],{c[i],i}});
	}
	for(int i=1;i<=n;i++){
		for(int j=1;j<=n;j++){
			for(int jj=1;jj<=n;jj++){
				dist[j][jj]=min(dist[j][jj],dist[j][i]+dist[i][jj]);
			}
		}
	}
	sp(0);
	sp1(0);
	//~ cout<<"**\n";
	cev=min(inf,dist[1][n]+dist[n][1]);
	//~ cout<<cev<<" ::: "<<endl;
	for(int i=1;i<=m;i++){
		if(yolda[i]==0 && yolda1[i]==0){
			int cevv=cev;
			cev=min(cev,min(dist[1][z[i]]+dist[y[i]][n]+c[i],dist[1][n])+min(dist[n][z[i]]+dist[y[i]][1]+c[i],dist[n][1])+d[i]);
			//~ cev=min(cev,dist[n][1]+dist[1][z[i]]+dist[y[i]][n]+d[i]+c[i]);
			//~ cev=min(cev,dist[1][n]+dist[n][z[i]]+dist[y[i]][1]+d[i]+c[i]);
			//~ if(cev!=cevv){printf("%lld %lld %lld %lld %lld %lld %lld %lld\n",i,z[i],y[i],c[i],d[i],dist[n][1],dist[1][z[i]],dist[y[i]][n]);return 0;}
			//~ if(cev!=cevv){printf("%lld %lld %lld %lld %lld %lld %lld %lld\n",i,z[i],y[i],c[i],d[i],dist[1][n],dist[n][z[i]],dist[y[i]][1]);return 0;}
			//~ cev=min(cev,dist[n][z[i]]+c[i]+dist[y[i]][1]+dist[1][z[i]]+dist[y[i]][n]+d[i]+c[i]);
			continue;
		}
		//~ if(yolda[i] && yolda1[i]){
			yasak[i]=1;
			ekstra1=z[i];
			ekstra2=y[i];
			ekstra3=c[i];
			sp(1);
			yasak[i]=0;
			int val=value;
			ekstra1=z[i];
			ekstra2=y[i];
			ekstra3=c[i];
			yasak[i]=1;
			sp1(1);
			yasak[i]=0;
			cev=min(cev,val+value+d[i]);
			continue;
		//~ }
		if(yolda[i]){
			yasak[i]=1;
			//~ ekstra1=z[i];
			//~ ekstra2=y[i];
			//~ ekstra3=c[i];
			sp(1);
			yasak[i]=0;
			cev=min(cev,dist[n][z[i]]+dist[y[i]][1]+c[i]+value+d[i]);
			continue;
		}
		//~ ekstra1=z[i];
		//~ ekstra2=y[i];
		//~ ekstra3=c[i];
		yasak[i]=1;
		sp1(1);
		yasak[i]=0;
		cev=min(cev,dist[1][z[i]]+dist[y[i]][n]+c[i]+value+d[i]);
	}
	if(cev>=inf)cev=-1;
	printf("%lld\n",cev);
    return 0;
}

Compilation message

ho_t4.cpp: In function 'int32_t main()':
ho_t4.cpp:118:8: warning: unused variable 'cevv' [-Wunused-variable]
  118 |    int cevv=cev;
      |        ^~~~
ho_t4.cpp: In function 'long long int in()':
ho_t4.cpp:33:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   33 |     scanf("%lld",&x);
      |     ~~~~~^~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 6228 KB Output is correct
2 Correct 11 ms 6168 KB Output is correct
3 Correct 13 ms 6280 KB Output is correct
4 Correct 14 ms 6276 KB Output is correct
5 Correct 3 ms 5332 KB Output is correct
6 Correct 11 ms 6176 KB Output is correct
7 Correct 3 ms 4948 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 4 ms 5148 KB Output is correct
10 Correct 29 ms 6296 KB Output is correct
11 Correct 31 ms 6300 KB Output is correct
12 Correct 32 ms 6252 KB Output is correct
13 Correct 12 ms 6280 KB Output is correct
14 Correct 13 ms 6316 KB Output is correct
15 Correct 12 ms 6280 KB Output is correct
16 Correct 12 ms 6284 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 52 ms 12364 KB Output is correct
2 Correct 47 ms 12624 KB Output is correct
3 Correct 38 ms 12460 KB Output is correct
4 Correct 13 ms 6408 KB Output is correct
5 Correct 15 ms 6252 KB Output is correct
6 Correct 12 ms 6228 KB Output is correct
7 Correct 12 ms 6160 KB Output is correct
8 Correct 3 ms 5008 KB Output is correct
9 Correct 34 ms 12676 KB Output is correct
10 Correct 35 ms 12680 KB Output is correct
11 Correct 41 ms 12876 KB Output is correct
12 Correct 39 ms 12748 KB Output is correct
13 Correct 37 ms 12428 KB Output is correct
14 Correct 37 ms 13236 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 6300 KB Output is correct
2 Correct 11 ms 6100 KB Output is correct
3 Correct 32 ms 10820 KB Output is correct
4 Correct 11 ms 6156 KB Output is correct
5 Correct 36 ms 12112 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 3 ms 4948 KB Output is correct
8 Correct 34 ms 12364 KB Output is correct
9 Correct 34 ms 12320 KB Output is correct
10 Correct 36 ms 12132 KB Output is correct
11 Correct 40 ms 12204 KB Output is correct
12 Correct 34 ms 12176 KB Output is correct
13 Correct 3 ms 5076 KB Output is correct
14 Correct 3 ms 4952 KB Output is correct
15 Correct 3 ms 4960 KB Output is correct
16 Correct 3 ms 5036 KB Output is correct
17 Correct 3 ms 5060 KB Output is correct
18 Correct 3 ms 5024 KB Output is correct
19 Correct 33 ms 12364 KB Output is correct
20 Correct 33 ms 12196 KB Output is correct
21 Correct 33 ms 12304 KB Output is correct
22 Correct 33 ms 12328 KB Output is correct

Subtask #4
63.0 / 63.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 6228 KB Output is correct
2 Correct 11 ms 6168 KB Output is correct
3 Correct 13 ms 6280 KB Output is correct
4 Correct 14 ms 6276 KB Output is correct
5 Correct 3 ms 5332 KB Output is correct
6 Correct 11 ms 6176 KB Output is correct
7 Correct 3 ms 4948 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 4 ms 5148 KB Output is correct
10 Correct 29 ms 6296 KB Output is correct
11 Correct 31 ms 6300 KB Output is correct
12 Correct 32 ms 6252 KB Output is correct
13 Correct 12 ms 6280 KB Output is correct
14 Correct 13 ms 6316 KB Output is correct
15 Correct 12 ms 6280 KB Output is correct
16 Correct 12 ms 6284 KB Output is correct
17 Correct 52 ms 12364 KB Output is correct
18 Correct 47 ms 12624 KB Output is correct
19 Correct 38 ms 12460 KB Output is correct
20 Correct 13 ms 6408 KB Output is correct
21 Correct 15 ms 6252 KB Output is correct
22 Correct 12 ms 6228 KB Output is correct
23 Correct 12 ms 6160 KB Output is correct
24 Correct 3 ms 5008 KB Output is correct
25 Correct 34 ms 12676 KB Output is correct
26 Correct 35 ms 12680 KB Output is correct
27 Correct 41 ms 12876 KB Output is correct
28 Correct 39 ms 12748 KB Output is correct
29 Correct 37 ms 12428 KB Output is correct
30 Correct 37 ms 13236 KB Output is correct
31 Correct 19 ms 6300 KB Output is correct
32 Correct 11 ms 6100 KB Output is correct
33 Correct 32 ms 10820 KB Output is correct
34 Correct 11 ms 6156 KB Output is correct
35 Correct 36 ms 12112 KB Output is correct
36 Correct 3 ms 4948 KB Output is correct
37 Correct 3 ms 4948 KB Output is correct
38 Correct 34 ms 12364 KB Output is correct
39 Correct 34 ms 12320 KB Output is correct
40 Correct 36 ms 12132 KB Output is correct
41 Correct 40 ms 12204 KB Output is correct
42 Correct 34 ms 12176 KB Output is correct
43 Correct 3 ms 5076 KB Output is correct
44 Correct 3 ms 4952 KB Output is correct
45 Correct 3 ms 4960 KB Output is correct
46 Correct 3 ms 5036 KB Output is correct
47 Correct 3 ms 5060 KB Output is correct
48 Correct 3 ms 5024 KB Output is correct
49 Correct 33 ms 12364 KB Output is correct
50 Correct 33 ms 12196 KB Output is correct
51 Correct 33 ms 12304 KB Output is correct
52 Correct 33 ms 12328 KB Output is correct
53 Correct 40 ms 12404 KB Output is correct
54 Correct 45 ms 12232 KB Output is correct
55 Correct 40 ms 12492 KB Output is correct
56 Correct 14 ms 6268 KB Output is correct
57 Correct 13 ms 6276 KB Output is correct
58 Correct 129 ms 11000 KB Output is correct
59 Correct 165 ms 11152 KB Output is correct
60 Correct 207 ms 11072 KB Output is correct
61 Correct 128 ms 11052 KB Output is correct
62 Correct 148 ms 11172 KB Output is correct
63 Correct 200 ms 11344 KB Output is correct
64 Correct 606 ms 11908 KB Output is correct
65 Correct 640 ms 11812 KB Output is correct
66 Correct 842 ms 12000 KB Output is correct
67 Correct 19 ms 9224 KB Output is correct
68 Correct 36 ms 12536 KB Output is correct
69 Correct 37 ms 12652 KB Output is correct
70 Correct 40 ms 12748 KB Output is correct
71 Correct 38 ms 12504 KB Output is correct
72 Correct 38 ms 12728 KB Output is correct
73 Correct 47 ms 12836 KB Output is correct
74 Correct 37 ms 12588 KB Output is correct