This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define endl "\n"
#define finp for(int i=0; i<n; i++)
#define fknp for(int k=0; k<n; k++)
#define yeap cout<<"YES"<<endl
#define nope cout<<"NO"<<endl
#define inpintn int n; cin>>n
#define inpintarrn int arr[n]; for(int i=0; i<n; i++){cin>>arr[i];}
#define inpllarrn long long arr[n]; for(int i=0; i<n; i++){cin>>arr[i];}
#define ll long long
using namespace std;
int main ()
{
ll M = 1e9+7;
ll n;
cin>>n;
ll arr[n];
ll brr[n];
ll ans[n];
for(int i=0; i<n; i++){
cin>>arr[i];
cin>>brr[i];
}
for(int i=0; i<n; i++){
ans[i] = 1;
}
for(int i=n-2; i>=0; i--){
for(int j=i+1; j<n; j++){
if(arr[j]>arr[i]){
ans[i]+=ans[j];
}
}
}
ll sum = 0;
for(int i=0; i<n; i++){
sum = (sum+ans[i])%M;
}
cout<<sum<<endl;
// for(int i=0; i<n; i++){
// cout << ans[i] << " ";
// }
// cout<<endl;
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |