oj.uz

Submission #879639

# Submission time Handle Problem Language Result Execution time Memory
879639 2023-11-27T19:07:53 Z iskhakkutbilim Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
 325 ms 24752 KB 
#include <bits/stdc++.h>
using namespace std;
#define ios ios::sync_with_stdio(false); cin.tie(NULL);cout.tie(NULL);
#define pb push_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define fr first
#define sc second
#define endl '\n'
#define int long long
#define ll long long
void fopn(string name){
	freopen((name+".in").c_str(),"r",stdin);
	freopen((name+".out").c_str(),"w",stdout);
}
const ll INF=1e18,mod=1e9+7;
const int N=1e5+5,M=1e4;
vector<pair<int,int>> g[N];
vector<int> djks(int s){
	vector<int> dist(N,INF),used(N,0);
	priority_queue<pair<int,int>> dq;
	dq.push({0,s});
	dist[s]=0;
	while(!dq.empty()){
		int a=dq.top().sc;
		dq.pop();
		if(used[a]) continue;
		used[a]=1;
		for(auto it: g[a]){
			if(dist[it.fr]>dist[a]+it.sc){
				dist[it.fr]=dist[a]+it.sc;
				dq.push({-dist[it.fr],it.fr});
			}
		}
	}
	return dist;
}
void solve(){
	int n,m;cin>>n>>m;
	int S,T,U,V;
	cin>>S>>T>>U>>V;--S,--T,--U,--V;
	for(int i=0;i<m;i++){
		int a,b,c;cin>>a>>b>>c;--a,--b;
		g[a].pb({b,c});
		g[b].pb({a,c});
	}
	vector<int> s=djks(S),t=djks(T),u=djks(U),v=djks(V);
	int ans=INF;
	vector<int> dpu(N,INF),dpv(N,INF);
	vector<pair<int,int>> vec;
	for(int i=0;i<n;i++){
		if(s[i]+t[i]==s[T])
			vec.pb({s[i],i});
	}
	sort(all(vec));
	for(auto aaa: vec){
		int i=aaa.sc;
		dpu[i]=u[i];
		dpv[i]=v[i];
		for(auto it: g[i]){
			if(t[i]+it.sc+s[it.fr]==s[T]){
				dpu[i]=min(dpu[it.fr],dpu[i]);
				dpv[i]=min(dpv[it.fr],dpv[i]);
			}
		}
		ans=min(ans,dpu[i]+v[i]);
		ans=min(ans,dpv[i]+u[i]);
	}
	//for(int i=0;i<n;i++) cout<<u[i]<<' ';
	cout<<min(ans,u[V]);
}
main(){
	//ios;
	int T=1;
	//cin>>T;
	while(T--){
		solve();
	}
}

Compilation message

commuter_pass.cpp:72:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   72 | main(){
      | ^~~~
commuter_pass.cpp: In function 'void fopn(std::string)':
commuter_pass.cpp:13:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 |  freopen((name+".in").c_str(),"r",stdin);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
commuter_pass.cpp:14:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   14 |  freopen((name+".out").c_str(),"w",stdout);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 290 ms 24088 KB Output is correct
2 Correct 262 ms 22396 KB Output is correct
3 Correct 277 ms 24752 KB Output is correct
4 Correct 265 ms 23704 KB Output is correct
5 Correct 264 ms 23628 KB Output is correct
6 Correct 280 ms 23944 KB Output is correct
7 Correct 306 ms 23388 KB Output is correct
8 Correct 270 ms 23028 KB Output is correct
9 Correct 266 ms 23188 KB Output is correct
10 Correct 262 ms 23284 KB Output is correct
11 Correct 103 ms 16196 KB Output is correct
12 Correct 275 ms 22876 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 320 ms 22776 KB Output is correct
2 Correct 321 ms 22428 KB Output is correct
3 Correct 304 ms 22264 KB Output is correct
4 Correct 310 ms 22280 KB Output is correct
5 Correct 298 ms 23420 KB Output is correct
6 Correct 274 ms 23432 KB Output is correct
7 Correct 301 ms 24272 KB Output is correct
8 Correct 270 ms 22292 KB Output is correct
9 Correct 281 ms 22844 KB Output is correct
10 Correct 325 ms 22524 KB Output is correct
11 Correct 111 ms 16716 KB Output is correct
12 Correct 285 ms 23432 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 9036 KB Output is correct
2 Correct 3 ms 7500 KB Output is correct
3 Correct 3 ms 7500 KB Output is correct
4 Correct 29 ms 10780 KB Output is correct
5 Correct 17 ms 9036 KB Output is correct
6 Correct 5 ms 7548 KB Output is correct
7 Correct 5 ms 7500 KB Output is correct
8 Correct 5 ms 7648 KB Output is correct
9 Correct 4 ms 7500 KB Output is correct
10 Correct 16 ms 9036 KB Output is correct
11 Correct 4 ms 7500 KB Output is correct
12 Correct 3 ms 7500 KB Output is correct
13 Correct 3 ms 7500 KB Output is correct
14 Correct 4 ms 7320 KB Output is correct
15 Correct 4 ms 7496 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 290 ms 24088 KB Output is correct
2 Correct 262 ms 22396 KB Output is correct
3 Correct 277 ms 24752 KB Output is correct
4 Correct 265 ms 23704 KB Output is correct
5 Correct 264 ms 23628 KB Output is correct
6 Correct 280 ms 23944 KB Output is correct
7 Correct 306 ms 23388 KB Output is correct
8 Correct 270 ms 23028 KB Output is correct
9 Correct 266 ms 23188 KB Output is correct
10 Correct 262 ms 23284 KB Output is correct
11 Correct 103 ms 16196 KB Output is correct
12 Correct 275 ms 22876 KB Output is correct
13 Correct 320 ms 22776 KB Output is correct
14 Correct 321 ms 22428 KB Output is correct
15 Correct 304 ms 22264 KB Output is correct
16 Correct 310 ms 22280 KB Output is correct
17 Correct 298 ms 23420 KB Output is correct
18 Correct 274 ms 23432 KB Output is correct
19 Correct 301 ms 24272 KB Output is correct
20 Correct 270 ms 22292 KB Output is correct
21 Correct 281 ms 22844 KB Output is correct
22 Correct 325 ms 22524 KB Output is correct
23 Correct 111 ms 16716 KB Output is correct
24 Correct 285 ms 23432 KB Output is correct
25 Correct 17 ms 9036 KB Output is correct
26 Correct 3 ms 7500 KB Output is correct
27 Correct 3 ms 7500 KB Output is correct
28 Correct 29 ms 10780 KB Output is correct
29 Correct 17 ms 9036 KB Output is correct
30 Correct 5 ms 7548 KB Output is correct
31 Correct 5 ms 7500 KB Output is correct
32 Correct 5 ms 7648 KB Output is correct
33 Correct 4 ms 7500 KB Output is correct
34 Correct 16 ms 9036 KB Output is correct
35 Correct 4 ms 7500 KB Output is correct
36 Correct 3 ms 7500 KB Output is correct
37 Correct 3 ms 7500 KB Output is correct
38 Correct 4 ms 7320 KB Output is correct
39 Correct 4 ms 7496 KB Output is correct
40 Correct 303 ms 23772 KB Output is correct
41 Correct 293 ms 23156 KB Output is correct
42 Correct 289 ms 23044 KB Output is correct
43 Correct 115 ms 17732 KB Output is correct
44 Correct 115 ms 17732 KB Output is correct
45 Correct 264 ms 24164 KB Output is correct
46 Correct 264 ms 24060 KB Output is correct
47 Correct 279 ms 23896 KB Output is correct
48 Correct 109 ms 17268 KB Output is correct
49 Correct 245 ms 23512 KB Output is correct
50 Correct 260 ms 24528 KB Output is correct
51 Correct 250 ms 24280 KB Output is correct