Code forces
薄层
努力就有收获~
展开
-
CodeForces 612D
奇妙的思维题。题意:给定n个区间,求被覆盖至少k次的区间(两端连续的区间可以合并)最少有多少个。思路:某个区间被覆盖至少k次,即这个区间的左端点包括左端点的前面应该至少包括给定的k个区间起点,且这些区间的终点至少有k个在这个区间右端点包括右端点的后面。所以可以这么想:给定的区间的左端点会贡献1,右端点会贡献-1,然后根据这n个区间即2*n个数进行排序(如果数值相同,根据贡献从1原创 2017-05-19 11:02:46 · 359 阅读 · 0 评论 -
codeforces-884D Boxes And Balls(思维、三叉哈夫曼树)
Ivan has n different boxes. The first of them contains some balls of n different colors.Ivan wants to play a strange game. He wants to distribute the balls into boxes in such a way that for every i (1 ≤ i ≤ n) i-th box will contain all balls with color i.原创 2017-11-01 14:52:44 · 678 阅读 · 0 评论 -
2014-2015 ACM-ICPC, NEERC, Northern Subregional Contest I-Instruction(模拟)
Ingrid is a head of a big railway station and, among other duties, is responsible for routing trains to theright platforms. The station has one entrance, and there are many switches that direct trains to otherswitches and platforms.Each switch has one i原创 2017-10-07 20:52:15 · 493 阅读 · 0 评论 -
CodeForces-835E The penguin's game(思维+二进制乱搞+交互题)
Pay attention: this problem is interactive.Penguin Xoriy came up with a new game recently. He has n icicles numbered from 1 to n. Each icicle has a temperature — an integer from 1 to 109. Exactly two of these icicles are special: their temperature is y, w原创 2017-08-31 14:14:27 · 343 阅读 · 0 评论 -
CodeForces-839B Game of the Rows(思维、细节)
Daenerys Targaryen has an army consisting of k groups of soldiers, the i-th group contains ai soldiers. She wants to bring her army to the other side of the sea to get the Iron Throne. She has recently bought an airplane to carry her army through the sea.原创 2017-08-16 23:59:39 · 256 阅读 · 0 评论 -
Codeforces Round #424 (Div. 2, rated, based on VK Cup Finals)-831C Jury Marks(思维)
Jury MarksPolycarp watched TV-show where k jury members one by one rated a participant by adding him a certain number of points (may be negative, i. e. points were subtracted). Initially the participant had some score, and each the marks were one by one a原创 2017-07-14 23:59:55 · 384 阅读 · 0 评论 -
Codeforces 855E Salazar Slytherin's Locket(数位dp)
Harry came to know from Dumbledore that Salazar Slytherin's locket is a horcrux. This locket was present earlier at 12 Grimmauld Place, the home of Sirius Black's mother. It was stolen from there and is now present in the Ministry of Magic in the office of原创 2017-11-10 13:05:51 · 346 阅读 · 0 评论 -
Codeforces 827C DNA Evolution(多维树状数组)
Everyone knows that DNA strands consist of nucleotides. There are four types of nucleotides: "A", "T", "G", "C". A DNA strand is a sequence of nucleotides. Scientists decided to track evolution of a rare species, which DNA strand was string s initially.E原创 2017-11-02 19:31:56 · 401 阅读 · 0 评论 -
CodeForces 606C
车辆排序CodeForces 606CDescription一个无限长的铁路有一个载着n辆车的火车,每一辆车的编号从1到n。每一辆车的编号都是不同的。他们的顺序是无序的。David Blaine想要将这些车按照他们的编号从小到大排序,他可以做两种操作。第一种,他可以将一辆车从任意位置移动到所有车的第一位。第二种,他可以将一辆车从任意位置移动到所有车的最后一位。不过他原创 2016-11-04 00:05:18 · 615 阅读 · 0 评论 -
code forces 735D 数论(哥德巴赫猜想)
哥德巴赫猜想:当 n > 5 且 n为奇数(odd number)时, n可写成两个质数之和;当 n > 2 且n为偶数(even number)时, n可写成三个质数之和.本题就利用了这个猜想基本内容来做的。本题思路:当n为质数时ans=1,当n不为质数且为偶数时,根据哥德巴赫猜想ans=2,当n不为质数且为奇数时,可知奇数减去一个最小的偶质数2之后还是奇原创 2017-04-28 17:16:52 · 498 阅读 · 0 评论 -
Codeforces Round #453 (Div. 2)...
A(水题)#include using namespace std;struct node { int x, y; bool operator<(const node k) const { return x < k.x; }} a[105];int main(){ int n, m, x, y; cin >> n >> m; for(int i = 0; i < n;原创 2018-01-25 16:08:24 · 273 阅读 · 0 评论 -
Codeforces-959D Mahmoud and Ehab and another array construction task(贪心)
题意:给定数组a,求大于或者等于数组a字典序的数组b,满足任意i,j,gcd(bi, bj) = 1。并且是在所有满足条件中的字典序最小的一个。思路:任意一对数互质,可以通过标记其质因子来解决,在找到第一个违背互质的数时,只需要找出大于该数的最小的一个与前面所有数互质的数,在此之后,要想保证字典序最小,便是所有可用的质数从小向大取。代码:#include using name原创 2018-04-30 16:17:21 · 570 阅读 · 0 评论 -
CodeForces-731E Funny Game(DP+Games)
Once upon a time Petya and Gena gathered after another programming competition and decided to play some game. As they consider most modern games to be boring, they always try to invent their own games. They have only stickers and markers, but that won't st原创 2017-08-13 12:30:36 · 385 阅读 · 0 评论 -
CodeForces 628D(数位DP)
题意:d-数:数字d有且只在偶数位上,奇数位不能出现数字d。(0思路:L,R范围较大,用string模拟。dp[i][j][k]:处理到第i位前对m取模为j且k表示忽略前导零之后i属于的位置是偶数位还是奇数位(暂时称作有效位)。详情看代码:#include #define LL long longusing namespace std;const int ma原创 2017-05-24 13:06:47 · 609 阅读 · 0 评论 -
Codeforces Round #418 (Div. 2)-C(尺取法)
Nadeko's birthday is approaching! As she decorated the room for the party, a long garland of Dianthus-shaped paper pieces was placed on a prominent part of the wall. Brother Koyomi will like it!Still unsatisfied with the garland, Nadeko decided to polish原创 2017-06-08 01:05:15 · 404 阅读 · 0 评论 -
Codeforces Round #427 (Div. 2)-C. Star sky(二维前缀和)
Codeforces Round #427 (Div. 2)-C. Star sky The Cartesian coordinate system is set in the sky. There you can see n stars, the i-th has coordinates (xi, yi), a maximum brightness c, equal for all stars, and an initial brightness si (0 ≤ si ≤ c).Over time t原创 2017-08-01 01:28:45 · 388 阅读 · 0 评论 -
codeforces-510E Fox And Dinner(带限制的二分图多重匹配+奇偶建图+打印路径)
Fox Ciel is participating in a party in Prime Kingdom. There are n foxes there (include Fox Ciel). The i-th fox is ai years old.They will have dinner around some round tables. You want to distribute foxes such that:Each fox is sitting at some table.Each原创 2017-10-13 16:35:28 · 348 阅读 · 0 评论 -
Gym-100342J Triatrip(求有向图三元环个数+bitset应用)
The travel agency “Four Russians” is offering the new service for their clients. Unlike other agencies that only suggest one-way or roundtrip for airline tickets to their customers, “Four Russians” offers the brand new idea — triatrip. Triatrip traveler st原创 2017-09-03 15:39:25 · 980 阅读 · 0 评论 -
CodeForces - 839E Mother of Dragons(无向图最大团)
There are n castles in the Lannister's Kingdom and some walls connect two castles, no two castles are connected by more than one wall, no wall connects a castle to itself.Sir Jaime Lannister has discovered that Daenerys Targaryen is going to attack his k原创 2017-08-21 20:35:33 · 407 阅读 · 0 评论 -
Codeforces-557D 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 wondering how to solve the following problem. You are given an原创 2017-07-31 17:55:20 · 406 阅读 · 0 评论 -
CodeForces-839C Journey(DFS+概率)
There are n cities and n - 1 roads in the Seven Kingdoms, each road connects two cities and we can reach any city from any other by the roads.Theon and Yara Greyjoy are on a horse in the first city, they are starting traveling through the roads. But the w原创 2017-08-17 01:18:36 · 384 阅读 · 0 评论 -
C-Cleaning Pipes(判断两线段相交+二分图判定) 2015-2016 Northwestern European Regional Contest (NWERC 2015)
Linköping has a quite complex water transport system.Around Linköping there are several wells from which wateris drawn. The water is then transported to other locationsusing pipes. Each pipe is a straight canal from one of thewells to some location in原创 2017-10-15 19:35:14 · 413 阅读 · 0 评论 -
CodeForces 616E(数学规律)
题意:输入n, m(1 ≤ n, m ≤ 10^13),求 n%1 + n%2 + ... + n%m的值.思路:n%i = n - n/i(整除)*i;所以 ∑(i=1, m) n%i 可以转化为 m*n - ∑(i=1, m) n/i*i;易知:给定一个i,被n整除得c = n/i,另r = n/c,很容易可以得到n整除i到r范围内的所有数的值都是相同的,所以我原创 2017-05-19 13:47:37 · 697 阅读 · 0 评论 -
CodeForces-540E Infinite Inversions(树状数组+离散化+加点)
There is an infinite sequence consisting of all positive integers in the increasing order: p = {1, 2, 3, ...}. We performed n swap operations with this sequence. A swap(a, b) is an operation of swapping the elements of the sequence on positions a and b. Yo原创 2017-09-27 21:02:08 · 317 阅读 · 0 评论 -
Codeforces Round #439 (Div. 2) C.The Intriguing Obsession(组合数、记忆化搜索)
With hands joined, go everywhere at a speed faster than our thoughts! This time, the Fire Sisters — Karen and Tsukihi — is heading for somewhere they've never reached — water-surrounded islands!There are three clusters of islands, conveniently coloured re原创 2017-10-07 22:44:31 · 299 阅读 · 0 评论 -
Codeforces-984C - Finite or not?(数论)
题意:给定p,q,b,问p/q能否表示成b进制下的有限小数形式(p,q,b <= 1e18)思路:对于约分后的p/q,只需关心1/q是否能在b进制下有限表现即可。把1/q换成小数形式,例如1/8 = 0.125,像整数转换进制一样,小数转换进制也是不断地除以进制的基,而小数的基是b^-1。则0.125转换为二进制过程如下,0.125(除2^-1)-->余0商0.25(除2^-1)--&...原创 2018-05-16 20:57:13 · 545 阅读 · 0 评论