思维
天涯-沧海
acmer
展开
-
2020 Multi-University Training Contest 7 1007 Game
整个图可以看成一个完全图,最长边必胜,两个端点连的其他边必败,然后剩余边中最长边必胜,最长边连的边必败。。。依次类推如果1号点连的边中有必胜边,那就必胜,否则必败#include<stdio.h>#include<queue>#include<string.h>#include<algorithm>using namespace std;#define ll long long#define maxn 3050ll mp[maxn..原创 2020-08-11 17:11:08 · 320 阅读 · 0 评论 -
2020上海高校程序设计竞赛暨第18届上海大学程序设计联赛夏季赛(同步赛) A 同源
这题可以等同于找三个互质的数xyz(可以假设x<=y<=c),x+y+z=n/k,xyz都不能为1,然后w=n/k,如果w是偶数,那x=2,yz拆成两个相邻奇数(如果(w-2)%2是奇数就拆成相差4的奇数),如果w是奇数,那x=3,其他两数yz和偶数同样处理,如果得到的z和y是3的倍数,就y-2,z+2最后得到的xyz如果有数等于1或者n%k不等于1都无解链接:https://ac.nowcoder.com/acm/contest/6871/A来源:牛客网时间限制:C/...原创 2020-08-05 17:46:55 · 1199 阅读 · 0 评论 -
(贪心)Codeforces Round #652 (Div. 2) E - DeadLee
这题首先每道菜如果够吃,就让吃它的人放到最后只吃这道菜,那对其他菜来说,就少了一些吃它的人,就又能有菜富裕,这样不断进行,如果每道菜都能在某个阶段富裕,那就alive,然后按照存入的顺序倒序输出,否则dead Be careful: there is 50 points penalty for submission which fails the pretests or resubmission (except failure on the first test, denial ...原创 2020-06-24 16:14:20 · 239 阅读 · 0 评论 -
(思维+暴力)CodeForces - 1244 D Paint the Tree
思路:首先可以看出,这个树只能是一条链的形式,如果有分叉,那必然染色会有冲突,所以我们只要枚举前两个点颜色,其他点就都已经确定了,纪录下最小值就好了You are given a tree consisting of nvertices. A tree is an undirected connected acyclic graph. Example of a tree.You have to paint each vertex into one of three colors. F.原创 2020-06-11 15:58:20 · 227 阅读 · 0 评论 -
(正确题意)Codeforces Round #639 (Div. 2) C Hilbert's Hotel
这题不少人是猜了一个找(i+ai)%n=(j+aj)%n水过去的,这个做法是正确的,但实际题意不是这样的,因为这样样例都没法解释正确的题意是这样的:给你一个数组ai,找两个不相等的整数k1,k2,是否存在k1+a[k1%n]=k2+a[k2%n]然后推一下就可以发现它和找(i+ai)%n=(j+aj)%n是等价的推的过程如下:假设是两个数ai和aj在变换后相等,现在找...原创 2020-05-07 02:13:10 · 214 阅读 · 0 评论 -
2018 Petrozavodsk Winter Camp, Yandex Cup CFGym 102155H Sketch
DescriptionGiven a sequence a consisting of integers a1, ..., an, consider all its non-decreasing subsequences of length k. Among all of these take the one with smallest last element. We denote the ...原创 2019-09-29 20:32:36 · 461 阅读 · 1 评论 -
Codeforces Round #311 (Div. 2) D. Vitaly and Cycle
After Vitaly was expelled from the university, he became interested in the graph theory.Vitaly especially liked the cycles of an odd length in which each vertex occurs at most once.Vitaly was wond...原创 2019-09-20 20:46:25 · 79 阅读 · 0 评论 -
Codeforces Round #585 (Div. 2) D. Ticket Game
Monocarp and Bicarp live in Berland, where every bus ticket consists of n digits (nis an even number). During the evening walk Monocarp and Bicarp found a ticket where some of the digits have been e...原创 2019-09-17 00:14:22 · 414 阅读 · 0 评论 -
Codeforces Round #585 (Div. 2) C. Swap Letters
Monocarp has got two strings s and thaving equal length. Both strings consist of lowercase Latin letters "a" and "b".Monocarp wants to make these two strings sand t equal to each other. He can d...原创 2019-09-17 00:03:29 · 265 阅读 · 0 评论 -
Balanced Lineup
DescriptionFor the daily milking, Farmer John's N cows (1 ≤ N ≤ 50,000) always line up in the same order. One day Farmer John decides to organize a game of Ultimate Frisbee with some of the cows. To...原创 2019-04-17 21:22:01 · 83 阅读 · 0 评论 -
Robbers
DescriptionN robbers have robbed the bank. As the result of their crime they chanced to get M golden coins. Before the robbery the band has made an agreement that after the robbery i-th gangster wou...原创 2019-04-17 21:19:49 · 426 阅读 · 0 评论