比赛场次 | 332 |
---|---|
比赛名称 | NOIP模拟赛by mzx Day1 |
比赛状态 | 已结束比赛成绩 |
开始时间 | 2016-10-19 18:30:00 |
结束时间 | 2016-10-19 22:00:00 |
开放分组 | 全部用户 |
注释介绍 | 由辣鸡mzx出的一套NOIP模拟题 考察基本知识点和代码能力 难度略难高noip2015 送分多,很良心 题解:http://pan.baidu.com/s/1mhN6xW8 |
题目名称 | 为爱追寻 |
---|---|
输入输出 | loverfinding.in/out |
时间限制 | 1000 ms (1 s) |
内存限制 | 256 MiB |
测试点数 | 10 简单对比 |
用户 | 结果 | 时间 | 内存 | 得分 |
---|---|---|---|---|
|
AAAAAAAAAA | 5.443 s | 180.53 MiB | 100 |
|
AAAAAAAAAA | 5.837 s | 27.77 MiB | 100 |
|
AAAAAAAAAA | 6.437 s | 7.15 MiB | 100 |
|
AAAAAAAAAA | 6.666 s | 6.33 MiB | 100 |
|
AAAAAAAAAE | 3.615 s | 19.40 MiB | 90 |
|
AAAAAAAAAW | 4.579 s | 7.15 MiB | 90 |
|
AAAAAAAAAE | 4.795 s | 34.62 MiB | 90 |
|
AAAAAAAAAE | 4.977 s | 24.23 MiB | 90 |
|
AAAAAAAAAT | 5.002 s | 19.40 MiB | 90 |
|
AAAAAAAAAE | 5.139 s | 21.83 MiB | 90 |
|
AAAAAAAAAE | 5.247 s | 24.17 MiB | 90 |
|
AAAAAAAAAE | 5.612 s | 76.59 MiB | 90 |
|
TAAAAAAAAE | 6.523 s | 21.88 MiB | 80 |
|
AATAAAAAAE | 7.995 s | 24.16 MiB | 80 |
|
WWWAAAAAAA | 5.569 s | 18.34 MiB | 70 |
|
AAAAAAWWWT | 7.298 s | 68.95 MiB | 60 |
|
AAATTATAAT | 7.984 s | 76.61 MiB | 60 |
|
AAAWWWEEEE | 4.464 s | 76.61 MiB | 30 |
|
AAAWWWWWWE | 5.594 s | 19.36 MiB | 30 |
|
TTTAAAEEEE | 5.824 s | 10.58 MiB | 30 |
|
MMMMMMMMMM | 0.000 s | 0.00 MiB | 0 |
|
C | 0.000 s | 0.00 MiB | 0 |
|
MMMMMMMMMM | 0.000 s | 0.00 MiB | 0 |
|
EEEEEEEEEE | 0.012 s | 30.23 MiB | 0 |
|
EEEEEEEEEE | 0.015 s | 49.76 MiB | 0 |
|
RRRRRRRRRR | 0.016 s | 0.31 MiB | 0 |
|
RRRRRRRRRR | 0.017 s | 2.10 MiB | 0 |
|
EEEEEEEEEE | 0.019 s | 7.92 MiB | 0 |
|
EEEEEEEEEE | 0.022 s | 24.02 MiB | 0 |
|
EEEEEEEEEE | 0.025 s | 24.02 MiB | 0 |
|
RRRRRRRRRR | 0.026 s | 86.13 MiB | 0 |
|
RRRRRRRRRR | 0.030 s | 0.28 MiB | 0 |
|
WWWWWWEWWW | 0.165 s | 0.30 MiB | 0 |
|
WWWWWWWWWW | 0.279 s | 0.22 MiB | 0 |
|
EEEEEEEEEE | 0.699 s | 7.92 MiB | 0 |
|
EEEEEEEEEE | 1.118 s | 0.28 MiB | 0 |
|
EEEEEEEEEE | 1.226 s | 0.31 MiB | 0 |
|
WWWWWWWWWW | 2.620 s | 6.35 MiB | 0 |
|
WWWWWWWWWW | 2.926 s | 7.15 MiB | 0 |
|
WWWWWWWWWW | 3.337 s | 0.28 MiB | 0 |
|
WWWWWWWWWW | 3.843 s | 0.25 MiB | 0 |
|
WWWWWWWWWW | 3.961 s | 0.31 MiB | 0 |
|
WWWWWWWWWW | 4.021 s | 0.31 MiB | 0 |
|
WWWWWWWWWW | 4.099 s | 0.26 MiB | 0 |
|
WWWWWWWWWW | 4.116 s | 0.26 MiB | 0 |
|
WWWWWWWWWW | 4.318 s | 0.23 MiB | 0 |
|
WWWWWWWWWW | 4.649 s | 0.29 MiB | 0 |
|
WWWWWWWWWW | 4.987 s | 0.29 MiB | 0 |
|
TTTTTTEEEE | 6.560 s | 24.35 MiB | 0 |
|
TTTTTTEEEE | 6.601 s | 6.76 MiB | 0 |
|
EETTTEEEEE | 8.277 s | 24.63 MiB | 0 |
|
TETTEEEETT | 8.291 s | 4.28 MiB | 0 |
|
TTTTETTTTE | 8.799 s | 2.33 MiB | 0 |
|
TTETEETTTT | 9.073 s | 2.03 MiB | 0 |
|
TTTTTTTTTE | 9.125 s | 0.50 MiB | 0 |
|
TTTTTTTTTE | 9.130 s | 95.76 MiB | 0 |
|
TTTTTTTTTE | 9.133 s | 34.64 MiB | 0 |
|
TTTTTTTTTE | 9.147 s | 1.87 MiB | 0 |
|
TWTTTTTTTE | 9.148 s | 2.00 MiB | 0 |
|
TTTTTTTTTE | 9.148 s | 22.03 MiB | 0 |
|
TTTTTTTTTE | 9.158 s | 7.88 MiB | 0 |
|
TTTTTTTTTE | 9.177 s | 18.56 MiB | 0 |
|
ETTTTTTTTT | 9.671 s | 0.94 MiB | 0 |
|
TTTTTTTTTT | 10.000 s | 6.35 MiB | 0 |
|
TTTTTTTTTT | 10.001 s | 0.28 MiB | 0 |
|
TTTTTTTTTT | 10.001 s | 5.56 MiB | 0 |
|
TTTRTRTTTT | 10.001 s | 7.94 MiB | 0 |
|
TTTTTTTTTT | 10.003 s | 0.28 MiB | 0 |
|
TTTTTTTTTT | 10.004 s | 0.28 MiB | 0 |
|
TTTTTTTTTT | 10.005 s | 6.34 MiB | 0 |
|
TTTTTTTTTT | 10.005 s | 7.92 MiB | 0 |
|
TTTTTTTTTT | 10.006 s | 0.31 MiB | 0 |
|
TTTTTTTTTT | 10.006 s | 68.95 MiB | 0 |
|
TTTTTTTTTT | 10.007 s | 0.31 MiB | 0 |
|
TTTTTTTTTT | 10.007 s | 0.31 MiB | 0 |
|
TTTTTTTTTT | 10.007 s | 7.13 MiB | 0 |
|
TTTTTTTTTT | 10.007 s | 31.18 MiB | 0 |
|
TTTTTTTTTT | 10.007 s | 36.84 MiB | 0 |
|
TTTTTTTTTT | 10.008 s | 0.27 MiB | 0 |
|
TTTTTTTTTT | 10.009 s | 0.28 MiB | 0 |
|
TTTTTTTTTT | 10.010 s | 0.27 MiB | 0 |
|
TTTTTTTTTT | 10.014 s | 0.30 MiB | 0 |
|
TTTTTTTTTT | 10.015 s | 7.98 MiB | 0 |
|
TTTTTTTTTT | 10.016 s | 0.31 MiB | 0 |
|
TTTTTTTTTT | 10.016 s | 90.28 MiB | 0 |
|
TTTTTTTTTT | 10.016 s | 137.56 MiB | 0 |
|
TTTTTTTTTT | 10.017 s | 0.28 MiB | 0 |
|
TTTTTTTTTT | 10.017 s | 0.31 MiB | 0 |
|
TTTTTTTTTT | 10.018 s | 0.28 MiB | 0 |
|
TTTTTTTTTT | 10.019 s | 0.25 MiB | 0 |
|
TTTTTTTTTT | 10.019 s | 0.31 MiB | 0 |
|
TTTTTTTTTT | 10.019 s | 7.94 MiB | 0 |
|
TTTTTTTTTT | 10.020 s | 0.21 MiB | 0 |
|
TTTTTTTTTT | 10.020 s | 0.27 MiB | 0 |
|
TTTTTTTTTT | 10.021 s | 109.35 MiB | 0 |
|
TTTTTTTTTT | 10.024 s | 0.31 MiB | 0 |
|
TTTTTTTTTT | 10.025 s | 0.31 MiB | 0 |
|
TTTTTTTTTT | 10.026 s | 0.28 MiB | 0 |
|
TTTTTTTTTT | 10.028 s | 246.36 MiB | 0 |
|
TTTTTTTTTT | 10.029 s | 0.31 MiB | 0 |
|
TTTTTTTTTT | 10.031 s | 0.28 MiB | 0 |
|
TTTTTTTTTT | 10.034 s | 0.31 MiB | 0 |
|
TTTTTTTTTT | 10.037 s | 0.31 MiB | 0 |
|
TTTTTTTTTT | 10.040 s | 135.27 MiB | 0 |
|
TTTTTTTTTT | 10.044 s | 0.31 MiB | 0 |
|
TTTTTTTTTT | 10.046 s | 0.31 MiB | 0 |
|
TTTTTTTTTT | 10.051 s | 0.28 MiB | 0 |
|
TTTTTTTTTT | 10.052 s | 0.31 MiB | 0 |
【注意:本场比赛准备仓促而且无人验题,可能会出现各种各样的小错误,对题面或者数据范围有疑问的同学请在cogs用户群中提问】
【公告:第二题样例n应该为5,已修改,第三题样例已上传,第二题题面已修改为:“所经过的零食店的消费指数不能超过c(除了起点和终点以外)”,第三题中敌方牌中没有敏捷单位】
【由于没有用评测机跑过数据,为了卡掉复杂度不正确的算法,考试过程中可能对数据范围或者时间限制的常数级修改,注意到数据修改请及时修改自己的数组大小。此外请同学们使用最优时间复杂度的算法】
【OI赛制,本场比赛结束后不评测,Day2结束后统一评测】
话说一年半以前,紫萱学姐展开了对杨廷学长的追求。在经历了不懈的努力之后,学姐终于成为了一名……金牌单身狗。但是这位痴情的少女并没有放弃,于是决定在保送之后继续进行这项征程,并为参加比赛的各位在役OI选手送上半熟的狗粮。
历经了半年的停课之后,学姐回到了陌生又熟悉的班里,但是她已经找不到学长的位置了。于是她决定采用一种高效率的寻找方法:瞎找法。
我们将学姐的班级视为一个二维平面,每个整数坐标对应一张桌子,学姐从班级的某个位置(x0,y0)开始瞎找,每次检查一下当前所在的这个桌子是谁的,然后进行下一次移动,直到找到学长的桌子(xt,yt),便停止移动。
给出学姐的初始坐标和每次移动的方向,请你判断在寻找的过程中学姐一共检查了多少张桌子。
第一行五个整数n,x0,y0,xt,yt,分别代表学姐移动的次数和学长桌子的坐标。
接下来n行,第i行两个整数dx,dy,代表学姐第i次移动沿与x/y轴平行的方向移动了dx/dy个单位。如果dx/dy为负数,表示沿x/y轴的反方向移动了-dx/-dy个单位。
输出学姐检查过的桌子总数,如果学姐进行完所有移动之后都没有找到学长的桌子,那么输出“SingleDogMZX”(不含引号)。
5 1 1 3 2 1 1 0 -2 0 2 1 0 0 -1
4
样例中,检查了(1,1)(2,2),(2,0),(3,2)共4张桌子
对于30%的数据,学姐每次移动时不会移动到已经检查过的桌子。
对于60%的数据,任何时刻学姐的横纵坐标都为≤2500的自然数。
对于90%的数据,任何时刻学姐的横纵坐标的绝对值都为≤2500的自然数。
对于100%的数据,任何时刻学姐的横纵坐标的绝对值都为≤10^9的自然数,n≤1000000。
mzx