Gecko [ tsuru-no-tsurugi.tokyo ]

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

Name	Size	Permission	Date
a.cpp	1.65 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

Rename

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
 
int main() {
    int N;cin>>N;
    vector<int> A(N),B(N),C(N),D(N),E(N);
    for(int i=0;i<N;i++)cin>>A[i];
    for(int i=0;i<N;i++)cin>>B[i];
    for(int i=0;i<N;i++)cin>>C[i];
    for(int i=0;i<N;i++)cin>>D[i];
    for(int 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> R(N,1),R2(N,1);
    for(int i=1;i<N;i++){
      R2[i]+=R2[i-1];
      R2[i]%= 127237991;
    }
    R=R2;

for(int i=0;i<N;i++){
      if(lower_bound(A.begin(),A.end(),B[i])-A.begin()==0)R2[i]=0;
      else{R2[i]=R[lower_bound(A.begin(),A.end(),B[i])-A.begin()-1];}}
    R=R2;
    for(int i=1;i<N;i++){
      R[i]+=R[i-1];
      R[i]%= 127237991;

}
    for(int i=0;i<N;i++){
      if(lower_bound(B.begin(),B.end(),C[i])-B.begin()==0)R2[i]=0;
      else{R2[i]=R[lower_bound(B.begin(),B.end(),C[i])-B.begin()-1];}}
    R=R2;
    R=R2;
    for(int i=1;i<N;i++){
      R[i]+=R[i-1];
      R[i]%= 127237991;

}
    for(int i=0;i<N;i++){
      if(lower_bound(C.begin(),C.end(),D[i])-C.begin()==0)R2[i]=0;
      else{R2[i]=R[lower_bound(C.begin(),C.end(),D[i])-C.begin()-1];}}
    R=R2;
    for(int i=1;i<N;i++){
      R[i]+=R[i-1];
      R[i]%= 127237991;
    }
    for(int i=0;i<N;i++){
      if(lower_bound(D.begin(),D.end(),E[i])-D.begin()==0)R2[i]=0;
      else{R2[i]=R[lower_bound(D.begin(),D.end(),E[i])-D.begin()-1];}}
    R=R2;
    for(int i=1;i<N;i++){
      R[i]+=R[i-1];
      R[i]%= 127237991;
    }

cout << R[N-1] << endl;
}