제출 #360141

#제출 시각아이디문제언어결과실행 시간메모리
360141beksultan04도시들 (IOI15_towns)C++14
25 / 100
22 ms512 KiB
#include "towns.h" #ifndef EVAL #include "grader.cpp" #endif // EVAL #include <bits/stdc++.h> using namespace std; #define lol long long #define pii pair<int,int> #define OK puts("OK"); #define NO puts("NO"); #define YES puts("YES"); #define fr first #define sc second #define ret return #define scanl(a) scanf("%lld",&a); #define scanll(a,b) scanf("%lld %lld",&a, &b); #define scanlll(a,b,c) scanf("%lld %lld %lld",&a,&b,&c); #define scan1(a) scanf("%d",&a); #define scan2(a,b) scanf("%d %d",&a, &b); #define scan3(a,b,c) scanf("%d %d %d",&a,&b,&c); #define all(s) s.begin(),s.end() #define allr(s) s.rbegin(),s.rend() #define pb push_back #define sz(v) (int)v.size() #define endi puts(""); #define eps 1e-12 int dist[1000],distv[1000],distu[1000],a[1000],b[1000],c[1000]; int hubDistance(int N, int sub) { int i,mx=0,j,v,u=0,len=2e9+7; for( i=0;i<N;++i){ dist[i] = getDistance(0,i); if (dist[i] > mx){ mx = dist[i]; v = i; } } mx = 0; for (i=0;i<N;++i){ if (i == v)continue; distv[i] = getDistance(v,i); if (mx < distv[i]){ mx = distv[i]; u = i; } } mx = 0; for (i=0;i<N;++i){ if (i == v || i == u)continue; distu[i] = getDistance(u,i); } for (i=0;i<N;++i){ if (i == v || i == u)continue; a[i] = (distv[i]+distu[i]-distv[u])/2; b[i] = (distv[i]+distv[u]-distu[i])/2; c[i] = (distu[i]+distv[u]-distv[i])/2; len = min(len,max(max(a[i],b[i]),c[i])); } int r=0,l=0,m=0; for (i=0;i<N;++i){ if (b[i] > len)r++; else if (a[i] > len)l++; else m++; } if (r >= N/2 || l >= N/2 || m >= N/2)ret -len; ret len; }

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

towns.cpp: In function 'int hubDistance(int, int)':
towns.cpp:29:13: warning: unused variable 'j' [-Wunused-variable]
   29 |  int i,mx=0,j,v,u=0,len=2e9+7;
      |             ^
towns.cpp:28:28: warning: unused parameter 'sub' [-Wunused-parameter]
   28 | int hubDistance(int N, int sub) {
      |                        ~~~~^~~
towns.cpp:52:15: warning: 'v' may be used uninitialized in this function [-Wmaybe-uninitialized]
   52 |         if (i == v || i == u)continue;
      |             ~~^~~~
#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...