Submission #537059

#	Time	Username	Problem	Language	Result	Execution time	Memory
537059		ammar2000	Boat (APIO16_boat)	C++17	0 / 100	2081 ms	9608 KiB

boat

#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];
map <pair <ll,pair<ll,ll> >,ll> dp,vis;
ll solve(int in,int li,int ad)
{
    if (in==n)
    {
        return ad>=0;
    }
    if (vis[{in,{li,ad}}])
        return dp[{in,{li,ad}}];
    vis[{in,{li,ad}}]=1;
    ll ret=0;
    for (int i=0;i+a[in]<=b[in];i++)
    {
        if (a[in]+i>a[li]+ad)
          ret+=solve(in+1,in,i),ret%=MOD;
    }
    ret+=solve(in+1,li,ad);
    return dp[{in,{li,ad}}]=ret%MOD;
}
int main()
{
   fast
   cin>>n;
   for (int i=0;i<n;i++)
    cin>>a[i]>>b[i];
   cout << solve(0,0,-1);
   // use scanf not cin
   return 0;
}

• Subtask 1: 0 / 9
• Subtask 2: 0 / 22
• Subtask 3: 0 / 27
• Subtask 4: 0 / 42