技巧
文章平均质量分 59
Effervescence
OIer
展开
-
Topcoder SRM 721 Div.2 B. RememberWordsEasy
B. RememberWordsEasyProblem Statement For Fox Ciel it is the beginning of a new school year. Her school year will consist of two semesters. The first semester contains d1 days and the second原创 2017-09-28 18:34:37 · 504 阅读 · 0 评论 -
Codeforces Round #441 (Div. 1, by Moscow Team Olympiad) F. Royal Questions
F. Royal QuestionsProblem Statement In a medieval kingdom, the economic crisis is raging. Milk drops fall, Economic indicators are deteriorating every day, money from the treasury disappear. To r原创 2017-10-20 22:45:02 · 362 阅读 · 0 评论 -
Codeforces Round #441 (Div. 1, by Moscow Team Olympiad) E. Delivery Club
E. Delivery ClubProblem Statement Petya and Vasya got employed as couriers. During the working day they are to deliver packages to n different points on the line. According to the company’s inter原创 2017-10-21 15:53:40 · 698 阅读 · 1 评论 -
Educational Codeforces Round 30 B.Balanced Substring
B. Balanced SubstringProblem Statement You are given a string s consisting only of characters 0 and 1. A substring [l, r] of s is a string slsl + 1sl + 2...srs_ls_{l + 1}s_{l + 2}... s_r, and its原创 2017-10-13 11:16:58 · 404 阅读 · 0 评论 -
Codeforces Round #401 (Div. 2) A. Shell Game
A. Shell GameProblem Statement Bomboslav likes to look out of the window in his room and watch lads outside playing famous shell game. The game is played by two persons: operator and player. Oper原创 2017-10-13 18:27:32 · 268 阅读 · 0 评论 -
POJ 2255 Tree Recovery(递归)
Tree RecoveryTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 15683Accepted: 9677DescriptionLittle Valentine liked playing with binary trees very much. Her favorite game was constructing random原创 2017-10-16 16:45:52 · 316 阅读 · 0 评论 -
Codeforces Round #442 (Div. 2) E. Danil and a Part-time Job
E. Danil and a Part-time JobProblem Statement Danil decided to earn some money, so he had found a part-time job. The interview have went well, so now he is a light switcher. Danil works in原创 2017-10-26 20:03:41 · 362 阅读 · 0 评论 -
Codeforces Round #444 (Div. 2) C. Solution for Cube
C. Solution for CubeProblem Statement During the breaks between competitions, top-model Izabella tries to develop herself and not to be bored. For example, now she tries to solve Rubik’s cube 2x2原创 2017-11-05 16:07:37 · 615 阅读 · 0 评论 -
[BZOJ3108][CQOI2013]图的逆变换(Bitset)
3108: [cqoi2013]图的逆变换Time Limit: 10 Sec Memory Limit: 128 MB给一个n结点m条边的有向图D,可以这样构造图E:给D的每条边u->v,在E中建立一个点uv,然后对于D中的两条边u->v和v->w,在E中从uv向vw连一条有向边。E中不含有其他点和边。输入E,你的任务是判断是否存在相应的D。注意,...原创 2018-02-27 18:12:49 · 362 阅读 · 0 评论 -
[BZOJ3109][CQOI2013]新数独(暴力Dfs)
题面..复制不过来..去BZOJ上看吧QwQ。 原题地址:http://www.lydsy.com/JudgeOnline/problem.php?id=3109思路&&分析: Emmm…这题其实没啥好讲的,只要有原创 2018-02-27 18:34:50 · 380 阅读 · 0 评论 -
[BZOJ2760]小A的烦恼(暴力模拟)
2760: [JLOI2011]小A的烦恼Time Limit: 10 Sec Memory Limit: 128 MBDescription小A是B公司的一名PM(product market)。B公司越来越注重产品使用情况分析,而小A的工作就是整天对着一堆数据分析来分析去,没完没了。其中有一个操作是小A很头疼的,就是要把多个csv文件的数据拷到同一个excel文件中去...原创 2018-02-24 15:48:44 · 683 阅读 · 0 评论 -
[UOJ129][BZOJ4197][NOI2015]寿司晚宴(状压DP)
#129. 【NOI2015】寿司晚宴 为了庆祝 NOI 的成功开幕,主办方为大家准备了一场寿司晚宴。小 G 和小 W 作为参加 NOI 的选手,也被邀请参加了寿司晚宴。在晚宴上,主办方为大家提供了 n−1n−1n − 1 种不同的寿司,编号 1,2,3,…,n−11,2,3,…,n−11, 2, 3, \dots, n − 1,其中第 iii 种寿司的美味度为 i...原创 2018-03-03 23:06:04 · 308 阅读 · 0 评论 -
Educational Codeforces Round 43 (Rated for Div. 2)D. Degree set(贪心递归构造)
D. Degree SetStetement You are given a sequence of n positive integers d1, d2, ..., dn(d1 < d2 < ... < dn)d1, d2, ..., dn(d1 < d2 < ... < dn)d_1, d_2,...原创 2018-05-01 13:53:40 · 452 阅读 · 2 评论 -
Codeforces Round #502 (Div. 1 + Div. 2)F. The Neutral Zone(分段筛)
题意 我们知道,log(p1a1p2a2p3a3...)=a1logp1+a2logp2+...log(p1a1p2a2p3a3...)=a1logp1+a2logp2+...log({p_1}^{a_1}{p_2}^{a_2}{p_3}^{a_3}...)=a_1logp_1+a_2logp_2+...(其中p为质数) p1a1p2a2p3a3...为一个数的质因数分解的表...原创 2018-08-09 10:28:41 · 299 阅读 · 0 评论 -
MemSQL Start[c]UP 2.0 Round 1 F.Permutation,[BZOJ2124]等差子序列(分治)
简化题意 (范围照CF上的给,BZOJ需要多组数据T≤7T≤7T\leq7)给定一个长度为n(n≤3e5)n(n≤3e5)n(n\leq3e5)的排列,问你这个排列中是否存在i,j,k(1≤i<j<k≤n)i,j,k(1≤i<j<k≤n)i,j,k(1\leq ip[j]+p[j]=p[i]+p[k]p[j]+p[j]=p[i]+p[k]p[j]+p[j]=p[...原创 2018-08-10 12:35:50 · 291 阅读 · 0 评论 -
牛客网暑期ACM多校训练营(第五场)B. div(技巧+OEIS or Pell方程)
题意 一个数被称为好的,当且仅当存在一个x∈[n2+1,n2+2∗n]x∈[n2+1,n2+2∗n]x\in[n^2+1,n^2+2*n]使得x|n4x|n4x|n^4,给定一个m(1≤m≤101000)m(1≤m≤101000)m(1\leq m\leq 10^{1000}),找到一个大于等于mmm的最小的好的nnn。分析(1) (P.S. 这一部分为正解,大致思路...原创 2018-08-03 09:55:03 · 754 阅读 · 0 评论 -
POJ 1308 && HDU 1325 Is It A Tree?(并查集)
Language:DefaultIs It A Tree?Time Limit: 1000MSMemory Limit: 10000KTotal Submissions: 34386Accepted: 11650DescriptionA tree is a well-known data structure that is either empty (null, void, nothing) or原创 2017-10-12 07:44:28 · 522 阅读 · 0 评论 -
Codeforces Round #441 (Div. 2, by Moscow Team Olympiad) F. High Cry
F. High CryProblem Statement Disclaimer: there are lots of untranslateable puns in the Russian version of the statement, so there is one more reason for you to learn Russian :) Rick and Mo原创 2017-10-20 19:29:45 · 341 阅读 · 0 评论 -
Topcoder SRM 721 Div.2 A. FlightDataRecorder
这场是我第一次打Topcoder,之前顶多只是写写前面的SRM的题。这一场在晚上11:00。我T3被题意杀了30分钟!!!结果打完之后连system test都测完了…尴尬。最后在practice room里交上去跑了下system test,我是A的……感觉错过了100个亿.jpg结果我T2还fst了..目前rating:1385(蓝名)。A. FlightDataRecorderProblem原创 2017-09-28 17:51:59 · 409 阅读 · 0 评论 -
Topcoder SRM 721 Div.2 C. ApocalypseEasy
C. ApocalypseEasyProblem Statement We have an undirected tree with n nodes, numbered 0 through n-1. You are given its description: a vector p with n-1 elements. For each valid i, there is an edg原创 2017-09-28 19:06:35 · 340 阅读 · 2 评论 -
Codeforces Round #439 (Div. 2) A. The Artful Expedient
A. The Artful ExpedientProblem StatementRock... Paper!After Karen have found the deterministic winning (losing?) strategy for rock-paper-scissors, her brother, Koyomi, comes up with a new game as a substit原创 2017-10-07 14:39:22 · 580 阅读 · 0 评论 -
Codeforces Round #439 (Div. 2) B. The Eternal Immortality
B. The Eternal ImmortalityProblem Statement Even if the world is full of counterfeits, I still regard it as wonderful. Pile up herbs and incense, and arise again from the flames and ashes原创 2017-10-07 14:54:03 · 469 阅读 · 0 评论 -
HDU 1052 Tian Ji -- The Horse Racing(贪心)
Tian Ji – The Horse RacingTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 31951 Accepted Submission(s): 9696Problem Description Here is a famo原创 2017-10-18 17:23:45 · 288 阅读 · 0 评论 -
Codeforces Round #440 (Div. 2) B. Maximum of Maximums of Minimums
B. Maximum of Maximums of MinimumsProblem Statement You are given an array a1a_1, a2a_2, …, ana_n consisting of n integers, and an integer k. You have to split the array into exactly k non-empty原创 2017-10-18 18:21:32 · 267 阅读 · 0 评论 -
Codeforces Round #440 (Div. 2) C. Maximum splitting
C. Maximum splittingProblem Statement You are given several queries. In the i-th query you are given a single positive integer nin_i. You are to represent nin_i as a sum of maximum possible numbe原创 2017-10-18 18:39:58 · 266 阅读 · 0 评论 -
Codeforces Round #441 (Div. 2, by Moscow Team Olympiad) A. Trip For Meal
A. Trip For MealProblem Statement Winnie-the-Pooh likes honey very much! That is why he decided to visit his friends. Winnie has got three best friends: Rabbit, Owl and Eeyore, each of them lives原创 2017-10-18 19:12:58 · 448 阅读 · 0 评论 -
Codeforces Round #437 (Div. 2, based on MemSQL Start[c]UP 3.0 - Round 2) B.Save the Problem!
B.Save the problem!Problem statement Attention: we lost all the test cases for this problem, so instead of solving the problem, we need you to generate test cases. We’re going to give you the ans原创 2017-10-02 16:36:04 · 280 阅读 · 0 评论 -
Codeforces Round #437 (Div. 2, based on MemSQL Start[c]UP 3.0 - Round 2) C.Ordering Pizza
C. Ordering PizzaProblem Statement It’s another Start[c]up finals, and that means there is pizza to order for the onsite contestants. There are only 2 types of pizza (obviously not, but let’s jus原创 2017-10-02 16:52:38 · 281 阅读 · 0 评论 -
Codeforces Round #441 (Div. 2, by Moscow Team Olympiad) C. Classroom Watch
C. Classroom WatchProblem Statement Eighth-grader Vova is on duty today in the class. After classes, he went into the office to wash the board, and found on it the number n. He asked what is this原创 2017-10-19 15:28:10 · 363 阅读 · 0 评论 -
Codeforces Round #438 (Div. 1 + Div. 2 combined) B. Race Against Time
B. Race Against TimeProblem statement Have you ever tried to explain to the coordinator, why it is eight hours to the contest and not a single problem has been prepared yet? Misha had. And this t原创 2017-10-05 22:58:30 · 222 阅读 · 0 评论 -
Codeforces Round #438 (Div. 1 + Div. 2 combined) C. Qualification Rounds
C. Qualification RoundsProblem Statement Snark and Philip are preparing the problemset for the upcoming pre-qualification round for semi-quarter-finals. They have a bank of n problems, and they w原创 2017-10-06 12:57:42 · 248 阅读 · 0 评论 -
Codeforces Round #438 (Div. 1 + Div. 2 combined) D. Huge Strings
D. Huge StringsProblem Statement You are given n strings s1s_1, s2s_2, …, sns_n consisting of characters 0 and 1. m operations are performed, on each of them you concatenate two existing strings原创 2017-10-06 13:24:42 · 248 阅读 · 0 评论 -
Codeforces Round #441 (Div. 2, by Moscow Team Olympiad) E. National Property
E. National PropertyProblem Statement You all know that the Library of Bookland is the largest library in the world. There are dozens of thousands of books in the library. Some long and un原创 2017-10-20 18:32:25 · 301 阅读 · 0 评论 -
[LOJ2838][JOISC 2018 Day 3]比太郎的聚会(分块暴力)
题意 给定一张nnn个点mmm条边的DAG,保证所有边都是从编号小的点往编号大的点连,给qqq次询问,每次询问给出一个点和一个点集,点集大小为kkk,询问对于可达这个点的除该点集外的最大距离是多少。 (n≤1e5,m≤2e5,q≤1e5,∑k≤1e5)(n\le 1e5,m\le 2e5,q\le1e5,\sum k\le 1e5)(n≤1e5,m≤2e5,q≤1e5,∑k≤1e5)...原创 2018-12-19 17:50:51 · 701 阅读 · 0 评论