Submission #556774

#TimeUsernameProblemLanguageResultExecution timeMemory
556774blue도시들 (IOI15_towns)C++17
0 / 100
13 ms352 KiB
#include "towns.h" #include <vector> #include <cmath> #include <set> #include <iostream> using namespace std; namespace { using vi = vector<int>; } int hubDistance(int N, int sub) { vi dist0(N); dist0[0] = 0; for(int i = 1; i < N; i++) dist0[i] = getDistance(0, i); int S = 0; for(int i = 1; i < N; i++) if(dist0[i] > dist0[S]) S = i; int ST = 0; //diameter // cerr << "done\n"; vi distS(N); distS[S] = 0; distS[0] = dist0[S]; int T = 0; ST = distS[0]; for(int i = 1; i < N; i++) { if(i != S) { distS[i] = getDistance(S, i); if(distS[i] > ST) { ST = distS[i]; T = i; } } } // cerr << "S = " << S << "\n"; vi S0_dist(N); for(int i = 0; i < N; i++) S0_dist[i] = (distS[i] + dist0[i] - distS[0])/2; vi xcoord(N); for(int i = 0; i < N; i++) xcoord[i] = distS[i] - S0_dist[i]; // int res = 5'000'000; int best_score = 5'000'000; set<int> best_coords; for(int i = 0; i < N; i++) { int curr_score = max(xcoord[i], ST - xcoord[i]); if(curr_score < best_score) { best_score = curr_score; best_coords.insert(xcoord[i]); } else if(curr_score == best_score) { best_coords.insert(xcoord[i]); } } return *best_coords.rbegin(); }

Compilation message (stderr)

towns.cpp: In function 'int hubDistance(int, int)':
towns.cpp:34:6: warning: variable 'T' set but not used [-Wunused-but-set-variable]
   34 |  int T = 0;
      |      ^
towns.cpp:14:28: warning: unused parameter 'sub' [-Wunused-parameter]
   14 | 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...