Submission #6584911
Source Code Expand
#include<iostream> #include<cstdio> #include<queue> using namespace std; const int M=1e5+7; int a[M],vis[M],b[M];//a记录最短时间,vis记录是否访问过 int n,k,d[10]={1,-1,5,-5,10,-10};//d是他可以前后左右走的点 queue<int>q; int main() { // freopen("temp.in","r",stdin); // freopen("temp.out","w",stdout); scanf("%d%d",&n,&k); a[n]=0,vis[n]=1;q.push(n); while(!q.empty()) { int x=q.front();q.pop(); if(x==k)break; for(int i=0;i<6;i++) { int y=x+d[i]; if(y<M&&y>-1&&vis[y]!=1) { q.push(y); vis[y]=1; a[y]=a[x]+1; } } } cout<<a[k]<<endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - リモコン |
User | luogu_bot2 |
Language | C++ (GCC 5.4.1) |
Score | 100 |
Code Size | 717 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:13:21: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d%d",&n,&k); ^
Judge Result
Set Name | All | ||
---|---|---|---|
Score / Max Score | 100 / 100 | ||
Status |
|
Set Name | Test Cases |
---|---|
All | 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 | AC | 1 ms | 256 KB |
00_maxret.txt | AC | 1 ms | 256 KB |
00_sample1.txt | AC | 1 ms | 256 KB |
00_sample2.txt | AC | 1 ms | 256 KB |
00_sample3.txt | AC | 1 ms | 256 KB |
01_rnd_00.txt | AC | 1 ms | 256 KB |
01_rnd_01.txt | AC | 1 ms | 256 KB |
01_rnd_02.txt | AC | 1 ms | 256 KB |
01_rnd_03.txt | AC | 1 ms | 256 KB |
01_rnd_04.txt | AC | 1 ms | 256 KB |
01_rnd_05.txt | AC | 1 ms | 256 KB |
01_rnd_06.txt | AC | 1 ms | 256 KB |
01_rnd_07.txt | AC | 1 ms | 256 KB |
01_rnd_08.txt | AC | 1 ms | 256 KB |
01_rnd_09.txt | AC | 1 ms | 256 KB |
01_rnd_10.txt | AC | 1 ms | 256 KB |
01_rnd_11.txt | AC | 1 ms | 256 KB |
01_rnd_12.txt | AC | 1 ms | 256 KB |
01_rnd_13.txt | AC | 1 ms | 256 KB |
01_rnd_14.txt | AC | 1 ms | 256 KB |
01_rnd_15.txt | AC | 1 ms | 256 KB |
01_rnd_16.txt | AC | 1 ms | 256 KB |
01_rnd_17.txt | AC | 1 ms | 256 KB |
01_rnd_18.txt | AC | 1 ms | 256 KB |
01_rnd_19.txt | AC | 1 ms | 256 KB |
01_rnd_20.txt | AC | 1 ms | 256 KB |
01_rnd_21.txt | AC | 1 ms | 256 KB |
01_rnd_22.txt | AC | 1 ms | 256 KB |
01_rnd_23.txt | AC | 1 ms | 256 KB |
01_rnd_24.txt | AC | 1 ms | 256 KB |
01_rnd_25.txt | AC | 1 ms | 256 KB |
01_rnd_26.txt | AC | 1 ms | 256 KB |
01_rnd_27.txt | AC | 1 ms | 256 KB |
01_rnd_28.txt | AC | 1 ms | 256 KB |
01_rnd_29.txt | AC | 1 ms | 256 KB |