oj.uz

답안 #890515

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
890515 2023-12-21T11:35:08 Z abcvuitunggio 도시들 (IOI15_towns) C++17
48 / 100
 13 ms 1116 KB 
#include "towns.h"
#include <bits/stdc++.h>
using namespace std;
int n,dist[111][111],cnt[111],u,v,R,sz[2]={0,0};
int d(int u, int v){
    if (u==v)
        return 0;
    if (u>v)
        swap(u,v);
    if (dist[u][v])
        return dist[u][v];
    return dist[u][v]=getDistance(u,v);
}
int calc(vector <int> ve){
    vector <int> tmp;
    fill(cnt,cnt+n,1);
    tmp.push_back(ve.back());
    ve.pop_back();
    for (int i:ve){
        int c=1;
        for (int j:tmp){
            int x=(d(i,u)+d(i,v)-d(u,v))/2,y=(d(j,u)+d(j,v)-d(u,v))/2;
            if (d(i,j)<x+y){
                cnt[j]++;
                if (cnt[j]>n/2)
                    return -R;
                c=0;
                break;
            }
        }
        if (c)
            tmp.push_back(i);
    }
    return R;
}
int hubDistance(int N, int sub){
    n=N;
    memset(dist,0,sizeof(dist));
    pair <int, int> mx={0,-1};
    for (int i=0;i<N;i++)
        mx=max(mx,{d(0,i),i});
    u=mx.second;
    mx={0,-1};
    for (int i=0;i<N;i++)
        mx=max(mx,{d(u,i),i});
    v=mx.second,R=1e9,sz[0]=sz[1]=0;
	for (int i=0;i<N;i++)
        R=min(R,abs(d(i,u)-d(i,v)));
    vector <int> a,b,tmp;
    for (int i=0;i<N;i++){
        int val=d(i,u)-d(i,v);
        if (val<-R)
            sz[0]++;
        if (val==-R)
            a.push_back(i);
        if (val==R)
            b.push_back(i);
        if (val>R)
            sz[1]++;
    }
    if (!R)
        b.clear();
    R=(R+d(u,v))/2;
    if (max(sz[0],sz[1])>N/2)
        return -R;
    if (min(sz[1]+b.size(),sz[0]+a.size())>N/2)
        return -R;
    if (sub==4||sub<3)
        return (max(a.size(),b.size())>N/2?-R:R);
    if (max(a.size(),sz[1]+b.size())<=N/2)
        return R;
    if (max(b.size(),sz[0]+a.size())<=N/2)
        return R;
    return calc(b.size()+sz[1]<=N/2?a:b);
}

Compilation message

towns.cpp: In function 'int d(int, int)':
towns.cpp:5:18: warning: declaration of 'v' shadows a global declaration [-Wshadow]
    5 | int d(int u, int v){
      |              ~~~~^
towns.cpp:4:33: note: shadowed declaration is here
    4 | int n,dist[111][111],cnt[111],u,v,R,sz[2]={0,0};
      |                                 ^
towns.cpp:5:11: warning: declaration of 'u' shadows a global declaration [-Wshadow]
    5 | int d(int u, int v){
      |       ~~~~^
towns.cpp:4:31: note: shadowed declaration is here
    4 | int n,dist[111][111],cnt[111],u,v,R,sz[2]={0,0};
      |                               ^
towns.cpp: In function 'int hubDistance(int, int)':
towns.cpp:66:43: warning: comparison of integer expressions of different signedness: 'const long unsigned int' and 'int' [-Wsign-compare]
   66 |     if (min(sz[1]+b.size(),sz[0]+a.size())>N/2)
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~
towns.cpp:69:39: warning: comparison of integer expressions of different signedness: 'const long unsigned int' and 'int' [-Wsign-compare]
   69 |         return (max(a.size(),b.size())>N/2?-R:R);
      |                 ~~~~~~~~~~~~~~~~~~~~~~^~~~
towns.cpp:70:37: warning: comparison of integer expressions of different signedness: 'const long unsigned int' and 'int' [-Wsign-compare]
   70 |     if (max(a.size(),sz[1]+b.size())<=N/2)
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
towns.cpp:72:37: warning: comparison of integer expressions of different signedness: 'const long unsigned int' and 'int' [-Wsign-compare]
   72 |     if (max(b.size(),sz[0]+a.size())<=N/2)
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~
towns.cpp:74:31: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   74 |     return calc(b.size()+sz[1]<=N/2?a:b);
      |                 ~~~~~~~~~~~~~~^~~~~

Subtask #1
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 864 KB Output is correct
2 Correct 9 ms 860 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 12 ms 860 KB Output is correct
5 Correct 12 ms 860 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 1116 KB Output is correct
2 Correct 8 ms 860 KB Output is correct
3 Correct 13 ms 856 KB Output is correct
4 Correct 12 ms 860 KB Output is correct

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 860 KB Output is correct
2 Correct 12 ms 860 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 13 ms 1112 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 1116 KB Output is correct

Subtask #5
0 / 13.0

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

Subtask #6
0 / 39.0

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