codeforce
·马克图布·
如果人生真的可以分为几个阶段的话,那么我现在就在感觉自己很普通,并一无是处的那个阶段。
展开
-
CF B. Verse For Santa
题目链接题意:有n个篇文章,每篇文章都有一定的朗诵时间a[i]a[i]a[i],然后圣诞老人只会听SSS的时间,然后你可以删除一篇文章使得圣诞老人可以听很多的文章,问是哪篇文章,如果不用删除的话输出000。思路:脑抽了。。。肯定是选已经阅读的最大时间的文章,这没错。然后注意判断时的细节。#include<bits/stdc++.h>using namespace std;...原创 2019-12-29 13:18:50 · 296 阅读 · 0 评论 -
codeforce 01 - MST(补图连通块)
题目链接题意:有一个完全图,然后权值只有0或者1,现在给你权值为1的边,其余权值为0,然后问你这个图的最小生成树的权值是多少。思路:很显然,我们要尽量多的用权值为0的边。这可怎么考虑呢?给的是权值为1的边可以形成一张图,这个图必定是原图的一个子图。然后这个子图的补图必定都是权值为0的边。我们可以考虑原图、补图转化的 思想。考虑补图(权值为0)的连通块个数。然后如果要把这些连通块连在...原创 2019-11-28 16:10:13 · 396 阅读 · 1 评论 -
cf D. Almost All Divisors(思维)
题意:给你一个数的所有除了1和它本身的 因数,让你求出这个数。如果有矛盾,那么输出 -1。思路:我真是..............这都想不到了。。。一般来说,因数都是两两配对出现的,除了 4*4 = 16这般。这个题目中出现矛盾有两种,1 给的因数有矛盾2给的因数不全那么,我们给因数从小到大排序,自然最小的和最大的排序。我们从头到尾扫一遍判断第一种情况,然后在把所得的这个数...原创 2019-11-06 14:55:14 · 175 阅读 · 0 评论 -
cf B. Catch Overflow(思维,栈模拟)
题意:让你模拟表达式求值的过程。for x 表示 循环从1 到 x。add表示加1 end 表示循环结束。若最后结果大于输出OVERFLOW!!! ,否则输出累加的值。思路:直接模拟,由于只有+1操作,所以循环嵌套累乘即可,然后直接爆long long 。思维真是烂的要死。既然他已经大于了,那么多1,多2不是一样嘛。所以如果大于的 话取不就得了。AC Code:#...原创 2019-11-03 22:11:45 · 170 阅读 · 0 评论 -
C. Block Towers(二分 | 暴力)
outputstandard outputStudents in a class are making towers of blocks. Each student makes a (non-zero) tower by stacking pieces lengthwise on top of each other. n of the students use pieces made of...原创 2019-08-04 15:40:40 · 275 阅读 · 0 评论 -
B. Chilly Willy(打表找规律)
Chilly Willy loves playing with numbers. He only knows prime numbers that are digits yet. These numbers are 2, 3, 5 and 7. But Willy grew rather bored of such numbers, so he came up with a few games t...原创 2019-08-11 10:48:29 · 285 阅读 · 2 评论 -
D. Good Substrings(Trie树高效判重)
题目链接————题意大致是给一个字符串s,然后给26个字母一个权,0或者1,0代表着坏字符,1代表着好字符。然后给你给你一个k,求所有s的坏字符少于k的子串。Trie树,一般分建树和查询。这个题目可以把建树和查询放在一起。大大提高效率!AC Code:#include<bits/stdc++.h>using namespace...原创 2019-08-25 15:30:54 · 242 阅读 · 0 评论 -
D. Shortest Cycle(鸽巢原理 + floyd求最小环)
题目链接————题目大意是给你一个节点数列,每一个数代表一个节点,若两个数按位与不等于零,则两个点之间有一个长度为 一的无向边,问可以形成的最小环是多少。思路:看别人博客一直不懂为什么大于128就输出3,今天看了CF评论区,有个dalao讲的太好了。I did it this way- The maximum number in the input is 10^18 which ca...原创 2019-08-21 10:21:15 · 301 阅读 · 0 评论 -
C. Balls and Boxes(贪心 + 模拟)
题目链接 ———— 题意大致是 有n个盒子,每个盒子有若干球(也可能没球),然后从一个盒子里把所有球拿出(这个盒子至少有一个球),依次按顺序依次放一个球到每个盒子。列如3 2 5 4 把第三个盒子的球全部拿出,最后会变成4,3,1,6 然后题目给你操作后的序列,然后给你放置最后一个球的位置,问原来的序列是什么。思路:一开始读错题意,以为每个盒子的球数都不能为0,然后一直Wa...原创 2019-08-21 10:53:13 · 320 阅读 · 0 评论 -
B. Ancient Prophesy(模拟)
题目链接————题目大意是给你一个字符串,找到出现次数最多的日期格式。dd-mm-yyyy而且 yyyy是在2013 - 2015,并且dd-mm-yyyy满足日期正确性。思路:就是模拟,但是有许多注意的点,首先2013 - 1015都不是闰年,然后天数dd要>=1(忘判了。。。),<=本月的天数。AC Code:#include<iostream>...原创 2019-08-21 11:01:13 · 315 阅读 · 0 评论 -
E. Beautiful Decomposition(贪心 | DP)
题目链接————题意大致是给你一个数,然后用二进制加和产生这个数,问最小需要多少个二的幂来产生。11011014= 2^7 + ( - 2^4) + ( - 2^2) + 2^0.贪心 考虑逆向加和, 拿这个来说1101101最后一个1因为前面有个0,所以直接直接减去倒数第二个1,因为前面还有个1,所以加个1让它进位产生足够多的0。依次类推,就是模拟进位的过程,因为我太弱...原创 2019-09-05 19:24:38 · 348 阅读 · 0 评论 -
C. Hard Process(二分 + 前缀和 | 尺取) !
You are given an array a with n elements. Each element of a is either 0 or 1.Let's denote the length of the longest subsegment of consecutive elements in a, consisting of only numbers one, as f(a). ...原创 2019-08-04 16:47:41 · 374 阅读 · 0 评论 -
B. Non-square Equation(有技巧的枚举:转化枚举变量)
Let's consider equation:x2 + s(x)·x - n = 0, where x, n are positive integers, s(x) is the function, equal to the sum of digits of number x in the decimal number system.You are given an integer ...原创 2019-08-05 09:25:33 · 211 阅读 · 0 评论 -
B. Magic, Wizardry and Wonders(巧妙贪心)
outputstandard outputVasya the Great Magician and Conjurer loves all kinds of miracles and wizardry. In one wave of a magic wand he can turn an object into something else. But, as you all know, th...原创 2019-08-05 09:59:49 · 336 阅读 · 0 评论 -
B. Vasya and Cornfield(线性规划)
Vasya owns a cornfield which can be defined with two integers nn and dd . The cornfield can be represented as rectangle with vertices having Cartesian coordinates (0,d),(d,0),(n,n−d)(0,d),(d,0),(n,n−d...原创 2019-05-23 19:21:28 · 319 阅读 · 0 评论 -
C. Vasya and Golden Ticket(dfs+可行性剪枝)!
Recently Vasya found a golden ticket — a sequence which consists of nn digits a1a2…ana1a2…an . Vasya considers a ticket to be lucky if it can be divided into two or more non-intersecting segments with...原创 2019-05-23 19:30:43 · 302 阅读 · 0 评论 -
C. Enlarge GCD(贪心)
Mr. F has nn positive integers, a1,a2,…,ana1,a2,…,an .He thinks the greatest common divisor of these integers is too small. So he wants to enlarge it by removing some of the integers.But this prob...原创 2019-05-23 22:38:10 · 350 阅读 · 0 评论 -
C. MP3(模拟 + 前缀 | 尺取 + 前缀)
One common way of digitalizing sound is to record sound intensity at particular time moments. For each time moment intensity is recorded as a non-negative integer. Thus we can represent a sound file a...原创 2019-07-31 16:22:34 · 360 阅读 · 0 评论 -
B. Make Product Equal One(贪心)
题目链接————题目大意是给你一个数列,然后要求这个数列的乘积为1,让你改变这些数字,问最小的代价是多少。思路:先分析一下,如果最后数列的乘积为1,那么每个数字只能是1或者-1,且如果有-1的话还要有偶数个。所以统计负数的个数,并排个序,然后若代价最小的话,一开始的思路就让负数尽量为-1,正数尽量为1,还要兼顾-1为偶数的情况。这个大致思路是对的,但是有细节。我一开始是 IF sum%...原创 2019-08-19 17:51:47 · 375 阅读 · 0 评论 -
A. You Are Given Two Binary Strings...(贪心)
题目链接 —— here题目大意:给你两个二进制串与,然后有一个公式 ,k>=0给出一个,它是什么呢,是的翻转过来的二进制串。然后让你求一个k 使得字典序最小。这个题目当时 想了挺长时间,走了不少岔路,一开始认为可以将二进制串转化为十进制数,然后枚举k,这是不可行的,因为二进制串长度太大了。后来突然想到了,的二进制只可能表示为 1 ,10,100,1000.....原创 2019-08-09 08:53:27 · 309 阅读 · 0 评论 -
D. Boring Partition(纯模拟 | 模拟 + 贪心)
This problem is the most boring one you've ever seen.Given a sequence of integers a1, a2, ..., an and a non-negative integer h, our goal is to partition the sequence into two subsequences (not neces...原创 2019-08-07 10:25:38 · 198 阅读 · 0 评论 -
C. Points on Line(二分 | 尺取 )
Little Petya likes points a lot. Recently his mom has presented him n points lying on the line OX. Now Petya is wondering in how many ways he can choose three distinct points so that the distance betw...原创 2019-08-10 23:25:05 · 255 阅读 · 0 评论 -
D. Olympiad(贪心 + 尺取)
A boy named Vasya has taken part in an Olympiad. His teacher knows that in total Vasya got at least x points for both tours of the Olympiad. The teacher has the results of the first and the second tou...原创 2019-08-05 11:37:02 · 240 阅读 · 0 评论 -
CodeForces 1141 E
A superhero fights with a monster. The battle consists of rounds, each of which lasts exactly nn minutes. After a round ends, the next round starts immediately. This is repeated over and over again....原创 2019-04-09 13:17:12 · 250 阅读 · 0 评论