結果
| 問題 | No.596 郵便配達 |
| ユーザー |
 37zigen
|
| 提出日時 | 2017-09-28 22:51:11 |
| 言語 | Java21 (openjdk 21) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 6,828 bytes |
| コンパイル時間 | 2,661 ms |
| コンパイル使用メモリ | 79,576 KB |
| 実行使用メモリ | 404,684 KB |
| 最終ジャッジ日時 | 2024-11-17 14:15:59 |
| 合計ジャッジ時間 | 13,473 ms |
|
ジャッジサーバーID （参考情報） |
judge3 / judge1 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | WA | - |
| testcase_01 | WA | - |
| testcase_02 | WA | - |
| testcase_03 | WA | - |
| testcase_04 | WA | - |
| testcase_05 | WA | - |
| testcase_06 | WA | - |
| testcase_07 | WA | - |
| testcase_08 | WA | - |
| testcase_09 | WA | - |
| testcase_10 | WA | - |
| testcase_11 | WA | - |
| testcase_12 | WA | - |
| testcase_13 | WA | - |
| testcase_14 | WA | - |
| testcase_15 | WA | - |
| testcase_16 | WA | - |
| testcase_17 | WA | - |
| testcase_18 | WA | - |
| testcase_19 | WA | - |
| testcase_20 | WA | - |
| testcase_21 | WA | - |
| testcase_22 | WA | - |
ソースコード
import java.io.FileNotFoundException;
import java.io.IOException;
import java.io.InputStream;
import java.util.Arrays;
import java.util.NoSuchElementException;
public class Main {
public static void main(String[] args) throws FileNotFoundException {
new Main().run();
}
int MAX = 0;
int INF = Integer.MAX_VALUE / 10;
int solve(int[] l, int[] r) {
int rEdge1 = INF;
int rEdge2 = -INF;
int lEdge1 = INF;
int lEdge2 = -INF;
for (int i = 0; i < MAX; ++i) {
if (r[i] != -1 && rEdge1 != INF) {
rEdge1 = i;
}
if (l[i] != -1 && lEdge1 != INF) {
lEdge1 = l[i];
}
}
for (int i = MAX - 1; i >= 0; --i) {
if (r[i] != -1 && rEdge2 != -INF) {
rEdge2 = r[i];
}
if (l[i] != -1 && lEdge2 != -INF) {
lEdge2 = i;
}
}
for (int i = Math.min(lEdge1, rEdge1) + 1; i < Math.max(lEdge2, rEdge2); ++i) {
if (l[i] == i) {
l[i] = -1;
}
if (r[i] == i) {
r[i] = -1;
}
}
int[] from = new int[MAX];
Arrays.fill(from, -1);
for (int i = 0; i < l.length; ++i) {
if (l[i] != -1) {
from[l[i]] = i;
}
}
int[] middle = new int[MAX];
for (int i = MAX - 1; i >= 0; --i) {
if (l[i] != i && l[i] != -1) {
++middle[i - 1];
if (l[i] > 0) {
--middle[l[i] - 1];
}
}
if (i + 1 < MAX) {
middle[i] = middle[i + 1] + middle[i];
}
}
int[][] s = new int[2][MAX];
for (int i = 0; i < s.length; ++i) {
for (int j = 0; j < s[i].length; ++j) {
s[i][j] = Integer.MAX_VALUE / 10;
}
}
{
for (int i = Math.min(rEdge1, lEdge1); i <= Math.max(rEdge2, lEdge2); ++i) {
if (rEdge1 <= i && i < lEdge1) {
s[0][i] = i - rEdge1;
}
if (i < lEdge1 || (l[i] != -1 && middle[i] == 0)) {
s[0][i] = Math.min(s[0][i], 2 * Math.abs(i - Math.min(lEdge1, rEdge1)));
}
if (l[i] == i || (middle[i] == 0 && l[i] == -1 && from[i] == -1)) {
if (i == 0) {
s[1][i] = 0;
s[0][i] = 0;
} else {
s[1][i] = Math.min(s[1][i], Math.min(s[1][i - 1] + 3, s[0][i - 1] + 1));
s[0][i] = Math.min(s[0][i], Math.min(s[1][i - 1] + 3, s[0][i - 1] + 1));
}
} else if (from[i] != -1 && i != 0) {
s[1][i] = Math.min(s[1][i], Math.min(s[0][i - 1] + 1, s[1][i - 1] + 3));
} else if (l[i] != -1) {
s[1][i] = Math.min(s[1][i], s[1][i - 1] + 3);
s[0][i] = Math.min(s[0][i], s[1][i - 1] + 3);
} else if ((middle[i] > 0 || from[i] != -1 || l[i] != -1) && i != 0) {
s[1][i] = Math.min(s[1][i], s[1][i - 1] + 3);
}
}
}
int ans = 2 * (Math.max(lEdge2, rEdge2) - Math.min(lEdge1, rEdge1));
for (int i = 0; i < MAX; ++i) {
ans = Math.min(ans,
s[0][i] + 2 * Math.abs(i - Math.max(lEdge2, rEdge2)) - (i == Math.max(lEdge2, rEdge2) ? 0 : 1));
}
return ans;
}
void run() {
Scanner sc = new Scanner();
int MAX_ = sc.nextInt();
if (!(1 <= MAX_ && MAX_ <= 1e7)) {
throw new AssertionError();
}
int m = sc.nextInt();
if (!(1 <= m && m <= 5 * 1e5)) {
throw new AssertionError();
}
int[] x = new int[m];
int[] d = new int[m];
int[][] y = new int[m][];
int sumd = 0;
for (int i = 0; i < m; ++i) {
x[i] = sc.nextInt();
d[i] = sc.nextInt();
if (!(d[i] > 0)) {
throw new AssertionError();
}
if (!(0 <= x[i] && x[i] < MAX_))
throw new AssertionError();
sumd += d[i];
y[i] = new int[d[i]];
for (int j = 0; j < d[i]; ++j) {
y[i][j] = sc.nextInt();
if (!(0 <= y[i][j] && y[i][j] < MAX_))
throw new AssertionError();
}
}
if (!(1 <= sumd && sumd <= 1e6)) {
throw new AssertionError();
}
System.out.println(solver(MAX_, m, x, d, y));
}
int solver(int MAX_, int m, int[] x, int[] d, int[][] y) {
MAX = MAX_;
int[] r = lr(MAX_, m, x, d, y)[1];
int[] l = lr(MAX_, m, x, d, y)[0];
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 src = (MAX - 1) - i;
int dst = (MAX - 1) - l[i];
invr[src] = dst;
}
if (r[i] != -1) {
int src = (MAX - 1) - i;
int dst = (MAX - 1) - r[i];
invl[src] = dst;
}
}
return Math.min(solve(l, r), solve(invl, invr));
}
int[][] lr(int MAX_, int m, int[] x, int[] d, int[][] y) {
MAX = MAX_;
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 ma = r[x[i]] != -1 ? r[x[i]] : x[i] - 1;
int mi = l[x[i]] != -1 ? l[x[i]] : x[i] + 1;
for (int j = 0; j < d[i]; ++j) {
ma = Math.max(ma, y[i][j]);
mi = Math.min(mi, y[i][j]);
}
if (ma >= x[i]) {
r[x[i]] = ma;
}
if (mi <= x[i]) {
l[x[i]] = 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;
}
}
}
return new int[][] { l, r };
}
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();
}
}
static void tr(Object... objects) {
System.out.println(Arrays.deepToString(objects));
}
}