HDU-1789 Doing Homework again (贪心+树状数组+二分)
来源:互联网 发布:数据修炼系统下载 编辑:程序博客网 时间:2024/06/05 14:30
Doing Homework again
Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 15472 Accepted Submission(s): 9025
Problem Description
Ignatius has just come back school from the 30th ACM/ICPC. Now he has a lot of homework to do. Every teacher gives him a deadline of handing in the homework. If Ignatius hands in the homework after the deadline, the teacher will reduce his score of the final test. And now we assume that doing everyone homework always takes one day. So Ignatius wants you to help him to arrange the order of doing homework to minimize the reduced score.
Input
The input contains several test cases. The first line of the input is a single integer T that is the number of test cases. T test cases follow.
Each test case start with a positive integer N(1<=N<=1000) which indicate the number of homework.. Then 2 lines follow. The first line contains N integers that indicate the deadlines of the subjects, and the next line contains N integers that indicate the reduced scores.
Each test case start with a positive integer N(1<=N<=1000) which indicate the number of homework.. Then 2 lines follow. The first line contains N integers that indicate the deadlines of the subjects, and the next line contains N integers that indicate the reduced scores.
Output
For each test case, you should output the smallest total reduced score, one line per test case.
Sample Input
333 3 310 5 131 3 16 2 371 4 6 4 2 4 33 2 1 7 6 5 4
Sample Output
035
#include <bits/stdc++.h>using namespace std;struct point{int t, v;bool operator < (const point& x) const{return v > x.v;}}a[1001];int c[1001], dl;inline int lowbit(int x){return x & (-x);}void add(int x){while(x <= dl){c[x]++;x += lowbit(x);}}int query(int x){int ans = 0;while(x){ans += c[x];x -= lowbit(x);}return ans;}int main(){int T;scanf("%d", &T);while(T--){int n;scanf("%d", &n);dl = 0;for(int i = 1; i <= n; ++i){scanf("%d", &a[i].t);dl = max(dl, a[i].t);}for(int i = 1; i <= n; ++i){scanf("%d", &a[i].v);}sort(a + 1, a + 1 + n);memset(c, 0, sizeof(c));int ans = 0, l, r, mid;for(int i = 1; i <= n; ++i){if(query(a[i].t) == a[i].t){ans += a[i].v;}else{l = 0;r = a[i].t;while(r > l){mid = l + r >> 1;if(query(a[i].t) - query(mid) == a[i].t - mid){r = mid;}else{l = mid + 1;}}add(l);}}printf("%d\n", ans);}}/*题意:1000份作业,每天可以做一份作业,每份作业有一个deadline和迟交作业扣的分,问怎么安排作业进度可以让扣分最少。思路:首先,我们一定是先做扣分较大的作业。如果作业当天空闲,那么就当天做,否则就向前查找是否空闲,如果没有空闲时间,则记录扣分情况。向前查找空闲的操作可以用二分+树状数组将复杂度从O(n)降到O(nlog(n))。*/
阅读全文
0 0
- HDU-1789 Doing Homework again (贪心+树状数组+二分)
- hdu 1789 Doing Homework again 贪心算法
- hdu 1789 Doing Homework again (贪心)
- hdu 1789 Doing Homework again(贪心)
- HDU 1789 Doing Homework again (贪心)
- HDU 1789 Doing Homework again (贪心)
- hdu 1789 Doing Homework again 贪心算法
- HDU 1789 Doing Homework again(贪心~!)
- HDU 1789 Doing Homework Again( 贪心 )
- hdu 1789 doing homework again 贪心
- 贪心-hdu-1789-Doing Homework again
- hdu 1789 Doing Homework again (贪心)
- HDU 1789 Doing Homework again 贪心
- HDU 1789 Doing Homework again(贪心)
- hdu 1789 Doing Homework again (贪心)
- HDU 1789 Doing Homework again (贪心)
- HDU 1789 Doing Homework again(贪心)
- HDU 1789 Doing Homework again(贪心)
- linux中断编程、中断基础介绍
- POJ2635
- ionic3 解决img标签无法在手机上正常显示问题
- 1070. 结绳(25)
- PyQt4 精彩实例分析 实例1 Hello Kitty!
- HDU-1789 Doing Homework again (贪心+树状数组+二分)
- 资讯类项目无限轮播Banner+圆点指示
- TensorFlow基础2:Session.run()和Tensor.eval()的区别
- sql语句优化
- shell学习笔记(一)
- SAP MM培训(仅限沈阳地区)
- (time.h) 自己用
- src和href的区别
- mysql的事务详解