제출 #785497

#제출 시각아이디문제언어결과실행 시간메모리
785497Sohsoh84Towns (IOI15_towns)C++17
25 / 100
15 ms360 KiB
#include "towns.h" #include <bits/stdc++.h> using namespace std; typedef pair<int, int> pll; #define X first #define Y second #define sep ' ' #define debug(x) cerr << #x << ": " << x << endl; const int MAXN = 1e6 + 10; int n, f[MAXN]; inline int get(int u, int v) { u--, v--; return getDistance(u, v); } inline pll diam_t(int v) { int ans = v, ans_val = 0; for (int i = 1; i <= n; i++) { if (i == v) continue; int t = get(v, i); f[i] = t; if (t > ans_val) ans = i, ans_val = t; } return {ans, ans_val}; } int hubDistance(int N_, int sub) { n = N_; int diam_v = diam_t(1).X; auto [diam_u, diam] = diam_t(diam_v); int r = numeric_limits<int>::max(); map<int, int> mp; for (int i = 1; i <= n; i++) { if (i == diam_u || i == diam_v) continue; int du = get(diam_u, i); int dv = f[i]; mp[du - dv]++; int diff = max(du, dv) - min(du, dv); int a = (diff + diam) / 2; r = min(r, a); } int tr = 2 * r - diam; int ps = 0; int ss = n; for (auto [x, y] : mp) { ss -= y; if (x == r || x == tr) if (ps <= n / 2 && ss <= n / 2 && y <= n / 2) return r; ps += y; } return -r; }

컴파일 시 표준 에러 (stderr) 메시지

towns.cpp: In function 'int hubDistance(int, int)':
towns.cpp:35:29: 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...