oj.uz

Submission #537067

# Submission time Handle Problem Language Result Execution time Memory
537067 2022-03-14T11:06:36 Z ammar2000 Boat (APIO16_boat) C++17
9 / 100
 3 ms 2380 KB 
#include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define F first
#define S second
#define coy cout<<"YES\n"
#define con cout<<"NO\n"
#define co1 cout<<"-1\n"
#define sc(x) scanf("%lld",&x)
#define all(x) x.begin(),x.end()
#define fast ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
using namespace std;
const int SI=3e5+7;
ll INF=8e18+7;
int dx[] = {1 , -1 , 0 , 0};
int dy[] = {0 , 0 , 1 , -1};
int MOD=1e9+7;
ll n,a[SI],b[SI],dp[505][505];
//map <pair <ll,pair<ll,ll> >,ll> dp,vis;
ll solve(int in,int li)
{
    if (in==n+1)
    {
        return li!=0;
    }
    if (dp[in][li]!=-1)
        return dp[in][li];
    ll ret=0;
    if (li==0)
    {
        ret=solve(in+1,in);
        ret%=MOD;
        ret+=solve(in+1,li);
    }
    else
    {
        if (a[in]>a[li])
            ret+=solve(in+1,in),ret%=MOD;
        ret+=solve(in+1,li);
    }
    return dp[in][li]=ret%MOD;
}
int main()
{
   fast
   memset(dp,-1,sizeof dp);
   cin>>n;
   for (int i=1;i<=n;i++)
    cin>>a[i]>>b[i];
   cout << solve(1,0);
   // use scanf not cin
   return 0;
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 2260 KB Output is correct
2 Correct 3 ms 2380 KB Output is correct
3 Correct 3 ms 2328 KB Output is correct
4 Correct 3 ms 2332 KB Output is correct
5 Correct 3 ms 2260 KB Output is correct
6 Correct 3 ms 2328 KB Output is correct
7 Correct 3 ms 2332 KB Output is correct
8 Correct 3 ms 2260 KB Output is correct
9 Correct 3 ms 2260 KB Output is correct
10 Correct 3 ms 2260 KB Output is correct
11 Correct 3 ms 2328 KB Output is correct
12 Correct 3 ms 2260 KB Output is correct
13 Correct 3 ms 2260 KB Output is correct
14 Correct 3 ms 2260 KB Output is correct
15 Correct 3 ms 2260 KB Output is correct
16 Correct 3 ms 2260 KB Output is correct
17 Correct 3 ms 2260 KB Output is correct
18 Correct 3 ms 2328 KB Output is correct
19 Correct 3 ms 2260 KB Output is correct
20 Correct 3 ms 2260 KB Output is correct

Subtask #2
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 2260 KB Output is correct
2 Correct 3 ms 2380 KB Output is correct
3 Correct 3 ms 2328 KB Output is correct
4 Correct 3 ms 2332 KB Output is correct
5 Correct 3 ms 2260 KB Output is correct
6 Correct 3 ms 2328 KB Output is correct
7 Correct 3 ms 2332 KB Output is correct
8 Correct 3 ms 2260 KB Output is correct
9 Correct 3 ms 2260 KB Output is correct
10 Correct 3 ms 2260 KB Output is correct
11 Correct 3 ms 2328 KB Output is correct
12 Correct 3 ms 2260 KB Output is correct
13 Correct 3 ms 2260 KB Output is correct
14 Correct 3 ms 2260 KB Output is correct
15 Correct 3 ms 2260 KB Output is correct
16 Correct 3 ms 2260 KB Output is correct
17 Correct 3 ms 2260 KB Output is correct
18 Correct 3 ms 2328 KB Output is correct
19 Correct 3 ms 2260 KB Output is correct
20 Correct 3 ms 2260 KB Output is correct
21 Incorrect 3 ms 2260 KB Output isn't correct
22 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 Correct 3 ms 2260 KB Output is correct
2 Correct 3 ms 2380 KB Output is correct
3 Correct 3 ms 2328 KB Output is correct
4 Correct 3 ms 2332 KB Output is correct
5 Correct 3 ms 2260 KB Output is correct
6 Correct 3 ms 2328 KB Output is correct
7 Correct 3 ms 2332 KB Output is correct
8 Correct 3 ms 2260 KB Output is correct
9 Correct 3 ms 2260 KB Output is correct
10 Correct 3 ms 2260 KB Output is correct
11 Correct 3 ms 2328 KB Output is correct
12 Correct 3 ms 2260 KB Output is correct
13 Correct 3 ms 2260 KB Output is correct
14 Correct 3 ms 2260 KB Output is correct
15 Correct 3 ms 2260 KB Output is correct
16 Correct 3 ms 2260 KB Output is correct
17 Correct 3 ms 2260 KB Output is correct
18 Correct 3 ms 2328 KB Output is correct
19 Correct 3 ms 2260 KB Output is correct
20 Correct 3 ms 2260 KB Output is correct
21 Incorrect 3 ms 2260 KB Output isn't correct
22 Halted 0 ms 0 KB -