# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
317867 | quocnguyen1012 | Skyscraper (JOI16_skyscraper) | C++14 | 392 ms | 174072 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>
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define eb emplace_back
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
const int maxn = 105, mod = 1e9 + 7;
int mem[maxn][maxn][1005][2][2];
int ar[maxn], N, L;
void add(int & x, int y) {
x += y;
if (x >= mod) x -= mod;
if (x < 0) x += mod;
}
int calc(int pos, int cc, int curl, int havel, int haver) {
int nxtl = curl;
if (pos)
nxtl += (havel + haver + 2 * cc) * (ar[pos] - ar[pos - 1]);
if (nxtl > L)
return 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... |