随笔分类 -  搜索系列/BFS/DFS

摘要:[Northern Eurasia Finals Online 2020]D. Down We Dig(记忆化搜索,博弈) 题面: 题意: 有一个高度为$\mathit n$的颜色方格,每一行有8个字符,其中‘W'代表白色,’R'代表红色。 现在要求你输出$\mathit n$个数,其中第$\mat 阅读全文
posted @ 2020-12-26 00:53 茄子Min 阅读(328) 评论(0) 推荐(1)
摘要:[Codeforces Round 636 (Div. 3)] E. Weights Distributing (BFS+最短路+贪心) E. Weights Distributing time limit per test 2 seconds memory limit per test 256 m 阅读全文
posted @ 2020-04-22 17:28 茄子Min 阅读(332) 评论(0) 推荐(0)
摘要:[Codeforces Round 498 (Div. 3)] F. Xor Paths (折半搜索) F. Xor Paths time limit per test 3 seconds memory limit per test 256 megabytes input standard inpu 阅读全文
posted @ 2020-03-24 18:39 茄子Min 阅读(218) 评论(0) 推荐(0)
摘要:Persistent Bookcase "CodeForces 707D " time limit per test 2 seconds memory limit per test 512 megabytes input standard input output standard output R 阅读全文
posted @ 2019-10-01 19:37 茄子Min 阅读(213) 评论(0) 推荐(0)
摘要:链接:https://ac.nowcoder.com/acm/contest/984/L 来源:牛客网 Catch That Cow 时间限制:C/C++ 1秒,其他语言2秒 空间限制:C/C++ 32768K,其他语言65536K 64bit IO Format: %lld 题目描述 Farmer 阅读全文
posted @ 2019-07-26 21:40 茄子Min 阅读(219) 评论(0) 推荐(0)
摘要:链接:https://ac.nowcoder.com/acm/contest/984/F 来源:牛客网 随机数 时间限制:C/C++ 1秒,其他语言2秒 空间限制:C/C++ 32768K,其他语言65536K 64bit IO Format: %lld 题目描述 正如你所知,奶牛们没有手指以至于不 阅读全文
posted @ 2019-07-12 17:48 茄子Min 阅读(183) 评论(0) 推荐(0)
摘要:题目描述 现有n盏灯,以及m个按钮。每个按钮可以同时控制这n盏灯——按下了第i个按钮,对于所有的灯都有一个效果。按下i按钮对于第j盏灯,是下面3中效果之一:如果a[i][j]为1,那么当这盏灯开了的时候,把它关上,否则不管;如果为 1的话,如果这盏灯是关的,那么把它打开,否则也不管;如果是0,无论这 阅读全文
posted @ 2019-07-07 16:27 茄子Min 阅读(220) 评论(0) 推荐(0)
摘要:24.02% 1000ms 262144K “因材施教”的教育方式自古有之,互联网时代,要实现真正意义上的个性化教育,离不开大数据技术的扶持。VIPKID 英语 2020 多万学员每月在课前预习、课中教学、课后复习、作业、答题测评等环节会产生超过 100100 TB 的数据增量,在对庞大数据进行分析 阅读全文
posted @ 2019-06-17 16:25 茄子Min 阅读(402) 评论(0) 推荐(0)
摘要:《Journey to the West》(also 《Monkey》) is one of the Four Great Classical Novels of Chinese literature. It was written by Wu Cheng'en during the Ming Dy 阅读全文
posted @ 2019-05-04 00:09 茄子Min 阅读(237) 评论(0) 推荐(0)
摘要:After a terrifying forest fire in Berland a forest rebirth program was carried out. Due to it N rows with M trees each were planted and the rows were 阅读全文
posted @ 2019-04-21 19:29 茄子Min 阅读(482) 评论(0) 推荐(0)
摘要:Kuro is living in a country called Uberland, consisting of nn towns, numbered from 11to nn, and n−1n−1 bidirectional roads connecting these towns. It 阅读全文
posted @ 2019-04-14 13:53 茄子Min 阅读(378) 评论(0) 推荐(0)
摘要:You are given a connected undirected graph consisting of nn vertices and mm edges. There are no self-loops or multiple edges in the given graph. You h 阅读全文
posted @ 2019-04-01 19:46 茄子Min 阅读(370) 评论(0) 推荐(0)
摘要:D. Vladik and Favorite Game time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output D. Vladik an 阅读全文
posted @ 2019-01-19 23:46 茄子Min 阅读(266) 评论(0) 推荐(0)