【Codeforces】
riba2534
没有谁生来就是神牛,而千里之行,始于足下!
展开
-
Good Bye 2018 C. New Year and the Sphere Transmission(数学)
题目链接:C. New Year and the Sphere TransmissionThere are nnn people sitting in a circle, numbered from 111 to nnn in the order in which they are seated. That is, for all iii from 111 to n−1n-1n−1, the ...原创 2018-12-31 16:37:10 · 503 阅读 · 0 评论 -
Codeforces Round #479 (Div. 3) F. Consecutive Subsequence(思路,最长连续递增子序列)
描述 You are given an integer array of length nn. You have to choose some subsequence of this array of maximum length such that this subsequence forms a increasing sequence of consecutive ...原创 2018-05-07 09:36:01 · 1384 阅读 · 1 评论 -
CodeForces - 954D Fight Against Traffic(最短路,dijkstra)
描述 Little town Nsk consists of n junctions connected by m bidirectional roads. Each road connects two distinct junctions and no two roads connect the same pair of junctions. It is possible t...原创 2018-04-03 15:20:17 · 727 阅读 · 0 评论 -
Codeforces Round #470 (rated, Div. 2, based on VK Cup 2018 Round 1) C. Producing Snow(二分)
描述 Alice likes snow a lot! Unfortunately, this year’s winter is already over, and she can’t expect to have any more of it. Bob has thus bought her a gift — a large snow maker. He plans to ma...原创 2018-03-11 15:26:58 · 313 阅读 · 0 评论 -
Codeforces Round #470 (rated, Div. 2, based on VK Cup 2018 Round 1) A. Protect Sheep(思路)
描述 Bob is a farmer. He has a large pasture with many sheep. Recently, he has lost some of them due to wolf attacks. He thus decided to place some shepherd dogs in such a way that all his she...原创 2018-03-11 11:27:17 · 525 阅读 · 0 评论 -
Codeforces Round #469 (Div. 2) C. Zebras(思路+模拟)
描述 Oleg writes down the history of the days he lived. For each day he decides if it was good or bad. Oleg calls a non-empty sequence of days a zebra, if it starts with a bad day, ends with a...原创 2018-03-10 15:33:27 · 302 阅读 · 0 评论 -
Codeforces Round #465 (Div. 2) C. Fifa and Fafa(计算几何)
描述 Fifa and Fafa are sharing a flat. Fifa loves video games and wants to download a new soccer game. Unfortunately, Fafa heavily uses the internet which consumes the quota. Fifa can access t...原创 2018-02-20 15:03:46 · 1055 阅读 · 0 评论 -
Codeforces Round #461 (Div. 2) D. Robot Vacuum Cleaner(贪心,思路)
描述 Pushok the dog has been chasing Imp for a few hours already. Fortunately, Imp knows that Pushok is afraid of a robot vacuum cleaner. While moving, the robot generates a string ...原创 2018-02-08 14:57:12 · 301 阅读 · 0 评论 -
Codeforces Round #461 (Div. 2) B. Magic Forest(异或的性质)
描述 Imp is in a magic forest, where xorangles grow (wut?) A xorangle of order n is such a non-degenerate triangle, that lengths of its sides are integers not exceeding n, and the xor-su...原创 2018-02-08 13:43:46 · 409 阅读 · 0 评论 -
Educational Codeforces Round 37 (Rated for Div. 2) F. SUM and REPLACE(线段树,区间更新)
描述 Let D(x) be the number of positive divisors of a positive integer x. For example, D(2) = 2 (2 is divisible by 1 and 2), D(6) = 4 (6 is divisible by 1, 2, 3 and 6). You are given an a...原创 2018-02-09 00:52:39 · 348 阅读 · 0 评论 -
Codeforces Round #457 (Div. 2) B. Jamie and Binary Sequence(二进制,思路,贪心)
描述 Jamie is preparing a Codeforces round. He has got an idea for a problem, but does not know how to solve it. Help him write a solution to the following problem: Find k integers such t原创 2018-01-20 15:23:28 · 793 阅读 · 2 评论 -
Educational Codeforces Round 37 (Rated for Div. 2) E. Connected Components?(连通分量的个数,STL)
描述 You are given an undirected graph consisting of n vertices and edges. Instead of giving you the edges that exist in the graph, we give you m unordered pairs (x, y) such that there is no原创 2018-02-03 11:14:48 · 705 阅读 · 0 评论 -
Codeforces Round #482 (Div. 2) C. Kuro and Walking Route(dfs,思路)
描述 Kuro is living in a country called Uberland, consisting of nn towns, numbered from 11 to nn, and n−1n−1 bidirectional roads connecting these towns. It is possible to reach each town from ...原创 2018-05-15 16:35:51 · 398 阅读 · 0 评论 -
Codeforces Round #482 (Div. 2) D. Kuro and GCD and XOR and SUM(Trie树,二进制)
描述 Kuro is currently playing an educational game about numbers. The game focuses on the greatest common divisor (GCD), the XOR value, and the sum of two numbers. Kuro loves the game so much ...原创 2018-05-16 22:18:34 · 685 阅读 · 1 评论 -
Codeforces Round #491 (Div. 2)题解
题目链接:Codeforces Round #491 (Div. 2)A. If at first you don’t succeed…题目类型: 容斥 题意: 题目大意是要进行一次考试,有人考好了有人没考好,考好的人都会去餐馆吃饭,餐馆有两个,有A个人去了第一个餐馆,有B个人去了第二个餐馆,有C个人两个餐馆都去了,现在问有多少人没有考好. 样例给出是给出了A,B,C,N的值,如果合...原创 2018-06-25 01:33:43 · 300 阅读 · 0 评论 -
Codeforces Round #513 by Barcelona Bootcamp (rated, Div. 1 + Div. 2) C. Maximum Subrectangle(思路)
描述You are given two arrays aa and bb of positive integers, with length nn and mm respectively.Let cc be an n×mn×m matrix, where ci,j=ai⋅bjci,j=ai⋅bj.You need to find a subrectangle of the matrix c...原创 2018-10-10 20:09:49 · 269 阅读 · 0 评论 -
Codeforces Round #514 (Div. 2) C. Sequence Transformation(思路,数论)
题目链接:C. Sequence Transformation思路:给你一个序列,从1到n。然后有一个操作,求出这个序列的数的所有的gcd,然后把这个数添加到原序列中,然后你可以任意选择删除一个数,直到这个序列为空,序列结束。题目让你输出,每一次求出的gcd的值所组成的序列,并且让这序列字典序最大。(保证元素唯一性,比如求出来的gcd的值为1,如果1已经存在那么不用添加)样例已经给出解释3...原创 2018-10-08 21:37:06 · 264 阅读 · 0 评论 -
CodeForces - 796C Bank Hacking(思路)
描述Although Inzane successfully found his beloved bone, Zane, his owner, has yet to return. To search for Zane, he would need a lot of money, of which he sadly has none. To deal with the problem, he ...原创 2018-10-14 23:06:59 · 311 阅读 · 0 评论 -
CodeForces - 825D Suitable Replacement(思路)
描述You are given two strings s and t consisting of small Latin letters, string s can also contain ‘?’ characters.Suitability of string s is calculated by following metric:Any two letters can be swa...原创 2018-10-14 16:54:05 · 286 阅读 · 1 评论 -
CodeForces - 780C Andryusha and Colored Balloons(思路,bfs)
描述Andryusha goes through a park each day. The squares and paths between them look boring to Andryusha, so he decided to decorate them.The park consists of n squares connected with (n - 1) bidirecti...原创 2018-10-14 16:49:05 · 377 阅读 · 0 评论 -
Educational Codeforces Round 51 (Rated for Div. 2) C. Vasya and Multisets(思路)
描述Vasya has a multiset ss consisting of nn integer numbers. Vasya calls some number xx nice if it appears in the multiset exactly once. For example, multiset {1,1,2,3,3,3,4}{1,1,2,3,3,3,4} contains ...原创 2018-09-21 20:32:30 · 435 阅读 · 0 评论 -
CodeForces - 1036C Classy Numbers(数位dp)
描述Let’s call some positive integer classy if its decimal representation contains no more than 33 non-zero digits. For example, numbers 44, 200000200000, 1020310203 are classy and numbers 42314231, 1...原创 2018-09-21 19:15:08 · 428 阅读 · 0 评论 -
CodeForces 570D Tree Requests(dfs序,二分)
描述 Roman planted a tree consisting of n vertices. Each vertex contains a lowercase English letter. Vertex 1 is the root of the tree, each of the n - 1 remaining vertices has a parent in the tree. ...原创 2018-09-14 11:31:22 · 262 阅读 · 0 评论 -
CodeForces 867E Buy Low Sell High(优先队列,贪心)
描述 You can perfectly predict the price of a certain stock for the next N days. You would like to profit on this knowledge, but only want to transact one share of stock per day. That is, each day y...原创 2018-08-31 21:57:31 · 312 阅读 · 0 评论 -
Codeforces Round #501 (Div. 3)题解
A. Points in Segments题目链接:Points in Segments分类:暴力题意:给出你一些区间,然后覆盖了一些,问哪些没有被覆盖思路:直接标记一下做就行了代码:#include <bits/stdc++.h>using namespace std;#define mem(a,b) memset(a,b,sizeof(a))typ...原创 2018-08-02 18:10:30 · 450 阅读 · 0 评论 -
Educational Codeforces Round 48 (Rated for Div. 2) D. Vasya And The Matrix(构造)
描述 Now Vasya is taking an exam in mathematics. In order to get a good mark, Vasya needs to guess the matrix that the teacher has constructed! Vasya knows that the matrix consists of n rows an...原创 2018-08-04 11:48:51 · 319 阅读 · 0 评论 -
Codeforces Round #457 (Div. 2) C. Jamie and Interesting Graph(构造)
描述 Jamie has recently found undirected weighted graphs with the following properties very interesting: The graph is connected and contains exactly n vertices and m edges. All edge weigh原创 2018-01-20 09:56:51 · 623 阅读 · 0 评论 -
Codeforces Round #460 (Div. 2) D. Substring(图论,记忆化DFS)
描述 You are given a graph with n nodes and m directed edges. One lowercase letter is assigned to each node. We define a path’s value as the number of the most frequently occurring letter. For原创 2018-02-01 10:03:57 · 568 阅读 · 0 评论 -
Codeforces Round #460 (Div. 2) C. Seat Arrangements(思路)
描述 Suppose that you are in a campus and have to go for classes day by day. As you may see, when you hurry to a classroom, you surprisingly find that many seats there are already occupied. To原创 2018-02-01 09:14:11 · 485 阅读 · 0 评论 -
CodeForces 711B Chris and Magic Square(找规律)
题目:B. Chris and Magic Squaretime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputZS the Coder and Chris t原创 2017-03-12 12:20:27 · 366 阅读 · 0 评论 -
Educational Codeforces Round 18 B. Counting-out Rhyme(数论,Vector应用)
题目:B. Counting-out Rhymetime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputn children are standing in a原创 2017-03-28 15:30:00 · 364 阅读 · 0 评论 -
Educational Codeforces Round 18 A. New Bus Route(水题)
题目:A. New Bus Routetime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputThere are n cities situated along原创 2017-03-28 15:27:45 · 542 阅读 · 0 评论 -
ICM Technex 2017 and Codeforces Round #400 (Div. 1 + Div. 2, combined)A. A Serial Killer(水题)
题目:A. A Serial Killertime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputOur beloved detective, Sherlock原创 2017-02-25 16:49:58 · 439 阅读 · 0 评论 -
Codeforces Round #401 (Div. 2)A. Shell Game(水题~)
题目:A. Shell Gametime limit per test0.5 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputBomboslav likes to look out of the原创 2017-02-25 16:47:08 · 732 阅读 · 0 评论 -
Codeforces Round #401 (Div. 2)B. Game of Credit Cards(贪心)
题目:B. Game of Credit Cardstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputAfter the fourth season Sh原创 2017-02-25 16:43:37 · 601 阅读 · 0 评论 -
Codeforces Round #301 (Div. 2)C. Ice Cave(广搜BFS)
题目:C. Ice Cavetime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou play a computer game. Your charact原创 2017-02-27 19:58:22 · 440 阅读 · 0 评论 -
Codeforces Round #387 (Div. 2)C. Servers(模拟)
题目:C. Serverstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputThere are n servers in a laboratory, ea原创 2016-12-20 17:04:36 · 368 阅读 · 0 评论 -
Codeforces Round #389 (Div. 2)B. Santa Claus and Keyboard Check(模拟)
题目:B. Santa Claus and Keyboard Checktime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputSanta Claus deci原创 2016-12-26 11:41:48 · 610 阅读 · 0 评论 -
Codeforces Round #389 (Div. 2)A. Santa Claus and a Place in a Class(水题)
题目:A. Santa Claus and a Place in a Classtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputSanta Claus原创 2016-12-26 10:23:49 · 658 阅读 · 0 评论 -
Codeforces Round #387 (Div. 2)B. Mammoth's Genome Decoding(水题)
题目:B. Mammoth's Genome Decodingtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputThe process of mammoth原创 2016-12-19 15:32:13 · 630 阅读 · 0 评论