Submission #1173875


Source Code Expand

import random, sys
import time
inputs = lambda: map(int, raw_input().split())

random.seed()

h, w, k, t = inputs()
X, Y = h, w
Cars = [inputs() for i in xrange(k)]
Coms = []

com_str = "LRUD-"
dd = [(0, -1), (0, 1), (-1, 0), (1, 0), (0, 0)]

order = range(k)
ds = range(4)

def dist(x0, y0, x1, y1):
    return abs(x0 - x1) + abs(y0 - y1)
def calc_score(L, Cars):
    Pd = 20 + sum(abs(x0 - x1) + abs(y0 - y1) for x0, y0, x1, y1 in Cars)
    Pt = 10 + L * 0.01
    return 10**7 / (Pt * Pd)

L = 0
tries = 10
for l in xrange(t):
    current_score = calc_score(l, Cars)
    #print Cars, current_score
    next_score = current_score
    coms = [4]*k
    exist_ = {(x0, y0) for x0, y0, x1, y1 in Cars}
    for _ in xrange(tries):
        coms_tmp = [4]*k
        nCars = [e[:] for e in Cars]
        random.shuffle(order)
        exist = set(exist_)
        for i in order:
            x0, y0, x1, y1 = Cars[i]
            if x0 == x1 and y0 == y1:
                continue
            random.shuffle(ds)
            wild = random.randint(0, 2) < 1
            for d in ds:
                dx, dy = dd[d]
                nx = x0 + dx; ny = y0 + dy
                if not 0 < nx <= X or not 0 < ny <= Y:
                    continue
                if not wild and dist(x0, y0, x1, y1) <= dist(nx, ny, x1, y1):
                    continue
                if (nx, ny) not in exist:
                    exist.add((nx, ny))
                    nCars[i] = (nx, ny, x1, y1)
                    coms_tmp[i] = d
                    break
        score = calc_score(l+1, nCars)
        if next_score < score:
            next_score = score
            coms = coms_tmp
    if current_score == next_score or l == 10000:
        L = l
        break
    for i in xrange(k):
        dx, dy = dd[coms[i]]
        x0, y0, x1, y1 = Cars[i]
        Cars[i] = (x0+dx, y0+dy, x1, y1)
    Coms.append(map(com_str.__getitem__, coms))
sys.stdout.write("%d\n" % L)
sys.stdout.write("\n".join("".join(e) for e in Coms))

Submission Info

Submission Time
Task B - 日本橋大渋滞
User yaketake08
Language Python (2.7.6)
Score 5831
Code Size 2062 Byte
Status AC
Exec Time 3449 ms
Memory 4840 KB

Judge Result

Set Name test_01 test_02 test_03 test_04 test_05 test_06 test_07 test_08 test_09 test_10 test_11 test_12 test_13 test_14 test_15 test_16 test_17 test_18 test_19 test_20 test_21 test_22 test_23 test_24 test_25 test_26 test_27 test_28 test_29 test_30
Score / Max Score 191 / 50000 237 / 50000 206 / 50000 223 / 50000 216 / 50000 193 / 50000 200 / 50000 199 / 50000 193 / 50000 184 / 50000 196 / 50000 189 / 50000 188 / 50000 202 / 50000 185 / 50000 209 / 50000 171 / 50000 198 / 50000 172 / 50000 179 / 50000 199 / 50000 189 / 50000 187 / 50000 175 / 50000 191 / 50000 199 / 50000 220 / 50000 163 / 50000 187 / 50000 190 / 50000
Status
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
Set Name Test Cases
test_01 subtask_01_01.txt
test_02 subtask_01_02.txt
test_03 subtask_01_03.txt
test_04 subtask_01_04.txt
test_05 subtask_01_05.txt
test_06 subtask_01_06.txt
test_07 subtask_01_07.txt
test_08 subtask_01_08.txt
test_09 subtask_01_09.txt
test_10 subtask_01_10.txt
test_11 subtask_01_11.txt
test_12 subtask_01_12.txt
test_13 subtask_01_13.txt
test_14 subtask_01_14.txt
test_15 subtask_01_15.txt
test_16 subtask_01_16.txt
test_17 subtask_01_17.txt
test_18 subtask_01_18.txt
test_19 subtask_01_19.txt
test_20 subtask_01_20.txt
test_21 subtask_01_21.txt
test_22 subtask_01_22.txt
test_23 subtask_01_23.txt
test_24 subtask_01_24.txt
test_25 subtask_01_25.txt
test_26 subtask_01_26.txt
test_27 subtask_01_27.txt
test_28 subtask_01_28.txt
test_29 subtask_01_29.txt
test_30 subtask_01_30.txt
Case Name Status Exec Time Memory
subtask_01_01.txt AC 1718 ms 4840 KB
subtask_01_02.txt AC 3449 ms 3828 KB
subtask_01_03.txt AC 2673 ms 3700 KB
subtask_01_04.txt AC 2502 ms 3572 KB
subtask_01_05.txt AC 2301 ms 3572 KB
subtask_01_06.txt AC 2177 ms 3572 KB
subtask_01_07.txt AC 2468 ms 3700 KB
subtask_01_08.txt AC 2635 ms 3572 KB
subtask_01_09.txt AC 2808 ms 3700 KB
subtask_01_10.txt AC 2758 ms 3572 KB
subtask_01_11.txt AC 1909 ms 3444 KB
subtask_01_12.txt AC 2157 ms 3572 KB
subtask_01_13.txt AC 2682 ms 3572 KB
subtask_01_14.txt AC 1878 ms 3444 KB
subtask_01_15.txt AC 2380 ms 3572 KB
subtask_01_16.txt AC 2658 ms 3700 KB
subtask_01_17.txt AC 1632 ms 3444 KB
subtask_01_18.txt AC 2796 ms 3700 KB
subtask_01_19.txt AC 1614 ms 3444 KB
subtask_01_20.txt AC 2511 ms 3572 KB
subtask_01_21.txt AC 2040 ms 3572 KB
subtask_01_22.txt AC 2603 ms 3572 KB
subtask_01_23.txt AC 2341 ms 3572 KB
subtask_01_24.txt AC 2288 ms 3572 KB
subtask_01_25.txt AC 2446 ms 3572 KB
subtask_01_26.txt AC 2610 ms 3572 KB
subtask_01_27.txt AC 3333 ms 3828 KB
subtask_01_28.txt AC 2427 ms 3572 KB
subtask_01_29.txt AC 2235 ms 3572 KB
subtask_01_30.txt AC 2550 ms 3572 KB