Contest Duration: ~ (local time) (300 minutes) Back to Home

Submission #7475006

Source Code Expand

Copy
```#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <string.h>
#include <vector>
#include <math.h>
#include <map>
#include <queue>
#define maxn 1000005
#define M(x,y) make_pair(x,y)
using namespace std;
typedef long long ll;
const int inf=0x3f3f3f3f;
int vis[200];
struct sa
{
int x;
int step;
};
int n,k,a,b,ans;
queue<sa>q;
void bfs()
{
while(!q.empty()){
int xx=q.front().x,ans=q.front().step;
q.pop();
if(xx==b)
{
printf("%d\n",ans );
return;
}
if(xx-1>=0&&!vis[xx-1]){
sa p;
p.x=xx-1;
p.step=ans+1;
vis[p.x]=1;
q.push(p);
}
if(xx-5>=0&&!vis[xx-5]){
sa p;
p.x=xx-5;
p.step=ans+1;
vis[p.x]=1;
q.push(p);
}
if(xx-10>=0&&!vis[xx-10]){
sa p;
p.x=xx-10;
p.step=ans+1;
vis[p.x]=1;
q.push(p);
}
if(xx+1<=40&&!vis[xx+1]){
sa p;
p.x=xx+1;
p.step=ans+1;
vis[p.x]=1;
q.push(p);
}
if(xx+5<=40&&!vis[xx+5]){
sa p;
p.x=xx+5;
p.step=ans+1;
vis[p.x]=1;
q.push(p);
}
if(xx+10<=40&&!vis[xx+10]){
sa p;
p.x=xx+10;
p.step=ans+1;
vis[p.x]=1;
q.push(p);
}
}
}
int main()
{
//freopen("in.txt","r",stdin);
while(scanf("%d%d",&a,&b)!=-1)
{
ans=0;
sa p;
p.x=a;
p.step=0;
q.push(p);
bfs();
}
return 0;
}

```

#### Submission Info

Submission Time 2019-09-12 17:59:05+0900 B - リモコン luogu_bot3 C++ (GCC 5.4.1) 100 1487 Byte AC 1 ms 256 KB

#### Judge Result

Set Name Score / Max Score Test Cases
All 100 / 100 00_maxdiff.txt, 00_maxret.txt, 00_sample1.txt, 00_sample2.txt, 00_sample3.txt, 01_rnd_00.txt, 01_rnd_01.txt, 01_rnd_02.txt, 01_rnd_03.txt, 01_rnd_04.txt, 01_rnd_05.txt, 01_rnd_06.txt, 01_rnd_07.txt, 01_rnd_08.txt, 01_rnd_09.txt, 01_rnd_10.txt, 01_rnd_11.txt, 01_rnd_12.txt, 01_rnd_13.txt, 01_rnd_14.txt, 01_rnd_15.txt, 01_rnd_16.txt, 01_rnd_17.txt, 01_rnd_18.txt, 01_rnd_19.txt, 01_rnd_20.txt, 01_rnd_21.txt, 01_rnd_22.txt, 01_rnd_23.txt, 01_rnd_24.txt, 01_rnd_25.txt, 01_rnd_26.txt, 01_rnd_27.txt, 01_rnd_28.txt, 01_rnd_29.txt
Case Name Status Exec Time Memory
00_maxdiff.txt 1 ms 256 KB
00_maxret.txt 1 ms 256 KB
00_sample1.txt 1 ms 256 KB
00_sample2.txt 1 ms 256 KB
00_sample3.txt 1 ms 256 KB
01_rnd_00.txt 1 ms 256 KB
01_rnd_01.txt 1 ms 256 KB
01_rnd_02.txt 1 ms 256 KB
01_rnd_03.txt 1 ms 256 KB
01_rnd_04.txt 1 ms 256 KB
01_rnd_05.txt 1 ms 256 KB
01_rnd_06.txt 1 ms 256 KB
01_rnd_07.txt 1 ms 256 KB
01_rnd_08.txt 1 ms 256 KB
01_rnd_09.txt 1 ms 256 KB
01_rnd_10.txt 1 ms 256 KB
01_rnd_11.txt 1 ms 256 KB
01_rnd_12.txt 1 ms 256 KB
01_rnd_13.txt 1 ms 256 KB
01_rnd_14.txt 1 ms 256 KB
01_rnd_15.txt 1 ms 256 KB
01_rnd_16.txt 1 ms 256 KB
01_rnd_17.txt 1 ms 256 KB
01_rnd_18.txt 1 ms 256 KB
01_rnd_19.txt 1 ms 256 KB
01_rnd_20.txt 1 ms 256 KB
01_rnd_21.txt 1 ms 256 KB
01_rnd_22.txt 1 ms 256 KB
01_rnd_23.txt 1 ms 256 KB
01_rnd_24.txt 1 ms 256 KB
01_rnd_25.txt 1 ms 256 KB
01_rnd_26.txt 1 ms 256 KB
01_rnd_27.txt 1 ms 256 KB
01_rnd_28.txt 1 ms 256 KB
01_rnd_29.txt 1 ms 256 KB