oj.uz

Submission #1102880

# Submission time Handle Problem Language Result Execution time Memory
1102880 2024-10-19T06:59:04 Z haianhnguyen08102007 Hotspot (NOI17_hotspot) C++17
100 / 100
 553 ms 1312 KB 
#include <bits/stdc++.h>
using namespace std;
 
#define ll long long
#define ar array
 
const int mxN=5000, INF=1e9;
int n, m, k;
double dp[mxN];
ar<int, 2> d1[mxN], d2[mxN];
vector<int> adj[mxN];
 
void bfs(int s, ar<int, 2>* d) {
	memset(d, -1, 8*n);
	d[s]={0, 1};
	for (queue<int> q({s}); q.size(); q.pop()) {
		int u=q.front();
		for (int v : adj[u]) {
			if (d[v][0]==-1) {
				d[v]={d[u][0]+1, d[u][1]};
				q.push(v);
			} else if (d[u][0]+1==d[v][0]) d[v][1]+=d[u][1];
		}
	}
}
 
int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> n >> m;
	for (int i=0; i<m; ++i) {
		int u, v;
		cin >> u >> v;
		adj[u].push_back(v);
		adj[v].push_back(u);
	}
	cin >> k;
	while(k--) {
		int u, v;
		cin >> u >> v;
		bfs(u, d1);
		bfs(v, d2);
		double t=d1[v][1];
		for (int j=0; j<n; ++j) if (d1[j][0]+d2[j][0]==d1[v][0]) dp[j]+=d1[j][1]*d2[j][1]/t;
	}
	cout << max_element(dp, dp+n)-dp;
	return 0;
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 596 KB Output is correct
2 Correct 1 ms 596 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 1 ms 596 KB Output is correct
5 Correct 1 ms 596 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 596 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 596 KB Output is correct
2 Correct 1 ms 596 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 1 ms 596 KB Output is correct
5 Correct 1 ms 596 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 596 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 1 ms 760 KB Output is correct
13 Correct 1 ms 760 KB Output is correct
14 Correct 1 ms 596 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 596 KB Output is correct
2 Correct 1 ms 596 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 1 ms 596 KB Output is correct
5 Correct 1 ms 596 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 596 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 2 ms 760 KB Output is correct
11 Correct 2 ms 656 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 1 ms 596 KB Output is correct
14 Correct 1 ms 596 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 596 KB Output is correct
2 Correct 1 ms 596 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 1 ms 596 KB Output is correct
5 Correct 1 ms 596 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 596 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 1 ms 760 KB Output is correct
13 Correct 1 ms 760 KB Output is correct
14 Correct 1 ms 596 KB Output is correct
15 Correct 1 ms 596 KB Output is correct
16 Correct 1 ms 596 KB Output is correct
17 Correct 2 ms 760 KB Output is correct
18 Correct 2 ms 656 KB Output is correct
19 Correct 1 ms 596 KB Output is correct
20 Correct 1 ms 596 KB Output is correct
21 Correct 1 ms 596 KB Output is correct
22 Correct 1 ms 596 KB Output is correct
23 Correct 1 ms 596 KB Output is correct
24 Correct 2 ms 596 KB Output is correct
25 Correct 2 ms 588 KB Output is correct
26 Correct 3 ms 764 KB Output is correct
27 Correct 1 ms 584 KB Output is correct
28 Correct 2 ms 596 KB Output is correct

Subtask #5
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 596 KB Output is correct
2 Correct 1 ms 596 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 1 ms 596 KB Output is correct
5 Correct 1 ms 596 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 596 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 1 ms 760 KB Output is correct
13 Correct 1 ms 760 KB Output is correct
14 Correct 1 ms 596 KB Output is correct
15 Correct 2 ms 768 KB Output is correct
16 Correct 1 ms 596 KB Output is correct
17 Correct 4 ms 596 KB Output is correct
18 Correct 2 ms 596 KB Output is correct
19 Correct 4 ms 596 KB Output is correct
20 Correct 2 ms 676 KB Output is correct
21 Correct 1 ms 764 KB Output is correct

Subtask #6
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 596 KB Output is correct
2 Correct 1 ms 596 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 1 ms 596 KB Output is correct
5 Correct 1 ms 596 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 596 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 1 ms 760 KB Output is correct
13 Correct 1 ms 760 KB Output is correct
14 Correct 1 ms 596 KB Output is correct
15 Correct 1 ms 596 KB Output is correct
16 Correct 1 ms 596 KB Output is correct
17 Correct 2 ms 760 KB Output is correct
18 Correct 2 ms 656 KB Output is correct
19 Correct 1 ms 596 KB Output is correct
20 Correct 1 ms 596 KB Output is correct
21 Correct 1 ms 596 KB Output is correct
22 Correct 1 ms 596 KB Output is correct
23 Correct 1 ms 596 KB Output is correct
24 Correct 2 ms 596 KB Output is correct
25 Correct 2 ms 588 KB Output is correct
26 Correct 3 ms 764 KB Output is correct
27 Correct 1 ms 584 KB Output is correct
28 Correct 2 ms 596 KB Output is correct
29 Correct 2 ms 768 KB Output is correct
30 Correct 1 ms 596 KB Output is correct
31 Correct 4 ms 596 KB Output is correct
32 Correct 2 ms 596 KB Output is correct
33 Correct 4 ms 596 KB Output is correct
34 Correct 2 ms 676 KB Output is correct
35 Correct 1 ms 764 KB Output is correct
36 Correct 45 ms 596 KB Output is correct
37 Correct 105 ms 852 KB Output is correct
38 Correct 553 ms 1284 KB Output is correct
39 Correct 361 ms 1312 KB Output is correct
40 Correct 56 ms 852 KB Output is correct
41 Correct 332 ms 1108 KB Output is correct
42 Correct 486 ms 1108 KB Output is correct
43 Correct 26 ms 596 KB Output is correct
44 Correct 19 ms 804 KB Output is correct