# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
126415 | shafinalam | Boat (APIO16_boat) | C++14 | 4 ms | 380 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
const int mxn = 1e5+5;
const int mod = 1e9+7;
typedef long long ll;
typedef pair<int,int>pii;
#define ff first
#define ss second
pii arr[mxn];
int dp[505];
int n;
int solve(int pos)
{
if(pos>=n) return 0;
if(dp[pos]!=-1) return dp[pos];
int ret = 0;
for(int i = pos+1; i <= n; i++)
if(arr[i].ff>arr[pos].ff) ret = (ret+solve(i)+1)%mod;
return dp[pos] = ret%mod;
}
int main()
{
scanf("%d", &n);
for(int i = 1; i <= n; i++)
{
int a, b;
scanf("%d%d", &a, &b);
arr[i] = make_pair(a, b);
}
memset(dp, -1, sizeof dp);
int ans = solve(0)%mod;
printf("%d\n", ans);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |