Submission #1087173

#TimeUsernameProblemLanguageResultExecution timeMemory
1087173guagua0407Towns (IOI15_towns)C++17
0 / 100
1 ms604 KiB
#include "towns.h" #include <bits/stdc++.h> using namespace std; #define ll long long #define pii pair<int,int> #define f first #define s second #define all(x) x.begin(),x.end() #define _ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int hubDistance(int N, int sub) { int n=N; vector<int> dis(n); for(int i=0;i<n;i++){ dis[i]=getDistance(0,i); } int x=max_element(all(dis))-dis.begin(); for(int i=0;i<n;i++){ dis[i]=getDistance(x,i); } int y=max_element(all(dis))-dis.begin(); vector<int> dis2(n); for(int i=0;i<n;i++){ dis2[i]=getDistance(y,i); } vector<int> val1(n),val2(n); vector<int> vec; for(int i=0;i<n;i++){ vec.push_back(dis[i]-(dis[i]+dis2[i]-dis[y])/2); val1[i]=dis[i]-(dis[i]+dis2[i]-dis[y])/2; val2[i]=(dis[i]+dis2[i]-dis[y])/2; } sort(all(vec)); int R=dis[y]; int ans=R; for(auto v:vec){ ans=min(ans,max(v,R-v)); } map<int,int> mp; for(auto v:vec){ mp[v]++; } bool tf=false; int pre=0; for(auto v:mp){ if(max(v.f,R-v.f)==ans){ int mx=max({pre,v.s,n-pre-v.s}); if(mx<=n/2){ tf=true; } } pre+=v.s; } int prv=ans; function<bool(int,int)> same=[&](int a,int b){ int d=getDistance(a,b); return (d==(val2[a]+val2[b])); }; if(!tf){ pre=0; for(auto v:mp){ if(max(v.f,R-v.f)==ans){ if(v.s>n/2){ vector<int> xs; for(int i=0;i<n;i++){ if(val1[i]==v.f){ xs.push_back(i); } } vector<vector<int>> diaob; vector<int> roy; for(auto u:xs){ diaob.push_back({u}); } while((int)diaob.size()>1){ vector<vector<int>> tmp; for(int i=0;i<(int)diaob.size()-1;i+=2){ if((int)diaob[i].size()<(int)diaob[i+1].size()) swap(diaob[i],diaob[i+1]); if(same(diaob[i][0],diaob[i+1][0])){ vector<int> cur=diaob[i]; cur.insert(cur.end(),all(diaob[i+1])); tmp.push_back(cur); } else{ for(int j=0;j<(int)diaob[i+1].size();j++){ roy.push_back(diaob[i][j]); roy.push_back(diaob[i+1][j]); } vector<int> cur; for(int j=(int)diaob[i].size()-1;j>=(int)diaob[i].size()-(int)diaob[i+1].size();j--){ cur.push_back(diaob[i][j]); } if(!cur.empty()) tmp.push_back(cur); } } if((int)diaob.size()%2==1){ tmp.push_back(diaob.back()); } diaob=tmp; } if(diaob.empty()){ tf=true; break; } int cnt=(int)diaob[0].size(); int node=diaob[0][0]; for(auto u:roy){ if(same(node,u)) cnt++; } if(cnt>n/2){ tf=true; } else{ tf=false; } break; } } pre+=v.s; } } assert(false); return (tf?ans:-ans); }

Compilation message (stderr)

towns.cpp: In function 'int hubDistance(int, int)':
towns.cpp:17:32: warning: conversion from '__gnu_cxx::__normal_iterator<int*, std::vector<int> >::difference_type' {aka 'long int'} to 'int' may change value [-Wconversion]
   17 |     int x=max_element(all(dis))-dis.begin();
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
towns.cpp:21:32: warning: conversion from '__gnu_cxx::__normal_iterator<int*, std::vector<int> >::difference_type' {aka 'long int'} to 'int' may change value [-Wconversion]
   21 |     int y=max_element(all(dis))-dis.begin();
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
towns.cpp:54:9: warning: unused variable 'prv' [-Wunused-variable]
   54 |     int prv=ans;
      |         ^~~
towns.cpp:11:28: warning: unused parameter 'sub' [-Wunused-parameter]
   11 | int hubDistance(int N, int sub) {
      |                        ~~~~^~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...