Submission #1042561


Source Code Expand

import java.io.IOException;
import java.io.InputStream;
import java.util.NoSuchElementException;


public class Main {
  public static void main(String[] args) {
    FastScanner sc = new FastScanner();
    long x = sc.nextLong();
    long y = sc.nextLong();
    System.out.println(solve(x, y));
    
//    for (int i = -3; i <= 3; i ++) {
//      for (int j = -3; j <= 3; j ++) {
//        long ret = solve(i, j);
//        
//        System.out.printf("%d %d %d\n", i, j, ret);
//      }
//    }
  }
  
  private static long solve(long x, long y) {
    long ax = Math.abs(x);
    long ay = Math.abs(y);
    long d = Math.abs(ax - ay);
    
    if (x == y) {
      return 0;
    } else if (ax <= ay) {
      if (y >= 0 && x >= 0) {
        return d;
      } else if (x * y < 0){
        return d + 1;
      } else {
        return d + 2;
      }
    } else {
      if (y >= 0 && x >= 0) {
        return d + 2;
      } else if (x >= 0 && y <= 0){
        return d + 1;
      } else if (x <= 0 && y >= 0){
        return y - x;
      } else {
        return d;
      }
    }
  }
}



class FastScanner {
	public static String debug = null;

	private final InputStream in = System.in;
	private int ptr = 0;
	private int buflen = 0;
	private byte[] buffer = new byte[1024];
	private boolean eos = false;

	private boolean hasNextByte() {
		if (ptr < buflen) {
			return true;
		} else {
			ptr = 0;
			try {
				if (debug != null) {
					buflen = debug.length();
					buffer = debug.getBytes();
					debug = "";
					eos = true;
				} else {
					buflen = in.read(buffer);
				}
			} catch (IOException e) {
				e.printStackTrace();
			}
			if (buflen < 0) {
				eos = true;
				return false;
			} else if (buflen == 0) {
				return false;
			}
		}
		return true;
	}

	private int readByte() {
		if (hasNextByte())
			return buffer[ptr++];
		else
			return -1;
	}

	private static boolean isPrintableChar(int c) {
		return 33 <= c && c <= 126;
	}

	private void skipUnprintable() {
		while (hasNextByte() && !isPrintableChar(buffer[ptr]))
			ptr++;
	}

	public boolean isEOS() {
		return this.eos;
	}

	public boolean hasNext() {
		skipUnprintable();
		return hasNextByte();
	}

	public String next() {
		if (!hasNext())
			throw new NoSuchElementException();
		StringBuilder sb = new StringBuilder();
		int b = readByte();
		while (isPrintableChar(b)) {
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}

	public long nextLong() {
		if (!hasNext())
			throw new NoSuchElementException();
		long n = 0;
		boolean minus = false;
		int b = readByte();
		if (b == '-') {
			minus = true;
			b = readByte();
		}
		if (b < '0' || '9' < b) {
			throw new NumberFormatException();
		}
		while (true) {
			if ('0' <= b && b <= '9') {
				n *= 10;
				n += b - '0';
			} else if (b == -1 || !isPrintableChar(b)) {
				return minus ? -n : n;
			} else {
				throw new NumberFormatException();
			}
			b = readByte();
		}
	}

	public int nextInt() {
		return (int) nextLong();
	}

	public long[] nextLongList(int n) {
		return nextLongTable(1, n)[0];
	}

	public int[] nextIntList(int n) {
		return nextIntTable(1, n)[0];
	}

	public long[][] nextLongTable(int n, int m) {
		long[][] ret = new long[n][m];
		for (int i = 0; i < n; i ++) {
			for (int j = 0; j < m; j ++) {
				ret[i][j] = nextLong();
			}
		}
		return ret;
	}

	public int[][] nextIntTable(int n, int m) {
		int[][] ret = new int[n][m];
		for (int i = 0; i < n; i ++) {
			for (int j = 0; j < m; j ++) {
				ret[i][j] = nextInt();
			}
		}
		return ret;
	}
}

Submission Info

Submission Time
Task A - Simple Calculator
User hiromi_ayase
Language Java8 (OpenJDK 1.8.0)
Score 0
Code Size 3719 Byte
Status WA
Exec Time 96 ms
Memory 8148 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 300
Status
AC × 3
AC × 11
WA × 3
Set Name Test Cases
Sample 0_00.txt, 0_01.txt, 0_02.txt
All 0_00.txt, 0_01.txt, 0_02.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt
Case Name Status Exec Time Memory
0_00.txt AC 96 ms 8016 KB
0_01.txt AC 95 ms 8148 KB
0_02.txt AC 96 ms 8016 KB
1_00.txt AC 94 ms 8020 KB
1_01.txt AC 95 ms 8016 KB
1_02.txt WA 96 ms 8016 KB
1_03.txt WA 93 ms 8144 KB
1_04.txt AC 96 ms 8020 KB
1_05.txt AC 95 ms 8148 KB
1_06.txt AC 95 ms 8148 KB
1_07.txt AC 96 ms 8016 KB
1_08.txt AC 96 ms 8016 KB
1_09.txt WA 96 ms 8016 KB
1_10.txt AC 95 ms 8148 KB