제출 #669993

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
669993		alvingogo	도시들 (IOI15_towns)	C++14	25 / 100	15 ms	464 KiB

towns

#include <bits/stdc++.h>
#include "towns.h"
 
using namespace std;

map<pair<int,int>,int> mpaa;
int qt=0;
int f(int x,int y){
    if(x==y){
        return 0;
    }
    if(x>y){
        swap(x,y);
    }
    if(mpaa.find(pair<int,int>(x,y))!=mpaa.end()){
        return mpaa[pair<int,int>(x,y)];
    }
    qt++;
    return mpaa[pair<int,int>(x,y)]=getDistance(x,y);
}
int hubDistance(int n, int sub) {
    mpaa.clear();
    vector<int> dist0(n);
    for (int i = 1; i < n; ++i) {
        dist0[i] = f(0,i);
    }
 
    int a = max_element(dist0.begin(), dist0.end()) - dist0.begin();
 
    vector<int> dist(n);
    dist[0] = dist0[a];
    for (int i = 1; i < n; ++i) {
        dist[i] = i == a ? 0 : f(i, a);
    }
 
    int b = max_element(dist.begin(), dist.end()) - dist.begin();
 
    vector<int> pos(n);
    pos[0] = (dist0[a] - dist0[b] + dist[b]) >> 1;
    for (int i = 1; i < n; ++i) {
        pos[i] = min(pos[0], (dist0[a] - dist0[i] + dist[i]) >> 1);
    }
 
    int ans = numeric_limits<int>::max();
 
    map<int, vector<int>> mp;
 
    for (int i = 0; i < n; ++i) {
        ans = min(ans, max(pos[i], dist[b] - pos[i]));
        mp[pos[i]].push_back(i);
    }
    return ans;
    int L = 0, R = n;
    for (auto [len, adj]: mp) {
        R -= adj.size();
 
        if (max(len, dist[b] - len) == ans && max(L, R) <= n / 2) {
            if (adj.size() <= n / 2) {
                return ans;
            }
            vector<int> p(n);
 
            int bal = 0, x;
            for (int y: adj) {
                if (bal == 0) {
                    x = y;
                }
                if (x == y || getDistance(x, y) < dist[x] + dist[y] - 2 * len) {
                    p[y] = x, ++bal;
                } else {
                    p[y] = y, --bal;
                }
            }
 
            int last = -1, cnt = 0;
            for (int y: adj) {
                if (p[y] == y && getDistance(x, y) < dist[x] + dist[y] - 2 * len) {
                    last = y;
                }
                cnt += p[y] == last;
            }
 
            if (cnt <= n / 2) {
                return ans;
            } else {
                return -ans;
            }
        }
        L += adj.size();
    }
 
    return -ans;
}

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

towns.cpp: In function 'int hubDistance(int, int)':
towns.cpp:28:53: warning: conversion from '__gnu_cxx::__normal_iterator<int*, std::vector<int> >::difference_type' {aka 'long int'} to 'int' may change value [-Wconversion]
   28 |     int a = max_element(dist0.begin(), dist0.end()) - dist0.begin();
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
towns.cpp:36:51: warning: conversion from '__gnu_cxx::__normal_iterator<int*, std::vector<int> >::difference_type' {aka 'long int'} to 'int' may change value [-Wconversion]
   36 |     int b = max_element(dist.begin(), dist.end()) - dist.begin();
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
towns.cpp:54:15: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   54 |     for (auto [len, adj]: mp) {
      |               ^
towns.cpp:55:23: warning: conversion from 'std::vector<int>::size_type' {aka 'long unsigned int'} to 'int' may change value [-Wconversion]
   55 |         R -= adj.size();
      |                       ^
towns.cpp:58:28: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   58 |             if (adj.size() <= n / 2) {
      |                 ~~~~~~~~~~~^~~~~~~~
towns.cpp:89:23: warning: conversion from 'std::vector<int>::size_type' {aka 'long unsigned int'} to 'int' may change value [-Wconversion]
   89 |         L += adj.size();
      |                       ^
towns.cpp:21:28: warning: unused parameter 'sub' [-Wunused-parameter]
   21 | int hubDistance(int n, int sub) {
      |                        ~~~~^~~

• Subtask 1: 13 / 13
• Subtask 2: 12 / 12
• Subtask 3: 0 / 13
• Subtask 4: 0 / 10
• Subtask 5: 0 / 13
• Subtask 6: 0 / 39