# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
362802 | QCFium | Skyscraper (JOI16_skyscraper) | C++14 | 321 ms | 3564 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>
int ri() {
int n;
scanf("%d", &n);
return n;
}
#define MOD 1000000007
int main() {
int n = ri();
// !!!! corner case n <= 2 !!!!
int l = ri();
int a[n];
for (auto &i : a) i = ri();
std::sort(a, a + n);
int dp[l + 1][n][2][2];
memset(dp, 0, sizeof(dp));
auto add = [&] (int &a, int b) {
a += b;
if (a >= MOD) a -= MOD;
};
for (int i = 0; i < 2; i++) for (int j = 0; j < 2; j++) dp[0][0][i][j] = 1;
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... |