# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
676472 | penguin133 | Hotspot (NOI17_hotspot) | C++17 | 374 ms | 1648 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pi pair<int, int>
#define pii pair<int, pair<int, int> >
#define fi first
#define se second
int n,m,q;
vector<int>v[5005];
long double ans[5005], cnt[5005];
int vis[5005];
pi dist[5005];
void solve(){
cin >> n >> m;
while(m--){
int x,y; cin >> x >> y;
v[x].push_back(y);
v[y].push_back(x);
}
queue<int>qu;
cin >> q;
while(q--){
int x, y; cin >> x >> y;
qu.push(x);
for(int i=0;i<=n;i++)dist[i] = {1e18, 0}, vis[i] = 0;
dist[x] = {0, 1};
for(int i=0;i<=n;i++)cnt[i] = 0;
while(!qu.empty()){
int bru = qu.front(); qu.pop();
//cout << bru << '\n';
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |