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 /
114791 /
Delete
Unzip
Name
Size
Permission
Date
Action
a.cpp
1.28
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
436
B
-rwxr-x---
2024-08-28 22:35
Save
Rename
#include <bits/stdc++.h> using namespace std; using ll = long long int; const ll MAX = 1e18; const ll MOD = 127237991; int main(){ ll N; cin >> N; vector<ll> A(N),B(N),C(N),D(N),E(N); for(ll i = 0;i < N;i++) cin >> A[i]; for(ll i = 0;i < N;i++) cin >> B[i]; for(ll i = 0;i < N;i++) cin >> C[i]; for(ll i = 0;i < N;i++) cin >> D[i]; for(ll i = 0;i < N;i++) cin >> E[i]; sort(A.begin(),A.end()); sort(B.begin(),B.end()); sort(C.begin(),C.end()); sort(D.begin(),D.end()); sort(E.begin(),E.end()); vector<ll> TA(N + 1),TB(N + 1),TC(N + 1),TD(N + 1),TE(N + 1); for(ll i = 0;i <= N;i++) TA[i] = i; for(ll i = 0;i < N;i++){ ll cnt = lower_bound(A.begin(),A.end(),B[i]) - A.begin(); TB[i + 1] = (TB[i] + TA[cnt]) % MOD; } for(ll i = 0;i < N;i++){ ll cnt = lower_bound(B.begin(),B.end(),C[i]) - B.begin(); TC[i + 1] = (TC[i] + TB[cnt]) % MOD; } for(ll i = 0;i < N;i++){ ll cnt = lower_bound(C.begin(),C.end(),D[i]) - C.begin(); TD[i + 1] = (TD[i] + TC[cnt]) % MOD; } for(ll i = 0;i < N;i++){ ll cnt = lower_bound(D.begin(),D.end(),E[i]) - D.begin(); TE[i + 1] = (TE[i] + TD[cnt]) % MOD; } cout << TE[N] << endl; }