# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
528084 | tht2005 | Skyscraper (JOI16_skyscraper) | C++17 | 69 ms | 16600 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;
const int md = (int)1e9 + 7;
void add(int& a, int b) {
a += b;
if(a >= md) a -= md;
}
int mul(int a, int b) {
return (long long)a * b % md;
}
const int N = 102;
const int M = 1003;
int n, m, res, a[N], f[N][N][M][3];
int main() {
scanf("%d %d", &n, &m);
for(int i = 0; i < n; ++i)
scanf("%d", a + i);
sort(a, a + n);
if(n == 1) {
putchar('1');
}
else {
f[0][1][0][0] = 1;
f[0][1][0][1] = 2;
for(int i = 0; i + 1 < n; ++i)
for(int j = 1; j <= n; ++j)
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... |