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 mod=1e9+7;
int n,res=0,a[505],b[505],f[505];
void Sub1()
{
for(int i=1;i<=n;i++)
{
f[i]=1;
for(int j=1;j<i;j++)
if(a[j]<a[i])
f[i]=(f[i]+f[j])%mod;
res=(res+f[i])%mod;
}
cout<<res;
}
void Sub2()
{
int cnt=0;
for(int i=1;i<=1e6*500;i++)
cnt++;
cout<<cnt;
}
int main()
{
cin>>n;
int maxn=0;
bool check=false;
for(int i=1;i<=n;i++)
{
cin>>a[i]>>b[i];
if(a[i]!=b[i])
check=true;
maxn=max(maxn,b[i]-a[i]);
}
if(check==false)
Sub1();
else
if(maxn<=1e6)
Sub2();
}
# | 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... |