Submission #432580

#TimeUsernameProblemLanguageResultExecution timeMemory
432580Kevin_Zhang_TW도시들 (IOI15_towns)C++17
25 / 100
25 ms1224 KiB
#include <bits/stdc++.h> using namespace std; using ll = long long; #define pb emplace_back #define AI(i) begin(i), end(i) template<class T> bool chmin(T &a, T b) { return b < a && (a = b, true); } template<class T> bool chmax(T &a, T b) { return a < b && (a = b, true); } #ifdef KEV #define DE(args...) kout("[ " + string(#args) + " ] = ", args) void kout() { cerr << endl; } template<class T, class ...U> void kout(T a, U ...b) { cerr << a << ' ', kout(b...); } template<class T> void debug(T l, T r) { while (l != r) cerr << *l << " \n"[next(l)==r], ++l; } #else #define DE(...) 0 #define debug(...) 0 #endif const int MAX_N = 200; #include "towns.h" int mem_dis[MAX_N][MAX_N], n; int dis(int a, int b) { if (mem_dis[a][b]) return mem_dis[a][b]; return mem_dis[a][b] = mem_dis[b][a] = getDistance(a, b); } int get_far(int x) { int d = 0, g = -1; for (int i = 0;i < n;++i) if (i != x) if (chmax(d, dis(x, i))) g = i; return g; } int hubDistance(int N, int sub) { memset(mem_dis, 0, sizeof(mem_dis)); n = N; int f = get_far(0), g = get_far(f); map<int, int> cnt; for (int i = 0;i < n;++i) { int y = dis(f, i), z = dis(g, i), x = dis(f, g); int h = (y + z - x) / 2; ++cnt[y - h]; } int ret = dis(f, g); for (auto [a, _] : cnt) chmin(ret, max(a, dis(f, g) - a)); return ret; }

Compilation message (stderr)

towns.cpp: In function 'int hubDistance(int, int)':
towns.cpp:35:28: warning: unused parameter 'sub' [-Wunused-parameter]
   35 | int hubDistance(int N, int sub) {
      |                        ~~~~^~~
#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...