Archer Time Limit: 2000ms Memory Limit: 262144KB This problem will be judged on CodeForces. Original ID: 312B64-bit integer IO format: %I64d      Java class name: (Any)   SmallR is an archer. SmallR is taking a match of archer with Zanoes. They try t…

题 SmallR is an archer. SmallR is taking a match of archer with Zanoes. They try to shoot in the target in turns, and SmallR shoots first. The probability of shooting the target each time is  for SmallR while  for Zanoes. The one who shoots in the tar…

二分. 统计过程如下图: 先统计红线上的个数,然后统计绿线上的个数,然后统计咖啡色线上的个数......一个一个往下统计就可以了. #pragma comment(linker, "/STACK:1024000000,1024000000") #include<cstdio> #include<cstring> #include<cmath> #include<algorithm> #include<vector> #incl…

B. Archer Time Limit: 20 Sec Memory Limit: 256 MB 题目连接 http://codeforces.com/contest/312/problem/B Description SmallR is an archer. SmallR is taking a match of archer with Zanoes. They try to shoot in the target in turns, and SmallR shoots first. The…

A. Warrior and Archer Time Limit: 20 Sec Memory Limit: 256 MB 题目连接 http://codeforces.com/contest/594/problem/A Description In the official contest this problem has a different statement, for which jury's solution was working incorrectly, and for this…

595C - Warrior and Archer 思路:设最后答案的区间为[l,r],那么r-l等于n/2,因为在(l,r)中的点都是其中一个人挖掉的,[0,l)和(r,n]中的点是另一个人挖掉的,两者相等. 代码: #include<bits/stdc++.h> using namespace std; #define ll long long #define pb push_back #define mp make_pair #define pi acos(-1.0) #define p…

题目大意:给你在一条线上的n(偶数)个点,mike和alice 开始禁点,他们轮流开始,直到最后只剩下两个点, mike希望剩下的两个点距离尽可能小,alice希望剩下的两个点距离尽可能大,他们都采用最优策略,问你最后 剩下的两个点是什么. 这种脑洞题好难啊啊,难受. 思路:我们假定剩下了两个点是 x1 和 x2 ,那么最优考虑,mike拿掉的是<x1 和 >x2的点,alice拿掉的是 x1 和 x2 之间的点,所以我们枚举x1 和 x2,因为mike先选,我们取其中的最小值. #inclu…

[链接] 链接 [题意] 在这里输入题意 [题解] 概率水题. 枚举它是第几轮成功的. 直到满足精度就好 [错的次数] 1 [反思] long double最让人安心. [代码] #include <bits/stdc++.h> #define double long double #define ll long long using namespace std; double a,b,c,d; int main() { cin >> a >> b >> c…

题目链接: http://codeforces.com/problemset/problem/6/D D. Lizards and Basements 2 time limit per test2 secondsmemory limit per test64 megabytes 问题描述 This is simplified version of the problem used on the original contest. The original problem seems to hav…

D. Lizards and Basements 2 题目连接: http://codeforces.com/contest/6/problem/D Description This is simplified version of the problem used on the original contest. The original problem seems to have too difiicult solution. The constraints for input data h…