Submission #4388322


Source Code Expand

Copy
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.Arrays;

public class Main {

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

	static int INF = 1 << 30;
	static long LINF = 1L << 60;
	static int MOD = 1000000007;
	static int[] mh4 = { 0, -1, 1, 0 };
	static int[] mw4 = { -1, 0, 0, 1 };
	static int[] mh8 = { -1, -1, -1, 0, 0, 1, 1, 1 };
	static int[] mw8 = { -1, 0, 1, -1, 1, -1, 0, 1 };

	static class TaskX {

		int k;
		int[] a;
		public void solve(int testNumber, MyInput in, PrintWriter out) {

			k = in.nextInt();
			a = in.nextIntArray(k);


			// 条件を満たす最小の値
			long l = -1, r = LINF;
			while (r - l > 1) {
				long m = (l + r) / 2;
				if (g1(m)) {
					r = m;
				} else {
					l = m;
				}
			}

			long min = r;

			// 条件を満たす最大の値
			l = -1; r = LINF;
			while (r - l > 1) {
				long m = (l + r) / 2;
				if (g2(m)) {
					l = m;
				} else {
					r = m;
				}
			}

			long max = l;

			if (min > max) {
				out.println(-1);
				return;
			}

			out.printf("%d %d\n", min, max);

		}

		boolean g1(long t) {
			for (int i = 0; i < k; i++) {
				t = t - t % a[i];
			}
			return t >= 2;
		}

		boolean g2(long t) {
			for (int i = 0; i < k; i++) {
				t = t - t % a[i];
			}
			return t <= 2;
		}
	}

	static class MyInput {
		private final BufferedReader in;
		private static int pos;
		private static int readLen;
		private static final char[] buffer = new char[1024 * 8];
		private static char[] str = new char[500 * 8 * 2];
		private static boolean[] isDigit = new boolean[256];
		private static boolean[] isSpace = new boolean[256];
		private static boolean[] isLineSep = new boolean[256];

		static {
			for (int i = 0; i < 10; i++) {
				isDigit['0' + i] = true;
			}
			isDigit['-'] = true;
			isSpace[' '] = isSpace['\r'] = isSpace['\n'] = isSpace['\t'] = true;
			isLineSep['\r'] = isLineSep['\n'] = true;
		}

		public MyInput(InputStream is) {
			in = new BufferedReader(new InputStreamReader(is));
		}

		public int read() {
			if (pos >= readLen) {
				pos = 0;
				try {
					readLen = in.read(buffer);
				} catch (IOException e) {
					throw new RuntimeException();
				}
				if (readLen <= 0) {
					throw new MyInput.EndOfFileRuntimeException();
				}
			}
			return buffer[pos++];
		}

		public int nextInt() {
			int len = 0;
			str[len++] = nextChar();
			len = reads(len, isSpace);
			int i = 0;
			int ret = 0;
			if (str[0] == '-') {
				i = 1;
			}
			for (; i < len; i++)
				ret = ret * 10 + str[i] - '0';
			if (str[0] == '-') {
				ret = -ret;
			}
			return ret;
		}

		public long nextLong() {
			int len = 0;
			str[len++] = nextChar();
			len = reads(len, isSpace);
			int i = 0;
			long ret = 0;
			if (str[0] == '-') {
				i = 1;
			}
			for (; i < len; i++)
				ret = ret * 10 + str[i] - '0';
			if (str[0] == '-') {
				ret = -ret;
			}
			return ret;
		}

		public char nextChar() {
			while (true) {
				final int c = read();
				if (!isSpace[c]) {
					return (char) c;
				}
			}
		}

		public String nextString() {
			return new String(nextChars());
		}

		public char[] nextChars() {
			int len = 0;
			str[len++] = nextChar();
			len = reads(len, isSpace);
			return Arrays.copyOf(str, len);
		}

		public char[][] next2DChars(int h, int w) {
			char[][] s = new char[h][w];
			for (int i = 0; i < h; i++) {
				s[i] = nextChars();
			}
			return s;
		}

		int reads(int len, boolean[] accept) {
			try {
				while (true) {
					final int c = read();
					if (accept[c]) {
						break;
					}
					if (str.length == len) {
						char[] rep = new char[str.length * 3 / 2];
						System.arraycopy(str, 0, rep, 0, str.length);
						str = rep;
					}
					str[len++] = (char) c;
				}
			} catch (MyInput.EndOfFileRuntimeException e) {
			}
			return len;
		}

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

		public int[] nextIntArray1Index(final int n) {
			final int[] res = new int[n + 1];
			for (int i = 1; i < n + 1; i++) {
				res[i] = nextInt();
			}
			return res;
		}

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

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

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

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

		public double nextDouble() {
			return Double.parseDouble(nextString());
		}

		public double[] nextDoubleArray(int n) {
			double[] res = new double[n];
			for (int i = 0; i < n; i++) {
				res[i] = nextDouble();
			}
			return res;
		}

		static class EndOfFileRuntimeException extends RuntimeException {
		}

	}

}

Submission Info

Submission Time
Task B - Ice Rink Game
User tutuz
Language Java8 (OpenJDK 1.8.0)
Score 500
Code Size 5745 Byte
Status
Exec Time 299 ms
Memory 25300 KB

Test Cases

Set Name Score / Max Score Test Cases
Sample 0 / 0 sample_01.txt, sample_02.txt, sample_03.txt
All 500 / 500 sample_01.txt, sample_02.txt, sample_03.txt, sample_01.txt, sample_02.txt, sample_03.txt, subtask_1_01.txt, subtask_1_02.txt, subtask_1_03.txt, subtask_1_04.txt, subtask_1_05.txt, subtask_1_06.txt, subtask_1_07.txt, subtask_1_08.txt, subtask_1_09.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt, subtask_1_14.txt, subtask_1_15.txt, subtask_1_16.txt, subtask_1_17.txt, subtask_1_18.txt, subtask_1_19.txt, subtask_1_20.txt, subtask_1_21.txt, subtask_1_22.txt, subtask_1_23.txt, subtask_1_24.txt, subtask_1_25.txt, subtask_1_26.txt, subtask_1_27.txt
Case Name Status Exec Time Memory
sample_01.txt 78 ms 23508 KB
sample_02.txt 73 ms 19924 KB
sample_03.txt 77 ms 19028 KB
subtask_1_01.txt 78 ms 18516 KB
subtask_1_02.txt 73 ms 19028 KB
subtask_1_03.txt 72 ms 19540 KB
subtask_1_04.txt 73 ms 20948 KB
subtask_1_05.txt 79 ms 19412 KB
subtask_1_06.txt 281 ms 21972 KB
subtask_1_07.txt 290 ms 21204 KB
subtask_1_08.txt 77 ms 22868 KB
subtask_1_09.txt 75 ms 21460 KB
subtask_1_10.txt 103 ms 17492 KB
subtask_1_11.txt 293 ms 20564 KB
subtask_1_12.txt 291 ms 21076 KB
subtask_1_13.txt 294 ms 24148 KB
subtask_1_14.txt 291 ms 21832 KB
subtask_1_15.txt 290 ms 24148 KB
subtask_1_16.txt 116 ms 21844 KB
subtask_1_17.txt 298 ms 20692 KB
subtask_1_18.txt 295 ms 25300 KB
subtask_1_19.txt 270 ms 21460 KB
subtask_1_20.txt 295 ms 19156 KB
subtask_1_21.txt 299 ms 25044 KB
subtask_1_22.txt 295 ms 22228 KB
subtask_1_23.txt 75 ms 18132 KB
subtask_1_24.txt 81 ms 21076 KB
subtask_1_25.txt 291 ms 24264 KB
subtask_1_26.txt 82 ms 22868 KB
subtask_1_27.txt 297 ms 23380 KB