답안 #1105342

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1105342	2024-10-26T08:09:38 Z	ngokhanh	Hotspot (NOI17_hotspot)	C++17	100 / 100	643 ms	848 KB

hotspot

#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for (int i=a;i<=b;i++)
#define rep2(i,a,b,c) for (int i=a;i<=b;i+=c)
#define rev(i,a,b) for (int i=a;i>=b;i--)
#define rev2(i,a,b,c) for (int i=a;i>=b;i-=c)
#define ii pair<ll,ll>
#define bit(i,j) ((i>>j)&1)
#define ull unsigned long long
#define pb push_back
#define pf push_front
#define ll long long
#define F first
#define S second
#define sz(a) (int)(a.size())
#define on(n) __builtin_popcountll(n)
#define ld long double
#define __log2(x) 63-__builtin_clzll(x)
#define Mask(x) (1LL<<x)
#define ALL(v) v.begin(),v.end()

const int N=5e3+5;
const int mod=998244353;

int n,m,k,u,v,a,b;
int dist[N][2],cnt[N][2];
vector<int> g[N];
bool use[N];
ld ans[N];

void bfs(int s,int p){
    rep(i,1,n){
        use[i]=0;
        dist[s][p]=1e9;
        cnt[i][p]=0;
    }
    queue<int> q;
    q.push(s);
    use[s]=1;
    dist[s][p]=0;
    cnt[s][p]=1;
    while(!q.empty()){
        int u=q.front();
        q.pop();
        for (int v:g[u])
            if (!use[v]){
                use[v]=1;
                dist[v][p]=dist[u][p]+1;
                cnt[v][p]=cnt[u][p];
                q.push(v);
            }
            else if (dist[v][p]==dist[u][p]+1) cnt[v][p]+=cnt[u][p];
    }
}

void solution(){
    cin >> n >> m;
    rep(i,1,m){
        cin >> u >> v;
        u++,v++;
        g[u].pb(v);
        g[v].pb(u);
    }
    cin >> k;
    rep(j,1,k){
        cin >> a >> b;
        a++,b++;
        bfs(a,0);
        bfs(b,1);
        ld Y=cnt[b][0]*1.0;
        rep(i,1,n)
            if (dist[i][0]+dist[i][1]==dist[b][0]){
               ld X=cnt[i][0]*cnt[i][1]*1.0;
               ans[i]=ans[i]*1.0+(X*1.0)/Y;
        }
    }
    int res=0;
    rep(i,1,n) if (ans[i]>ans[res]) res=i;
    cout << res-1;
}
int32_t main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int test=1;
    //cin >> test;
    while(test--)
        solution();
}

Subtask #1
4.0 / 4.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	592 KB	Output is correct
2	Correct	1 ms	760 KB	Output is correct
3	Correct	1 ms	592 KB	Output is correct
4	Correct	1 ms	592 KB	Output is correct
5	Correct	1 ms	592 KB	Output is correct
6	Correct	1 ms	764 KB	Output is correct
7	Correct	1 ms	760 KB	Output is correct

Subtask #2
5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	592 KB	Output is correct
2	Correct	1 ms	760 KB	Output is correct
3	Correct	1 ms	592 KB	Output is correct
4	Correct	1 ms	592 KB	Output is correct
5	Correct	1 ms	592 KB	Output is correct
6	Correct	1 ms	764 KB	Output is correct
7	Correct	1 ms	760 KB	Output is correct
8	Correct	1 ms	592 KB	Output is correct
9	Correct	1 ms	592 KB	Output is correct
10	Correct	1 ms	760 KB	Output is correct
11	Correct	1 ms	592 KB	Output is correct
12	Correct	1 ms	592 KB	Output is correct
13	Correct	1 ms	592 KB	Output is correct
14	Correct	1 ms	592 KB	Output is correct

Subtask #3
11.0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	592 KB	Output is correct
2	Correct	1 ms	760 KB	Output is correct
3	Correct	1 ms	592 KB	Output is correct
4	Correct	1 ms	592 KB	Output is correct
5	Correct	1 ms	592 KB	Output is correct
6	Correct	1 ms	764 KB	Output is correct
7	Correct	1 ms	760 KB	Output is correct
8	Correct	1 ms	592 KB	Output is correct
9	Correct	1 ms	592 KB	Output is correct
10	Correct	1 ms	592 KB	Output is correct
11	Correct	2 ms	592 KB	Output is correct
12	Correct	1 ms	592 KB	Output is correct
13	Correct	1 ms	592 KB	Output is correct
14	Correct	2 ms	592 KB	Output is correct

Subtask #4
18.0 / 18.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	592 KB	Output is correct
2	Correct	1 ms	760 KB	Output is correct
3	Correct	1 ms	592 KB	Output is correct
4	Correct	1 ms	592 KB	Output is correct
5	Correct	1 ms	592 KB	Output is correct
6	Correct	1 ms	764 KB	Output is correct
7	Correct	1 ms	760 KB	Output is correct
8	Correct	1 ms	592 KB	Output is correct
9	Correct	1 ms	592 KB	Output is correct
10	Correct	1 ms	760 KB	Output is correct
11	Correct	1 ms	592 KB	Output is correct
12	Correct	1 ms	592 KB	Output is correct
13	Correct	1 ms	592 KB	Output is correct
14	Correct	1 ms	592 KB	Output is correct
15	Correct	1 ms	592 KB	Output is correct
16	Correct	1 ms	592 KB	Output is correct
17	Correct	1 ms	592 KB	Output is correct
18	Correct	2 ms	592 KB	Output is correct
19	Correct	1 ms	592 KB	Output is correct
20	Correct	1 ms	592 KB	Output is correct
21	Correct	2 ms	592 KB	Output is correct
22	Correct	1 ms	764 KB	Output is correct
23	Correct	1 ms	592 KB	Output is correct
24	Correct	2 ms	760 KB	Output is correct
25	Correct	2 ms	592 KB	Output is correct
26	Correct	2 ms	592 KB	Output is correct
27	Correct	1 ms	760 KB	Output is correct
28	Correct	2 ms	760 KB	Output is correct

Subtask #5
26.0 / 26.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	592 KB	Output is correct
2	Correct	1 ms	760 KB	Output is correct
3	Correct	1 ms	592 KB	Output is correct
4	Correct	1 ms	592 KB	Output is correct
5	Correct	1 ms	592 KB	Output is correct
6	Correct	1 ms	764 KB	Output is correct
7	Correct	1 ms	760 KB	Output is correct
8	Correct	1 ms	592 KB	Output is correct
9	Correct	1 ms	592 KB	Output is correct
10	Correct	1 ms	760 KB	Output is correct
11	Correct	1 ms	592 KB	Output is correct
12	Correct	1 ms	592 KB	Output is correct
13	Correct	1 ms	592 KB	Output is correct
14	Correct	1 ms	592 KB	Output is correct
15	Correct	1 ms	592 KB	Output is correct
16	Correct	1 ms	592 KB	Output is correct
17	Correct	4 ms	592 KB	Output is correct
18	Correct	2 ms	592 KB	Output is correct
19	Correct	4 ms	760 KB	Output is correct
20	Correct	2 ms	592 KB	Output is correct
21	Correct	1 ms	592 KB	Output is correct

Subtask #6
36.0 / 36.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	592 KB	Output is correct
2	Correct	1 ms	760 KB	Output is correct
3	Correct	1 ms	592 KB	Output is correct
4	Correct	1 ms	592 KB	Output is correct
5	Correct	1 ms	592 KB	Output is correct
6	Correct	1 ms	764 KB	Output is correct
7	Correct	1 ms	760 KB	Output is correct
8	Correct	1 ms	592 KB	Output is correct
9	Correct	1 ms	592 KB	Output is correct
10	Correct	1 ms	760 KB	Output is correct
11	Correct	1 ms	592 KB	Output is correct
12	Correct	1 ms	592 KB	Output is correct
13	Correct	1 ms	592 KB	Output is correct
14	Correct	1 ms	592 KB	Output is correct
15	Correct	1 ms	592 KB	Output is correct
16	Correct	1 ms	592 KB	Output is correct
17	Correct	1 ms	592 KB	Output is correct
18	Correct	2 ms	592 KB	Output is correct
19	Correct	1 ms	592 KB	Output is correct
20	Correct	1 ms	592 KB	Output is correct
21	Correct	2 ms	592 KB	Output is correct
22	Correct	1 ms	764 KB	Output is correct
23	Correct	1 ms	592 KB	Output is correct
24	Correct	2 ms	760 KB	Output is correct
25	Correct	2 ms	592 KB	Output is correct
26	Correct	2 ms	592 KB	Output is correct
27	Correct	1 ms	760 KB	Output is correct
28	Correct	2 ms	760 KB	Output is correct
29	Correct	1 ms	592 KB	Output is correct
30	Correct	1 ms	592 KB	Output is correct
31	Correct	4 ms	592 KB	Output is correct
32	Correct	2 ms	592 KB	Output is correct
33	Correct	4 ms	760 KB	Output is correct
34	Correct	2 ms	592 KB	Output is correct
35	Correct	1 ms	592 KB	Output is correct
36	Correct	48 ms	592 KB	Output is correct
37	Correct	129 ms	848 KB	Output is correct
38	Correct	643 ms	848 KB	Output is correct
39	Correct	395 ms	848 KB	Output is correct
40	Correct	64 ms	848 KB	Output is correct
41	Correct	372 ms	848 KB	Output is correct
42	Correct	564 ms	848 KB	Output is correct
43	Correct	23 ms	592 KB	Output is correct
44	Correct	21 ms	592 KB	Output is correct

답안 #1105342

Compilation message

Subtask #1 4.0 / 4.0

Subtask #2 5.0 / 5.0

Subtask #3 11.0 / 11.0

Subtask #4 18.0 / 18.0

Subtask #5 26.0 / 26.0

Subtask #6 36.0 / 36.0

Subtask #1
4.0 / 4.0

Subtask #2
5.0 / 5.0

Subtask #3
11.0 / 11.0

Subtask #4
18.0 / 18.0

Subtask #5
26.0 / 26.0

Subtask #6
36.0 / 36.0