oj.uz

Submission #1102950

# Submission time Handle Problem Language Result Execution time Memory
1102950 2024-10-19T09:15:20 Z Cam Hotspot (NOI17_hotspot) C++17
100 / 100
 621 ms 7932 KB 
#include <bits/stdc++.h>
using namespace std;
 
#define task "TRAINCENTER"
#define fi first
#define se second
#define pii pair <int, int>
#define pb push_back
#define ll long long 
#define pip pair <int, pii>
#define pli pair <ll, int>
#define double long double
 
const int N = 1e5 + 5;
const int mod = 1e9 + 7;
const ll inf = 1e18 + 7;
 
int myabs(int x)
{
    return x < 0 ? -x : x;
}
 
int n, m, k;
vector <int> g[N];
long long cnt[2][N], d[2][N];
double ans[N];
 
void inp()
{
    cin >> n >> m;
    for (int i=1; i<=m; ++i)
    {
        int u, v;
        cin >> u >> v;
        u++;
        v++;
        g[u].push_back(v);
        g[v].push_back(u);
    }
    cin >> k;
}
 
void bfs(int id, int s)
{
    queue <int> q;
    for (int i=0; i<=n; ++i)
        d[id][i] = -1,
        cnt[id][i] = 0;
    d[id][s] = 0;
    q.push(s);
    cnt[id][s] = 1;
    while (!q.empty())
    {
        int u = q.front();
        q.pop();
        for (int v : g[u])
        {
            if (d[id][v] == -1)
            {
                d[id][v] = d[id][u] + 1;
                cnt[id][v] = cnt[id][u];
                q.push(v);
            }
            else if (d[id][v] == d[id][u] + 1)
                cnt[id][v] += cnt[id][u];
        }
    }
}
 
void solve()
{
    while (k--)
    {
        int a, b;
        cin >> a >> b;
        a++;
        b++;
        bfs(0, a);
        bfs(1, b);
        double tmp = cnt[0][b];
        for (int i=1; i<=n; ++i)
            if (d[0][i] + d[1][i] == d[0][b])
            {
                double tmp1 = (double)(cnt[0][i] * cnt[1][i]);
                ans[i] += (tmp1/tmp);
            }
    }
    int res = 0;
    for (int i=1; i<=n; ++i)
        if (ans[i] > ans[res])
            res = i;
    cout << res - 1;
}
 
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    if (fopen(task".inp", "r"))
    {
        freopen(task".inp", "r", stdin);
        freopen(task".out", "w", stdout);
    }
    inp();
    solve();
    return 0;
}

Compilation message

hotspot.cpp: In function 'int main()':
hotspot.cpp:102:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  102 |         freopen(task".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
hotspot.cpp:103:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  103 |         freopen(task".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
4.0 / 4.0

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

Subtask #2
5.0 / 5.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
18.0 / 18.0

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

Subtask #5
26.0 / 26.0

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

Subtask #6
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 7248 KB Output is correct
2 Correct 2 ms 7248 KB Output is correct
3 Correct 2 ms 7248 KB Output is correct
4 Correct 2 ms 7444 KB Output is correct
5 Correct 2 ms 7248 KB Output is correct
6 Correct 2 ms 7248 KB Output is correct
7 Correct 2 ms 7248 KB Output is correct
8 Correct 2 ms 7248 KB Output is correct
9 Correct 2 ms 7248 KB Output is correct
10 Correct 2 ms 7248 KB Output is correct
11 Correct 2 ms 7248 KB Output is correct
12 Correct 3 ms 7248 KB Output is correct
13 Correct 2 ms 7248 KB Output is correct
14 Correct 2 ms 7248 KB Output is correct
15 Correct 2 ms 7248 KB Output is correct
16 Correct 3 ms 7416 KB Output is correct
17 Correct 3 ms 7248 KB Output is correct
18 Correct 4 ms 7248 KB Output is correct
19 Correct 2 ms 7248 KB Output is correct
20 Correct 2 ms 7248 KB Output is correct
21 Correct 3 ms 7248 KB Output is correct
22 Correct 3 ms 7248 KB Output is correct
23 Correct 2 ms 7248 KB Output is correct
24 Correct 3 ms 7248 KB Output is correct
25 Correct 3 ms 7248 KB Output is correct
26 Correct 3 ms 7248 KB Output is correct
27 Correct 2 ms 7248 KB Output is correct
28 Correct 3 ms 7248 KB Output is correct
29 Correct 3 ms 7248 KB Output is correct
30 Correct 3 ms 7248 KB Output is correct
31 Correct 6 ms 7248 KB Output is correct
32 Correct 3 ms 7248 KB Output is correct
33 Correct 5 ms 7248 KB Output is correct
34 Correct 3 ms 7472 KB Output is correct
35 Correct 2 ms 7248 KB Output is correct
36 Correct 48 ms 7484 KB Output is correct
37 Correct 110 ms 7504 KB Output is correct
38 Correct 621 ms 7744 KB Output is correct
39 Correct 363 ms 7760 KB Output is correct
40 Correct 59 ms 7660 KB Output is correct
41 Correct 367 ms 7760 KB Output is correct
42 Correct 517 ms 7932 KB Output is correct
43 Correct 25 ms 7248 KB Output is correct
44 Correct 20 ms 7500 KB Output is correct