online judge CodeForces
文章平均质量分 89
Yishui_Blog
Try our best
展开
-
Codeforces Educational 38 C. Constructing Tests ( 构造
题目描述Let’s denote a m-free matrix as a binary (that is, consisting of only 1’s and 0’s) matrix such that every square submatrix of size m × m of this matrix contains at least one zero.Consider the ...原创 2018-02-18 03:29:17 · 516 阅读 · 0 评论 -
GYM 101350D. Magical Bamboos
D. Magical Bamboos 题目描述In a magical forest, there exists N bamboos that don’t quite get cut down the way you would expect.Originally, the height of the ith bamboo is equal to hi. In one move, yo...原创 2018-04-24 01:17:24 · 252 阅读 · 0 评论 -
GYM 101350E. Competitive Seagulls (博弈
E. Competitive Seagulls题目描述There are two seagulls playing a very peculiar game. First they line up N unit squares in a line, all originally colored white.Let L be the length of the longest cont...原创 2018-04-24 01:25:51 · 243 阅读 · 0 评论 -
GYM 10135 F. Monkeying Around
F. Monkeying AroundWhen 题目描述the monkey professor leaves his class for a short time, all the monkeys go bananas. N monkeys are lined up sitting side by side on their chairs. They each have the same...原创 2018-04-24 01:28:20 · 204 阅读 · 2 评论 -
GYM 101350 G. Snake Rana ( 容斥
G. Snake Rana 题目描述Old Macdonald wants to build a new hen house for his hens. He buys a new rectangular area of size N by M. The night before he builds the hen house, snake Rana devises an evil pla...原创 2018-04-24 01:31:20 · 313 阅读 · 0 评论 -
GYM 101350 H. Mirrored String I
题目描述The gorillas have recently discovered that the image on the surface of the water is actually a reflection of themselves. So, the next thing for them to discover is mirrored strings.A mirr...原创 2018-04-24 16:10:32 · 199 阅读 · 0 评论 -
GYM 101350 I. Mirrored String II
I. Mirrored String II题目描述Note: this is a harder version of Mirrored string I.The gorillas have recently discovered that the image on the surface of the water is actually a reflection of themse...原创 2018-04-24 16:12:19 · 249 阅读 · 0 评论 -
GYM 101350J. Lazy Physics Cat
J. Lazy Physics Cat 题目描述Physics cat likes to draw shapes and figure out their area. He starts by drawing a circle. Then inside the circle, he draws the triangle X, Y, Z - where Y is the center poi...原创 2018-04-24 16:18:09 · 183 阅读 · 0 评论 -
GYM 101350K. Owl Geeks ( STL暴力
K. Owl Geeks题目描述The owls have the following equation:Y = a × x2 + b × xWith a, b, and N given, they decide to put into a set the integer values of Y that are less than or equal to N and tha...原创 2018-04-25 19:50:19 · 279 阅读 · 0 评论 -
GYM 101350 A. Sherlock Bones
A. Sherlock Bones 题目描述The great dog detective Sherlock Bones is on the verge of a new discovery. But for this problem, he needs the help of his most trusted advisor -you- to help him fetch the a...原创 2018-04-24 01:11:48 · 258 阅读 · 0 评论 -
GYM 101350 C. Cheap Kangaroo ( gcd
题目描述There are N kangaroos going out to eat at an Indian restaurant. The ith kangaroo wants to eat exactly xi food. The kangaroos all want to order the same size of plates, but each one can orde...原创 2018-04-24 01:08:51 · 196 阅读 · 0 评论 -
Codeforces Educational 38 B. Run For Your Prize
题目描述You and your friend are participating in a TV show “Run For Your Prize”.At the start of the show n prizes are located on a straight line. i-th prize is located at position ai. Positions of all...原创 2018-02-18 03:44:01 · 392 阅读 · 0 评论 -
Codeforces Educational 38 A. Word Correction
题目描述Victor tries to write his own text editor, with word correction included. However, the rules of word correction are really strange.Victor thinks that if a word contains two consecutive vowels,...原创 2018-02-18 04:03:20 · 292 阅读 · 0 评论 -
Codeforces #253 (Div. 1)C. Artem and Array ( 贪心
C. Artem and Array 题目描述Artem has an array of n positive integers. Artem decided to play with it. The game consists of n moves. Each move goes like this. Artem chooses some element of the array and...原创 2018-03-10 21:25:56 · 263 阅读 · 0 评论 -
Codeforces #467 (Div. 2) C. Save Energy! ( 数学
C. Save Energy! 题目描述Julia is going to cook a chicken in the kitchen of her dormitory. To save energy, the stove in the kitchen automatically turns off after k minutes after turning on.During coo...原创 2018-02-26 09:05:01 · 564 阅读 · 0 评论 -
Codeforces #467 (Div. 2) B. Vile Grasshoppers ( 数学
B. Vile Grasshoppers 题目描述The weather is fine today and hence it’s high time to climb the nearby pine and enjoy the landscape.The pine’s trunk includes several branches, located one above another...原创 2018-02-26 09:18:58 · 623 阅读 · 0 评论 -
Codeforces #304 (Div. 2) B. Soldier and Badges ( 贪心
B. Soldier and Badges 题目描述Colonel has n badges. He wants to give one badge to every of his n soldiers. Each badge has a coolness factor, which shows how much it’s owner reached. Coolness factor ...原创 2018-03-22 22:58:58 · 204 阅读 · 0 评论 -
Codeforces Round #403 (Div. 2 C. Andryusha and Colored Balloons ( 树上染色问题
C. Andryusha and Colored Balloons 题目描述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...原创 2018-03-21 00:08:19 · 205 阅读 · 0 评论 -
GYM 101350B. Unusual Team
B. Unusual Team题目描述A lion, a mouse, and a beaver are one of the best teams at Animal University, and they have qualified to the ACM Arabella 2017 contest!They want to choose their team name, an...原创 2018-04-24 00:45:00 · 198 阅读 · 0 评论 -
GYM 101350L. All’s Wall That Ends Wall ( 线段树
L. All’s Wall That Ends Wall 题目描述In the magical forest, you come upon N walls that you think is a great place to store water for your animal friends. The ith wall consists of ai blocks stacked on ...原创 2018-04-25 19:53:39 · 411 阅读 · 0 评论 -
GYM 101350 M. Make Cents? ( STL
M. Make Cents? 题目描述Every year, an elephant qualifies to the Arab Collegiate Programming Competition. He graduated this year, but that’s irrelephant. What’s important is that the location of the...原创 2018-04-25 19:55:19 · 285 阅读 · 0 评论 -
CodeForces - 609C Load Balancing
Load Balancing 题目描述In the school computer room there are n servers which are responsible for processing several computing tasks. You know the number of scheduled tasks for each server: there a...原创 2018-04-25 21:37:56 · 215 阅读 · 0 评论 -
CodeForces - 466C Number of Ways
题意一串数字,分割成三个相同部分的和有多少种方法?考虑前缀和? 那么若其前缀为2∗k2∗k2*k大小的话,则种类个数++++ ++ 知道遇到前缀为kkk的情况加上 AC代码#include <bits/stdc++.h>using namespace std;#define ll long long#define CLR(a,b) memset(a,(b),s...原创 2018-07-14 14:58:18 · 193 阅读 · 0 评论 -
CodeForces - 140C New Year Snowmen (贪心+堆
题意: 一组数字 找出最多的三个严格单调的数字为一组, 求出最多可以分配多数组?考虑贪心: 数量越多的数组当然是越先考虑组成,数组动态的改变,用大顶堆进行维护#include <bits/stdc++.h>using namespace std;#define ll long long#define CLR(a,b) memset(a,(b),sizeof(a))...原创 2018-07-14 14:59:45 · 280 阅读 · 0 评论 -
CodeForces 651C Watchmen ( map
题意: 给定⼆维平面的 n 个坐标,求满⾜ |xi−xj|+|yi−yj|=(xi−xj)∗(xi−xj)+(yi−yj)∗(yi−yj)−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−−√|xi−xj|+|yi−yj|=(xi−xj)∗(xi−xj)+(yi−yj)∗(yi−yj)\left| x_i − x_j \right| + \left|y_i − y_j\right...原创 2018-07-14 15:12:53 · 198 阅读 · 0 评论 -
Codeforces Round #503 (by SIS, Div. 2) A, B, C(判断&&搜索&&STL乱搞
A - New Building for SIS题意:一排房子1−n1−n1-n,问从第xxx个结点到第yyy个结点 需要的最少步数 (只能在特定的楼层内转移)题解判断几个就可以了 trick点 : 注意特定的楼层内部也是需要计算步数#include <bits/stdc++.h>using namespace std;const int MAXN ...原创 2018-08-13 00:49:12 · 179 阅读 · 0 评论 -
Codeforces 438 D. The Child and Sequence (线段树
题意: 三种操作 1.区间求和 3.区间取模 2.单点更新题解:直接单点更新暴力维护, 取模的均摊复杂度为O(nlogn)O(nlogn)O(nlogn)#include &lt;bits/stdc++.h&gt;using namespace std;#define ll long long #define pb push_back#define...原创 2018-08-16 14:59:36 · 228 阅读 · 0 评论 -
Codeforces Round #504 A.B.C.D( 模拟&&思维&&模拟&&线段树
A. Single Wildcard Pattern Matching题意:判断字符串的小问题,trick点比较多,FST无数,最后过的C还少,, 多亏了写的时候仔细想了两遍,,,//// Created by team02 on 18-8-17.//#include &amp;amp;lt;bits/stdc++.h&amp;amp;gt;using namespace std;#define...原创 2018-08-19 14:48:32 · 155 阅读 · 0 评论 -
Codeforces Round #502 A,B,C,D (排序&&规律&&构造&&状压预处理
A. The Rank题意:简单的排序,寻找特定的那个人的名次,,,#include <bits/stdc++.h>using namespace std;#define ll long long #define pb push_back#define ls o<<1#define rs o<<1|1#define fi firs...原创 2018-08-17 02:29:07 · 170 阅读 · 0 评论 -
CodeForces242E XOR on Segment (线段树+二进制拆位
题目链接: http://codeforces.com/problemset/problem/242/E题意:给出n个点,m次操作,1 x y:查询区间x-y的和,2l r x,区间l-r每个数都异或x;思考: 我们可以很容易的想到,异或是在二进制上面进行的, 然后我们每次异或 其实就是反向的更改这一区间上面的数字, 数据的范围大概是在2^20内 所有我们可以直接建20颗线段树, ...原创 2018-10-12 11:35:22 · 186 阅读 · 0 评论 -
CodeForces - 617E XOR and Favorite Number ( 莫队
题意一串数字,询问区间内有几个连续的区间异或后为kkk第一个 莫队算法 挺简单的 果然是优雅的暴力qwq#include &lt;bits/stdc++.h&gt;using namespace std;#define ll long longconst int MAXN = 2e5+10;int sz, arr[MAXN], cnt[1&lt;&lt;20];ll r...原创 2018-07-20 00:09:08 · 160 阅读 · 0 评论 -
CodeForces - 1006E Military Problem ( DFS
题意:#include <algorithm>#include <cstdio>#include <cstring>#include <iostream>#include <bits/stdc++.h>using namespace std;#define pb push_back#define ll long lon...原创 2018-07-18 22:33:36 · 355 阅读 · 0 评论 -
Codeforces 720C.Cellular Network ( 二分
Cellular Network题目描述You are given n points on the straight line — the positions (x-coordinates) of the cities and m points on the same line — the positions (x-coordinates) of the cellular towers....原创 2018-05-04 00:28:53 · 197 阅读 · 0 评论 -
CodeForces - 602C The Two Routes (最短路
The Two Routes 题目描述In Absurdistan, there are n towns (numbered 1 through n) and m bidirectional railways. There is also an absurdly simple road network — for each pair of different towns x and y,...原创 2018-05-13 17:18:56 · 300 阅读 · 0 评论 -
CodeForces - 652D Nested Segments (离散化+BIT
Nested Segments 题目描述You are given n segments on a line. There are no ends of some segments that coincide. For each segment find the number of segments it contains.输入The first line contains a ...原创 2018-05-15 10:36:38 · 221 阅读 · 0 评论 -
CodeForces - 706D Vasiliy's Multiset (01Trie 面向对象写法
题意现在有 q 个询问和一个多重集合 A,初始时只包含 0。现在有三种询问:“+ x” — 将整数 x 加入多重集合 A. “- x” — 将整数 x 从多重集合 A 中删除。保证整数 x 一定在多重集合 A 中出现过。 “? x” — 给定一个数 x 你需要求出最大的 ,也就是找到和 x xor值最大的在集合 A 中的整数 y 。 多重集合是可以有重复元素的集合。 01Trie模...原创 2018-06-12 23:12:18 · 167 阅读 · 0 评论 -
Codeforces1006A.Adjacent Replacements
A .Adjacent Replacements题意:判断一下奇数偶数就行了qwq#include &amp;amp;lt;bits/stdc++.h&amp;amp;gt;using namespace std;const int MAXN = 2e5+10;int main() { int n; vector&amp;amp;lt;int&amp;amp;gt; v; cin &am原创 2018-07-18 22:09:03 · 197 阅读 · 0 评论 -
Codeforces 1006B.Polycarp's Practice ( 贪心
题意:n个数,k种划分, 问划分的集合种最大是多少, 输出他们的和,并输出每个数的种类 很简单的一个贪心小问题 排序得到最大的kkk个值 记录位置 输出即可#include <algorithm>#include <cstdio>#include <cstring>#include <iostream>#include &l...原创 2018-07-18 22:16:18 · 185 阅读 · 0 评论 -
CodeForces - 1006C Three Parts of the Array ( 二分
题意:一段数字,分成三份 前一份与后一份的和必须相等, 问最大的值是多少?维护一个前缀,然后在前缀里面二分寻找相等的就好了TAT#include <bits/stdc++.h>using namespace std;#define ll long longconst int MAXN = 2e5+10;int arr[MAXN];ll sum[MAXN];...原创 2018-07-18 22:22:47 · 208 阅读 · 0 评论 -
CodeForces - 1006D Two Strings Swaps
题意:原创 2018-07-18 22:25:46 · 173 阅读 · 0 评论