Problem 3789 --License Plate Recognition

3789: License Plate Recognition

"
Time Limit $1$ 秒/Second(s) Memory Limit $128$ 兆字节/Megabyte(s)
提交总数 $23$ 正确数量 $3$
裁判形式 标准裁判/Standard Judge 我的状态 尚未尝试
难度 分类标签 字符串
The first line contains an integer T (1≤T≤50) --- the number of test cases.

Each test case represents a binary image, which contains 30 lines of strings. Each line contains 100 characters, either . (a black pixel) or # (a white pixel).

Here are all the characters that may appear in the image.

Chinese characters:


ASCII version: https://paste.ubuntu.com/p/B5pTWv7s6J/
(Backup: https://github.com/cjj490168650/plate/blob/main/chn.txt)

English and numeric characters:

ASCII version: https://paste.ubuntu.com/p/59bjvwY3Yr/
(Backup: https://github.com/cjj490168650/plate/blob/main/eng.txt)

It is guaranteed that:

  • The characters in the image follow the standard of license plates. There are seven characters in the image, lining up from left to right. The first character is a Chinese character. The second character is an English character. The last five characters are English or numeric characters.

  • All characters in the image are identical to the characters given above (ASCII version), including the size and the shape.

  • There are no redundant white pixels in the image.

  • There is spacing between characters.

  • The characters won't touch or get out of the image boundaries.


1
....................................................................................................
....................................................................................................
....................................................................................................
....................................................................................................
....................................................................................................
....................................................................................................
....................................................................................................
..........................##...........##..........#####......########..........##......########....
.......#.......#..........###..........##.........#######.....########.........###......########....
.......#.......#..........###..........##........##....##..........###.........###......##..........
.......#.......#.........####..........##...............##........###.........####......##..........
....###############......####..........##..............##........###..........####......##..........
.......#.......#.........##.#..........##..............##.......###...........####......##..........
.......#.......#.........##.##.........##..............##.......#####........#####......#######.....
.......#.......#.........##.##.........##.............##........######.......##.##......########....
.......#.......#........###.##.........##............###............##......###.##............###...
.......#########........##..##.........##...........###.............##......##..##.............##...
.......#.......#........##...#.........##...........##..............##......##..##.............##...
.......#.......#........##...##........##..........###..............##.....##...##.............##...
.......#.......#........#######........##.........###.........##....##.....#########...........##...
.......#.......#.......########........##.........##..........##....##.....#########....##.....##...
.......#########.......##....##........##........###..........###...##..........##.......##...###...
.......#.......#.......##....##........##........########......######...........##.......#######....
.......................##.....##.......##........########.......####............##........#####.....
....................................................................................................
....................................................................................................
....................................................................................................
....................................................................................................
....................................................................................................
....................................................................................................
 
Case #1:
5 19
24 32
40 41
50 58
63 70
76 84
89 97

推荐代码 查看3789 所有题解 上传题解视频得图灵币

本题记录 用 户(点击查看用户) 运行号(点击购买题解) 时 间
算法最快[$9 $ms] ꧁༺ 看看我的名字是不是很长 ༻꧂ 819071 2022-03-12 17:06:33
内存最少[$2044 $KB] 梦鸿 818883 2022-03-12 16:04:27
第一AC 只能过个样例~~~ 789457 2021-12-01 17:34:07
第一挑战 只能过个样例~~~ 761494 2021-07-29 17:56:25

赛题来源/所属竞赛 N/A

竞赛编号 竞赛名称 竞赛时间 访问比赛
1695 2022年省赛预选赛(字符串) 2022-03-12 14:00:00 请登录