제출 #1049212

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1049212		Whisper	Hotspot (NOI17_hotspot)	C++17	38 / 100	2 ms	644 KiB

hotspot

#include <bits/stdc++.h>

using namespace std;
using ll = long long;

#define int long long
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORD(i, a, b) for (int i = (b); i >= (a); i --)
#define REP(i, a) for (int i = 0; i < (a); ++i)
#define REPD(i, a) for (int i = (a) - 1; i >= 0; --i)

#define MASK(i) (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)


constexpr ll LINF = (1ll << 60);
constexpr int INF = (1ll << 30);
constexpr int Mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

/*
    Phu Trong from Nguyen Tat Thanh High School for gifted student
*/

template <class X, class Y>
    bool minimize(X &x, const Y &y){
        X eps = 1e-9;
        if (x > y + eps) {x = y; return 1;}
        return 0;
    }

template <class X, class Y>
    bool maximize(X &x, const Y &y){
        X eps = 1e-9;
        if (x + eps < y) {x = y; return 1;}
        return 0;
    }
int numNode, numEdge, numPath;
#define MAX_NODE            5005
#define MAX_PATH            2002
vector<int> G[MAX_NODE];


long double ans[MAX_NODE];

void go(int a, vector<int>&minDist, vector<int>& cnt){
    cnt[a] = 1;
    minDist[a] = 0;
    queue<int> q; q.emplace(a);
    while(q.size()){
        int u = q.front(); q.pop();
        for (int&v : G[u]){
            if (minDist[v] == -1){
                minDist[v] = minDist[u] + 1;
                cnt[v] = cnt[u];
                q.emplace(v);
            }
            else if(minDist[v] == minDist[u] + 1){
                cnt[v] += cnt[u];
            }
        }
    }
}
void process(void){
    cin >> numNode >> numEdge;
    for (int i = 1; i <= numEdge; ++i){
        int u, v; cin >> u >> v;
        G[u].emplace_back(v);
        G[v].emplace_back(u);
    }
    REP(i, numNode) ans[i] = 0.0;

    cin >> numPath;
    for (int i = 1; i <= numPath; ++i){
        int a, b; cin >> a >> b;
        vector<int> minDist(numNode + 5, -1), cnt(numNode + 5);
        vector<int> rminDist(numNode + 5, -1), rcnt(numNode + 5);

        go(a, minDist, cnt);
        go(b, rminDist, rcnt);
        int value = cnt[b];
        REP(u, numNode){
            if(minDist[u] + rminDist[u] == minDist[b]){
                int v = cnt[u] * rcnt[u];
                ans[u] += (long double)v / (long double)value;
            }
        }
    }
    int mx_value = -1, cap = 0;
    REP(i, numNode) if(maximize(mx_value, ans[i])){
        cap = i;
    }
    cout << cap;
}
signed main(){
    #define name "Whisper"
    cin.tie(nullptr) -> sync_with_stdio(false);
    //freopen(name".inp", "r", stdin);
    //freopen(name".out", "w", stdout);
    process();
    return (0 ^ 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