# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
23661 | TAMREF | Boat (APIO16_boat) | C++11 | 0 ms | 2024 KiB |
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>
using namespace std;
typedef long long ll;
const int MX=505;
const int mod=1000000007;
int N, A[MX], B[MX];
void input(){
scanf("%d",&N);
for(int i=1;i<=N;i++) scanf("%d %d",&A[i],&B[i]);
}
void task1(){
ll D[MX]={1};
for(int i=1,j;i<=N;i++){
for(j=i-1;B[j]>=B[i];--j);
D[i]=(D[i-1]+D[j])%mod;
}
printf("%lld\n",((D[N]-1)%mod+mod)%mod);
}
int main(){
input();
task1();
}
Compilation message (stderr)
# | 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... |