# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
30801 | inqr | Boat (APIO16_boat) | C++14 | 0 ms | 3056 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>
#define pb push_back
#define mp make_pair
#define rt insert
#define st first
#define nd second
#define ll long long
#define pii pair < int , int >
#define DB printf("debug\n");
#define umax( x , y ) x = max( x , (y) )
#define umin( x , y ) x = min( x , (y) )
#define all(x) x.begin() , x.end()
using namespace std;
int n;
ll ans=0,mod=1e9+7;
int a[505],b[505];
void solve1(){
int dp[505][505];memset(dp,0,sizeof(dp));
dp[0][0]=1;
dp[0][a[0]]=1;
for(int i=1;i<=n;i++){
for(int j=0;j<a[i];j++){//i yi alarak
dp[i][a[i]]+=dp[i-1][j];
dp[i][a[i]]%=mod;
}
for(int j=0;j<=500;j++){// i yi almiyarak
dp[i][j]+=dp[i-1][j];
dp[i][j]%=mod;
}
}
# | 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... |