oj.uz

Submission #1096530

# Submission time Handle Problem Language Result Execution time Memory
1096530 2024-10-04T17:14:13 Z cpptowin Skyscraper (JOI16_skyscraper) C++17
100 / 100
 90 ms 54736 KB 
#include <bits/stdc++.h>
#define fo(i, d, c) for (int i = d; i <= c; i++)
#define fod(i, c, d) for (int i = c; i >= d; i--)
#define maxn 1000010
#define N 1010
#define fi first
#define se second
#define pb emplace_back
#define en cout << "\n";
#define int long long
#define inf (int)1e18
#define bitcount(x) __builtin_popcountll(x)
#define pii pair<int, int>
#define vii vector<pii>
#define lb(x) x & -x
#define bit(i, j) ((i >> j) & 1)
#define offbit(i, j) (i ^ (1LL << j))
#define onbit(i, j) (i | (1LL << j))
#define vi vector<int>
#define all(x) x.begin(), x.end()
#define ss(x) (int)x.size()
template <typename T1, typename T2>
bool minimize(T1 &a, T2 b)
{
    if (a > b)
    {
        a = b;
        return true;
    }
    return false;
}
template <typename T1, typename T2>
bool maximize(T1 &a, T2 b)
{
    if (a < b)
    {
        a = b;
        return true;
    }
    return false;
}
using namespace std;
const int nsqrt = 450;
const int mod = 1e9 + 7;
void add(int &x, int k)
{
    x += k;
    x %= mod;
    if (x < 0)
        x += mod;
}
void del(int &x, int k)
{
    x -= k;
    x %= mod;
    if (x < 0)
        x += mod;
}
int n, l, a[105];
int f[105][105][1111][3];
main()
{
#define name "TASK"
    if (fopen(name ".inp", "r"))
    {
        freopen(name ".inp", "r", stdin);
        freopen(name ".out", "w", stdout);
    }
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cin >> n >> l;
    fo(i, 1, n) cin >> a[i];
    if(n == 1) return cout << 1,0;
    f[0][0][0][0] = 1;
    sort(a + 1, a + n + 1);
    a[n + 1] = 10000;
    fo(i, 1, n) fo(j, 1, i) fo(k, 0, l) fo(m, 0, 2)
    {
        int delta = (2 * j - m) * (a[i + 1] - a[i]);
        if (k < delta or i + j - 1 - m > n)
            continue;
        add(f[i][j][k][m], f[i - 1][j - 1][k - delta][m]);
        if (m)
            add(f[i][j][k][m], (2 - (m - 1)) * f[i - 1][j - 1][k - delta][m - 1]);
        add(f[i][j][k][m], (2 * j - m) * f[i - 1][j][k - delta][m]);
        if (m == 1)
            add(f[i][j][k][m], 2 * j * f[i - 1][j][k - delta][m - 1]);
        if (m == 2)
        {
            if (i == n)
                add(f[i][j][k][m], f[i - 1][j][k - delta][m - 1]);
            else if (j > 1)
                add(f[i][j][k][m], (j - 1) * f[i - 1][j][k - delta][m - 1]);
        }
        if (m == 2)
        {
            if (i == n)
                add(f[i][j][k][m], f[i - 1][j + 1][k - delta][m]);
            else
                add(f[i][j][k][m], j * (j - 1) * f[i - 1][j + 1][k - delta][m]);
        }
        else if (m == 1)
            add(f[i][j][k][m], j * j * f[i - 1][j + 1][k - delta][m]);
        else
            add(f[i][j][k][m], j * (j + 1) * f[i - 1][j + 1][k - delta][m]);
    }
    int ans = 0;
    fo(i, 0, l) add(ans, f[n][1][i][2]);
    cout << ans;
}

Compilation message

skyscraper.cpp:61:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   61 | main()
      | ^~~~
skyscraper.cpp: In function 'int main()':
skyscraper.cpp:66:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   66 |         freopen(name ".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
skyscraper.cpp:67:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   67 |         freopen(name ".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 860 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 0 ms 464 KB Output is correct
9 Correct 1 ms 860 KB Output is correct
10 Correct 1 ms 604 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 1 ms 856 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 1 ms 860 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 860 KB Output is correct
7 Correct 0 ms 604 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 860 KB Output is correct
10 Correct 1 ms 860 KB Output is correct

Subtask #3
80.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 860 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 0 ms 464 KB Output is correct
9 Correct 1 ms 860 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 1 ms 856 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 1 ms 860 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 1 ms 860 KB Output is correct
17 Correct 0 ms 604 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 1 ms 860 KB Output is correct
20 Correct 1 ms 860 KB Output is correct
21 Correct 2 ms 2652 KB Output is correct
22 Correct 60 ms 37476 KB Output is correct
23 Correct 83 ms 51284 KB Output is correct
24 Correct 73 ms 48476 KB Output is correct
25 Correct 90 ms 54612 KB Output is correct
26 Correct 72 ms 47376 KB Output is correct
27 Correct 28 ms 24408 KB Output is correct
28 Correct 36 ms 27996 KB Output is correct
29 Correct 59 ms 42836 KB Output is correct
30 Correct 90 ms 54736 KB Output is correct