oj.uz

Submission #743435

# Submission time Handle Problem Language Result Execution time Memory
743435 2023-05-17T11:38:32 Z blacktulip Olympic Bus (JOI20_ho_t4) C++17
5 / 100
 1000 ms 6864 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 = 205;
const lo mod = 1000000007;
 
int n,m,k,flag,t,y[50005],z[50005],c[50005],d[50005],dist[li][li],cur1[li],value,par[li],ekstra1,ekstra2,ekstra3,par1[li];
int cev;
bool vis[li],yolda[50005],yolda1[50005],yasak[50005];
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){
    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);
	cev=min(inf,dist[1][n]+dist[n][1]);
	for(int i=1;i<=m;i++){
		//~ if(yolda[i]==0 && yolda1[i]==0){
			//~ 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]);
			//~ continue;
		//~ }
		yasak[i]=1;
		ekstra1=z[i];
		ekstra2=y[i];
		ekstra3=c[i];
		sp(1);
		int val=value;
		sp1(1);
		yasak[i]=0;
		cev=min(cev,val+value+d[i]);
		continue;
	}
	if(cev>=inf)cev=-1;
	printf("%lld\n",cev);
    return 0;
}

Compilation message

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 38 ms 776 KB Output is correct
2 Correct 9 ms 576 KB Output is correct
3 Correct 53 ms 784 KB Output is correct
4 Correct 64 ms 800 KB Output is correct
5 Correct 14 ms 544 KB Output is correct
6 Correct 9 ms 596 KB Output is correct
7 Correct 1 ms 316 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 4 ms 468 KB Output is correct
10 Correct 87 ms 920 KB Output is correct
11 Correct 84 ms 792 KB Output is correct
12 Correct 74 ms 788 KB Output is correct
13 Correct 29 ms 780 KB Output is correct
14 Correct 37 ms 724 KB Output is correct
15 Correct 34 ms 784 KB Output is correct
16 Correct 37 ms 724 KB Output is correct

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1077 ms 6864 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 800 KB Output is correct
2 Correct 11 ms 684 KB Output is correct
3 Execution timed out 1089 ms 5344 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 63.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 776 KB Output is correct
2 Correct 9 ms 576 KB Output is correct
3 Correct 53 ms 784 KB Output is correct
4 Correct 64 ms 800 KB Output is correct
5 Correct 14 ms 544 KB Output is correct
6 Correct 9 ms 596 KB Output is correct
7 Correct 1 ms 316 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 4 ms 468 KB Output is correct
10 Correct 87 ms 920 KB Output is correct
11 Correct 84 ms 792 KB Output is correct
12 Correct 74 ms 788 KB Output is correct
13 Correct 29 ms 780 KB Output is correct
14 Correct 37 ms 724 KB Output is correct
15 Correct 34 ms 784 KB Output is correct
16 Correct 37 ms 724 KB Output is correct
17 Execution timed out 1077 ms 6864 KB Time limit exceeded
18 Halted 0 ms 0 KB -