# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
731824 | Trunkty | Hotspot (NOI17_hotspot) | C++14 | 1178 ms | 277648 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/extc++.h>
using namespace std;
typedef long long ll;
#define int ll
int n,m,q;
vector<int> roads[5005];
int best[5005][5005],cnt[5005][5005];
long double val[5005];
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n >> m;
for(int i=1;i<=m;i++){
int a,b;
cin >> a >> b;
roads[a].push_back(b);
roads[b].push_back(a);
}
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
best[i][j] = 2000000000;
}
vector<int> v = {i};
best[i][i] = 0;
cnt[i][i] = 1;
for(int j=0;j<v.size();j++){
int x = v[j];
for(int k:roads[x]){
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... |