# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
26194 | Extazy | Boat (APIO16_boat) | C++14 | 2000 ms | 7992 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;
const int N = 517;
const int MOD = (1e9) + 7;
int n,a[N],b[N];
map < int, int > state[N];
int recurse(int pos, int last) {
if(pos>n) {
return ((last!=0) ? 1 : 0);
}
if(state[pos].find(last)!=state[pos].end()) {
return state[pos][last];
}
long long ans=recurse(pos+1,last),i;
for(i=max(last+1,a[pos]);i<=b[pos];i++) {
ans+=recurse(pos+1,i);
}
ans%=MOD;
state[pos][last]=ans;
return ans;
}
int main() {
int i;
scanf("%d", &n);
for(i=1;i<=n;i++) {
scanf("%d %d", &a[i], &b[i]);
}
printf("%d\n", recurse(1,0));
return 0;
}
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... |