Submission #1102938

#	Time	Username	Problem	Language	Result	Execution time	Memory
1102938		Cam	Hotspot (NOI17_hotspot)	C++17	38 / 100	4 ms	764 KiB

hotspot

#include <bits/stdc++.h>
#define name "traincentre"
#define ll long long
#define db double
#define pb push_back
#define ii pair<int,int>
#define mp make_pair
#define fi first
#define se second
#define bit(x,i) (((x)>>(i))&1)
#define sz(s) (int)(s).size()
#define all(a) (a).begin(),(a).end()
#define rep(i,a,b) for(int i=(a), _b=(b); i<=_b; i++)
#define repd(i,a,b) for(int i=(a), _b=(b); i>=_b; i--)
#define _unique(x) (x).resize(unique(all(x)) - (x).begin())

using namespace std;

const int N = 5e3 + 3;
const int inf = 1e9 + 7;
const int base = 31;
const double eps = 0.00000001;

int n, m, k;
int d[2][N];
db cnt[2][N], ans[N], res;
vector <int> a[N];

void dijkstra (int o, int s) {

    rep (i, 1, n) d[o][i] = inf, cnt[o][i] = 0;
    queue <int> q;
    q.push (s); d[o][s] = 0; cnt[o][s] = 1;

    while (sz (q)) {

        int u = q.front(); q.pop();
        for (int v : a[u]) {

            if (d[o][v] > d[o][u] + 1) {

                d[o][v] = d[o][u] + 1;
                q.push (v);
                cnt[o][v] = cnt[o][u];
            }
            if (d[o][v] == d[o][u] + 1) cnt[o][v] += cnt[o][u];
        }
    }
}
void solve (void) {

    cin >> n >> m;
    rep (i, 1, m) {

        int u, v; cin >> u >> v;
        u ++; v ++;
        a[u].pb (v); a[v].pb (u);
    }
    cin >> k;
    rep (i, 1, k) {

        int x, y;
        cin >> x >> y;
        x ++; y ++;
        dijkstra (0, x); dijkstra (1, y);
        rep (u, 1, n) if (d[0][u] + d[1][u] == d[0][y]) {

            db tmp = (db)(cnt[0][u] * cnt[1][u]);
            tmp = tmp / (db)cnt[0][y];
            ans[u] += tmp;
        }
    }
    int u = 1;
    res = ans[1];
    rep (i, 1, n) if (ans[i] > res) {

        res = ans[i];
        u = i;
    }
    cout << u - 1;
}

signed main()
{
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    //freopen(name".inp","r",stdin);
    //freopen(name".out","w",stdout);

    solve();
    return 0;
}

• Subtask 1: 4 / 4
• Subtask 2: 5 / 5
• Subtask 3: 11 / 11
• Subtask 4: 18 / 18
• Subtask 5: 0 / 26
• Subtask 6: 0 / 36