# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
586603 | blue | Skyscraper (JOI16_skyscraper) | C++17 | 166 ms | 89096 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 <iostream>
#include <vector>
#include <algorithm>
using namespace std;
using ll = long long;
using vi = vector<int>;
const ll mod = 1'000'000'007LL;
ll ad(ll a, ll b)
{
return (a+b) % mod;
}
int main()
{
int N, L;
cin >> N >> L;
vi A(N);
for(int i = 0; i < N; i++)
cin >> A[i];
int DP[(1<<N)][N][1+L];
for(int m = 0; m < (1<<N); m++)
for(int i = 0; i < N; i++)
for(int l = 0; l <= L; l++)
DP[m][i][l] = 0;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |