oj.uz

Submission #1015187

# Submission time Handle Problem Language Result Execution time Memory
1015187 2024-07-06T07:10:44 Z UmairAhmadMirza Boat (APIO16_boat) C++17
0 / 100
 1 ms 504 KB 
#include <bits/stdc++.h>
using namespace std;

#define int long long
int const N=505;
int const mod=1e9+7;

int dp[N];
int arr[N];

signed main(){
	int n;
	cin>>n;
	for (int i = 1; i <=n; ++i)
		cin>>arr[i]>>arr[i];
	dp[0]=1;
	for(int i=1;i<=n;i++){
		dp[i]=dp[i-1];
		for(int j=i-1;j>=0;j--)
			if(arr[j]<arr[i]){
				dp[i]+=dp[j];
				dp[i]%=mod;
				break;
			}
	}
	dp[n]--;
	dp[n]+=mod;
	dp[n]%=mod;
	cout<<dp[n]<<endl;
	return 0;
}

Subtask #1
0 / 9.0

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

Subtask #4
0 / 42.0

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