-
Notifications
You must be signed in to change notification settings - Fork 0
/
10660.cpp
74 lines (65 loc) · 1.58 KB
/
10660.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
#include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
const int M = 5;
const int MM = M*M;
int md(int x,int y) {
div_t xx = div(x,M);
div_t yy = div(y,M);
return abs(xx.quot-yy.quot)+abs(xx.rem-yy.rem);
}
int main(int argc, char* argv[])
{
int T;
cin>>T;
while (T--) {
int n; cin>>n;
int area[MM];
int min_dist_sum=0;
for (int i=0;i<MM;++i) {
area[i]=0;
min_dist_sum+=2*M*10000;
}
while (n--) {
int r,c,population; cin>>r>>c>>population; area[r*M+c]=population;
}
int sol[5];
for (int a=0;a<MM-4;++a) {
for (int b=a+1;b<MM-3;++b) {
for (int c=b+1;c<MM-2;++c) {
for (int d=c+1;d<MM-1;++d) {
for (int e=d+1;e<MM;++e) {
int office[5]={a,b,c,d,e};
//distance sum to offices from all areas
int dist_sum = 0;
for (int i=0;i<MM;++i) {
if (area[i]>0) {
int dist = md(i,office[0]);
for (int j=1;j<5;++j) {
int tmp = md(i,office[j]);
if (tmp<dist) {
dist=tmp;
}
}
dist*=area[i];
dist_sum+=dist;
}
}
if (dist_sum<min_dist_sum) {
min_dist_sum=dist_sum;
memcpy(sol,office,sizeof(int)*5);
}
}
}
}
}
}
for (int i=0;i<5;++i) {
if (i>0)
cout<<" ";
cout<<sol[i];
}
cout<<endl;
}
return 0;
}