Submission #1105369

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

hotspot

#include <bits/stdc++.h>
#define ll long long
#define int long long
#define F first
#define S second
#define MAXN 5005
#define MAXEDGE 40005
#define ii pair<ll,int>
#define bit(i,j) ((i>>j)&1)
#define sz(i) (int)i.size()
#define endl '\n'
using namespace std;
int n, m, k;
vector<int>g[MAXN];
namespace sub1
{
double dp[MAXN];
ii d[MAXN][2];
void bfs(int st, int j)
{
    for(int i = 0; i <= n; i++)
        d[i][j] = {1e18, 0};
    queue<int>q;
    q.push(st);
    d[st][j] = {0, 1};
    while(q.empty() != 1)
    {
        int u = q.front();
        q.pop();
        for(int v : g[u])
        {
            if(d[v][j].F > d[u][j].F + 1)
            {
                d[v][j] = {d[u][j].F + 1, d[u][j].S};
                q.push(v);
            }
            else if(d[v][j].F == d[u][j].F + 1)
                d[v][j].S += d[u][j].S;
        }
    }
}
void calc(int st, int ed)
{
    for(int i=0;i<n;i++)
    {
        if(d[i][0].F+d[i][1].F==d[ed][0].F)
        {
            double t=1.0*d[i][0].S*d[i][1].S,t1=1;
            dp[i]+=1.0*t/1.0*t1;
        }
    }
}
void solve()
{
    cin >> k;
    for(int i = 1; i <= k; i++)
    {
        int x, y;
        cin >> x >> y;
        bfs(x, 0);
        bfs(y, 1);
        calc(x, y);
    }
    int res = 0;
    for(int i = 0; i < n; i++)
        if(dp[i] > dp[res])
            res = i;
    cout << res;
}
}
main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cin >> n >> m;
    for(int i = 1; i <= m; i++)
    {
        int x, y;
        cin >> x >> y;
        g[x].push_back(y);
        g[y].push_back(x);
    }
    sub1::solve();
}
/**
5 5
0 1
1 2
2 3
3 4
4 0
2
0 2
0 4

**/

Compilation message (stderr)

hotspot.cpp:71:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   71 | main()
      | ^~~~

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