Submission #7448679


Source Code Expand

#include <cstdio>
#include <algorithm>
#include <queue>

using namespace std;

int a, b;
typedef pair<int, int> pp;
queue<pp> que;
int delta[6] = { 1, -1, 5, -5, 10, -10 };

void init() {
	scanf("%d%d", &a, &b);
}

int bfs(int m, int n) {
	que.push(pp(0, m));
	while (true) {
		pp p = que.front();
		que.pop();
		if (p.second == n) {
			return p.first;
		}
		for (int i = 0; i < 6; i++) {
			que.push(pp(p.first + 1, p.second + delta[i]));
		}
	}
}



int main() {
	init();
	printf("%d", bfs(a, b));
	//system("pause");
	return 0;
}

Submission Info

Submission Time
Task B - リモコン
User luogu_bot4
Language C++ (GCC 5.4.1)
Score 0
Code Size 568 Byte
Status WA
Exec Time 3 ms
Memory 1024 KB

Compile Error

./Main.cpp: In function ‘void init()’:
./Main.cpp:13:23: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d", &a, &b);
                       ^

Judge Result

Set Name All
Score / Max Score 0 / 100
Status
WA × 35
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 WA 2 ms 508 KB
00_maxret.txt WA 2 ms 1024 KB
00_sample1.txt WA 1 ms 256 KB
00_sample2.txt WA 1 ms 256 KB
00_sample3.txt WA 1 ms 256 KB
01_rnd_00.txt WA 1 ms 256 KB
01_rnd_01.txt WA 1 ms 256 KB
01_rnd_02.txt WA 1 ms 256 KB
01_rnd_03.txt WA 1 ms 256 KB
01_rnd_04.txt WA 1 ms 256 KB
01_rnd_05.txt WA 1 ms 256 KB
01_rnd_06.txt WA 1 ms 256 KB
01_rnd_07.txt WA 1 ms 256 KB
01_rnd_08.txt WA 3 ms 384 KB
01_rnd_09.txt WA 1 ms 256 KB
01_rnd_10.txt WA 1 ms 256 KB
01_rnd_11.txt WA 1 ms 256 KB
01_rnd_12.txt WA 2 ms 640 KB
01_rnd_13.txt WA 1 ms 256 KB
01_rnd_14.txt WA 1 ms 256 KB
01_rnd_15.txt WA 1 ms 256 KB
01_rnd_16.txt WA 1 ms 256 KB
01_rnd_17.txt WA 1 ms 256 KB
01_rnd_18.txt WA 1 ms 256 KB
01_rnd_19.txt WA 1 ms 256 KB
01_rnd_20.txt WA 1 ms 256 KB
01_rnd_21.txt WA 1 ms 256 KB
01_rnd_22.txt WA 1 ms 256 KB
01_rnd_23.txt WA 1 ms 256 KB
01_rnd_24.txt WA 1 ms 256 KB
01_rnd_25.txt WA 1 ms 256 KB
01_rnd_26.txt WA 1 ms 256 KB
01_rnd_27.txt WA 1 ms 256 KB
01_rnd_28.txt WA 1 ms 256 KB
01_rnd_29.txt WA 1 ms 256 KB