Submission #8561089
Source Code Expand
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
import itertools
import numpy as np
from functools import lru_cache
X = list(map(int,readline().split()))
Y = list(map(int,readline().split()))
for i in [1,3,5]:
X[i] += 1
Y[i] += 1
X1 = X[:2]; X2 = X[2:4]; X3 = X[4:]
Y1 = Y[:2]; Y2 = Y[2:4]; Y3 = Y[4:]
def cumprod(arr,MOD):
L = len(arr); Lsq = int(L**.5+1)
arr = np.resize(arr,Lsq**2).reshape(Lsq,Lsq)
for n in range(1,Lsq):
arr[:,n] *= arr[:,n-1]; arr[:,n] %= MOD
for n in range(1,Lsq):
arr[n] *= arr[n-1,-1]; arr[n] %= MOD
return arr.ravel()[:L]
def make_fact(U,MOD):
x = np.arange(U,dtype=np.int64); x[0] = 1
fact = cumprod(x,MOD)
x = np.arange(U,0,-1,dtype=np.int64); x[0] = pow(int(fact[-1]),MOD-2,MOD)
fact_inv = cumprod(x,MOD)[::-1]
return fact,fact_inv
U = 2 * 10 ** 6 + 10
MOD = 10**9 + 7
fact, fact_inv = make_fact(U,MOD)
@lru_cache()
def make_comb(n):
return fact[n] * fact_inv[:n+1] % MOD * fact_inv[:n+1][::-1] % MOD
answer = 0
for p in itertools.product([0,1],repeat=6):
x1,x2,x3,y1,y2,y3 = [A[i] for A,i in zip([X1,X2,X3,Y1,Y2,Y3],p)]
sgn = (-1) ** sum(p)
a,b,c,d = x2-x1, x3-x2, x2-x1+y2-y1, x3-x2+y3-y2
c += 2; d += 2; sgn = -sgn
make_comb(c)
make_comb(d)
Submission Info
Submission Time |
|
Task |
E - Sightseeing Plan |
User |
maspy |
Language |
Python (3.4.3) |
Score |
0 |
Code Size |
1397 Byte |
Status |
WA |
Exec Time |
1077 ms |
Memory |
323808 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
0 / 1600 |
Status |
|
|
Set Name |
Test Cases |
Sample |
sample_01.txt, sample_02.txt, sample_03.txt |
All |
sample_01.txt, sample_02.txt, sample_03.txt, sample_01.txt, sample_02.txt, sample_03.txt, subtask_1_01.txt, subtask_1_02.txt, subtask_1_03.txt, subtask_1_04.txt, subtask_1_05.txt, subtask_1_06.txt, subtask_1_07.txt, subtask_1_08.txt, subtask_1_09.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt, subtask_1_14.txt, subtask_1_15.txt, subtask_1_16.txt, subtask_1_17.txt, subtask_1_18.txt, subtask_1_19.txt, subtask_1_20.txt, subtask_1_21.txt, subtask_1_22.txt, subtask_1_23.txt, subtask_1_24.txt |
Case Name |
Status |
Exec Time |
Memory |
sample_01.txt |
WA |
354 ms |
90604 KB |
sample_02.txt |
WA |
351 ms |
90604 KB |
sample_03.txt |
MLE |
1030 ms |
298208 KB |
subtask_1_01.txt |
WA |
351 ms |
90604 KB |
subtask_1_02.txt |
WA |
465 ms |
111840 KB |
subtask_1_03.txt |
MLE |
995 ms |
290272 KB |
subtask_1_04.txt |
WA |
540 ms |
146784 KB |
subtask_1_05.txt |
WA |
593 ms |
164576 KB |
subtask_1_06.txt |
WA |
522 ms |
138208 KB |
subtask_1_07.txt |
WA |
854 ms |
243936 KB |
subtask_1_08.txt |
WA |
543 ms |
139232 KB |
subtask_1_09.txt |
WA |
541 ms |
141664 KB |
subtask_1_10.txt |
MLE |
945 ms |
266848 KB |
subtask_1_11.txt |
MLE |
867 ms |
251872 KB |
subtask_1_12.txt |
WA |
791 ms |
213472 KB |
subtask_1_13.txt |
MLE |
907 ms |
253280 KB |
subtask_1_14.txt |
WA |
635 ms |
165984 KB |
subtask_1_15.txt |
WA |
680 ms |
177248 KB |
subtask_1_16.txt |
WA |
819 ms |
228580 KB |
subtask_1_17.txt |
WA |
813 ms |
229216 KB |
subtask_1_18.txt |
WA |
707 ms |
196320 KB |
subtask_1_19.txt |
WA |
600 ms |
176480 KB |
subtask_1_20.txt |
WA |
603 ms |
184288 KB |
subtask_1_21.txt |
WA |
602 ms |
176480 KB |
subtask_1_22.txt |
MLE |
1009 ms |
306400 KB |
subtask_1_23.txt |
MLE |
1077 ms |
317920 KB |
subtask_1_24.txt |
MLE |
1019 ms |
323808 KB |