oj.uz

Submission #402596

# Submission time Handle Problem Language Result Execution time Memory
402596 2021-05-12T02:54:22 Z penguinhacker Hotspot (NOI17_hotspot) C++14
100 / 100
 867 ms 1196 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 460 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 1 ms 452 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 460 KB Output is correct
6 Correct 1 ms 408 KB Output is correct
7 Correct 1 ms 460 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 460 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 1 ms 452 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 460 KB Output is correct
6 Correct 1 ms 408 KB Output is correct
7 Correct 1 ms 460 KB Output is correct
8 Correct 1 ms 460 KB Output is correct
9 Correct 2 ms 460 KB Output is correct
10 Correct 1 ms 452 KB Output is correct
11 Correct 1 ms 444 KB Output is correct
12 Correct 2 ms 332 KB Output is correct
13 Correct 1 ms 460 KB Output is correct
14 Correct 2 ms 460 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 460 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 1 ms 452 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 460 KB Output is correct
6 Correct 1 ms 408 KB Output is correct
7 Correct 1 ms 460 KB Output is correct
8 Correct 1 ms 460 KB Output is correct
9 Correct 2 ms 452 KB Output is correct
10 Correct 2 ms 460 KB Output is correct
11 Correct 3 ms 460 KB Output is correct
12 Correct 1 ms 440 KB Output is correct
13 Correct 1 ms 460 KB Output is correct
14 Correct 3 ms 460 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 460 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 1 ms 452 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 460 KB Output is correct
6 Correct 1 ms 408 KB Output is correct
7 Correct 1 ms 460 KB Output is correct
8 Correct 1 ms 460 KB Output is correct
9 Correct 2 ms 460 KB Output is correct
10 Correct 1 ms 452 KB Output is correct
11 Correct 1 ms 444 KB Output is correct
12 Correct 2 ms 332 KB Output is correct
13 Correct 1 ms 460 KB Output is correct
14 Correct 2 ms 460 KB Output is correct
15 Correct 1 ms 460 KB Output is correct
16 Correct 2 ms 452 KB Output is correct
17 Correct 2 ms 460 KB Output is correct
18 Correct 3 ms 460 KB Output is correct
19 Correct 1 ms 440 KB Output is correct
20 Correct 1 ms 460 KB Output is correct
21 Correct 3 ms 460 KB Output is correct
22 Correct 2 ms 444 KB Output is correct
23 Correct 2 ms 440 KB Output is correct
24 Correct 3 ms 460 KB Output is correct
25 Correct 4 ms 460 KB Output is correct
26 Correct 5 ms 460 KB Output is correct
27 Correct 2 ms 332 KB Output is correct
28 Correct 4 ms 460 KB Output is correct

Subtask #5
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 460 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 1 ms 452 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 460 KB Output is correct
6 Correct 1 ms 408 KB Output is correct
7 Correct 1 ms 460 KB Output is correct
8 Correct 1 ms 460 KB Output is correct
9 Correct 2 ms 460 KB Output is correct
10 Correct 1 ms 452 KB Output is correct
11 Correct 1 ms 444 KB Output is correct
12 Correct 2 ms 332 KB Output is correct
13 Correct 1 ms 460 KB Output is correct
14 Correct 2 ms 460 KB Output is correct
15 Correct 3 ms 588 KB Output is correct
16 Correct 2 ms 460 KB Output is correct
17 Correct 6 ms 588 KB Output is correct
18 Correct 3 ms 456 KB Output is correct
19 Correct 5 ms 588 KB Output is correct
20 Correct 3 ms 588 KB Output is correct
21 Correct 2 ms 460 KB Output is correct

Subtask #6
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 460 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 1 ms 452 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 460 KB Output is correct
6 Correct 1 ms 408 KB Output is correct
7 Correct 1 ms 460 KB Output is correct
8 Correct 1 ms 460 KB Output is correct
9 Correct 2 ms 460 KB Output is correct
10 Correct 1 ms 452 KB Output is correct
11 Correct 1 ms 444 KB Output is correct
12 Correct 2 ms 332 KB Output is correct
13 Correct 1 ms 460 KB Output is correct
14 Correct 2 ms 460 KB Output is correct
15 Correct 1 ms 460 KB Output is correct
16 Correct 2 ms 452 KB Output is correct
17 Correct 2 ms 460 KB Output is correct
18 Correct 3 ms 460 KB Output is correct
19 Correct 1 ms 440 KB Output is correct
20 Correct 1 ms 460 KB Output is correct
21 Correct 3 ms 460 KB Output is correct
22 Correct 2 ms 444 KB Output is correct
23 Correct 2 ms 440 KB Output is correct
24 Correct 3 ms 460 KB Output is correct
25 Correct 4 ms 460 KB Output is correct
26 Correct 5 ms 460 KB Output is correct
27 Correct 2 ms 332 KB Output is correct
28 Correct 4 ms 460 KB Output is correct
29 Correct 3 ms 588 KB Output is correct
30 Correct 2 ms 460 KB Output is correct
31 Correct 6 ms 588 KB Output is correct
32 Correct 3 ms 456 KB Output is correct
33 Correct 5 ms 588 KB Output is correct
34 Correct 3 ms 588 KB Output is correct
35 Correct 2 ms 460 KB Output is correct
36 Correct 69 ms 588 KB Output is correct
37 Correct 174 ms 784 KB Output is correct
38 Correct 867 ms 1132 KB Output is correct
39 Correct 639 ms 1100 KB Output is correct
40 Correct 84 ms 744 KB Output is correct
41 Correct 521 ms 1116 KB Output is correct
42 Correct 740 ms 1196 KB Output is correct
43 Correct 46 ms 588 KB Output is correct
44 Correct 33 ms 588 KB Output is correct