# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1029858 | KasymK | Boat (APIO16_boat) | C++17 | 1 ms | 448 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;
#define ff first
#define ss second
#define all(v) v.begin(), v.end()
#define ll long long
#define pb push_back
#define pii pair<int, int>
const int MOD = 1e9+7;
const int N = 5e2+5;
ll dp[N], a[N], b[N];
void solve(){
int n;
scanf("%d", &n);
for(int i = 0; i < n; ++i)
scanf("%lld%lld", &a[i], &b[i]);
ll ans = 0;
for(int i = 0; i < n; ++i){
dp[i] = 1;
for(int j = 0; j < i; ++j)
if(a[j] < a[i])
dp[i] += dp[j];
dp[i] %= MOD;
(ans += dp[i]) %= MOD;
}
printf("%lld\n", ans);
}
int main(){
int t = 1;
// scanf("%d", &t);
while(t--)
solve();
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... |