oj.uz

Submission #69264

# Submission time Handle Problem Language Result Execution time Memory
69264 2018-08-20T10:40:02 Z FedericoS Boat (APIO16_boat) C++14
0 / 100
 2000 ms 143056 KB 
#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.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 504 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 504 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2074 ms 143056 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 42.0

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