This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
/*
* author : Apiram
* created: 02.05.2023 19:33:30
*/
#include<bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;cin>>n;
vector<int>x(n),y(n);
for (int i = 0;i<n;++i){
cin>>x[i]>>y[i];
}
vector<long long>dp(n,1);
for (int i = 0;i<n;++i){
for (int j = 0;j<i;++j){
if (x[i] > x[j]){
dp[i] = (dp[i] + dp[j])%mod;
}
}
}
long long ans = 0;
for (int i = 0;i<n;++i){
ans = (ans + dp[i])%mod;
}
cout<<ans<<'\n';
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... |