# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
118575 | IOrtroiii | Skyscraper (JOI16_skyscraper) | C++14 | 144 ms | 19468 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 N = 105;
const int M = 1005;
const int mod = 1e9 + 7;
void add(int &x, int y) {
x += y; if (x >= mod) x -= mod;
}
int mul(int x, int y) {
return (long long) x * y % mod;
}
int a[N];
int f[N][N][M][2][2];
int main() {
int n, m;
scanf("%d %d", &n, &m);
if (n == 1) {
puts("1");
return 0;
}
for (int i = 1; i <= n; ++i) {
scanf("%d", a + i);
}
sort(a + 1, a + 1 + n);
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... |