CodeForces 772A Voltage Keepsake
来源:互联网 发布:常见的hash算法有哪些 编辑:程序博客网 时间:2024/05/21 09:53
题目链接:http://codeforces.com/contest/772/problem/A
题意:有n台机器,每台机器初始的电脑为b[i],每秒消耗的电能是a[i],你每秒可以提供总和为p的电能给这n台机器分,问你这n台机器最多能一起坚持几秒,如果n台机器可以无限工作下去就输出-1
解析:二分答案t,然后判一下就好
#include <bits/stdc++.h>using namespace std;const int maxn = 1e5+100;struct node{ double a,b;}a[maxn];bool slove(double p,double t,int n){ double sum = p*t; for(int i=0;i<n;i++) { double tmp = a[i].a*t-a[i].b; if(tmp>0) sum -= tmp; if(sum<0) return false; } return true;}int main(void){ int n; double p; scanf("%d %lf",&n,&p); double sum = 0; for(int i=0;i<n;i++) { scanf("%lf %lf",&a[i].a,&a[i].b); sum += a[i].a; } double l = 0,r = 1e14; int k = 200; while(k--) { double mid = (l+r)/2; if(slove(p,mid,n)) l = mid; else r = mid; } if(p>=sum) puts("-1"); else printf("%.10f\n",l); return 0;}
0 0
- CodeForces 772A Voltage Keepsake
- CF#772 A. Voltage Keepsake(二分)
- A. Voltage Keepsake
- Codeforces 801C Voltage Keepsake
- Codeforces 801C Voltage Keepsake
- Codeforces 801C Voltage Keepsake 二分+精度
- Codeforces 801C Voltage Keepsake【二分】
- codeforces 801C Voltage Keepsake 二分答案
- Codeforces Round #409C Voltage Keepsake(二分)
- Codeforces Round # 409 C. Voltage Keepsake (二分)
- Codeforces Round #409 Div.2(C. Voltage Keepsake)二分
- Codeforces Round #409 C Voltage Keepsake(二分)
- Codeforces Round # 409 C. Voltage Keepsake (二分)
- Codeforces Round #409 (Div. 2) C. Voltage Keepsake 二分
- C. Voltage Keepsake
- C. Voltage Keepsake
- Codeforces801C Voltage Keepsake
- cf 801c Voltage Keepsake
- chrome浏览器解决跨域问题
- ubuntu anaconda install opencv
- 51nod1347
- 数据库锁机制
- 使用CXF开发RESTFul服务
- CodeForces 772A Voltage Keepsake
- Android录制WAV文件- 带去回声
- java从入门到弃坑第十天
- 基数排序
- 桟的应用——十进制转化为八进制
- 【CodeForces 797B】Odd sum(模拟)
- 【上机笔试之十三】最大公约数
- reactNative的页面跳转
- Android简单网络视频播放器