# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1043349 | Aldas25 | Skyscraper (JOI16_skyscraper) | C++14 | 1 ms | 860 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;
typedef long long ll;
const ll MOD = 1e9 + 7;
const int MAXN = 110;
const int MAXL = 1010;
int n, l;
int a[MAXN];
ll dp[MAXN][MAXN][MAXL][3];
int main() {
ios_base::sync_with_stdio(0); cin.tie(nullptr);
cin >> n >> l;
for (int i = 1; i <= n; i++) cin >> a[i];
sort(a+1, a+n+1);
dp[0][0][0][0] = 1;
a[n+1] = MAXL;
for (int i = 1; i <= n; i++) for (int j = 1; j <= i; j++) for (int m = 0; m <= 2; m++) {
ll delta = (a[i+1] - a[i]) * ((ll)(2 * j - m));
for (int k = delta; k <= l; k++) {
int prevK = k - delta;
ll val = 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... |