Linux tsuru-no-tsurugi 5.15.0-186-generic #196-Ubuntu SMP Sat Jun 20 16:09:34 UTC 2026 x86_64
Apache/2.4.52 (Ubuntu)
Server IP : 192.168.0.18 & Your IP : 216.73.217.105
Domains :
Cant Read [ /etc/named.conf ]
User : www-data
Terminal
Auto Root
Create File
Create Folder
Localroot Suggester
Backdoor Destroyer
Readme
/
var /
www /
submit2 /
114907 /
Delete
Unzip
Name
Size
Permission
Date
Action
a.py
1.66
KB
-rwxr-x---
2024-08-28 22:35
cerror.txt
0
B
-rwxr-x---
2024-08-28 22:35
error.txt
0
B
-rwxr-x---
2024-08-28 22:35
submit_info.txt
474
B
-rwxr-x---
2024-08-28 22:35
Save
Rename
import sys sys.setrecursionlimit(10**7) # input = sys.stdin.readline # import pypyjit # pypyjit.set_param('max_unroll_recursion=-1') def mp():return map(int,input().split()) def lmp():return list(map(int,input().split())) def lm1(LIST): return list(map(lambda x:x-1, LIST)) def mps(A):return [tuple(map(int, input().split())) for _ in range(A)] def stoi(LIST):return list(map(int,LIST)) def itos(LIST):return list(map(str,LIST)) def atoi(LIST): return [ord(i)-ord("a") for i in LIST] def Atoi(LIST): return [ord(i)-ord("A") for i in LIST] def bitA(X,A):return X & 1<<A == 1<<A import math import bisect import heapq import time from copy import copy as cc from copy import deepcopy as dc from itertools import accumulate, product from collections import Counter, defaultdict, deque def ceil(U,V):return (U+V-1)//V def modf1(N,MOD):return (N-1)%MOD+1 inf = (1<<63)-1 mod = 127237991 n = int(input()) a = [lmp() for i in range(5)] for i in a: i.sort() def f(x,y): if visit[x][y]:return memo[x][y] if x == 4:return 1 m = bisect.bisect_right(a[x+1],a[x][y]) if m == n:return 0 cnt = 0 for i in range(m,n): cnt += f(x+1,i) cnt %= mod memo[x][y] *= cnt memo[x][y] %= mod visit[x][y] = True return memo[x][y] def g(x,y): m = bisect.bisect_right(a[x+1],a[x][y]) if m == n:return 0 return memo[x+1][m] ans = 0 memo = [[1]*n for i in range(5)] visit = [[False]*n for i in range(5)] ans += f(0,0) % mod for i in range(1,2): for j in range(n-1,0,-1): memo[i][j-1] += memo[i][j] memo[i][j-1] %= mod for i in range(1,n): ans += g(0,i)%mod print(ans%mod)