oj.uz

답안 #676472

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
676472 2022-12-31T03:33:23 Z penguin133 Hotspot (NOI17_hotspot) C++17
100 / 100
 374 ms 1648 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pi pair<int, int>
#define pii pair<int, pair<int, int> > 
#define fi first
#define se second
int n,m,q;
vector<int>v[5005];
long double ans[5005], cnt[5005];
int vis[5005];
pi dist[5005];
void solve(){
	cin >> n >> m;
	while(m--){
		int x,y; cin >> x >> y;
		v[x].push_back(y);
		v[y].push_back(x);
	}
	queue<int>qu;
	cin >> q;
	while(q--){
		int x, y; cin >> x >> y;
		qu.push(x);
		for(int i=0;i<=n;i++)dist[i] = {1e18, 0}, vis[i] = 0;
		dist[x] = {0, 1};
		for(int i=0;i<=n;i++)cnt[i] = 0;
		while(!qu.empty()){
			int bru = qu.front(); qu.pop();
			//cout << bru << '\n';
			for(auto i : v[bru]){
				if(dist[i].fi > dist[bru].fi + 1)dist[i] = dist[bru], dist[i].fi++, qu.push(i);
				else if(dist[i].fi == dist[bru].fi + 1)dist[i].se += dist[bru].se;
			}
		}
		//cerr << dist[y].se << '\n';
		int cur = dist[y].se;
		assert(cur != 0);
		cnt[y] = 1.0L;
		qu.push(y);
		while(!qu.empty()){
			int bt = qu.front(); qu.pop();
			if(vis[bt])continue;
			vis[bt] = 1;
			ans[bt] += cnt[bt];
			for(auto i : v[bt]){
				if(dist[i].fi == dist[bt].fi - 1){
					qu.push(i);
					cnt[i] += (long double)((long double)dist[i].se/(long double)dist[bt].se * cnt[bt]);
				}
			}
		}
	}
	long double fin = 0.0;
	int in = 0;
	for(int i=0;i<=n;i++)if(fin < ans[i])fin = ans[i], in = i;
	//for(int i=0;i<n;i++)cout << ans[i] << " ";
	//cout << '\n';
	cout << in << '\n';
}
 
main(){
	ios::sync_with_stdio(0);cin.tie(0);
	int t = 1;
	//cin >> t;
	while(t--){
		solve();
	}
}

Compilation message

hotspot.cpp:62:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   62 | main(){
      | ^~~~

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 444 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 496 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 444 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 496 KB Output is correct
8 Correct 1 ms 444 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 448 KB Output is correct
11 Correct 1 ms 448 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 448 KB Output is correct

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 444 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 496 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 2 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 2 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 2 ms 444 KB Output is correct

Subtask #4
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 444 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 496 KB Output is correct
8 Correct 1 ms 444 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 448 KB Output is correct
11 Correct 1 ms 448 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 448 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 2 ms 468 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 2 ms 468 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 1 ms 468 KB Output is correct
21 Correct 2 ms 444 KB Output is correct
22 Correct 1 ms 468 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 2 ms 448 KB Output is correct
25 Correct 2 ms 468 KB Output is correct
26 Correct 2 ms 468 KB Output is correct
27 Correct 1 ms 444 KB Output is correct
28 Correct 2 ms 468 KB Output is correct

Subtask #5
26.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 444 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 496 KB Output is correct
8 Correct 1 ms 444 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 448 KB Output is correct
11 Correct 1 ms 448 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 448 KB Output is correct
15 Correct 2 ms 596 KB Output is correct
16 Correct 1 ms 596 KB Output is correct
17 Correct 3 ms 724 KB Output is correct
18 Correct 2 ms 596 KB Output is correct
19 Correct 3 ms 712 KB Output is correct
20 Correct 2 ms 584 KB Output is correct
21 Correct 1 ms 468 KB Output is correct

Subtask #6
36.0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 444 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 496 KB Output is correct
8 Correct 1 ms 444 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 448 KB Output is correct
11 Correct 1 ms 448 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 448 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 2 ms 468 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 2 ms 468 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 1 ms 468 KB Output is correct
21 Correct 2 ms 444 KB Output is correct
22 Correct 1 ms 468 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 2 ms 448 KB Output is correct
25 Correct 2 ms 468 KB Output is correct
26 Correct 2 ms 468 KB Output is correct
27 Correct 1 ms 444 KB Output is correct
28 Correct 2 ms 468 KB Output is correct
29 Correct 2 ms 596 KB Output is correct
30 Correct 1 ms 596 KB Output is correct
31 Correct 3 ms 724 KB Output is correct
32 Correct 2 ms 596 KB Output is correct
33 Correct 3 ms 712 KB Output is correct
34 Correct 2 ms 584 KB Output is correct
35 Correct 1 ms 468 KB Output is correct
36 Correct 29 ms 844 KB Output is correct
37 Correct 66 ms 956 KB Output is correct
38 Correct 374 ms 1484 KB Output is correct
39 Correct 238 ms 1620 KB Output is correct
40 Correct 37 ms 852 KB Output is correct
41 Correct 236 ms 1544 KB Output is correct
42 Correct 294 ms 1648 KB Output is correct
43 Correct 17 ms 724 KB Output is correct
44 Correct 15 ms 724 KB Output is correct