#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;
}
int main()
{
cin>>n;
bool check=false;
for(int i=1;i<=n;i++)
{
cin>>a[i]>>b[i];
if(a[i]!=b[i])
check=true;
}
if(check==false)
Sub1();
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
2020 KB |
Output is correct |
2 |
Correct |
0 ms |
2020 KB |
Output is correct |
3 |
Correct |
0 ms |
2020 KB |
Output is correct |
4 |
Correct |
0 ms |
2020 KB |
Output is correct |
5 |
Correct |
0 ms |
2020 KB |
Output is correct |
6 |
Correct |
0 ms |
2020 KB |
Output is correct |
7 |
Correct |
0 ms |
2020 KB |
Output is correct |
8 |
Correct |
0 ms |
2020 KB |
Output is correct |
9 |
Correct |
0 ms |
2020 KB |
Output is correct |
10 |
Correct |
0 ms |
2020 KB |
Output is correct |
11 |
Correct |
0 ms |
2020 KB |
Output is correct |
12 |
Correct |
0 ms |
2020 KB |
Output is correct |
13 |
Correct |
0 ms |
2020 KB |
Output is correct |
14 |
Correct |
0 ms |
2020 KB |
Output is correct |
15 |
Correct |
0 ms |
2020 KB |
Output is correct |
16 |
Correct |
0 ms |
2020 KB |
Output is correct |
17 |
Correct |
0 ms |
2020 KB |
Output is correct |
18 |
Correct |
0 ms |
2020 KB |
Output is correct |
19 |
Correct |
0 ms |
2020 KB |
Output is correct |
20 |
Correct |
0 ms |
2020 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
2020 KB |
Output is correct |
2 |
Correct |
0 ms |
2020 KB |
Output is correct |
3 |
Correct |
0 ms |
2020 KB |
Output is correct |
4 |
Correct |
0 ms |
2020 KB |
Output is correct |
5 |
Correct |
0 ms |
2020 KB |
Output is correct |
6 |
Correct |
0 ms |
2020 KB |
Output is correct |
7 |
Correct |
0 ms |
2020 KB |
Output is correct |
8 |
Correct |
0 ms |
2020 KB |
Output is correct |
9 |
Correct |
0 ms |
2020 KB |
Output is correct |
10 |
Correct |
0 ms |
2020 KB |
Output is correct |
11 |
Correct |
0 ms |
2020 KB |
Output is correct |
12 |
Correct |
0 ms |
2020 KB |
Output is correct |
13 |
Correct |
0 ms |
2020 KB |
Output is correct |
14 |
Correct |
0 ms |
2020 KB |
Output is correct |
15 |
Correct |
0 ms |
2020 KB |
Output is correct |
16 |
Correct |
0 ms |
2020 KB |
Output is correct |
17 |
Correct |
0 ms |
2020 KB |
Output is correct |
18 |
Correct |
0 ms |
2020 KB |
Output is correct |
19 |
Correct |
0 ms |
2020 KB |
Output is correct |
20 |
Correct |
0 ms |
2020 KB |
Output is correct |
21 |
Incorrect |
0 ms |
2020 KB |
Output isn't correct |
22 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
2020 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
2020 KB |
Output is correct |
2 |
Correct |
0 ms |
2020 KB |
Output is correct |
3 |
Correct |
0 ms |
2020 KB |
Output is correct |
4 |
Correct |
0 ms |
2020 KB |
Output is correct |
5 |
Correct |
0 ms |
2020 KB |
Output is correct |
6 |
Correct |
0 ms |
2020 KB |
Output is correct |
7 |
Correct |
0 ms |
2020 KB |
Output is correct |
8 |
Correct |
0 ms |
2020 KB |
Output is correct |
9 |
Correct |
0 ms |
2020 KB |
Output is correct |
10 |
Correct |
0 ms |
2020 KB |
Output is correct |
11 |
Correct |
0 ms |
2020 KB |
Output is correct |
12 |
Correct |
0 ms |
2020 KB |
Output is correct |
13 |
Correct |
0 ms |
2020 KB |
Output is correct |
14 |
Correct |
0 ms |
2020 KB |
Output is correct |
15 |
Correct |
0 ms |
2020 KB |
Output is correct |
16 |
Correct |
0 ms |
2020 KB |
Output is correct |
17 |
Correct |
0 ms |
2020 KB |
Output is correct |
18 |
Correct |
0 ms |
2020 KB |
Output is correct |
19 |
Correct |
0 ms |
2020 KB |
Output is correct |
20 |
Correct |
0 ms |
2020 KB |
Output is correct |
21 |
Incorrect |
0 ms |
2020 KB |
Output isn't correct |
22 |
Halted |
0 ms |
0 KB |
- |