![](https://img-blog.csdnimg.cn/20201014180756780.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
三分
tomjobs
别慌,慌也没用
展开
-
2020ICPC 南京 Fireworks(整数三分+期望)
题意: 拿一个鞭炮花nnn时间,点燃之前所有鞭炮花mmm时间。 一个鞭炮有p10000\frac{p}{10000}10000p的可能是个好鞭炮。求最少期望时间能点燃好鞭炮。 思路: 可以想到,肯定是每次放固定数目的鞭炮再点燃,因为只要存在一个固定数目为xxx期望时间少,之后肯定还是放xxx个。 那么设放xxx个鞭炮再点燃,能遇到好鞭炮的期望次数为(mid∗n+m)/(1−(1−p)mid))(mid * n + m) / (1 - (1 - p)^{mid}))(mid∗n+m)/(1−(1−p)mid原创 2020-12-25 17:26:18 · 467 阅读 · 0 评论 -
A - Trick or Treat Gym - 102470A(三分)
题意: 一堆点在x轴上某个点会和,要你找到一个x轴上的点使得会和时间最短。 思路: 三分这个点即可 #pragma GCC optimize(3,"Ofast","inline") #include<bits/stdc++.h> using namespace std; typedef long long LL; typedef double db; bool Finish_read; template<class T>inline void read(T &x){Finis原创 2020-10-04 10:26:15 · 168 阅读 · 0 评论 -
E - Euclidean TSP Gym - 101482E(三分)
The famous Arora-Mitchell approximation algorithm for the Euclidean Travelling Salesman Problem (Eu- clidean TSP) was discovered independently by Sanjeev Arora and Joseph S. B. Mitchell in 1998. It ca...原创 2020-04-19 23:43:02 · 290 阅读 · 1 评论 -
Weakness and Poorness CodeForces - 578C(三分)
You are given a sequence of n integers a1, a2, …, an. Determine a real number x such that the weakness of the sequence a1 - x, a2 - x, …, an - x is as small as possible. The weakness of a sequence is ...原创 2020-02-10 18:14:04 · 312 阅读 · 0 评论 -
Error Curves UVA - 1476(三分求最值)
Josephina is a clever girl and addicted to Machine Learning recently. She pays much attention to a method called Linear Discriminant Analysis, which has many interesting properties. In order to test t...原创 2020-02-09 23:57:50 · 231 阅读 · 0 评论 -
BZOJ1857. [Scoi2010]传送带(三分套三分)
Description 在一个2维平面上有两条传送带,每一条传送带可以看成是一条线段。两条传送带分别为线段AB和线段CD。lxhgww在AB上的移动速度为P,在CD上的移动速度为Q,在平面上的移动速度R。现在lxhgww想从A点走到D点,他想知道最少需要走多长时间 Input 输入数据第一行是4个整数,表示A和B的坐标,分别为Ax,Ay,Bx,By 第二行是4个整数,表示C和D的坐标,分别为Cx,...原创 2019-10-11 19:16:36 · 180 阅读 · 0 评论