OJ--codeforces
codancer
为信仰而战斗
展开
-
【codeforces 1243】D. 0-1 MST(补图的连通块计数)
题意:给你一个图,求补图的联通块个数。题解:考虑用使用并查集,用set存已经被放入并查集的点,对于没有放入的点,计算该点和联通块相连的点的个数,如果相连的点的个数小于联通块大小,则直接连进去即可。时间复杂度O(n+m∗log)O(n+m*log)O(n+m∗log)。代码:#include<bits/stdc++.h> using namespace std;const...原创 2019-11-07 10:15:16 · 687 阅读 · 3 评论 -
【codeforces 1225D】Power Products
题意计算满足ai∗aj=xk,i<ja_{i}*a_{j}=x^k,i<jai∗aj=xk,i<j的对数。思路考虑x∗y=pkx*y=p^kx∗y=pk,将xxx和yyy进行质因子分解可得:x=p1m1p2m2p3m3...pnmnx=p_1^{m_1}p_2^{m_2}p_3^{m_3}...p_n^{m_n}x=p1m1p2m2p3m3...pnm...原创 2019-10-27 22:21:05 · 464 阅读 · 0 评论 -
Educational Codeforces Round 75 (Rated for Div. 2)
A如果某个字母连续出现的次数是奇数,那么这个键一定是好的,遍历一遍即可。#include<bits/stdc++.h>using namespace std;int main(){ int T; cin>>T; while(T--){ string s; cin>>s; set&l...原创 2019-10-25 20:09:05 · 218 阅读 · 0 评论 -
Codeforces Round #595 (Div. 3)
A对数组排序,如果存在相邻两项为1,则最少可以分成两组,否则分成1组。#include<bits/stdc++.h> using namespace std;int a[200];int main(){ int T; cin>>T; while(T--){ int n; cin>>n; ...原创 2019-10-23 16:59:59 · 172 阅读 · 0 评论 -
The 13th Chinese Northeast Collegiate Programming Contest 部分题解
B. Balanced Diet题意:商店有mmm种nnn个糖果,每个糖果有一个权值,现在你要买一些糖果使得Sc\frac{S}{c}cS最大,其中SSS为你购买的糖果的权值和,ccc为你购买的出现次数最多的那种糖果出现的种类数,但是每种糖果的购买数量不能在[1,li)[1,l_i)[1,li)之间。思路:枚举ccc,利用前缀和求得购买的每种糖果的权值和,更新最大值。代码:#inc...原创 2019-05-31 18:16:10 · 698 阅读 · 0 评论 -
Codeforces Round #562 (Div. 2) A B C D题解
A. Circle Metro直接模拟即可。#include<bits/stdc++.h>using namespace std;int main(){ int n,a,x,b,y; cin>>n>>a>>x>>b>>y; for(int i=1;i<=300;i++){ if(a<n) a++...原创 2019-05-30 19:00:03 · 172 阅读 · 0 评论 -
【codeforces Div2】Technocup 2019 - Elimination Round 1(A,B,C)
Technocup 2019 - Elimination Round 1比赛迟到了15分钟。(A)大水题就不说了,有1输出HARD,否则输出NO;#include<bits/stdc++.h>using namespace std;const int maxn = 1e6+10;const int INF = 0x3f3f3f3f;typedef long long ...原创 2018-09-24 15:24:55 · 348 阅读 · 0 评论 -
【Codeforces Round #508div2】(A,B,C,D)
A. Equality time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard output You are given a string s of length n , which consists only of the firs...原创 2018-09-07 07:51:07 · 609 阅读 · 0 评论 -
【codeforces 1036C】Classy Numbers(数位dp)
C. Classy Numbers time limit per test3 seconds memory limit per test256 megabytes inputstandard input outputstandard output Let’s call some positive integer classy if its decimal representation c...原创 2018-09-12 21:21:34 · 489 阅读 · 0 评论 -
「codeforces 438D」The Child and Sequence(线段树+剪枝)
D. The Child and Sequence time limit per test 4 seconds memory limit per test 256 megabytes input standard input output standard outputAt the children’s day, the child came to Picks’s house,...原创 2018-08-22 16:05:03 · 172 阅读 · 0 评论 -
【CF 1185G1】Playlist for Polycarp (easy version)(状压DP)
题面题意现在你有nnn首歌,第iii首歌的播放时间为tit_iti,种类为fif_ifi,其中1≤fi≤31 \leq f_i \leq 31≤fi≤3,现在你从家到学校需要花费TTT的时间,你在路上不想闲着,现在你要选几首歌按照一定的顺序播放,你要保证着几首歌的时间总和为TTT(每首歌只会播放一次),并且在播放的时候不会连续播放同一种类的歌曲,计算共有多少种方案,答案对109+710^...原创 2019-06-20 20:35:00 · 291 阅读 · 0 评论 -
【Codeforces Round #569 (Div. 2)】 题解
A小学数学题#include<bits/stdc++.h>using namespace std;long long f[102];void init(){ f[1]=1; for(int i=2;i<=101;i++){ f[i]=f[i-1]+(i-1)*4; }}int main(){ init(); int n; cin>>n;...原创 2019-06-24 11:58:01 · 207 阅读 · 0 评论 -
【Educational Codeforces Round 67 (Rated for Div. 2)】E. Tree Painting(换根DP)
题面题意:一棵树,有nnn个节点,现在要找一个点作为根节点使得这棵树的所有子树的大小和最大。求出最大值。思路:先利用一次dfs求出以iii为根的子树的大小sizisiz_isizi和所有的字数和$$...原创 2019-07-03 10:49:49 · 187 阅读 · 0 评论 -
【 Codeforces Round #572 (Div. 2)】E. Count Pairs(数学)
题面题意:现在有一个长度为nnn的数组aaa,找出有多少对(i,j)(i,j)(i,j)满足1≤1\leq1≤i<ji<ji<j≤n\leq n≤n并且(ai+aj)∗(ai2+aj2)modp==k(a_i+a_j)*(a_i^{2}+a_j^{2})modp==k(ai+aj)∗(ai2+aj2)modp==k。思路:左右同乘(ai−aj)(a...原创 2019-07-06 10:05:12 · 544 阅读 · 0 评论 -
【codeforces 1208D】 Restore Permutation(线段树)
题面题意:一个长度为nnn的排列aaa,现在定义pip_ipi为数组aaa中下标小于等于iii并且小于aia_iai的数字的和。现在给定ppp,求aaa。思路:首先可以肯定的是,ppp中最后一个000出现的位置pospospos在aaa中一定是111。我们可以反证:假设aposa_{pos}apos不为111,假设111在pospospos之前,那么ppos≥1p_{pos} \g...原创 2019-08-27 11:30:20 · 194 阅读 · 0 评论 -
【codeforces 1026 D】 Shortest Cycle(最小环)
题面题意:一个长度为nnn的数组,如果ai&aj!=0a_{i} \& a_{j}!=0ai&aj!=0,那么iii和jjj之间就有一条边,计算所构成图的最小环。(1≤n≤100000,1≤ai≤1018)(1 \leq n \leq 100000,1 \leq a_i \leq 10^{18})(1≤n≤100000,1≤ai≤1018)思路...原创 2019-08-28 17:43:37 · 184 阅读 · 0 评论 -
codancer的图论训练(updating...)
2019.9.12580C.Kefa and Parktags: 简单DFS1081D.Maximum Distancetags:带点思维的MST,学会了只联通某些点的并查集原创 2019-09-12 19:03:28 · 252 阅读 · 0 评论 -
【codeforces 590div3】F.Yet Another Substring Reverse
题意:现在有一个字符串 sss(1≤∣s∣≤1061 \leq |s| \leq 10^61≤∣s∣≤106),现在选择一个区间[l,r][l,r][l,r],反转一次或者不反转。若某区间的字母各不相同,则该区间为完美区间。你要做的就是执行完操作后使完美区间的长度最大。(整个字符串的字母种类数不超过202020)题解:这个问题可以转换为寻找两个不相交的完美区间使得他们的长度和最大。首先枚举...原创 2019-10-02 12:14:03 · 237 阅读 · 3 评论 -
CodeForce 460A :Vasya and Socks
A. Vasya and Sockstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputVasya has n pairs of socks. In the morning of each day Vasya ha...原创 2018-02-14 09:50:22 · 192 阅读 · 0 评论 -
【codforces 978D】Almost Arithmetic Progression
D. Almost Arithmetic Progressiontime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputPolycarp likes arithmetic progressions. A sequenc...原创 2018-08-14 22:57:15 · 148 阅读 · 0 评论 -
codeforces 527A Playing with Paper
A. Playing with Papertime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputOne day Vasya was sitting on a not so interesting Maths lesson and making an ...原创 2018-03-18 11:36:22 · 165 阅读 · 0 评论 -
Restoring Numbers
A. Restoring Numberstime limit per test2.0 smemory limit per test256 MBinputstandard inputoutputstandard outputPavel had two positive integers a and b. He found their sum s and greatest common divisor...原创 2018-03-30 09:41:09 · 844 阅读 · 0 评论 -
Parallelograms
J. Parallelogramstime limit per test2.0 smemory limit per test256 MBinputstandard inputoutputstandard outputThere are n sticks, the i-th of which has length ai. Alex wants to assemble from them as man...原创 2018-03-30 09:44:37 · 349 阅读 · 0 评论 -
CF 659A A. Round House
Vasya lives in a round building, whose entrances are numbered sequentially by integers from 1 to n. Entrance n and entrance 1 are adjacent.Today Vasya got bored and decided to take a walk in t...原创 2018-03-24 11:32:47 · 475 阅读 · 0 评论 -
【Codeforces 583A】Asphalting Roads(有意思的题目)
A. Asphalting Roadstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputCity X consists of n vertical and n horizontal infinite roads, forming n × n int...原创 2018-04-07 20:08:49 · 184 阅读 · 0 评论 -
CODEFORCES 461A Appleman and Toastman
A. Appleman and Toastmantime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputAppleman and Toastman play a game. Initially Appleman gives one group of n...原创 2018-03-27 20:31:53 · 149 阅读 · 0 评论 -
【codeforces 798A】Mike and palindrome
A. Mike and palindrometime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputMike has a string s consisting of only lowercase English letters. He wants t...原创 2018-04-11 20:58:37 · 168 阅读 · 0 评论 -
Happy Number
第一次做出来看着那么高大上的题目。。。其实题意很简单,就是让你求快乐数,直接一个while再来个记录数组判断是否有循环就行了。#include<iostream>#include<math.h>#include<string.h>using namespace std;long long sum;int s[1000];int b[999999];...原创 2018-04-11 21:49:51 · 175 阅读 · 0 评论 -
【codeforces 20C】 Dijkstra?(堆优化)最短路
D - Dijkstra? CodeForces - 20C #include<bits/stdc++.h>using namespace std;typedef long long LL; const int MAXN = 1e5 + 10; const LL INF = 1LL<<62; vector<int> e[MAXN];//点 ...原创 2018-04-13 17:53:10 · 451 阅读 · 1 评论 -
【codeforces 467B】 Fedor and New Game(位运算模拟)
B. Fedor and New Gametime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputAfter you had helped George and Alex to move in the dorm, they went to help th...原创 2018-04-26 19:22:20 · 223 阅读 · 0 评论 -
【codeforces 721A】One-dimensional Japanese Crossword
A. One-dimensional Japanese Crosswordtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputRecently Adaltik discovered japanese crosswords. Japanese cros...原创 2018-04-27 17:05:03 · 270006 阅读 · 0 评论 -
【codeforces 733A】 Grasshopper And the String(模拟)
A. Grasshopper And the Stringtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputOne day, the Grasshopper was jumping on the lawn and found a piece of ...原创 2018-04-28 19:13:22 · 234 阅读 · 0 评论 -
【codeforces 479DIV.3】A B C E题解
A. Wrong Subtractiontime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputLittle girl Tanya is learning how to decrease a number by one, but she does it ...原创 2018-05-07 17:24:13 · 423 阅读 · 0 评论 -
【codeforces 998B】B. A Tide of Riverscape
B. A Tide of Riverscapetime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputWalking along a riverside, Mino silently takes a note of something."Time," M...原创 2018-06-12 12:45:12 · 310 阅读 · 0 评论 -
【codeforces 1003D】Coins and Queries(思维)
D. Coins and Queriestime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputPolycarp has nn coins, the value of the ii-th coin is aiai. It is guaranteed t...原创 2018-07-12 20:53:33 · 270 阅读 · 0 评论 -
【codeforces 1009C】Annoying Present(思维)
C. Annoying Presenttime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputAlice got an array of length nn as a birthday present once again! This is the t...原创 2018-07-15 12:20:35 · 526 阅读 · 0 评论 -
【 Codeforces Round #502】
A. The Ranktime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputJohn Smith knows that his son, Thomas Smith, is among the best student...原创 2018-08-09 09:07:45 · 274 阅读 · 0 评论 -
codeforces 水题 37A-Towers
A. Towerstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputLittle Vasya has received a young builder’s kit. The kit consists of several wooden bars,...原创 2018-03-09 08:37:48 · 427 阅读 · 0 评论