제출 #1143591

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1143591		loreips	새로운 문제 (CEOI16_router)	Text	0 / 100	0 ms	0 KiB

1-router.out

2-router.out

3-router.out

4-router.out

5-router.out

6-router.out

# 13197

import sys
input = sys.stdin.readline

f = open('6-router.out.txt','w')

def printtofile(*a):
    for i in a:
        f.write(str(i)+' ')
    f.write('\n')

print = printtofile

n,Mlim,Plim = 9955,500_000,100_000

m = 996
divisions = 33

print(2*n+2*m+divisions**2,2*n+2*divisions*m)

assert n//m+1 == 10
for i in range(m):
    for j in range(n//m+1):
        if 1+i*(n//m+1)+j <= n: print(1+i*(n//m+1)+j,1+2*n+i)
        if 1+n+i*(n//m+1)+j <= 2*n: print(1+2*n+m+i,1+n+i*(n//m+1)+j)


for i in range(divisions):
    for j in range(divisions):
        node = 2*n+2*m+divisions*i+j+1
        for k in range(m//divisions+1):
            if 1+2*n+i*(m//divisions+1)+k <= 2*n+m: print(1+2*n+i*(m//divisions+1)+k,node)
            if 1+2*n+m+j*(m//divisions+1)+k <= 2*n+2*m: print(node,1+2*n+m+j*(m//divisions+1)+k)

f.close()

7-router.out

• Subtask 1: 0 / 4
• Subtask 2: 0 / 5
• Subtask 3: 0 / 6
• Subtask 4: 0 / 6
• Subtask 5: 0 / 26
• Subtask 6: 0 / 30
• Subtask 7: 0 / 23