제출 #669860

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

towns

#include <bits/stdc++.h>
#include <towns.h>
#pragma GCC optimize("Ofast")
#define AquA cin.tie(0);ios_base::sync_with_stdio(0);
#define fs first
#define sc second
#define p_q priority_queue
using namespace std;

map<pair<int,int>,int> mp;
int f(int x,int y){
    assert(x!=y);
    if(x==y){
        return 0;
    }
    if(x>y){
        swap(x,y);
    }
    if(mp.find({x,y})!=mp.end()){
        return mp[{x,y}];
    }
    return mp[{x,y}]=getDistance(x,y);
}
int hubDistance(int N,int sub){
    int n=N;
    int a=0;
    for(int i=0;i<n;i++){
        if(f(0,i)>f(0,a)){
            a=i;
        }
    }
    int b=a;
    for(int i=0;i<n;i++){
        if(f(a,i)>f(a,b)){
            b=i;
        }
    }
    map<int,pair<int,vector<int> > > m;
    for(int i=0;i<n;i++){
        if(i!=a && i!=b){
            int d=(f(i,a)+f(i,b)-f(a,b))/2;
            int x=f(i,a)-d;
            m[x].fs=max(m[x].fs,d);
            m[x].fs=max(m[x].fs,max(x,f(a,b)-x));
            m[x].sc.push_back(i);
        }
    }
    vector<int> g;
    for(auto h:m){
        g.push_back(h.fs);
    }
    int p=g.size();
    vector<int> dis(p,0);
    for(int i=0;i<p;i++){
        dis[i]=m[g[i]].fs;
        for(int j=i+1;j<p;j++){
            int u=g[i]-g[j];
            dis[i]=max(dis[i],m[g[j]].fs+u);
            dis[j]=max(dis[j],m[g[i]].fs+u);
        }
    }
    int y=0;
    for(int i=0;i<n;i++){
        y=max(y,dis[i]);
    }
    return y;
}

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

towns.cpp: In function 'int hubDistance(int, int)':
towns.cpp:52:17: warning: conversion from 'std::vector<int>::size_type' {aka 'long unsigned int'} to 'int' may change value [-Wconversion]
   52 |     int p=g.size();
      |           ~~~~~~^~
towns.cpp:24:27: warning: unused parameter 'sub' [-Wunused-parameter]
   24 | int hubDistance(int N,int sub){
      |                       ~~~~^~~

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