oj.uz

Submission #553690

# Submission time Handle Problem Language Result Execution time Memory
553690 2022-04-26T15:51:13 Z ala2 Boat (APIO16_boat) C++14
0 / 100
 4 ms 2260 KB 
#include <bits/stdc++.h>
#define int long long
#define F first
#define S second
#define pb push_back
#define B begin()
#define E end()

using namespace std;
int n;
int a[1001000];
int dp[505][505];
const int mod=1e9+7;
int f(int i,int last)
{
    if(dp[i][last]!=-1)
        return dp[i][last]%mod;
    if(i==n+1)
        return 1;
    int g=f(i+1,last);
    if(a[i]>a[last])
        g+=f(i+1,i);
    return dp[i][last]=g%mod;
}
signed main()
{
    memset(dp,-1,sizeof dp);
    cin>>n;
    for(int i=1;i<=n;i++){
        //a[i]=n-i;
        cin>>a[i]>>a[i];
    }
    while(f(1,0)>=mod)
    {
        
    }
        cout<<f(1,0)<<endl;

}

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 2260 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 22.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 2260 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 2260 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 42.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 2260 KB Output isn't correct
2 Halted 0 ms 0 KB -