Subway_18的博客

ICPC North Central NA Contest 2020 I. Staggering to the Finish

Subway_18 — Mon, 30 Aug 2021 22:52:41 +0800

ICPC North Central NA Contest 2020 I. Staggering to the Finish 题目描述 An oval track and field racing track consists of two parallel straightaway sections connected by two semicircles,depicted in figure 1. Footraces run in the counterclockwise direction, endi

STL练习 (string, map, vector, sort)

Subway_18 — Fri, 29 Jan 2021 12:51:08 +0800

Anagrams (II) 时间限制: 1 Sec 内存限制: 128 MB 题目描述 One of the preferred kinds of entertainment of people living in final stages of XX century is filling in the crosswords. Almost every newspaper and magazine has a column dedicated to entertainment but only amate

STL练习(vector, string, map, sort)

Subway_18 — Thu, 28 Jan 2021 14:28:00 +0800

问题 D: Ananagrams 时间限制: 1 Sec 内存限制: 128 MB 题目描述 Most crossword puzzle fans are used to anagrams — groups of words with the same letters in different orders — for example OPTS, SPOT, STOP, POTS and POST. Some words however do not have this attribute, no mat

垃圾键盘(bushi) (悲剧文本)

Subway_18 — Thu, 28 Jan 2021 13:01:40 +0800

问题 B: Broken Keyboard 时间限制: 1 Sec 内存限制: 128 MB 题目描述 You’re typing a long text with a broken keyboard. Well it’s not so badly broken. The only problem with the keyboard is that sometimes the “home” key or the “end” key gets automatically pressed (internall

产生数 (DFS + 高精度)

Subway_18 — Sun, 24 Jan 2021 18:30:34 +0800

问题 C: 产生数时间限制: 1 Sec 内存限制: 128 MB 题目描述给出一个整数 n（n<10^30) 和 k 个变换规则（k<=15）。规则：一位数可变换成另一个一位数：规则的右部不能为零。例如：n=234。有规则（k＝2）： 2－> 5 3－> 6 上面的整数 234 经过变换后可能产生出的整数为（包括原数）: 234 534 264 564 共 4 种不同的产生数问题：给出一个整数 n 和 k 个规则。求出：经过任意次的变换（0次或多次），能产生出

n皇后问题C++ 详解

Subway_18 — Tue, 19 Jan 2021 12:49:25 +0800

#pragma comment(linker, "/STACK:102400000,102400000") #pragma GCC optimize(3, "Ofast", "inline") #pragma GCC optimize(2) #include #define RE register int #define INF 0x3f3f3f3f #define EPS 1e-8 using namespace std; typedef unsigned lo

BFS+枚举

Subway_18 — Sun, 29 Nov 2020 17:23:32 +0800

14976: 绿纹龙的森林游记时间限制: 1 Sec 内存限制: 128 MB 题目描述暑假来了，绿纹龙很高兴。于是飘飘乎就来到了森林一日游。可是他却看到了很不和谐的一幕，一群猎人在森林里围捕小动物。森林可以看做是一个10*10的方格，如下图所示，1表示猎人，0表示小动物。已知猎人保持不动，而小动物可以往上下左右任意方向逃脱（当然不能撞上猎人）。小动物可以逃出森林。但上图背景色被标红的那部分小动物将永远无法逃脱猎人的魔爪。输入一个10*10的矩阵，描述森林中猎人和小动物分布的情况。保证每个点

求公共区间

Subway_18 — Tue, 17 Nov 2020 20:05:30 +0800

14383: Prison 时间限制: 1 Sec 内存限制: 128 MB 题目描述 We have N ID cards, and there are M gates. We can pass the i-th gate if we have one of the following ID cards: the Li-th, (Li+1)-th, …, and Ri-th ID cards. How many of the ID cards allow us to pass all the gates

1127：Password Passes

Subway_18 — Sun, 25 Oct 2020 21:03:41 +0800

1127: Password Passes//水题时间限制: 1 Sec 内存限制: 64 MB 题目描述 Student at ACME University are required to change passwords to their email accounts every year. Each new password must satisfy the following: The password must contain only alphanumeric characters (c