codeforces
KIDGINBROOK
这个作者很懒,什么都没留下…
展开
-
cf 505c Mr. Kitayuta, the Treasure Hunter
#include #include #include #include #include #include #include using namespace std;const int maxn = 30015;int n, d, vis[maxn], dp[maxn][500];int dfs(int u, int cha){ if (u > 30000) r原创 2015-01-31 00:18:19 · 825 阅读 · 0 评论 -
codeforces 894E Ralph and Mushrooms 强连通dp
E. Ralph and Mushroomstime limit per test2.5 secondsmemory limit per test512 megabytesinputstandard inputoutputstandard outputRalph is going to collect mushrooms in the Mushroom Fore...原创 2018-10-11 13:50:58 · 295 阅读 · 0 评论 -
codeforces 580d Kefa and Dishes 状压dp
D. Kefa and Dishestime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputWhen Kefa came to the restaurant and sat at a table, the waite...原创 2018-10-17 21:00:38 · 334 阅读 · 0 评论 -
codeforces 786B Legacy 线段树建图最短路
B. Legacytime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputRick and his co-workers have made a new radioactive formula and a lot o...原创 2018-11-01 19:38:13 · 449 阅读 · 0 评论 -
codeforces 1012b Chemical table
B. Chemical tabletime limit per test1 secondmemory limit per test512 megabytesinputstandard inputoutputstandard outputInnopolis University scientists continue to investigate the peri...原创 2019-01-08 14:30:36 · 281 阅读 · 0 评论 -
codeforces 1042d Petya and Array 线段树|树状数组|平衡树
D. Petya and Arraytime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputPetya has an array aa consisting of nn integers. He has learne...原创 2019-01-21 17:46:12 · 308 阅读 · 0 评论 -
codeforces 1108F MST Unification 次小生成树 lca
F. MST Unificationtime limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given an undirected weighted connected graph with nn v...原创 2019-02-04 13:12:22 · 463 阅读 · 0 评论 -
codeforces 1012c Hills dp
C. Hillstime limit per test1 secondmemory limit per test512 megabytesinputstandard inputoutputstandard outputWelcome to Innopolis city. Throughout the whole year, Innopolis citizens ...原创 2019-02-05 20:08:22 · 447 阅读 · 0 评论 -
codeforces 1096D Easy Problem dp
D. Easy Problemtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputVasya is preparing a contest, and now he has written a statement ...原创 2019-02-06 20:40:25 · 594 阅读 · 0 评论 -
codeforces 1107g Vasya and Maximum Profit 线段树 单调栈
G. Vasya and Maximum Profittime limit per test3.5 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputVasya got really tired of these credits (from probl...原创 2019-02-07 20:33:44 · 315 阅读 · 0 评论 -
codeforces 1073C Vasya and Robot
C. Vasya and Robottime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputVasya has got a robot which is situated on an infinite Cartesia...原创 2019-03-15 19:53:30 · 444 阅读 · 0 评论 -
codeforces 1065f Up and Down the Tree 树形dp
F. Up and Down the Treetime limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given atreewithnnvertices; its root is vertex...原创 2019-03-23 17:05:15 · 335 阅读 · 0 评论 -
codeforces 1153D Serval and Rooted Tree 树形dp
D. Serval and Rooted Treetime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputNow Serval is a junior high school student in Japari Mi...原创 2019-04-28 14:21:07 · 239 阅读 · 0 评论 -
codeforces 1095F Make It Connected 最小生成树
F. Make It Connectedtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given an undirected graph consisting ofnnvertices....原创 2019-04-29 16:46:33 · 404 阅读 · 0 评论 -
codeforces 894D Ralph And His Tour in Binary Country
D. Ralph And His Tour in Binary Countrytime limit per test2.5 secondsmemory limit per test512 megabytesinputstandard inputoutputstandard outputRalph is in the Binary Country. The Bin...原创 2018-09-25 17:10:42 · 262 阅读 · 0 评论 -
codeforces 1036C Classy Numbers 数位dp
C. Classy Numberstime limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputLet's call some positive integer classy if its decimal represen...原创 2018-09-19 23:44:48 · 352 阅读 · 0 评论 -
cf 505d Mr. Kitayuta's Technology
#include #include #include using namespace std;#define maxn 200005vector G[maxn],g[maxn],st;int vis[maxn];int mk[maxn];int flag;void dfs(int v){ st.push_back(v); vis[v]=1; for(i原创 2015-01-31 00:16:46 · 1271 阅读 · 0 评论 -
cf 507E Breaking Good 最短路
在一个有n个城市m条边的国家,有一个犯罪团伙。这个犯罪团伙想要抢银行。犯罪团伙基地在城市1,银行在城市n。有个人Walter想要加入这个犯罪团伙,于是为了过的团伙高层的信任,Walter必须担任一项的任务,那就是在基地到银行之间选出一条最短路。这个国家有若干公路在维修,于是你需要将最短路径上的公路修好,为了阻止别的警察追击我方,还必须将所有的不在最短路上的公路炸毁。假如有多条最短路,那么需要选择影原创 2015-02-03 19:47:22 · 750 阅读 · 0 评论 -
cf 510E Fox And Dinner 网络流
题意:每个狐狸都有一个编号,问是否可以将狐狸分成几个桌子,使得相邻的狐狸的编号和为素数,每个桌子至少有三个。只有相邻两个狐狸一奇一偶才有可能为素数,且每一个狐狸度数为2,所以建立一个二分图,一边为偶,一边为奇,源点到偶度数容量为2,奇数到汇点容量为2,一个偶数加一个奇数为素数,则连接这两点,跑最大流,若流量为n则可以,否则不可能。#include #include #include原创 2015-02-16 18:50:14 · 514 阅读 · 0 评论 -
Codeforces Round #340 (Div. 2) C. Watering Flowers
两种方法,一种n2,一种nlogn#include #include typedef long long ll;using namespace std;ll pow(int a){ return a * (ll) a;}int main(){ int n, x1, x2, y1, y2; scanf("%d%d%d%d%d", &n, &x1, &y1,原创 2016-01-28 10:00:26 · 351 阅读 · 0 评论 -
Codeforces Round #340 (Div. 2) E. XOR and Favorite Number
莫队,贴一个关于莫队讲解的好文章。http://blog.csdn.net/bossup/article/details/39236275#include #include #include using namespace std;typedef long long ll;const int maxn = 100100;int n, m, k;int num[maxn], blo原创 2016-01-28 12:11:10 · 440 阅读 · 0 评论 -
Educational Codeforces Round 6
C. Pearls in a Row从左往右贪心。#include #include #include using namespace std;const int maxn = 3e5 + 100;set bag;int n, a[maxn];int main(){ scanf("%d", &n); for (int i = 1; i <= n; i原创 2016-02-02 11:01:25 · 361 阅读 · 0 评论 -
codeforces 500D New Year Santa Network
题意:求出在一棵树中随机找三个点,三点中任意两点路径长度之和的期望。任意一条边都会将这棵树分成两部分,这样可以计算每条边的期望。#include #include #define maxn 100100#define ll long longdouble ans,tot;struct edge{ int u,v,id,next;}e[maxn*2];ll len[m原创 2015-01-14 21:47:59 · 733 阅读 · 0 评论 -
Codeforces Round #381 (Div. 1)
A. Alyona and mextime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputAlyona's mother wants to present an array原创 2016-11-28 13:38:51 · 532 阅读 · 0 评论 -
Codeforces Round #382 (Div. 1)
A. Tennis Championshiptime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputFamous Brazil city Rio de Janeiro ho原创 2016-12-08 13:09:21 · 588 阅读 · 0 评论 -
codeforces 802K Send the Fool Further! (medium) 树形dp
K. Send the Fool Further! (medium)time limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputThank you for helping He原创 2017-07-27 17:24:32 · 693 阅读 · 0 评论 -
codeforces 827A 并查集
A. String Reconstructiontime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputIvan had string s consisting of sm原创 2017-09-14 11:22:50 · 1294 阅读 · 0 评论 -
codeforces 827C 树状数组
C. DNA Evolutiontime limit per test2 secondsmemory limit per test512 megabytesinputstandard inputoutputstandard outputEveryone knows that DNA strands consist of原创 2017-09-01 11:19:58 · 954 阅读 · 0 评论 -
codeforces 1100E 二分 + 拓扑排序
E. Andrew and Taxitime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputAndrew prefers taxi to other means of transport, but recently ...原创 2019-05-22 22:29:49 · 217 阅读 · 0 评论