# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
48226 | qkrghdqls1 | Boat (APIO16_boat) | C++14 | 2061 ms | 524288 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;
int a[501],b[501],mod=1000000007;
vector<int> v;
unordered_map<int,int> m;
map<int,int> su;
int main()
{
/*int n,cnt=1;
scanf("%d",&n);
for(int i=1;i<=n;i++){
scanf("%d %d",&a[i],&b[i]);
v.push_back(a[i]);
v.push_back(b[i]);
}
sort(v.begin(),v.end());
unique(v.begin(),v.end());
while(cnt<v.size()&&v[cnt-1]<v[cnt]) cnt++;*/
int n;
scanf("%d",&n);
for(int i=0;i<n;i++){
scanf("%d %d",&a[i],&b[i]);
for(int j=a[i];j<=b[i];j++) m[j]=0;
}
m[0]=1;
int s=0;
for(int i=0;i<n;i++){
s=0;
for(auto it=m.begin();it!=m.end();it++){
s=(s+it->second)%mod;
su[it->first]=s;
}
for(int j=b[i];j>=a[i];j--)
{
auto it=su.find(j);
auto it2=m.find(j);
it--;
m[j]=(m[j]+it->second)%mod;
}
}
s=0;
for(auto it=m.begin();it!=m.end();it++){
s=(s+it->second)%mod;
su[it->first]=s;
}
printf("%d",(s-1+mod)%mod);
}
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... |