제출 #387335

#제출 시각아이디문제언어결과실행 시간메모리
387335alireza_kaviani도시들 (IOI15_towns)C++11
35 / 100
22 ms1132 KiB
#include <bits/stdc++.h> #include "towns.h" using namespace std; #define SZ(x) int(x.size()) #define sep ' ' const int MAXN = 1e3 + 10; const int MOD = 1e9 + 7; int dist[4][MAXN]; int ask(int ind , int v , int n){ int mx = 0; for(int i = 0 ; i < n ; i++){ dist[ind][i] = getDistance(v , i); if(dist[ind][i] > dist[ind][mx]) mx = i; } return mx; } int hubDistance(int N, int sub) { int v = ask(0 , 0 , N); int u = ask(1 , v , N); ask(2 , u , N); int mn = MOD; for(int i = 0 ; i < N ; i++){ mn = min(mn , abs(dist[1][i] - dist[2][i])); // cout << i << sep << dist[1][i] << sep << dist[2][i] << endl; } // cout << v << sep << u << endl; int xl = 0 , xr = 0 , yl = 0 , yr = 0; vector<int> v1 , v2; for(int i = 0 ; i < N ; i++){ int val = dist[1][i] - dist[2][i]; dist[3][i] = (dist[1][i] + dist[2][i] - dist[1][u]) / 2; if(val < -mn) xl++; if(val == -mn) yl++ , v1.push_back(i); if(val == mn) yr++ , v2.push_back(i); if(val > mn) xr++; } int R = (dist[1][u] + mn) / 2; if(xl <= N / 2 && yl <= N / 2 && xr + yr <= N / 2) return R; if(xr <= N / 2 && yr <= N / 2 && xl + yl <= N / 2) return R; if(sub == 1 || sub == 2 || sub == 4) return -R; yl = yr = 0; for(int i = 0 ; i < SZ(v1) ; i++){ int cur = 1; for(int j = 0 ; j < i ; j++){ if(dist[3][v1[i]] + dist[3][v1[j]] > getDistance(v1[i] , v1[j])) cur++; } yl = max(yl , cur); } for(int i = 0 ; i < SZ(v2) ; i++){ int cur = 1; for(int j = 0 ; j < i ; j++){ if(dist[3][v2[i]] + dist[3][v2[j]] > getDistance(v2[i] , v2[j])) cur++; } yr = max(yr , cur); } //cout << xl << sep << yl << sep << xr << sep << yr << endl; if(xl <= N / 2 && yl <= N / 2 && xr + SZ(v2) <= N / 2) return R; if(xr <= N / 2 && yr <= N / 2 && xl + SZ(v1) <= N / 2) return R; return -R; }
#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...