結果

問題 No.596 郵便配達
コンテスト
ユーザー 37zigen
提出日時 2017-08-29 23:49:25
言語 Java
(openjdk 23)
結果
WA  
実行時間 -
コード長 5,077 bytes
コンパイル時間 2,559 ms
コンパイル使用メモリ 78,696 KB
実行使用メモリ 218,516 KB
最終ジャッジ日時 2024-11-17 14:10:39
合計ジャッジ時間 8,048 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 13 WA * 10
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.File;
import java.io.FileNotFoundException;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.NoSuchElementException;
import java.util.Scanner;

public class Main {
	public static void main(String[] args) throws FileNotFoundException {
		new Main().run();
	}

	int MAX = 0;

	int solve(int[] l, int[] r) {
		int[] r2 = new int[MAX];
		// rEdge1->rEdge2の時
		int rEdge1 = Integer.MAX_VALUE >> 4;
		int rEdge2 = -(Integer.MAX_VALUE >> 4);
		int lEdge1 = Integer.MAX_VALUE >> 4;
		int lEdge2 = -(Integer.MAX_VALUE >> 4);
		for (int i = 0; i < MAX; ++i) {
			if (r[i] != -1) {
				rEdge1 = i;
				break;
			}
		}
		for (int i = MAX - 1; i >= 0; --i) {
			if (r[i] != -1) {
				rEdge2 = r[i];
				break;
			}
		}
		for (int i = MAX - 1; i >= 0; --i) {
			if (l[i] != -1) {
				lEdge2 = i;
				break;
			}
		}
		for (int i = 0; i < MAX; ++i) {
			if (l[i] != -1) {
				lEdge1 = l[i];
				break;
			}
		}

		int[] pile = new int[MAX];
		for (int i = MAX - 1; i >= 0; --i) {
			if (l[i] != -1) {
				++pile[i];
				if (l[i] > 0) {
					--pile[l[i] - 1];
				}
			}
			if (i + 1 < MAX) {
				pile[i] = pile[i + 1] + pile[i];
			}
		}
		for (int i = 0; i < MAX; ++i) {
			if (pile[i] > 0) {
				pile[i] = 1;
			}
		}
		Arrays.fill(r2, Integer.MAX_VALUE >> 4);
		{
			for (int i = rEdge1; i < MAX; ++i) {
				if (pile[i] == 0 || i + 1 == MAX || pile[i + 1] == 0) {
					r2[i] = 2 * Math.abs(i - Math.min(lEdge1, rEdge1));
				}
				if ((i == 0 || pile[i - 1] == 0) && pile[i] != 0) {
					r2[i] = Math.min(r2[i], (1 + 2 * (pile[i] - 1)) + (i > 0 ? r2[i - 1] : 0));
				} else {
					r2[i] = Math.min(r2[i], (1 + 2 * pile[i]) + (i > 0 ? r2[i - 1] : 0));
				}
			}
		}
		int ans = Integer.MAX_VALUE >> 4;
		for (int i = 0; i < MAX; ++i) {
			if (pile[i] == 0 || i + 1 == MAX || pile[i + 1] == 0) {
				int tmp = r2[i] + 2 * Math.abs(i - Math.max(lEdge2, rEdge2));
				ans = Math.min(ans, tmp);
			}
		}
		return ans;

	}

	void run() throws FileNotFoundException {
		Scanner sc = new Scanner();
		PrintWriter pw = new PrintWriter(System.out);
		MAX = sc.nextInt();
		int m = sc.nextInt();
		int[] r = new int[MAX];
		int[] l = new int[MAX];

		Arrays.fill(r, -1);
		Arrays.fill(l, -1);
		for (int i = 0; i < m; ++i) {
			int x = sc.nextInt();
			int d = sc.nextInt();
			int ma = x - 1;
			int mi = x + 1;
			for (int j = 0; j < d; ++j) {
				int y = sc.nextInt();
				ma = Math.max(ma, y);
				mi = Math.min(mi, y);
			}
			if (ma >= x) {
				r[x] = ma;
			}
			if (mi <= x) {
				l[x] = mi;
			}
		}

		{
			int ma = -1;
			for (int i = 0; i < MAX; ++i) {
				if (r[i] == -1)
					continue;
				if (ma < r[i]) {
					ma = r[i];
				} else if (ma >= r[i]) {
					r[i] = -1;
				}
			}
		}
		{
			int mi = MAX * 10;
			for (int i = MAX - 1; i >= 0; --i) {
				if (l[i] == -1)
					continue;
				if (mi > l[i]) {
					mi = l[i];
				} else if (mi <= l[i]) {
					l[i] = -1;
				}
			}
		}

		int[] invl = new int[MAX];
		int[] invr = new int[MAX];
		Arrays.fill(invl, -1);
		Arrays.fill(invr, -1);
		for (int i = 0; i < MAX; ++i) {
			if (l[i] != -1) {
				int s = (MAX - 1) - i;
				int d = (MAX - 1) - l[i];
				invr[s] = d;
			}
			if (r[i] != -1) {
				int s = (MAX - 1) - i;
				int d = (MAX - 1) - r[i];
				invl[s] = d;
			}
		}
		long ans = Math.min(solve(l, r), solve(invl, invr));
		pw.println(ans);
		pw.close();
	}

	class Scanner {
		private final InputStream in = System.in;
		private final byte[] buffer = new byte[1024];
		private int ptr = 0;
		private int buflen = 0;

		private boolean hasNextByte() {
			if (ptr < buflen) {
				return true;
			} else {
				ptr = 0;
				try {
					buflen = in.read(buffer);
				} catch (IOException e) {
					e.printStackTrace();
				}
				if (buflen <= 0) {
					return false;
				}
			}
			return true;
		}

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

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

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

		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();
		}
	}
}
0