graphs - Problem Set

ID	Problem Show tags Hide tags	AC / Tried	Difficulty
4076	CF1266F Almost Same Distance dfs and similar graphs *2900	0 / 0	(None)
4074	CF1266H Red-Blue Graph dp graphs math matrices meet-in-the-middle *3400	0 / 0	(None)
4056	CF1268D Invertation in Tournament brute force divide and conquer graphs math *3200	0 / 0	(None)
4045	CF1270G Subset with Zero Sum constructive algorithms dfs and similar graphs math *2700	0 / 0	(None)
4031	CF1272E Nearest Opposite Parity dfs and similar graphs shortest paths *1900	0 / 0	(None)
4028	CF1276B Two Fairs combinatorics dfs and similar dsu graphs *1900	0 / 0	(None)
4016	CF1278D Segment Tree data structures dsu graphs trees *2100	0 / 0	(None)
4004	CF1280C Jeremy Bearimy dfs and similar graphs greedy trees *2000	0 / 0	(None)
3992	CF1282E The Cake Is a Lie constructive algorithms data structures dfs and similar graphs *2400	0 / 0	(None)
3987	CF1283D Christmas Trees graphs greedy shortest paths *1800	0 / 0	(None)
3978	CF1284F New Year and Social Network data structures graph matchings graphs math trees *3200	0 / 0	(None)
3977	CF1284G Seollal graphs *3300	0 / 0	(None)
3972	CF1285E Delete a Segment brute force constructive algorithms data structures dp graphs sortings trees two pointers *2300	0 / 0	(None)
3967	CF1286B Numbers on Tree constructive algorithms data structures dfs and similar graphs greedy trees *1800	0 / 0	(None)
3950	CF1290C Prefix Enlightenment dfs and similar dsu graphs *2400	0 / 0	(None)
3949	CF1290D Coffee Varieties (hard version) constructive algorithms graphs interactive *3000	0 / 0	(None)
3943	CF1291F Coffee Varieties (easy version) graphs interactive *2800	0 / 0	(None)
3939	CF1292D Chaotic V. dp graphs greedy math number theory trees *2700	0 / 0	(None)
3916	CF1296E1 String Coloring (easy version) constructive algorithms dp graphs greedy sortings *1800	0 / 0	(None)
3899	CF1299D Around the World bitmasks combinatorics dfs and similar dp graphs graphs math trees *3000	0 / 0	(None)
3892	CF1301D Time to Run constructive algorithms graphs implementation *2000	0 / 0	(None)
3889	CF1301F Super Jaber dfs and similar graphs implementation shortest paths *2600	0 / 0	(None)
3866	CF1304D Shortest and Longest LIS constructive algorithms graphs greedy two pointers *1800	0 / 0	(None)
3854	CF1305G Kuroni and Antihype bitmasks brute force dp dsu graphs *3500	0 / 0	(None)
3849	CF1307D Cow and Fields binary search data structures dfs and similar graphs greedy shortest paths sortings *1900	0 / 0	(None)
3845	CF1307G Cow and Exercise flows graphs shortest paths *3100	0 / 0	(None)
3841	CF1310D Tourism dp graphs probabilities *2300	0 / 0	(None)
3810	CF1316D Nash Matrix constructive algorithms dfs and similar graphs implementation *2000	0 / 0	(None)
3806	CF1320B Navigation System dfs and similar graphs shortest paths *1700	0 / 0	(None)
3796	CF1322C Instant Noodles graphs hashing math number theory *2300	0 / 0	(None)
3784	CF1324F Maximum White Subtree dfs and similar dp graphs trees *1800	0 / 0	(None)
3778	CF1325E Ehab's REAL Number Theory Problem brute force dfs and similar graphs number theory shortest paths *2600	0 / 0	(None)
3777	CF1325F Ehab's Last Theorem constructive algorithms dfs and similar graphs greedy *2500	0 / 0	(None)
3765	CF1327B Princesses and Princes brute force graphs greedy *1200	0 / 0	(None)
3763	CF1327D Infinite Path brute force dfs and similar graphs math number theory *2200	0 / 0	(None)
3755	CF1328D Carousel constructive algorithms dp graphs greedy math *1800	0 / 0	(None)
3754	CF1328E Tree Queries dfs and similar graphs trees *1900	0 / 0	(None)
3723	CF1333D Challenges in school №41 brute force constructive algorithms games graphs greedy implementation sortings *2100	0 / 0	(None)
3717	CF1334D Minimum Euler Cycle constructive algorithms graphs greedy implementation *1800	0 / 0	(None)
3716	CF1334E Divisor Paths combinatorics graphs greedy math number theory *2200	0 / 0	(None)
3706	CF1335F Robots on a Grid data structures dfs and similar dsu graphs greedy matrices *2200	0 / 0	(None)
3698	CF1336F Journey data structures divide and conquer graphs trees *3500	0 / 0	(None)
3690	CF1338E JYPnation graphs *3500	0 / 0	(None)
3686	CF1340B Nastya and Scoreboard bitmasks dp graphs greedy *1700	0 / 0	(None)
3685	CF1340C Nastya and Unexpected Guest dfs and similar dp graphs shortest paths *2400	0 / 0	(None)
3684	CF1340D Nastya and Time Machine constructive algorithms dfs and similar graphs trees *2600	0 / 0	(None)
3683	CF1340E Nastya and Bees graphs interactive probabilities *3000	0 / 0	(None)
3667	CF1343E Weights Distributing brute force graphs greedy shortest paths sortings *2100	0 / 0	(None)
3664	CF1344B Monopole Magnets constructive algorithms dfs and similar dsu graphs *2000	0 / 0	(None)
3663	CF1344C Quantifier Question dfs and similar dp graphs math *2600	0 / 0	(None)
3653	CF1346D Constructing the Dungeon special problem graphs greedy 1600	0 / 0	(None)
3652	CF1346E Magic Tricks special problem dp graphs 1700	0 / 0	(None)
3641	CF1348F Phoenix and Memory data structures dfs and similar graphs greedy *2600	0 / 0	(None)
3638	CF1349C Orac and Game of Life dfs and similar graphs implementation shortest paths *2000	0 / 0	(None)
3605	CF1354E Graph Coloring dfs and similar dp graphs *2100	0 / 0	(None)
3547	CF1360E Polygon dp graphs implementation shortest paths *1300	0 / 0	(None)
3542	CF1361A Johnny and Contribution constructive algorithms graphs greedy sortings *1700	0 / 0	(None)
3540	CF1361C Johnny and Megan's Necklace binary search bitmasks constructive algorithms dfs and similar dsu graphs *2500	0 / 0	(None)
3538	CF1361E James and the Chase dfs and similar graphs probabilities trees *3000	0 / 0	(None)
3521	CF1364D Ehab's Last Corollary constructive algorithms dfs and similar graphs greedy implementation trees *2100	0 / 0	(None)
3516	CF1365D Solve The Maze constructive algorithms dfs and similar dsu graphs greedy implementation shortest paths *1700	0 / 0	(None)
3506	CF1366F Jog Around The Graph binary search dp geometry graphs *2700	0 / 0	(None)
3499	CF1367E Necklace Assembly brute force dfs and similar dp graphs greedy number theory *1900	0 / 0	(None)
3492	CF1368E Ski Accidents constructive algorithms graphs greedy *2500	0 / 0	(None)
3489	CF1368G Shifting Dominoes data structures geometry graphs trees *3200	0 / 0	(None)
3483	CF1369D TediousLee dp graphs greedy math trees *1900	0 / 0	(None)
3474	CF1370F1 The Hidden Pair (Easy Version) binary search dfs and similar graphs interactive shortest paths trees *2400	0 / 0	(None)
3473	CF1370F2 The Hidden Pair (Hard Version) binary search dfs and similar graphs interactive shortest paths trees *2700	0 / 0	(None)
3436	CF1375G Tree Modification brute force constructive algorithms dfs and similar graph matchings graphs trees *2800	0 / 0	(None)
3407	CF1383A String Transformation 1 dsu graphs greedy sortings strings trees two pointers *1700	0 / 0	(None)
3405	CF1383C String Transformation 2 bitmasks dp graphs trees *3100	0 / 0	(None)
3404	CF1383D Rearrange brute force constructive algorithms graphs greedy sortings *2800	0 / 0	(None)
3402	CF1383F Special Edges flows graphs *3200	0 / 0	(None)
3393	CF1385E Directing Edges constructive algorithms dfs and similar graphs *2000	0 / 0	(None)
3391	CF1385G Columns Swaps 2-sat dfs and similar dsu graphs implementation *2300	0 / 0	(None)
3378	CF1388D Captain Flint and Treasure data structures dfs and similar graphs greedy implementation trees *2000	0 / 0	(None)
3370	CF1389G Directing Edges dfs and similar dp graphs trees *2800	0 / 0	(None)
3366	CF1391C Cyclic Permutations combinatorics dp graphs math *1500	0 / 0	(None)
3364	CF1391E Pairs of Pairs constructive algorithms dfs and similar graphs greedy trees *2600	0 / 0	(None)
3354	CF1392I Kevin and Grid fft graphs math *3300	0 / 0	(None)
3345	CF1394B Boboniu Walks on Graph brute force dfs and similar graphs hashing *2300	0 / 0	(None)
3316	CF1399F Yet Another Segments Subset data structures dp graphs sortings *2300	0 / 0	(None)
3297	CF1402C Star Trek special problem combinatorics dfs and similar dp games graphs matrices trees 2600	0 / 0	(None)
3296	CF1403A The Potion of Great Power special problem 2-sat binary search data structures graphs interactive sortings two pointers 2400	0 / 0	(None)
3295	CF1403B Spring cleaning special problem data structures dfs and similar graphs trees 2300	0 / 0	(None)
3288	CF1404E Bricks flows graph matchings graphs *2800	0 / 0	(None)
3283	CF1406C Link Cut Centroids constructive algorithms dfs and similar graphs trees *1700	0 / 0	(None)
3276	CF1407D Discrete Centrifugal Jumps data structures dp graphs *2200	0 / 0	(None)
3275	CF1407E Egor in the Republic of Dagestan constructive algorithms dfs and similar dp graphs greedy shortest paths *2500	0 / 0	(None)
3270	CF1408E Avoid Rainbow Cycles data structures dsu graphs greedy sortings trees *2400	0 / 0	(None)
3267	CF1408G Clusterization Counting combinatorics dp dsu fft graphs trees *2700	0 / 0	(None)
3255	CF1411C Peaceful Rooks dfs and similar dsu graphs *1700	0 / 0	(None)
3233	CF1416D Graph and Queries data structures dsu graphs implementation trees *2600	0 / 0	(None)
3226	CF1418C Mortal Kombat Tower dp graphs greedy shortest paths *1500	0 / 0	(None)
3214	CF1419F Rain of Fire binary search data structures dfs and similar dsu graphs implementation *2800	0 / 0	(None)
3197	CF1422D Returning Home graphs shortest paths sortings *2300	0 / 0	(None)
3193	CF1423B Valuable Paper binary search flows graph matchings graphs *1900	0 / 0	(None)
3192	CF1423C Dušan's Railway divide and conquer graphs trees *3500	0 / 0	(None)
3185	CF1423H Virus data structures divide and conquer dsu graphs *2500	0 / 0	(None)
3176	CF1424M Ancient Language graphs sortings *2200	0 / 0	(None)

Lucky

Pick a problem randomly based on the current filter.

Categories

动态规划

搜索

计算几何

贪心

树结构

图结构

数论

模拟

数据结构

博弈论

字符串

组合数学

线性代数

高精度

递推

概率论

NPC

其他

Status

Development

Support

About

Categories

Status

Development

Support

About

Don't have an account?

SIGN IN