Submission #69264

#	Time	Username	Problem	Language	Result	Execution time	Memory
69264		FedericoS	Boat (APIO16_boat)	C++14	0 / 100	2074 ms	143056 KiB

boat

#include <iostream>
#include <map>
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> pll;

ll M=1000000007;
int N;
ll X[505],Y[505];
map<ll,ll> S;
map<pll,ll> DP;
ll ans;

int main(){

	cin>>N;
	for(int i=0;i<N;i++)
		cin>>X[i]>>Y[i];

	for(int i=N-1;i>=0;i--)
		for(ll j=Y[i];j>=X[i];j--){
			DP[{i,j}]=(S[j+1]+1)%M;
			S[j]=(S[j]+DP[{i,j}])%M;
		}

	for(int i=0;i<N;i++)
		ans=(ans+DP[{i,X[i]}])%M;
	cout<<ans;

}

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