제출 #854329

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
854329	2023-09-26 19:39:57	annabeth9680	Hotspot (NOI17_hotspot)	C++17	100 / 100	586 ms	1612 KiB

hotspot

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 5011;
vector<int> adj[MAXN];
long double ans[MAXN];
bool vis[MAXN];
int N;
vector<int> df(MAXN), ds(MAXN), nf(MAXN), ns(MAXN);
void bfs(int src, int dest, vector<int> &nums, vector<int> &dist){
    fill(nums.begin(),nums.end(),0); fill(dist.begin(),dist.end(),1<<30);
    memset(vis,false,sizeof(vis));
    vis[src] = true; dist[src] = 0; nums[src] = 1;
    deque<int> q; q.push_back(src);
    while(!q.empty()){
        int u = q.front(); q.pop_front();
        for(int v : adj[u]){
            if(dist[u]+1 < dist[v]){
                nums[v] = nums[u];
                dist[v] = dist[u]+1;
                if(!vis[v]){
                    q.push_back(v);
                    vis[v] = true;
                }
            }
            else if(dist[u]+1 == dist[v]){
                nums[v] += nums[u];
            }
        }
    }
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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