제출 #640492

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
640492		piOOE	도시들 (IOI15_towns)	C++17	컴파일 에러	0 ms	0 KiB

towns

#include <bits/stdc++.h>
#include "towns.h"

using namespace std;

int hubDistance(int n, int sub) {
    map<pair<int, int>, int> mp;
    auto mygetDistance = [&](int x, int y) {
        if (mp.count({x, y})) {
            return mp[{x, y}];
        } else {#include <bits/stdc++.h>
#include "towns.h"

using namespace std;

int hubDistance(int n, int sub) {
    map<pair<int, int>, int> mp;
    auto mygetDistance = [&](int x, int y) {
        if (mp.count({x, y})) {
            return mp[{x, y}];
        } else {
            return mp[{x, y}] = mp[{y, x}] = getDistance(x, y);
        }
    };
    if (sub <= 2) {
        vector<int> dist(n);
        for (int i = 0; i < n; ++i) {
            dist[i] = mygetDistance(i, 0);
        }
        int v = max_element(dist.begin(), dist.end()) - dist.begin();
        for (int i = 0; i < n; ++i) {
            dist[i] = mygetDistance(i, v);
        }
        int u = max_element(dist.begin(), dist.end()) - dist.begin();
        vector<int> dist2(n);
        for (int i = 0; i < n; ++i) {
            dist2[i] = mygetDistance(i, u);
        }
        int ans = numeric_limits<int>::max();
        for (int i = 0; i < n; ++i) {
            int e = dist[i] + dist2[i] - dist[u] >> 1;
            ans = min(ans, max(dist[i] - e, dist2[i] - e));
        }
        return ans;
    } else {
        vector<int> dist(n);
        for (int i = 0; i < n; ++i) {
            dist[i] = mygetDistance(i, 0);
        }

        int a = max_element(dist.begin(), dist.end()) - dist.begin();
        for (int i = 0; i < n; ++i) {
            dist[i] = mygetDistance(i, a);
        }

        int b = max_element(dist.begin(), dist.end()) - dist.begin();
        vector<int> dist2(n);
        for (int i = 0; i < n; ++i) {
            dist2[i] = mygetDistance(i, b);
        }

        int ans = numeric_limits<int>::max();
        for (int i = 0; i < n; ++i) {
            int e = dist[i] + dist2[i] - dist[b] >> 1;
            ans = min(ans, max(dist[i] - e, dist2[i] - e));
        }

        vector<int> mega;
        for (int i = 0; i < n; ++i) {
            if (i != b && i != a) {
                int e = dist[i] + dist2[i] - dist[b] >> 1;
                mega.push_back(dist[i] - e);
            }
        }
        sort(mega.begin(), mega.end());
        mega.resize(unique(mega.begin(), mega.end()) - mega.begin());

        const int m = mega.size();
        vector<int> adj(n), cnt(m);
        vector<vector<int>> kids(m);

        for (int i = 0; i < n; ++i) {
            if (i != b && i != a) {
                int e = dist[i] + dist2[i] - dist[b] >> 1;
                adj[i] = lower_bound(mega.begin(), mega.end(), dist[i] - e) - mega.begin();
                kids[adj[i]].push_back(i);
                ++cnt[adj[i]];
            }
        }

        for (int i = 0; i < m; ++i) {
            if (max(mega[i], dist[b] - mega[i]) == ans) {
                int L = 1, R = 1;
                for (int j = 0; j < i; ++j) {
                    L += cnt[j];
                }
                for (int j = i + 1; j < m; ++j) {
                    R += cnt[j];
                }
                if (max({L, R, cnt[i]}) <= n / 2 && 0) {
                    assert(false);
                    return -ans;
                }
            }
        }
        return ans;
    }
}
            return mp[{x, y}] = mp[{y, x}] = getDistance(x, y);
        }
    };
    if (sub <= 2) {
        vector<int> dist(n);
        for (int i = 0; i < n; ++i) {
            dist[i] = mygetDistance(i, 0);
        }
        int v = max_element(dist.begin(), dist.end()) - dist.begin();
        for (int i = 0; i < n; ++i) {
            dist[i] = mygetDistance(i, v);
        }
        int u = max_element(dist.begin(), dist.end()) - dist.begin();
        vector<int> dist2(n);
        for (int i = 0; i < n; ++i) {
            dist2[i] = mygetDistance(i, u);
        }
        int ans = numeric_limits<int>::max();
        for (int i = 0; i < n; ++i) {
            int e = dist[i] + dist2[i] - dist[u] >> 1;
            ans = min(ans, max(dist[i] - e, dist2[i] - e));
        }
        return ans;
    } else {
        vector<int> dist(n);
        for (int i = 0; i < n; ++i) {
            dist[i] = mygetDistance(i, 0);
        }

        int a = max_element(dist.begin(), dist.end()) - dist.begin();
        for (int i = 0; i < n; ++i) {
            dist[i] = mygetDistance(i, a);
        }

        int b = max_element(dist.begin(), dist.end()) - dist.begin();
        vector<int> dist2(n);
        for (int i = 0; i < n; ++i) {
            dist2[i] = mygetDistance(i, b);
        }

        int ans = numeric_limits<int>::max();
        for (int i = 0; i < n; ++i) {
            int e = dist[i] + dist2[i] - dist[b] >> 1;
            ans = min(ans, max(dist[i] - e, dist2[i] - e));
        }

        vector<int> mega;
        for (int i = 0; i < n; ++i) {
            if (i != b && i != a) {
                int e = dist[i] + dist2[i] - dist[b] >> 1;
                mega.push_back(dist[i] - e);
            }
        }
        sort(mega.begin(), mega.end());
        mega.resize(unique(mega.begin(), mega.end()) - mega.begin());

        const int m = mega.size();
        vector<int> adj(n), cnt(m);
        vector<vector<int>> kids(m);

        for (int i = 0; i < n; ++i) {
            if (i != b && i != a) {
                int e = dist[i] + dist2[i] - dist[b] >> 1;
                adj[i] = lower_bound(mega.begin(), mega.end(), dist[i] - e) - mega.begin();
                kids[adj[i]].push_back(i);
                ++cnt[adj[i]];
            }
        }

        for (int i = 0; i < m; ++i) {
            if (max(mega[i], dist[b] - mega[i]) == ans) {
                int L = 1, R = 1;
                for (int j = 0; j < i; ++j) {
                    L += cnt[j];
                }
                for (int j = i + 1; j < m; ++j) {
                    R += cnt[j];
                }
                if (max({L, R, cnt[i]}) <= n / 2) {
                    assert(false);
                    return -ans;
                }
            }
        }
        return ans;
    }
}

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

towns.cpp:11:17: error: stray '#' in program
   11 |         } else {#include <bits/stdc++.h>
      |                 ^
towns.cpp: In lambda function:
towns.cpp:11:18: error: 'include' was not declared in this scope
   11 |         } else {#include <bits/stdc++.h>
      |                  ^~~~~~~
towns.cpp:11:27: error: 'bits' was not declared in this scope
   11 |         } else {#include <bits/stdc++.h>
      |                           ^~~~
towns.cpp:11:32: error: 'stdc' was not declared in this scope; did you mean 'std'?
   11 |         } else {#include <bits/stdc++.h>
      |                                ^~~~
      |                                std
towns.cpp:14:1: error: expected primary-expression before 'using'
   14 | using namespace std;
      | ^~~~~
towns.cpp:16:33: error: a function-definition is not allowed here before '{' token
   16 | int hubDistance(int n, int sub) {
      |                                 ^
towns.cpp: In function 'int hubDistance(int, int)':
towns.cpp:117:55: warning: conversion from '__gnu_cxx::__normal_iterator<int*, std::vector<int> >::difference_type' {aka 'long int'} to 'int' may change value [-Wconversion]
  117 |         int v = max_element(dist.begin(), dist.end()) - dist.begin();
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
towns.cpp:121:55: warning: conversion from '__gnu_cxx::__normal_iterator<int*, std::vector<int> >::difference_type' {aka 'long int'} to 'int' may change value [-Wconversion]
  121 |         int u = max_element(dist.begin(), dist.end()) - dist.begin();
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
towns.cpp:128:40: warning: suggest parentheses around '-' inside '>>' [-Wparentheses]
  128 |             int e = dist[i] + dist2[i] - dist[u] >> 1;
towns.cpp:138:55: warning: conversion from '__gnu_cxx::__normal_iterator<int*, std::vector<int> >::difference_type' {aka 'long int'} to 'int' may change value [-Wconversion]
  138 |         int a = max_element(dist.begin(), dist.end()) - dist.begin();
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
towns.cpp:143:55: warning: conversion from '__gnu_cxx::__normal_iterator<int*, std::vector<int> >::difference_type' {aka 'long int'} to 'int' may change value [-Wconversion]
  143 |         int b = max_element(dist.begin(), dist.end()) - dist.begin();
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
towns.cpp:151:40: warning: suggest parentheses around '-' inside '>>' [-Wparentheses]
  151 |             int e = dist[i] + dist2[i] - dist[b] >> 1;
towns.cpp:158:44: warning: suggest parentheses around '-' inside '>>' [-Wparentheses]
  158 |                 int e = dist[i] + dist2[i] - dist[b] >> 1;
towns.cpp:165:32: warning: conversion from 'std::vector<int>::size_type' {aka 'long unsigned int'} to 'int' may change value [-Wconversion]
  165 |         const int m = mega.size();
      |                       ~~~~~~~~~^~
towns.cpp:171:44: warning: suggest parentheses around '-' inside '>>' [-Wparentheses]
  171 |                 int e = dist[i] + dist2[i] - dist[b] >> 1;
towns.cpp:172:77: warning: conversion from '__gnu_cxx::__normal_iterator<int*, std::vector<int> >::difference_type' {aka 'long int'} to '__gnu_cxx::__alloc_traits<std::allocator<int>, int>::value_type' {aka 'int'} may change value [-Wconversion]
  172 |                 adj[i] = lower_bound(mega.begin(), mega.end(), dist[i] - e) - mega.begin();
      |                          ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~