結果
| 問題 |
No.596 郵便配達
|
| コンテスト | |
| ユーザー |
 uwi
|
| 提出日時 | 2017-11-10 23:22:09 |
| 言語 | Java (openjdk 23) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 7,280 bytes |
| コンパイル時間 | 4,957 ms |
| コンパイル使用メモリ | 89,680 KB |
| 実行使用メモリ | 96,348 KB |
| 最終ジャッジ日時 | 2024-11-24 15:25:36 |
| 合計ジャッジ時間 | 49,442 ms |
|
ジャッジサーバーID （参考情報） |
judge4 / judge1 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| other | AC * 14 WA * 2 TLE * 7 |
ソースコード
package contest171110;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Comparator;
import java.util.InputMismatchException;
public class F {
InputStream is;
PrintWriter out;
String INPUT = "";
long go(int[][] xs, int m)
{
long max = 0;
for(int[] v : xs)max = Math.max(max, v[2]);
long ans = Long.MAX_VALUE;;
long[] dp = new long[m+1];
for(int i = 1;i <= m;i++){
int lmin = xs[i-1][1];
dp[i] = Long.MAX_VALUE / 2;
for(int j = i-1;j >= 0;j--){
long run = xs[i-1][0] - xs[Math.max(j-1, 0)][0];
if(xs[i-1][0] <= lmin){
dp[i] = Math.min(dp[i], dp[j] + run);
if(i == m){
if(max > xs[i-1][0]){
ans = Math.min(ans, dp[j] + run + max-xs[i-1][0]);
}else{
ans = Math.min(ans, dp[j] + run);
}
}
if(j > 0)lmin = Math.min(xs[j-1][1], lmin);
}else{
long nrun = (xs[i-1][0] - lmin);
dp[i] = Math.min(dp[i], dp[j] + run + nrun*2);
if(i == m){
if(max > xs[i-1][0]){
ans = Math.min(ans, dp[j] + run + nrun*2 + max-xs[i-1][0]);
ans = Math.min(ans, dp[j] + run + nrun + 2*(max-xs[i-1][0]));
}else{
ans = Math.min(ans, dp[j] + run + nrun);
}
}
if(j > 0)lmin = Math.min(xs[j-1][1], lmin);
}
}
}
// tr(xs);
// tr(dp);
return ans;
}
void solve()
{
// 0 1 4 6
// 276 2701 16 85
int n = ni(), m = ni();
int[][] xs = new int[m][];
for(int i = 0;i < m;i++){
int x = ni(), d = ni();
int[] ys = na(d);
Arrays.sort(ys);
int minx = ys[0], maxx = ys[d-1];
xs[i] = new int[]{x, minx, maxx};
}
Arrays.sort(xs, new Comparator<int[]>() {
public int compare(int[] a, int[] b) {
return a[0] - b[0];
}
});
long res1 = go(xs, m);
for(int i = 0;i < m;i++){
xs[i][0] = 7000000-xs[i][0];
int t = 7000000-xs[i][1];
xs[i][1] = 7000000-xs[i][2];
xs[i][2] = t;
}
Arrays.sort(xs, new Comparator<int[]>() {
public int compare(int[] a, int[] b) {
return a[0] - b[0];
}
});
long res2 = go(xs, m);
out.println(Math.min(res1, res2));
// long[] mins = new long[m];
// for(int i = 0;i < m;i++){
// mins[i] = xs[i][1];
// }
//
// SegmentTreeRMQL st = new SegmentTreeRMQL(mins);
// SegmentTreeRMQL stdp = new SegmentTreeRMQL(mins);
// for(int i = 0;i < m;i++){
// int[] v = xs[i];
// stdp.minx(0, i+1) + v[0];
// }
}
public static class SegmentTreeRMQL {
public int M, H, N;
public long[] st;
public SegmentTreeRMQL(int n)
{
N = n;
M = Integer.highestOneBit(Math.max(N-1, 1))<<2;
H = M>>>1;
st = new long[M];
Arrays.fill(st, 0, M, Long.MAX_VALUE);
}
public SegmentTreeRMQL(long[] a)
{
N = a.length;
M = Integer.highestOneBit(Math.max(N-1, 1))<<2;
H = M>>>1;
st = new long[M];
for(int i = 0;i < N;i++){
st[H+i] = a[i];
}
Arrays.fill(st, H+N, M, Long.MAX_VALUE);
for(int i = H-1;i >= 1;i--)propagate(i);
}
public void update(int pos, long x)
{
st[H+pos] = x;
for(int i = (H+pos)>>>1;i >= 1;i >>>= 1)propagate(i);
}
private void propagate(int i)
{
st[i] = Math.min(st[2*i], st[2*i+1]);
}
public long minx(int l, int r){
long min = Long.MAX_VALUE;
if(l >= r)return min;
while(l != 0){
int f = l&-l;
if(l+f > r)break;
long v = st[(H+l)/f];
if(v < min)min = v;
l += f;
}
while(l < r){
int f = r&-r;
long v = st[(H+r)/f-1];
if(v < min)min = v;
r -= f;
}
return min;
}
public long min(int l, int r){ return l >= r ? 0 : min(l, r, 0, H, 1);}
private long min(int l, int r, int cl, int cr, int cur)
{
if(l <= cl && cr <= r){
return st[cur];
}else{
int mid = cl+cr>>>1;
long ret = Long.MAX_VALUE;
if(cl < r && l < mid){
ret = Math.min(ret, min(l, r, cl, mid, 2*cur));
}
if(mid < r && l < cr){
ret = Math.min(ret, min(l, r, mid, cr, 2*cur+1));
}
return ret;
}
}
public int firstle(int l, long v) {
int cur = H+l;
while(true){
if(st[cur] <= v){
if(cur < H){
cur = 2*cur;
}else{
return cur-H;
}
}else{
cur++;
if((cur&cur-1) == 0)return -1;
if((cur&1)==0)cur>>>=1;
}
}
}
public int lastle(int l, long v) {
int cur = H+l;
while(true){
if(st[cur] <= v){
if(cur < H){
cur = 2*cur+1;
}else{
return cur-H;
}
}else{
if((cur&cur-1) == 0)return -1;
cur--;
if((cur&1)==1)cur>>>=1;
}
}
}
}
void run() throws Exception
{
is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
out = new PrintWriter(System.out);
long s = System.currentTimeMillis();
solve();
out.flush();
if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
// Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){
// @Override
// public void run() {
// long s = System.currentTimeMillis();
// solve();
// out.flush();
// if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
// }
// };
// t.start();
// t.join();
}
public static void main(String[] args) throws Exception { new F().run(); }
private byte[] inbuf = new byte[1024];
public int lenbuf = 0, ptrbuf = 0;
private int readByte()
{
if(lenbuf == -1)throw new InputMismatchException();
if(ptrbuf >= lenbuf){
ptrbuf = 0;
try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
if(lenbuf <= 0)return -1;
}
return inbuf[ptrbuf++];
}
private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
private double nd() { return Double.parseDouble(ns()); }
private char nc() { return (char)skip(); }
private String ns()
{
int b = skip();
StringBuilder sb = new StringBuilder();
while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')
sb.appendCodePoint(b);
b = readByte();
}
return sb.toString();
}
private char[] ns(int n)
{
char[] buf = new char[n];
int b = skip(), p = 0;
while(p < n && !(isSpaceChar(b))){
buf[p++] = (char)b;
b = readByte();
}
return n == p ? buf : Arrays.copyOf(buf, p);
}
private int[] na(int n)
{
int[] a = new int[n];
for(int i = 0;i < n;i++)a[i] = ni();
return a;
}
private long[] nal(int n)
{
long[] a = new long[n];
for(int i = 0;i < n;i++)a[i] = nl();
return a;
}
private char[][] nm(int n, int m) {
char[][] map = new char[n][];
for(int i = 0;i < n;i++)map[i] = ns(m);
return map;
}
private int[][] nmi(int n, int m) {
int[][] map = new int[n][];
for(int i = 0;i < n;i++)map[i] = na(m);
return map;
}
private int ni() { return (int)nl(); }
private long nl()
{
long num = 0;
int b;
boolean minus = false;
while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
if(b == '-'){
minus = true;
b = readByte();
}
while(true){
if(b >= '0' && b <= '9'){
num = num * 10 + (b - '0');
}else{
return minus ? -num : num;
}
b = readByte();
}
}
private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); }
}