Submission #1291179

#TimeUsernameProblemLanguageResultExecution timeMemory
1291179kustov_vadim_533도시들 (IOI15_towns)C++20
0 / 100
8 ms1852 KiB
#include <iostream> #include <algorithm> #include <math.h> #include <vector> #include <set> #include <queue> #include <array> #include <map> #include <random> #include <bitset> #include <stack> #include <deque> #include <random> #include <unordered_set> #include <unordered_map> #include <string> #include <chrono> #include "towns.h" using namespace std; typedef long long ll; typedef long double ld; mt19937 gen(chrono::steady_clock::now().time_since_epoch().count()); int hubDistance(int N, int sub) { int r = 1e9; vector<int> d(N, 0); for (int i = 0; i < N; ++i) { for (int j = i + 1; j < N; ++j) { int dij = getDistance(i, j); d[i] = max(d[i], dij); d[j] = max(d[j], dij); } } for (int i = 0; i < N; ++i) { r = min(r, d[i]); } return r; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...