Submission #674919

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
674919	2022-12-26 15:15:39	QwertyPi	Hotspot (NOI17_hotspot)	C++14	100 / 100	737 ms	1284 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;
long double Exp[MAXN];
bool vis[MAXN];
vector<int> G[MAXN];
vector<int> du(MAXN), dv(MAXN), cu(MAXN), cv(MAXN); 
void bfs(int u, int v, vector<int>& c, vector<int>& d){
  fill(c.begin(), c.end(), 0);
  fill(d.begin(), d.end(), 1 << 30);
  fill(vis, vis + MAXN, 0);
  deque<int> dq; dq.push_back(u); d[u] = 0; c[u] = 1; vis[u] = true;
  while(dq.size()){
    int t = dq.front(); dq.pop_front();
    for(auto i : G[t]){
      if(d[t] + 1 < d[i]){
        c[i] = c[t];
        d[i] = d[t] + 1;
        if(!vis[i]) dq.push_back(i), vis[i] = true;
      }else if(d[t] + 1 == d[i]){
        c[i] += c[t];
      }
    }
  }
}
bool ok[MAXN];
int n, m;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
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