题目传送门:http://codeforces.com/problemset/problem/97/C 题意:给出$n$与一个范围在$[0,1]$内的递增序列$P_0-P_n$,试构造一个无穷序列$\{a_i\}$满足$0 \leq a_i \leq n$,使得对于任意$k > 0$满足$a_k \leq \sum\limits_{i=1}^{k-1}(n - 2a_i)$且极限$\lim\limits_{m \rightarrow +\infty} \frac{\sum\limits_{i=1…

CF97C Winning Strategy 洛咕(题意应该快传上去了) 这题好玄学鸭...都不知道为啥是对的 设\(f[i][j]\)表示打了i轮比赛,有j个参加了一次的人,直接枚举有几个参加了转移过去即可 #include<bits/stdc++.h> #define il inline #define vd void #define ll long long il int gi(){ int x=0,f=1;char ch=getchar(); while(!isdigit(ch)){i…

题解 CF97C [Winning Strategy] 此题是某平台%你赛原题,跟大家分享一下某校zsy和sxr等同学的神仙做法. 我解释一下题意,大是说,我有[无限]个人,每个人可以对他"伤害"至多两次.当伤害完第二次时,这个人会转变成一个贡献(Pi).Pi和杀死的人数正相关. Idea: 其实此题关键是"无限"这个关键词,这说明,操作到了极远的时候,其实是几种操作在互刷,稍后我们将伪证明,有且仅有特定两种操作在互刷. 为了方便讨论,我们定义: 没有被操作过的人称…

正解:构造+图论 解题报告: 找了半天才找到的传送门! 先简要表达下题意 一个图上,如果存在(a,b)满足a<b且存在从a到b再回到a的路径,每条道路被经过至多一次,我们称(a,b)为完美点对试构造一个点数和边数不超过5000的无向连通图,其完美点对数量恰好为K k<=107 昂这题也比较简单啊,,,就每次都尽量大地构边双联通分量 然后把他们连起来就好辣 显然连起来是不会构造完美点对的 然后关于边双联通分量,可以得到当有n个点的时候完美点对的数量为n(n-1)/2 然后就好辣? over! #…

大意: 无向图, 无重边自环, 每个点度数>=3, 要求完成下面任意一个任务 找一条结点数不少于n/k的简单路径 找k个简单环, 每个环结点数小于n/k, 且不为3的倍数, 且每个环有一个特殊点$x$, $x$只属于这一个环 任选一棵生成树, 若高度>=n/k, 直接完成任务1, 否则对于叶子数一定不少于k, 而叶子反向边数>=2, 一定可以构造出一个环 #include <iostream> #include <algorithm> #include <c…

蒟蒻才普及组呀~ 大佬别D我 等集中补一下 CF980F:咋说捏,我觉得要联赛了做这题有点浪费时间,等想颓废了再来写写叭qwq 215E/279D/288E/331C3/431D/433E/750G/776G(数位dp) 917E/914F/932G(字符串) 论文 https://www.codechef.com/problems/DISTNUM 316D3(置换) 由于不想浪费时间(太弱),不会做且无中文题解(或者写得不好),直接咕咕咕 CF142C CF156E CF123C CF185C…

Description 4x4 tic-tac-toe is played on a board with four rows (numbered 0 to 3 from top to bottom) and four columns (numbered 0 to 3 from left to right). There are two players, x and o, who move alternately with x always going first. The game is wo…

Find the Winning Move Time Limit: 3000MS   Memory Limit: 32768K Total Submissions: 1286   Accepted: 626 Description 4x4 tic-tac-toe is played on a board with four rows (numbered 0 to 3 from top to bottom) and four columns (numbered 0 to 3 from left t…

题目链接: 题目 D. Remainders Game time limit per test 1 second memory limit per test 256 megabytes 问题描述 Today Pari and Arya are playing a game called Remainders. Pari chooses two positive integer x and k, and tells Arya k but not x. Arya have to find the v…

Nim Time Limit: 1000MS   Memory Limit: 30000K Total Submissions: 1501   Accepted: 845 Description Let's play a traditional game Nim. You and I are seated across a table and we have a hundred stones on the table (we know the number of stones exactly).…