oj.uz

답안 #1018437

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1018437 2024-07-10T04:27:38 Z huutuan 도시들 (IOI15_towns) C++14
0 / 100
 10 ms 600 KB 
#include "towns.h"

#include <bits/stdc++.h>

using namespace std;

int dd[200][200], d1[200], d2[200];

int GetDistance(int u, int v){
   if (u==v) return 0;
   if (dd[u][v]) return dd[u][v];
   return dd[u][v]=dd[v][u]=getDistance(u, v);
}

int hubDistance(int N, int sub) {
   int u=0, dis=0;
   for (int i=1; i<N; ++i){
      int d=GetDistance(0, i);
      if (d>dis){
         dis=d;
         u=i;
      }
   }
   dis=0;
   int v=u;
   for (int i=0; i<N; ++i) if (i!=u){
      int d=GetDistance(u, i);
      d1[i]=d;
      if (d>dis){
         dis=d;
         v=i;
      }
   }
   int ans=1e9;
   vector<pair<int, int>> vv;
   for (int i=0; i<N; ++i) if (i!=u && i!=v){
      d2[i]=GetDistance(v, i);
      int common=(d1[i]+d2[i]-dis)/2;
      int dl=d1[i]-common, dr=d2[i]-common;
      ans=min(ans, max(dl, dr));
      vv.emplace_back(dl, dr);
   }
   sort(vv.begin(), vv.end());
   for (auto &ii:vv) if (max(ii.first, ii.second)==ans){
      int szl=0, szr=0;
      vector<int> child;
      for (int i=0; i<N; ++i){
         int common=(d1[i]+d2[i]-dis)/2;
         int dl=d1[i]-common, dr=d2[i]-common;
         if (dl<ii.first) ++szl;
         else if (dl>ii.first) ++szr;
         else child.push_back(i);
      }
      vector<pair<int, int>> subtree;
      for (int i:child){
         bool check=0;
         for (auto &j:subtree){
            int ff=GetDistance(i, j.first);
            int common=d1[i]+d1[j.first]-ff;
            if (common){
               ++j.second;
               check=1;
               break;
            }
         }
         if (!check) subtree.emplace_back(i, 1);
      }
      int mx=N/2;
      bool check=szl<=mx && szr<=mx;
      for (auto &i:subtree) check&=i.second<=mx;
      if (check) return ans;
   }
   return -ans;
}

Compilation message

towns.cpp: In function 'int hubDistance(int, int)':
towns.cpp:49:31: warning: unused variable 'dr' [-Wunused-variable]
   49 |          int dl=d1[i]-common, dr=d2[i]-common;
      |                               ^~
towns.cpp:15:28: warning: unused parameter 'sub' [-Wunused-parameter]
   15 | int hubDistance(int N, int sub) {
      |                        ~~~~^~~

Subtask #1
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 8 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 8 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 10 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 9 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 7 ms 600 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 7 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -