# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
257896 | 2020-08-05T03:17:33 Z | daniel920712 | Boat (APIO16_boat) | C++14 | 507 ms | 8208 KB |
#include <iostream> #include <stdio.h> #include <stdlib.h> #include <set> #include <map> using namespace std; long long MOD=1e9+7; map < pair < long long , long long > , long long > all; long long N; long long a[505],b[505]; map < long long , long long > con; set < long long > have; long long F(long long x,long long y) { long long i; if(x==0) return y!=1e9+5; if(all.find(make_pair(x,y))!=all.end()) return all[make_pair(x,y)]; all[make_pair(x,y)]=F(x-1,y); for(auto i:con) { if(i.first>=a[x]&&i.first<y&&i.first<=b[x]) { all[make_pair(x,y)]+=i.second*F(x-1,i.first)%MOD; all[make_pair(x,y)]%=MOD; } } return all[make_pair(x,y)]; } int main() { long long N,M,i; scanf("%lld",&N); for(i=1;i<=N;i++) { scanf("%lld %lld",&a[i],&b[i]); have.insert(a[i]); have.insert(b[i]); } for(auto i:have) { if(i==*prev(have.end())) con[i]=1; con[*prev(have.lower_bound(i))]=i-*prev(have.lower_bound(i)); } //for(auto i:con) printf("%lld %lld\n",i.first,i.second); printf("%lld\n",F(N,1e9+5)); return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 507 ms | 8208 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 507 ms | 8208 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 156 ms | 1488 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 507 ms | 8208 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |