提出 #20752489


ソースコード 拡げる

n = int(input())

nd = []
ans = [[]] * n

xy = []
yj = []

for j in range(n):
    x, y, r = map(int, input().split())
    xy.append([x, y, j])
    yj.append([y, j])

xy.sort()
yj.sort()

for i, e in enumerate(xy):
    yindex = yj.index([e[1], e[2]])
    if yindex == n-1:
        yend = 10000
    else:
        yend = yj[yindex+1][0]
        if e[1] == yend:
            yend += 1

    if i == n-1:
        nd.append([e[0], e[1], 10000, yend, e[2]])
    else:
        if e[0] == xy[i+1][0]:
            if i == 0: e[0] = 0
            nd.append([e[0], e[1], e[0]+1, yend, e[2]])
        else:
            if i == 0: e[0] = 0
            nd.append([e[0], e[1], xy[i+1][0], yend, e[2]])

for i in range(n):
    for j in range(1, n-i+1):
        if i+j == n:
            ans[nd[i][4]] = [nd[i][0], nd[i][1], 10000, nd[i][3]]
            break
        if nd[i][2] == 10000:
            ans[nd[i][4]] = [nd[i][0], nd[i][1], 10000, nd[i][3]]
            break
        if nd[i][1] >= nd[i+j][1] and nd[i][3] <= nd[i+j][3]:
            ans[nd[i][4]] = [nd[i][0], nd[i][1], nd[i][2], nd[i][3]]
            break
        if nd[i][1] <= nd[i+j][1] < nd[i][3]:
            ans[nd[i][4]] = [nd[i][0], nd[i][1], nd[i][2], nd[i][3]]
            break
        if nd[i][1] < nd[i+j][3] <= nd[i][3]:
            ans[nd[i][4]] = [nd[i][0], nd[i][1], nd[i][2], nd[i][3]]
            break

        nd[i][2] = nd[i+j][0]

for f in ans:
    print(f[0], f[1], f[2], f[3])

提出情報

提出日時
問題 A - AtCoder Ad
ユーザ yougoto
言語 Python (3.8.2)
得点 23007684912
コード長 1506 Byte
結果 AC
実行時間 39 ms
メモリ 9368 KiB

ジャッジ結果

セット名 test_ALL
得点 / 配点 23007684912 / 50000000000
結果
AC × 50
セット名 テストケース
test_ALL test_0000.txt, test_0001.txt, test_0002.txt, test_0003.txt, test_0004.txt, test_0005.txt, test_0006.txt, test_0007.txt, test_0008.txt, test_0009.txt, test_0010.txt, test_0011.txt, test_0012.txt, test_0013.txt, test_0014.txt, test_0015.txt, test_0016.txt, test_0017.txt, test_0018.txt, test_0019.txt, test_0020.txt, test_0021.txt, test_0022.txt, test_0023.txt, test_0024.txt, test_0025.txt, test_0026.txt, test_0027.txt, test_0028.txt, test_0029.txt, test_0030.txt, test_0031.txt, test_0032.txt, test_0033.txt, test_0034.txt, test_0035.txt, test_0036.txt, test_0037.txt, test_0038.txt, test_0039.txt, test_0040.txt, test_0041.txt, test_0042.txt, test_0043.txt, test_0044.txt, test_0045.txt, test_0046.txt, test_0047.txt, test_0048.txt, test_0049.txt
ケース名 結果 実行時間 メモリ
test_0000.txt AC 20 ms 9060 KiB
test_0001.txt AC 23 ms 9228 KiB
test_0002.txt AC 27 ms 9296 KiB
test_0003.txt AC 39 ms 9356 KiB
test_0004.txt AC 29 ms 9172 KiB
test_0005.txt AC 24 ms 9064 KiB
test_0006.txt AC 26 ms 9236 KiB
test_0007.txt AC 23 ms 9120 KiB
test_0008.txt AC 36 ms 9180 KiB
test_0009.txt AC 22 ms 9304 KiB
test_0010.txt AC 26 ms 9172 KiB
test_0011.txt AC 22 ms 9176 KiB
test_0012.txt AC 30 ms 9180 KiB
test_0013.txt AC 19 ms 9056 KiB
test_0014.txt AC 26 ms 9232 KiB
test_0015.txt AC 29 ms 9268 KiB
test_0016.txt AC 29 ms 9180 KiB
test_0017.txt AC 32 ms 9228 KiB
test_0018.txt AC 28 ms 9020 KiB
test_0019.txt AC 22 ms 9228 KiB
test_0020.txt AC 27 ms 9356 KiB
test_0021.txt AC 29 ms 9360 KiB
test_0022.txt AC 20 ms 9232 KiB
test_0023.txt AC 27 ms 9180 KiB
test_0024.txt AC 24 ms 9176 KiB
test_0025.txt AC 36 ms 9364 KiB
test_0026.txt AC 33 ms 9304 KiB
test_0027.txt AC 30 ms 9368 KiB
test_0028.txt AC 21 ms 9052 KiB
test_0029.txt AC 22 ms 9348 KiB
test_0030.txt AC 22 ms 9068 KiB
test_0031.txt AC 21 ms 9168 KiB
test_0032.txt AC 20 ms 9300 KiB
test_0033.txt AC 32 ms 9232 KiB
test_0034.txt AC 36 ms 9176 KiB
test_0035.txt AC 26 ms 9164 KiB
test_0036.txt AC 18 ms 9220 KiB
test_0037.txt AC 23 ms 9060 KiB
test_0038.txt AC 23 ms 9068 KiB
test_0039.txt AC 27 ms 9176 KiB
test_0040.txt AC 31 ms 9180 KiB
test_0041.txt AC 22 ms 9072 KiB
test_0042.txt AC 30 ms 9232 KiB
test_0043.txt AC 18 ms 9356 KiB
test_0044.txt AC 39 ms 9308 KiB
test_0045.txt AC 29 ms 9300 KiB
test_0046.txt AC 26 ms 9232 KiB
test_0047.txt AC 34 ms 9368 KiB
test_0048.txt AC 24 ms 9176 KiB
test_0049.txt AC 24 ms 9360 KiB