LightOJ 1349 - Aladdin and the Optimal Invitation(数学啊)
来源:互联网 发布:c语言中常用函数 编辑:程序博客网 时间:2024/05/21 11:43
题目链接:http://lightoj.com/volume_showproblem.php?problem=1349
Finally Aladdin reached home, with the great magical lamp. He was happier than ever. As he was a nice boy, he wanted to share the happiness with all people in the town. So, he wanted to invite all people in town in some place such that they can meet there easily. As Aladdin became really wealthy, so, number of people was not an issue. Here you are given a similar problem.
Assume that the town can be modeled as an m x n 2D grid. People live in the cells. Aladdin wants to select a cell such that all people can gather here with optimal overall cost. Here, cost for a person is the distance he has to travel to reach the selected cell. If a person lives in cell (x, y) and he wants to go to cell (p, q), then the cost is |x-p|+|y-q|. So, distance between (5, 2) and (1, 3) is |5-1|+|2-3| which is 5. And the overall cost is the summation of costs for all people.
So, you are given the information of the town and the people, your task to report a cell which should be selected by Aladdin as the gathering point and the overall cost should be as low as possible.
Input
Input starts with an integer T (≤ 20), denoting the number of test cases.
Each case starts with a blank line. Next line contains three integers: m, n and q (1 ≤ m, n, q ≤ 50000), m and n denote the number of rows and columns of the grid respectively. Each of the next q lines contains three integers u v w (1 ≤ u ≤ m, 1 ≤ v ≤ n, 1 ≤ w ≤ 10000), meaning that there are w persons who live in cell (u, v). You can assume that there are no people in the cells which are not listed. You can also assume that each of the q lines contains a distinct cell.
Output
For each case, print the case number and the row and column position of the cell where the people should be invited. There can be multiple solutions, any valid one will do.
Sample Input
Output for Sample Input
2
5 1 1
2 1 10
5 5 4
1 1 1
2 2 1
4 4 1
5 5 1
Case 1: 2 1
Case 2: 3 3
Note
1. This is a special judge problem; wrong output format may cause 'Wrong Answer'.
2. Dataset is huge, use faster I/O methods.
PS:
求带权中位数!
代码如下:
#include <cstdio>#include <cstring>#include <algorithm>using namespace std;struct node{ int u, v; int w;} a[50047];bool cmp_u(node a, node b){ return a.u < b.u;}bool cmp_v(node a, node b){ return a.v < b.v;}int main(){ int t; scanf("%d",&t); int m, n, q; int cas = 0; while(t--) { scanf("%d%d%d",&m,&n,&q); int sum = 0; for(int i = 0; i < q; i++) { scanf("%d%d%d",&a[i].u,&a[i].v,&a[i].w); sum += a[i].w; } sort(a,a+q,cmp_u); int tt; if(sum%2) { tt = (sum+1)/2; } else { tt = sum/2; } int ansx = 0, ansy = 0; int tsum = 0; for(int i = 0; i < q; i++) { tsum += a[i].w; if(tsum >= tt) { ansx = a[i].u; break; } } tsum = 0; sort(a,a+q,cmp_v); for(int i = 0; i < q; i++) { tsum += a[i].w; if(tsum >= tt) { ansy = a[i].v; break; } } printf("Case %d: %d %d\n",++cas,ansx,ansy); } return 0;}
- LightOJ 1349 - Aladdin and the Optimal Invitation(数学啊)
- lightoj 1349 Aladdin and the Optimal Invitation
- lightoj 1349 - Aladdin and the Optimal Invitation 贪心 中位数
- lightoj 1349 - Aladdin and the Optimal Invitation 【中位数的运用】
- lightoj 1349 - Aladdin and the Optimal Invitation (中位数的运用)
- Light OJ 1349 Aladdin and the Optimal Invitation
- BNUOJ 13268 Aladdin and the Optimal Invitation
- lightoj1349 - Aladdin and the Optimal Invitation【求中位数】
- LightOJ 1348 Aladdin and the Return Journey (树链剖分)
- LightOJ 1348 Aladdin and the Return Journey(树链剖分)
- LightOJ 1348 Aladdin and the Return Journey (树链剖分)
- LightOJ 1348 Aladdin and the Return Journey(树链剖分)
- LightOJ 1342 - Aladdin and the Magical Sticks
- lightOJ 1341 Aladdin and the Flying Carpet
- LightOJ 1341 Aladdin and the Flying Carpet
- LightOJ 1341Aladdin and the Flying Carpet
- LightOJ 1341 - Aladdin and the Flying Carpet
- Aladdin and the Flying Carpet LightOJ
- 1.3_Manipulating Results
- 项目设计
- 外链权重高的新闻源外链
- Win7 和 MAC 系统通过VMware共享文件夹
- 第4周 【项目3-用对象数组操作长方柱类】
- LightOJ 1349 - Aladdin and the Optimal Invitation(数学啊)
- nginx折腾记(HTTP性能能测试,与Apache对比)
- BlissPop-v2.2-ef51l-UNOFFICIAL-20150331
- Linux开机自动挂载局域网windows共享文件夹
- No result defined for action and result input
- LeetCode OJ House Robber
- 正则表达式–零宽断言详解
- STL源码:hash_set、hash_map、hash_multiset、hash_multimap
- 关于excel 中的数据导入数据库 、数据库中的数据导入的Excel 中的思考