oj.uz

Submission #433353

# Submission time Handle Problem Language Result Execution time Memory
433353 2021-06-19T15:45:53 Z timmyfeng Towns (IOI15_towns) C++17
100 / 100
 22 ms 880 KB 
#include <bits/stdc++.h>
using namespace std;

#include "towns.h"

const int N = 110;

int dist_0[N], dist_u[N], pos[N], color[N];

int hubDistance(int n, int subtask) {
    for (int i = 1; i < n; ++i) {
        dist_0[i] = getDistance(0, i);
    }

    int u = max_element(dist_0, dist_0 + n) - dist_0;
    dist_u[0] = dist_0[u];
    for (int i = 1; i < n; ++i) {
        dist_u[i] = u == i ? 0 : getDistance(u, i);
    }

    int v = max_element(dist_u, dist_u + n) - dist_u;
    pos[0] = (dist_0[u] - dist_0[v] + dist_u[v]) / 2;
    for (int i = 1; i < n; ++i) {
        pos[i] = min(pos[0], (dist_0[u] - dist_0[i] + dist_u[i]) / 2);
    }

    int ans = INT_MAX;
    map<int, vector<int>> groups;
    for (int i = 0; i < n; ++i) {
        ans = min(ans, max(pos[i], dist_u[v] - pos[i]));
        groups[pos[i]].push_back(i);
    }

    int left = 0, right = n;
    for (auto &[len, nodes] : groups) {
        right -= nodes.size();
        if (max(len, dist_u[v] - len) == ans) {
            if (max(left, right) <= n / 2) {
                int j = -1, balance = 0;
                for (auto i : nodes) {
                    if (balance == 0) {
                        j = i;
                    }

                    if (i == j || getDistance(i, j) < dist_u[i] + dist_u[j] - 2 * len) {
                        color[i] = j, ++balance;
                    } else {
                        color[i] = i, --balance;
                    }
                }

                int k = -1, count = 0;
                for (auto i : nodes) {
                    if (color[i] == i && getDistance(i, j) < dist_u[i] + dist_u[j] - 2 * len) {
                        k = i;
                    }
                    count += color[i] == k;
                }

                return count <= n / 2 ? ans : -ans;
            }
        }
        left += nodes.size();
    }

    return -ans;
}

Compilation message

towns.cpp: In function 'int hubDistance(int, int)':
towns.cpp:15:45: warning: conversion from 'long int' to 'int' may change value [-Wconversion]
   15 |     int u = max_element(dist_0, dist_0 + n) - dist_0;
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~
towns.cpp:21:45: warning: conversion from 'long int' to 'int' may change value [-Wconversion]
   21 |     int v = max_element(dist_u, dist_u + n) - dist_u;
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~
towns.cpp:36:29: warning: conversion from 'std::vector<int>::size_type' {aka 'long unsigned int'} to 'int' may change value [-Wconversion]
   36 |         right -= nodes.size();
      |                             ^
towns.cpp:63:28: warning: conversion from 'std::vector<int>::size_type' {aka 'long unsigned int'} to 'int' may change value [-Wconversion]
   63 |         left += nodes.size();
      |                            ^
towns.cpp:10:28: warning: unused parameter 'subtask' [-Wunused-parameter]
   10 | int hubDistance(int n, int subtask) {
      |                        ~~~~^~~~~~~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 340 KB Output is correct
2 Correct 16 ms 332 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 18 ms 336 KB Output is correct
5 Correct 17 ms 340 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 348 KB Output is correct
2 Correct 13 ms 332 KB Output is correct
3 Correct 19 ms 332 KB Output is correct
4 Correct 19 ms 340 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 332 KB Output is correct
2 Correct 18 ms 876 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 18 ms 876 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 332 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 332 KB Output is correct
2 Correct 19 ms 880 KB Output is correct
3 Correct 21 ms 876 KB Output is correct

Subtask #6
39.0 / 39.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 332 KB Output is correct
2 Correct 18 ms 844 KB Output is correct
3 Correct 22 ms 832 KB Output is correct