# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
442844 | parsabahrami | Skyscraper (JOI16_skyscraper) | C++17 | 1 ms | 844 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.
/* I do it for the glory */
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> pii;
#define SZ(x) (int) x.size()
#define F first
#define S second
const int N = 1e2 + 10, MOD = 1e9 + 7;
int dp[N][N][10 * N][3], A[N], n, L;
void add(int &x, int y) {
x += y;
if (x >= MOD) x -= MOD;
}
int main() {
scanf("%d%d", &n, &L);
dp[0][0][0][0] = 1;
for (int i = 1; i <= n; i++)
scanf("%d", &A[i]);
sort(A + 1, A + n + 1);
for (int i = 1; i <= n; i++) {
for (int j = 0; j <= i; j++) {
for (int k = 0; k <= L; k++) {
for (int t = 0; t <= min(j, 2); t++) {
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... |