oj.uz

Submission #699493

# Submission time Handle Problem Language Result Execution time Memory
699493 2023-02-17T06:03:32 Z Baytoro Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
 442 ms 24516 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 406 ms 23932 KB Output is correct
2 Correct 372 ms 22436 KB Output is correct
3 Correct 365 ms 24516 KB Output is correct
4 Correct 375 ms 23792 KB Output is correct
5 Correct 429 ms 22980 KB Output is correct
6 Correct 391 ms 24072 KB Output is correct
7 Correct 397 ms 23056 KB Output is correct
8 Correct 368 ms 23048 KB Output is correct
9 Correct 376 ms 23188 KB Output is correct
10 Correct 386 ms 23088 KB Output is correct
11 Correct 162 ms 16356 KB Output is correct
12 Correct 429 ms 23112 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 403 ms 22600 KB Output is correct
2 Correct 423 ms 22292 KB Output is correct
3 Correct 428 ms 22284 KB Output is correct
4 Correct 417 ms 22296 KB Output is correct
5 Correct 438 ms 22736 KB Output is correct
6 Correct 430 ms 23452 KB Output is correct
7 Correct 395 ms 24296 KB Output is correct
8 Correct 442 ms 22228 KB Output is correct
9 Correct 384 ms 22788 KB Output is correct
10 Correct 409 ms 22232 KB Output is correct
11 Correct 172 ms 16576 KB Output is correct
12 Correct 398 ms 23444 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 9028 KB Output is correct
2 Correct 5 ms 7308 KB Output is correct
3 Correct 5 ms 7364 KB Output is correct
4 Correct 38 ms 10744 KB Output is correct
5 Correct 21 ms 9028 KB Output is correct
6 Correct 6 ms 7380 KB Output is correct
7 Correct 6 ms 7616 KB Output is correct
8 Correct 7 ms 7492 KB Output is correct
9 Correct 5 ms 7436 KB Output is correct
10 Correct 21 ms 9028 KB Output is correct
11 Correct 4 ms 7364 KB Output is correct
12 Correct 4 ms 7364 KB Output is correct
13 Correct 5 ms 7364 KB Output is correct
14 Correct 5 ms 7396 KB Output is correct
15 Correct 5 ms 7364 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 406 ms 23932 KB Output is correct
2 Correct 372 ms 22436 KB Output is correct
3 Correct 365 ms 24516 KB Output is correct
4 Correct 375 ms 23792 KB Output is correct
5 Correct 429 ms 22980 KB Output is correct
6 Correct 391 ms 24072 KB Output is correct
7 Correct 397 ms 23056 KB Output is correct
8 Correct 368 ms 23048 KB Output is correct
9 Correct 376 ms 23188 KB Output is correct
10 Correct 386 ms 23088 KB Output is correct
11 Correct 162 ms 16356 KB Output is correct
12 Correct 429 ms 23112 KB Output is correct
13 Correct 403 ms 22600 KB Output is correct
14 Correct 423 ms 22292 KB Output is correct
15 Correct 428 ms 22284 KB Output is correct
16 Correct 417 ms 22296 KB Output is correct
17 Correct 438 ms 22736 KB Output is correct
18 Correct 430 ms 23452 KB Output is correct
19 Correct 395 ms 24296 KB Output is correct
20 Correct 442 ms 22228 KB Output is correct
21 Correct 384 ms 22788 KB Output is correct
22 Correct 409 ms 22232 KB Output is correct
23 Correct 172 ms 16576 KB Output is correct
24 Correct 398 ms 23444 KB Output is correct
25 Correct 23 ms 9028 KB Output is correct
26 Correct 5 ms 7308 KB Output is correct
27 Correct 5 ms 7364 KB Output is correct
28 Correct 38 ms 10744 KB Output is correct
29 Correct 21 ms 9028 KB Output is correct
30 Correct 6 ms 7380 KB Output is correct
31 Correct 6 ms 7616 KB Output is correct
32 Correct 7 ms 7492 KB Output is correct
33 Correct 5 ms 7436 KB Output is correct
34 Correct 21 ms 9028 KB Output is correct
35 Correct 4 ms 7364 KB Output is correct
36 Correct 4 ms 7364 KB Output is correct
37 Correct 5 ms 7364 KB Output is correct
38 Correct 5 ms 7396 KB Output is correct
39 Correct 5 ms 7364 KB Output is correct
40 Correct 365 ms 23764 KB Output is correct
41 Correct 393 ms 22936 KB Output is correct
42 Correct 394 ms 23100 KB Output is correct
43 Correct 177 ms 17704 KB Output is correct
44 Correct 190 ms 17692 KB Output is correct
45 Correct 374 ms 24384 KB Output is correct
46 Correct 345 ms 24028 KB Output is correct
47 Correct 366 ms 23940 KB Output is correct
48 Correct 178 ms 17116 KB Output is correct
49 Correct 339 ms 23376 KB Output is correct
50 Correct 361 ms 24308 KB Output is correct
51 Correct 339 ms 24100 KB Output is correct