oj.uz

답안 #207282

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
207282 2020-03-07T01:55:29 Z AQT 도시들 (IOI15_towns) C++14
25 / 100
 25 ms 508 KB 
#include <towns.h>
#include <bits/stdc++.h>

using namespace std;

int dist[2][200];
int par[200], sz[200];

int hubDistance(int N, int sub){
    int d1 = 0, d2 = 0;
    for(int i = 1; i<N; i++){
        dist[0][i] = getDistance(0, i);
        if(dist[0][i] > dist[0][d1]){
            d1 = i;
        }
    }
    for(int i = 0; i<N; i++){
        dist[1][i] = getDistance(d1, i);
        if(dist[1][i] > dist[1][d2]){
            d2 = i;
        }
    }
    int dia = dist[1][d2];
    int ans = dia;
    for(int i = 0; i<N; i++){
        int k = (dist[0][d1] + dist[1][i] - dist[0][i])/2;
        if(abs(ans-dia/2) > abs(k-dia/2)){
            ans = k;
        }
    }
    ans = max(ans, dia-ans);
    vector<int> v, w, t;
    for(int i =0 ; i<N; i++){
        par[i] = i;
        v.push_back(i);
        sz[i] = 1;
    }
    int g = -1;
    for(int k = 0; k<10; k++){
        while(v.size() >= 2){
            int n = v.back();
            v.pop_back();
            int m = v.back();
            v.pop_back();
            if(dist[1][n] + dist[1][m] - getDistance(n, m) > dia){
                par[n] = -1;
                sz[m] += sz[n];
                w.push_back(m);
            }
            else{
                t.push_back(n);
                t.push_back(m);
            }
        }
        if(v.size() == 1 && w.empty()){
            g = v[0];
            break;
        }
        swap(v, w);
    }
    if(g != -1){
        int cnt = 0;
        for(int i = 0; i<N; i++){
            if(par[i] == i){
                if(dist[1][i] + dist[1][g] - getDistance(i, g) > dia){
                    cnt += sz[i];
                }
            }
        }
        if(cnt > N/2){
            ans = -ans;
        }
    }
    else{
        ans = -ans;
    }
    return -ans;
}

Compilation message

towns.cpp: In function 'int hubDistance(int, int)':
towns.cpp:9:28: warning: unused parameter 'sub' [-Wunused-parameter]
 int hubDistance(int N, int sub){
                            ^~~

Subtask #1
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 22 ms 376 KB Output is correct
2 Correct 19 ms 376 KB Output is correct
3 Correct 5 ms 256 KB Output is correct
4 Correct 25 ms 376 KB Output is correct
5 Correct 24 ms 380 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 22 ms 376 KB Output is correct
2 Correct 19 ms 376 KB Output is correct
3 Correct 25 ms 376 KB Output is correct
4 Correct 25 ms 376 KB Output is correct

Subtask #3
0 / 13.0

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

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 24 ms 508 KB Output isn't correct

Subtask #5
0 / 13.0

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

Subtask #6
0 / 39.0

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