Submission #2196845


Source Code Expand

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.InputMismatchException;
import java.util.Map;
import java.util.StringTokenizer;
import java.util.TreeMap;

public class Main {

	public static void main(String[] args) throws IOException {
		InputStream inputStream = System.in;
		OutputStream outputStream = System.out;
		InputReader in = new InputReader(inputStream);
		PrintWriter out = new PrintWriter(outputStream);
		TaskX solver = new TaskX();
		solver.solve(1, in, out);
		out.close();
	}

	static class TaskX {
		public void solve(int testNumber, InputReader in, PrintWriter out) {

			int a = in.nextInt();
			int b = in.nextInt();
			int[] map = new int[11];
			map[0] = 0;
			map[1] = 1;
			map[2] = 2;
			map[3] = 3;
			map[4] = 2;
			map[5] = 1;
			map[6] = 2;
			map[7] = 3;
			map[8] = 2;
			map[9] = 2;
			map[10] = 1;

			int count = 0;
			if (a == b) {
				count = 0;
			} else if (a < b) {
				while (b - a > 10) {
					b -= 10;
					count++;
				}
				count += map[b-a];
			} else if (a > b) {
				while (a - b > 10) {
					a -= 10;
					count++;
				}
				count += map[a-b];
			}
			out.println(count);

		}
	}

	static class ArrayUtils {
		public static Map<Integer, Integer> getCountMap(int[] array) {
			Map<Integer, Integer> map = new TreeMap<>();
			for (int x : array)
				map.merge(x, 1, Integer::sum);
			return map;
		}
	}

	static class InputReader {
		BufferedReader in;
		StringTokenizer tok;

		public String nextString() {
			while (!tok.hasMoreTokens()) {
				try {
					tok = new StringTokenizer(in.readLine(), " ");
				} catch (IOException e) {
					throw new InputMismatchException();
				}
			}
			return tok.nextToken();
		}

		public int nextInt() {
			return Integer.parseInt(nextString());
		}

		public long nextLong() {
			return Long.parseLong(nextString());
		}

		public int[] nextIntArray(int n) {
			int[] res = new int[n];
			for (int i = 0; i < n; i++) {
				res[i] = nextInt();
			}
			return res;
		}

		public long[] nextLongArray(int n) {
			long[] res = new long[n];
			for (int i = 0; i < n; i++) {
				res[i] = nextLong();
			}
			return res;
		}

		public InputReader(InputStream inputStream) {
			in = new BufferedReader(new InputStreamReader(inputStream));
			tok = new StringTokenizer("");
		}

	}

}

Submission Info

Submission Time
Task B - リモコン
User tutuz
Language Java8 (OpenJDK 1.8.0)
Score 0
Code Size 2531 Byte
Status WA
Exec Time 75 ms
Memory 23376 KB

Judge Result

Set Name All
Score / Max Score 0 / 100
Status
AC × 32
WA × 3
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 73 ms 20820 KB
00_maxret.txt WA 73 ms 21460 KB
00_sample1.txt AC 74 ms 19284 KB
00_sample2.txt AC 71 ms 16980 KB
00_sample3.txt AC 73 ms 21204 KB
01_rnd_00.txt AC 75 ms 18900 KB
01_rnd_01.txt AC 72 ms 19796 KB
01_rnd_02.txt AC 73 ms 18644 KB
01_rnd_03.txt AC 74 ms 18644 KB
01_rnd_04.txt AC 73 ms 18644 KB
01_rnd_05.txt AC 73 ms 21460 KB
01_rnd_06.txt AC 71 ms 18644 KB
01_rnd_07.txt AC 73 ms 19796 KB
01_rnd_08.txt AC 73 ms 17876 KB
01_rnd_09.txt AC 75 ms 23376 KB
01_rnd_10.txt WA 71 ms 19412 KB
01_rnd_11.txt AC 73 ms 21328 KB
01_rnd_12.txt AC 71 ms 18388 KB
01_rnd_13.txt AC 72 ms 21460 KB
01_rnd_14.txt AC 73 ms 20948 KB
01_rnd_15.txt AC 74 ms 21460 KB
01_rnd_16.txt AC 72 ms 19668 KB
01_rnd_17.txt WA 71 ms 19412 KB
01_rnd_18.txt AC 73 ms 21460 KB
01_rnd_19.txt AC 72 ms 19540 KB
01_rnd_20.txt AC 74 ms 21460 KB
01_rnd_21.txt AC 72 ms 21460 KB
01_rnd_22.txt AC 72 ms 18388 KB
01_rnd_23.txt AC 71 ms 18644 KB
01_rnd_24.txt AC 74 ms 19156 KB
01_rnd_25.txt AC 74 ms 21588 KB
01_rnd_26.txt AC 75 ms 21332 KB
01_rnd_27.txt AC 73 ms 18260 KB
01_rnd_28.txt AC 71 ms 19540 KB
01_rnd_29.txt AC 72 ms 17876 KB