模拟
Spidy_harker
这个作者很懒,什么都没留下…
展开
-
UPC-ICPC训练赛 Menagerie(模拟)
题目(http://icpc.upc.edu.cn/problem.php?cid=1713&pid=1)Snuke, who loves animals, built a zoo.There are N animals in this zoo. They are conveniently numbered 1 through N, and arranged in a circle. ...原创 2019-03-23 21:37:34 · 606 阅读 · 0 评论 -
洛谷P1563
题目#include <iostream>using namespace std;///坑点:x=(x%n+n)%n;求出的x可能等于0,0所对的是第n个小人,所以要返回nstruct peo{ string name; int cx;///朝向}p[100005];long n;///小人个数long m;///指令个数int dir(int ...原创 2019-04-04 16:34:42 · 251 阅读 · 0 评论 -
问题 B: Slimming Plan
Chokudai loves eating so much. However, his doctor Akensho told him that he was overweight, so he finally decided to lose his weight.Chokudai made a slimming plan of a D-day cycle. It is represented ...原创 2019-04-18 22:07:39 · 247 阅读 · 0 评论 -
问题 I: Stones
题目描述There are N stones arranged in a row. Every stone is painted white or black. A string S represents the color of the stones. The i-th stone from the left is white if the i-th character of S is ., ...原创 2019-07-29 09:17:29 · 401 阅读 · 0 评论 -
问题 N: 我有一个梦想
题目描述「Tweetuzki 你怎么这么菜啊,打了这么久 CF 还没紫。」「Emmm…」「Tweetuzki 你好菜啊,怎么打个 Div2 都能掉分的啊。」「Emmm…」「Tweetuzki 你不行啊,这不是傻逼题你怎么没秒啊?」「Emmm…」「Tweetuzki,等会有一场 Div2,你赶紧上紫啊。」「我……尽力吧」微弱的灯光在漆黑的夜晚里,闪烁得如此明亮。凌乱的英文字母与纷杂...原创 2019-08-02 10:10:18 · 365 阅读 · 0 评论 -
Non-Interactive Guessing Number
题目思路:1.猜数有两种极端:1)最优策略:二分猜数2)最差策略:猜两端未猜过的数(如 n=10 “>><<>” 那么我猜1,2,10,9,3)2.若含有等于号,则我们要选择最优策略先猜,有以下两种情况1)若在猜的中间(或者在最后一回合)我们就获胜了(l==r,即可输出“YES”),中间获胜的情况我们就可以在中间随便猜猜消耗一下次数,可以理解为最优和最差...原创 2019-09-03 19:44:09 · 276 阅读 · 0 评论