-----------------------归纳
dxyinme
这个作者很懒,什么都没留下…
展开
-
一些现在才知道的SB东西
对于STL的优先队列 priority_queue来说 如果你定义:priority_queue< int >q;那么它将是一个大根堆。如果定义priority_queue< int , vector<int>, less<int> >q;那么它也是一个大根堆。如果定义priority_queue<int, vector<int> , greater&原创 2017-07-07 09:51:06 · 418 阅读 · 0 评论 -
[HDU5573]Binary Tree
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) 分数:2500,构造还是比较难的 Problem Description The Old Frog King lives on the root of an infinite tree. According to the law, eac...原创 2019-09-03 23:05:10 · 147 阅读 · 0 评论 -
[codeforces1208D]Restore Permutation
time limit per test : 2 seconds memory limit per test : 256 megabytes An array of integers p1,p2,…,pnp_1,p_2,…,p_np1,p2,…,pn is called a permutation if it contains each number from 111 to nnn exact...原创 2019-09-01 11:16:18 · 255 阅读 · 0 评论 -
[codeforces23C]Oranges and Apples
time limit per test : 1.5 seconds memory limit per test : 256 megabytes 分数:2500(补的有趣的老题) In 2N − 12N - 12N − 1 boxes there are apples and oranges. Your task is to choose NNN boxes so, that they will c...原创 2019-09-01 10:04:06 · 218 阅读 · 0 评论 -
[hdu6586]String
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others) Problem Description Tom has a string containing only lowercase letters. He wants to choose a subsequence of the strin...原创 2019-08-13 11:51:53 · 185 阅读 · 0 评论 -
[codeforces1203F1]Complete the Projects (easy version)
time limit per test : 2 seconds memory limit per test : 256 megabytes The only difference between easy and hard versions is that you should complete all the projects in easy version but this is not ne...原创 2019-08-16 09:53:30 · 571 阅读 · 0 评论 -
[2019牛客网多校训练第1场]Euclidean Distance
链接:https://ac.nowcoder.com/acm/contest/881/C 来源:牛客网 Bobo has a point A in the nnn dimension real space RnR_nRn, whose coodinate is (a1/m,a2/m,…,an/m)(a_1/m,a_2/m,…,a_n/m)(a1/m,a2/m,…,an/m) where a...原创 2019-07-18 22:02:49 · 1224 阅读 · 5 评论 -
[AtCoder Grand Contest 035]
A. XOR Circle 题意: 给定n(n<=105)n(n<=10^5)n(n<=105)个数字a[1]a[1]a[1]~a[n]a[n]a[n],询问是否能够将其重排成一个首位相接的环形数组,使得每个a[i](1<=i<=n)a[i](1<=i<=n)a[i](1<=i<=n)等于与其相邻...原创 2019-07-15 23:25:39 · 259 阅读 · 0 评论 -
[codeforces803C]Maximal GCD
time limit per test : 1 second memory limit per test : 256 megabytes You are given positive integer number nnn. You should create such strictly increasing sequence of kkk positive numbers a1, a2, ...,...原创 2019-06-05 16:49:25 · 130 阅读 · 0 评论 -
[codeforces1158B]The minimal unique substring
time limit per test : 1 second memory limit per test : 256 megabytes Let s be some string consisting of symbols “0” or “1”. Let’s call a string t a substring of string s, if there exists such number 1...原创 2019-05-23 23:13:23 · 461 阅读 · 0 评论 -
[codeforces923D]Picking Strings
time limit per test : 2 seconds memory limit per test : 256 megabytes Alice has a string consisting of characters ′A′'A'′A′, ′B′'B'′B′ and ′C′'C'′...原创 2019-05-01 09:16:56 · 338 阅读 · 0 评论 -
Educational Codeforces Round 29
太弱鸡了,所以只有4题。(C题最难,没有之一)A. 给你一个数字x,问能不能补充几个前导零使得他变成回文数(可以补充0个前导零)模拟题 #include<iostream> #include<cstdio> #include<cstdlib> #include<cstring> #include<cmath> #include<algorithm> #include<queue> #include<原创 2017-09-23 21:30:14 · 196 阅读 · 0 评论 -
[gym102267L]ABC
time limit per test : 1.0 s memory limit per test : 256 MB You are given a string consisting of letters ′a′,′b′'a', 'b'′a′,′b′ and ′c′'c'′c′, and there are 444 kinds of operations you can do on it: Re...原创 2019-10-03 10:10:40 · 334 阅读 · 1 评论