oj.uz

Submission #1102949

# Submission time Handle Problem Language Result Execution time Memory
1102949 2024-10-19T09:14:17 Z icebear Hotspot (NOI17_hotspot) C++17
100 / 100
 478 ms 133192 KB 
// ~~ icebear & at~~
#include <bits/stdc++.h>
using namespace std;

const double eps = 1e-6;
const int N = 5000 + 5;
int numNode, numEdge, numQuery;
vector<int> G[N];
int dist[N][N], ways[N][N];
bool computed[N];
queue<int> Q;
int a[N], b[N];

void BFS(int x) {
    memset(dist[x], 0x3f, sizeof dist[x]);
    dist[x][x] = 0;
    ways[x][x] = 1;
    Q.push(x);
    while(!Q.empty()) {
        int u = Q.front(); Q.pop();
        for (int v : G[u])
            if (dist[x][v] > dist[x][u] + 1) {
                dist[x][v] = dist[x][u] + 1;
                ways[x][v] = ways[x][u];
                Q.push(v);
            } else if (dist[x][v] == dist[x][u] + 1)
                ways[x][v] += ways[x][u];
    }
}

bool isLarger(array<int, 3> &x, array<int, 3> &y) {
    return 1ll * x[0] * y[1] > 1ll * x[1] * y[0];
}

int main(){
    // freopen("TRAINCENTRE.inp", "r", stdin);
    // freopen("TRAINCENTRE.out", "w", stdout);
    ios_base::sync_with_stdio(0); 
    cin.tie(0); cout.tie(0);
    cin >> numNode >> numEdge;
    for(int i = 0; i < numEdge; i++) {
        int u, v;
        cin >> u >> v;
        G[u].push_back(v);
        G[v].push_back(u);
    }

    cin >> numQuery;
    for(int i = 0; i < numQuery; i++) {
        cin >> a[i] >> b[i];
        if (!computed[a[i]]) {
            BFS(a[i]);
            computed[a[i]] = true;
        }
        if (!computed[b[i]]) {
            BFS(b[i]);
            computed[b[i]] = true;
        }
    }

    long double Eans = 0;
    int ans = 0;
    for(int w = 0; w < numNode; w++) {
        long double Ew = 0;
        for(int i = 0; i < numQuery; i++) {
            int fixedPath = 0, totalPath = 0;
            if (dist[a[i]][w] + dist[b[i]][w] == dist[a[i]][b[i]]) 
                fixedPath += ways[a[i]][w] * ways[b[i]][w];
            totalPath += ways[a[i]][b[i]];
            Ew += 1.0 * fixedPath / totalPath;
        }

        if (Ew - Eans > eps) Eans = Ew, ans = w;      
    }
    
    cout << ans;
    return 0;
}

Subtask #1
4.0 / 4.0

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

Subtask #2
5.0 / 5.0

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

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8784 KB Output is correct
2 Correct 2 ms 8784 KB Output is correct
3 Correct 2 ms 8784 KB Output is correct
4 Correct 1 ms 4688 KB Output is correct
5 Correct 2 ms 8784 KB Output is correct
6 Correct 2 ms 8784 KB Output is correct
7 Correct 2 ms 8804 KB Output is correct
8 Correct 3 ms 16976 KB Output is correct
9 Correct 5 ms 27216 KB Output is correct
10 Correct 4 ms 25168 KB Output is correct
11 Correct 6 ms 35512 KB Output is correct
12 Correct 3 ms 8784 KB Output is correct
13 Correct 2 ms 6736 KB Output is correct
14 Correct 3 ms 16976 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8784 KB Output is correct
2 Correct 2 ms 8784 KB Output is correct
3 Correct 2 ms 8784 KB Output is correct
4 Correct 1 ms 4688 KB Output is correct
5 Correct 2 ms 8784 KB Output is correct
6 Correct 2 ms 8784 KB Output is correct
7 Correct 2 ms 8804 KB Output is correct
8 Correct 1 ms 6736 KB Output is correct
9 Correct 2 ms 6736 KB Output is correct
10 Correct 2 ms 8784 KB Output is correct
11 Correct 1 ms 4688 KB Output is correct
12 Correct 1 ms 4688 KB Output is correct
13 Correct 1 ms 4688 KB Output is correct
14 Correct 2 ms 6736 KB Output is correct
15 Correct 3 ms 16976 KB Output is correct
16 Correct 5 ms 27216 KB Output is correct
17 Correct 4 ms 25168 KB Output is correct
18 Correct 6 ms 35512 KB Output is correct
19 Correct 3 ms 8784 KB Output is correct
20 Correct 2 ms 6736 KB Output is correct
21 Correct 3 ms 16976 KB Output is correct
22 Correct 3 ms 19024 KB Output is correct
23 Correct 3 ms 19024 KB Output is correct
24 Correct 5 ms 25168 KB Output is correct
25 Correct 5 ms 39504 KB Output is correct
26 Correct 5 ms 35408 KB Output is correct
27 Correct 2 ms 10832 KB Output is correct
28 Correct 3 ms 19024 KB Output is correct

Subtask #5
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8784 KB Output is correct
2 Correct 2 ms 8784 KB Output is correct
3 Correct 2 ms 8784 KB Output is correct
4 Correct 1 ms 4688 KB Output is correct
5 Correct 2 ms 8784 KB Output is correct
6 Correct 2 ms 8784 KB Output is correct
7 Correct 2 ms 8804 KB Output is correct
8 Correct 1 ms 6736 KB Output is correct
9 Correct 2 ms 6736 KB Output is correct
10 Correct 2 ms 8784 KB Output is correct
11 Correct 1 ms 4688 KB Output is correct
12 Correct 1 ms 4688 KB Output is correct
13 Correct 1 ms 4688 KB Output is correct
14 Correct 2 ms 6736 KB Output is correct
15 Correct 3 ms 10832 KB Output is correct
16 Correct 2 ms 6736 KB Output is correct
17 Correct 6 ms 29264 KB Output is correct
18 Correct 4 ms 29264 KB Output is correct
19 Correct 7 ms 39672 KB Output is correct
20 Correct 3 ms 10832 KB Output is correct
21 Correct 2 ms 10832 KB Output is correct

Subtask #6
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8784 KB Output is correct
2 Correct 2 ms 8784 KB Output is correct
3 Correct 2 ms 8784 KB Output is correct
4 Correct 1 ms 4688 KB Output is correct
5 Correct 2 ms 8784 KB Output is correct
6 Correct 2 ms 8784 KB Output is correct
7 Correct 2 ms 8804 KB Output is correct
8 Correct 1 ms 6736 KB Output is correct
9 Correct 2 ms 6736 KB Output is correct
10 Correct 2 ms 8784 KB Output is correct
11 Correct 1 ms 4688 KB Output is correct
12 Correct 1 ms 4688 KB Output is correct
13 Correct 1 ms 4688 KB Output is correct
14 Correct 2 ms 6736 KB Output is correct
15 Correct 3 ms 16976 KB Output is correct
16 Correct 5 ms 27216 KB Output is correct
17 Correct 4 ms 25168 KB Output is correct
18 Correct 6 ms 35512 KB Output is correct
19 Correct 3 ms 8784 KB Output is correct
20 Correct 2 ms 6736 KB Output is correct
21 Correct 3 ms 16976 KB Output is correct
22 Correct 3 ms 19024 KB Output is correct
23 Correct 3 ms 19024 KB Output is correct
24 Correct 5 ms 25168 KB Output is correct
25 Correct 5 ms 39504 KB Output is correct
26 Correct 5 ms 35408 KB Output is correct
27 Correct 2 ms 10832 KB Output is correct
28 Correct 3 ms 19024 KB Output is correct
29 Correct 3 ms 10832 KB Output is correct
30 Correct 2 ms 6736 KB Output is correct
31 Correct 6 ms 29264 KB Output is correct
32 Correct 4 ms 29264 KB Output is correct
33 Correct 7 ms 39672 KB Output is correct
34 Correct 3 ms 10832 KB Output is correct
35 Correct 2 ms 10832 KB Output is correct
36 Correct 22 ms 12880 KB Output is correct
37 Correct 78 ms 50000 KB Output is correct
38 Correct 478 ms 130928 KB Output is correct
39 Correct 91 ms 31816 KB Output is correct
40 Correct 68 ms 109244 KB Output is correct
41 Correct 335 ms 133192 KB Output is correct
42 Correct 229 ms 52304 KB Output is correct
43 Correct 38 ms 80760 KB Output is correct
44 Correct 27 ms 82760 KB Output is correct