codeforces
UCAS王小二
不念过去,不畏未来...
展开
-
Educational Codeforces Round 53 (Rated for Div. 2)
C. Vasya and Robot 【二分】暴力左端点,二分右端点。在[L,R]区间内任意填方向,根据区间外的方向值和终点(x,y)计算出此区间需要能否填成。判断式:r - l >= abs(res1) + abs(res2) && (r - l - abs(res1) - abs(res2)) % 2 == 0.#include <bits/stdc++.h&...原创 2018-11-02 12:02:05 · 203 阅读 · 1 评论 -
CodeForces 584A
C -CCrawling in process...Crawling failedTime Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64uSubmitStatusPracticeCodeForces 584A DescriptionOlesya loves nu原创 2017-03-05 01:12:12 · 330 阅读 · 0 评论 -
CodeForces 584B
D -DCrawling in process...Crawling failedTime Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64uSubmitStatusPracticeCodeForces 584BKolya loves putting gnomes at the c原创 2017-03-05 01:14:54 · 291 阅读 · 0 评论 -
CodeForces 583A
E -ECrawling in process...Crawling failedTime Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64uSubmitStatusPracticeCodeForces 583A DescriptionCity X consists原创 2017-03-05 01:17:50 · 435 阅读 · 0 评论 -
CodeForces 586B
B -BTime Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64uSubmitStatus Practice CodeForces 586BDescriptionA little boy Laurenty has been playing his favourite原创 2017-03-05 01:22:55 · 354 阅读 · 0 评论 -
CodeForces - 895
CodeForces - 895A Pizza SeparationStudents Vasya and Petya are studying at the BSU (Byteland State University). At one of the breaks they decided to order a pizza. In this problem pizza is a circle原创 2017-12-03 13:12:59 · 497 阅读 · 2 评论 -
Good Bye 2017 C. New Year and Curling
C. New Year and Curling time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard output Carol is currently curling. She has n disks each wit原创 2017-12-30 12:37:31 · 212 阅读 · 0 评论 -
Educational Codeforces Round 37 (Rated for Div. 2)
It is winter now, and Max decided it’s about time he watered the garden. The garden can be represented as n consecutive garden beds, numbered from 1 to n. k beds contain water taps (i-th tap is loc原创 2018-02-03 12:52:58 · 205 阅读 · 0 评论 -
Codeforces 620E New Year Tree【DFS序+线段树区间染色+二进制思维+位运算】
The New Year holidays are over, but Resha doesn’t want to throw away the New Year tree. He invited his best friends Kerim and Gural to help him to redecorate the New Year tree. The New Year tree is原创 2018-02-01 23:56:42 · 293 阅读 · 0 评论 -
CodeForces 586A
A -ACrawling in process...Crawling failedTime Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64uDescriptionAlena has successfully passed the entrance exams to the u原创 2017-03-05 01:01:50 · 332 阅读 · 0 评论 -
ICM Technex 2018 and Codeforces Round #463 (Div. 1 + Div. 2, combined)
A. Palindromic Supersequence You are given a string A. Find a string B, where B is a palindrome and A is a subsequence of B. A subsequence of a string is a string that can be derived from it by...原创 2018-02-16 21:57:14 · 617 阅读 · 0 评论 -
Codeforces Round #462 (Div. 2)
A. A Compatible Pair Nian is a monster which lives deep in the oceans. Once a year, it shows up on the land, devouring livestock and even people. In order to keep the monster away, people fill the...原创 2018-02-17 22:08:43 · 210 阅读 · 0 评论 -
Manthan, Codefest 18 (rated, Div. 1 + Div. 2) D. Valid BFS?【set+BFS】
题意:给你一颗树(无向图),问你是否满足BFS序? 分析:用dfs把树隔离出来,然后bfs去遍历,看是否满足;由于兄弟节点顺序可能不一致,用set查找。#include <bits/stdc++.h>#include <ext/rope>using namespace std;using namespace __gnu_cxx;#define met(s) m...原创 2018-09-03 09:02:56 · 376 阅读 · 0 评论 -
Educational Codeforces Round 45 (Rated for Div. 2)
A:#pragma GCC optimize ("O2")#include <bits/stdc++.h>#include <ext/rope>using namespace std;using namespace __gnu_cxx;#define met(s) memset(s, 0, sizeof(s))#define rep(i, a, b) f...原创 2018-08-20 22:26:16 · 143 阅读 · 0 评论 -
Codeforces Round #493 (Div. 2)
A:#pragma GCC optimize ("O2")#include <bits/stdc++.h>#include <ext/rope>using namespace std;using namespace __gnu_cxx;#define met(s) memset(s, 0, sizeof(s))#define rep(i, a, b) for...原创 2018-08-20 22:22:17 · 129 阅读 · 0 评论 -
Codeforces Round #503 C Elections【优先队列+枚举】
题意:1号选举人想要赢的胜利,可以花钱买票得到最多的票; 分析: 先把vector排下序,再枚举获得的票数,用优先队列维护花费.#include <bits/stdc++.h>#include <math.h>#include <string.h>#include <algorithm>using namespace std;#...原创 2018-08-13 22:35:45 · 200 阅读 · 0 评论 -
CodeForces - 33B String Problem【spfa||暴力】
Boy Valera likes strings. And even more he likes them, when they are identical. That’s why in his spare time Valera plays the following game. He takes any two strings, consisting of lower case Lati...原创 2018-04-10 21:23:16 · 333 阅读 · 0 评论 -
Codeforces Round #361 (Div. 2) C. Mike and Chocolate Thieves【二分】
Bad news came to Mike’s village, some thieves stole a bunch of chocolates from the local factory! Horrible! Aside from loving sweet things, thieves from this area are known to be very greedy. So...原创 2018-04-09 22:17:37 · 216 阅读 · 0 评论 -
Codeforces Round #466 (Div. 2)
A. Points on the line 题意:给你一个序列,让你求去除最少的数字,保证剩下的序列: 最大值-最小值<=k; 分析: 直接暴力;#include <cstdio>#include <cstring>#include <algorithm>#include <cmath>using namespace std;...原创 2018-02-25 00:03:15 · 188 阅读 · 0 评论 -
CodeForces - 828D High Load【构造+图】
Arkady needs your help again! This time he decided to build his own high-speed Internet exchange point. It should consist of n nodes connected with minimum possible number of wires into one network (a...原创 2018-03-16 09:57:03 · 277 阅读 · 0 评论 -
Codeforces Round #459 (Div. 2) C.The Monster【贪心&括号匹配】
A. The Monster time limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard output As Will is stuck in the Upside Down, he can still communicate wit原创 2018-01-30 17:16:06 · 251 阅读 · 0 评论 -
CodeForces - 892 C - Pride【GCD思维】
ou have an array a with length n, you can perform operations. Each operation is like this: choose two adjacent elements from a, say x and y, and replace one of them with gcd(x, y), where gcd denotes th原创 2017-11-19 16:21:17 · 424 阅读 · 0 评论 -
codeforces 754D Fedor and coupons【优先队列+贪心*好题】
D. Fedor and couponstime limit per test4 secondsAll our characters have hobbies. The same is true for Fedor. He enjoys shopping in the neighboring supermarket.The goods in the supermarket have unique ...原创 2017-11-09 17:48:19 · 392 阅读 · 0 评论 -
B. The Golden Age
题目链接:http://codeforces.com/contest/813/problem/B 题意:就是有一个数叫做不幸运数,满足题目的 n = xa + yb,现在给你一个区间[l,r],让你找一个在这个区间里面一个最长的区间使得这个区间里面的所有数都不是不幸运数,让你输出最长区间的区间长度 ;#include#include#define max_n 1010#inc原创 2017-06-07 08:19:45 · 472 阅读 · 0 评论 -
C. Karen and Game【模拟+思维】
C. Karen and Gametime limit per test2 secondsmemory limit per test512 megabytesinputstandard inputoutputstandard outputOn the way to school, Karen became fixate原创 2017-06-18 11:26:31 · 614 阅读 · 0 评论 -
CodeForces - 791B 并查集或dfs
Bear Limak examines a social network. Its main functionality is that two members can become friends (then they can talk with each other and share funny pictures).There are n members, numbered 1 thro原创 2017-04-29 12:04:06 · 449 阅读 · 0 评论 -
C. Really Big Numbers
C. Really Big Numberstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputIvan likes to learn different things a原创 2017-06-16 07:03:29 · 860 阅读 · 0 评论 -
Codeforces777C 技巧
C. Alyona and SpreadsheetDuring the lesson small girl Alyona works with one famous spreadsheet computer program and learns how to edit tables.Now she has a table filled with integers.原创 2017-04-26 07:41:08 · 1387 阅读 · 0 评论 -
CodeForces - 777B Game of Credit Cards 田忌赛马之二
在第四个赛季之后,Sherlock和Moriary已经意识到他们之间的战斗的整体愚蠢,并决定继续在和平的信用卡游戏中的比赛。这个游戏的规则很简单:每个玩家都带他最喜爱的n位信用卡。然后两位玩家一个一个地将他们的卡上写的数字命名。如果两位数字不相等,则数字较小的玩家将从另一名玩家中轻拍(通常用食指敲击前额)。例如,如果n = 3,Sherlock的卡是123,Moriarty的卡有321号,第一个S...原创 2017-04-21 13:44:56 · 420 阅读 · 0 评论 -
CodeForces - 233B 数学
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 numberx in the decimal number system.You are given an inte原创 2017-04-13 20:30:22 · 401 阅读 · 0 评论 -
CodeForces - 789B 模拟
Masha really loves algebra. On the last lesson, her strict teacher Dvastan gave she new exercise.You are given geometric progression b defined by two integersb1 and q. Remind that a geometric pr原创 2017-04-13 10:13:06 · 808 阅读 · 0 评论 -
CodeForces - 670D1【思维】
胡大加工厂要组装一种产品。组装该产品需要n种零件,每组装一个该产品需要第i种零件ai个。胡大有第i种零件bi个。此外,胡大还有一种特殊的零件,每个特殊零件可以当作任意一个其它零件使用。那么问题来了,胡大最多一共可以组装多少个该产品?Input对于每个样例:第一行包括两个正整数n 、k (1 ≤ n, k ≤ 1000),组成该产品需要的零件的种类数和胡大有的特殊零件的数量第二行原创 2017-07-16 22:39:10 · 466 阅读 · 0 评论 -
B.Five-In-a-Row【逻辑+模拟】
B. Five-In-a-Rowtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputAlice and Bob play 5-in-a-row game. They ha原创 2017-07-17 11:58:57 · 1077 阅读 · 0 评论 -
Educational Codeforces Round 25 D. Suitable Replacement【二分】
D. Suitable Replacementtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given two strings s and t co原创 2017-07-19 20:46:29 · 394 阅读 · 0 评论 -
CodeForces 711C Coloring Trees【dp*好题】
ZS the Coder and Chris the Baboon has arrived at Udayland! They walked in the park where n trees grow. They decided to be naughty and color the trees in the park. The trees are numbered with integers ...原创 2017-11-18 14:24:26 · 509 阅读 · 0 评论 -
CodeForces - 219D Choosing Capital for Treeland【树形dp*好题】
The country Treeland consists of n cities, some pairs of them are connected with unidirectional roads. Overall there are n - 1 roads in the country. We know that if we don't take the direction of the r原创 2017-11-11 16:49:13 · 366 阅读 · 0 评论 -
C. The Tag Game【dfs】
题目链接思路: 建立一个树,以1为根,计算出t点和根节点所在的树的直径d1,并算出每个点距离根节点的距离d2。然后,模拟两个出发点1和x点,让x点向根节点靠近,根节点1向x点靠近。当根节点的步伐小于x点路经的点的d1时记录d2 * 2(可以到达的点),其余情况为不能到达。#include <bits/stdc++.h>#define max_n 200010using namespace st原创 2017-09-06 08:35:02 · 265 阅读 · 0 评论 -
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原创 2017-08-14 09:19:35 · 773 阅读 · 0 评论 -
C. Journey【dfs + 期望】
C. Journey time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard output There are n cities and n - 1 roads in the Seven Kingdoms, each road connects tw原创 2017-08-13 16:28:17 · 678 阅读 · 0 评论 -
B. Petya and Exam【字符串】
B. Petya and Examtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputIt's hard times now. Today Petya needs to原创 2017-07-25 01:30:10 · 2760 阅读 · 0 评论