oj.uz

답안 #727006

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
727006 2023-04-19T19:26:02 Z sochu Skyscraper (JOI16_skyscraper) C++14
20 / 100
 729 ms 250792 KB 
#include <bits/stdc++.h>
//#pragma GCC optimize ("03")
#define FastIO ios_base::sync_with_stdio(false) , cin.tie(0) , cout.tie(0)
#define FILES freopen("in" , "r" , stdin) , freopen("out" , "w" , stdout)
#define ll long long
#define ull unsigned long long
#define ld long double
#define eb emplace_back
#define pb push_back
#define qwerty1 first
#define qwerty2 second
#define qwerty3 -> first
#define qwerty4 -> second
#define umap unordered_map
#define uset unordered_set
#define pii pair < ll , ll >
#define pq priority_queue
#define dbg(x) cerr << #x << ": " << x << '\n'

namespace FastRead
{
    char __buff[5000];ll __lg = 0 , __p = 0;
    char nc()
    {
        if(__lg == __p){__lg = fread(__buff , 1 , 5000 , stdin);__p = 0;if(!__lg) return EOF;}
        return __buff[__p++];
    }
    template<class T>void read(T&__x)
    {
        T __sgn = 1; char __c;while(!isdigit(__c = nc()))if(__c == '-')__sgn = -1;
        __x = __c - '0';while(isdigit(__c = nc()))__x = __x * 10 + __c - '0';__x *= __sgn;
    }
}

using namespace FastRead;
using namespace std;

const ll N = 1e2 + 10;
const ll L = 2e3 + 10;
const ll M = 1e9 + 7;
const ld PI = acos(-1);
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

ll n , l;
ll a[N] , dp[N][N][L * 2][4];

void add(ll &x , ll y)
{
    y %= M;
    x += y;
    x %= M;
}

signed main()
{
//	#ifndef ONLINE_JUDGE
//		FastIO , FILES;
//	#endif

	ll i , j , s;

    cin >> n >> l;

    for(i = 1 ; i <= n ; i++)
        cin >> a[i];

    sort(a + 1 , a + n + 1);

    dp[1][1][0 + L][0] = 1;
    dp[1][1][-a[1] + L][1] = 1;
    dp[1][1][-a[1] + L][2] = 1;
    dp[1][1][-(2 * a[1]) + L][3] = 1;

    for(i = 2 ; i <= n ; i++)
    {
        for(j = 1 ; j <= i ; j++)
        {
            for(s = -2 * l ; s <= l ; s++)
            {
                ///merge
                if(s - 2 * a[i] + L >= 0)
                {
                    add(dp[i][j][s + L][0] , j * dp[i - 1][j + 1][s - 2 * a[i] + L][0]);
                    add(dp[i][j][s + L][1] , j * dp[i - 1][j + 1][s - 2 * a[i] + L][1]);
                    add(dp[i][j][s + L][2] , j * dp[i - 1][j + 1][s - 2 * a[i] + L][2]);
                    add(dp[i][j][s + L][3] , j * dp[i - 1][j + 1][s - 2 * a[i] + L][3]);
                }

                ///concat
                add(dp[i][j][s + L][0] , (2 * j - 2) * dp[i - 1][j][s + L][0]);
                add(dp[i][j][s + L][1] , (2 * j - 2) * dp[i - 1][j][s + L][1]);
                add(dp[i][j][s + L][2] , (2 * j - 2) * dp[i - 1][j][s + L][2]);
                add(dp[i][j][s + L][3] , (2 * j - 2) * dp[i - 1][j][s + L][3]);


                if(s - a[i] + L >= 0) add(dp[i][j][s + L][0] , dp[i - 1][j][s - a[i] + L][1]);
                if(s - a[i] + L >= 0) add(dp[i][j][s + L][2] , dp[i - 1][j][s - a[i] + L][3]);
                                      add(dp[i][j][s + L][1] , dp[i - 1][j][s        + L][1]);
                                      add(dp[i][j][s + L][3] , dp[i - 1][j][s        + L][3]);
                                     // add(dp[i][j][s + L][3] , dp[i - 1][j][s        + L][1]);

                if(s - a[i] + L >= 0) add(dp[i][j][s + L][0] , dp[i - 1][j][s - a[i] + L][2]);
                                      add(dp[i][j][s + L][2] , dp[i - 1][j][s        + L][2]);
                                      add(dp[i][j][s + L][3] , dp[i - 1][j][s        + L][3]);
                if(s - a[i] + L >= 0) add(dp[i][j][s + L][1] , dp[i - 1][j][s - a[i] + L][3]);
                                     // add(dp[i][j][s + L][3] , dp[i - 1][j][s        + L][2]);


                ///new
                if(j > 2 && s + 2 * a[i] + L < 2 * L)
                {
                    add(dp[i][j][s + L][0] , (j - 2) * dp[i - 1][j - 1][s + 2 * a[i] + L][0]);
                    add(dp[i][j][s + L][1] , (j - 2) * dp[i - 1][j - 1][s + 2 * a[i] + L][1]);
                    add(dp[i][j][s + L][2] , (j - 2) * dp[i - 1][j - 1][s + 2 * a[i] + L][2]);
                    add(dp[i][j][s + L][3] , (j - 2) * dp[i - 1][j - 1][s + 2 * a[i] + L][3]);
                }

                if(s + a[i] + L < 2 * L) add(dp[i][j][s + L][0] , dp[i - 1][j - 1][s +     a[i] + L][1]);
                if(s + a[i] + L < 2 * L) add(dp[i][j][s + L][0] , dp[i - 1][j - 1][s +     a[i] + L][2]);
                if(s + 2 * a[i] + L < 2 * L) add(dp[i][j][s + L][1] , dp[i - 1][j - 1][s + 2 * a[i] + L][1]);
                if(s + 2 * a[i] + L < 2 * L)                      add(dp[i][j][s + L][2] , dp[i - 1][j - 1][s + 2 * a[i] + L][2]);
                if(s + 2 * a[i] + L < 2 * L)                    add(dp[i][j][s + L][3] , dp[i - 1][j - 1][s + 2 * a[i] + L][3]);
                 if(s + 2 * a[i] + L < 2 * L)                     add(dp[i][j][s + L][3] , dp[i - 1][j - 1][s + 2 * a[i] + L][3]);
                 if(s + a[i] + L < 2 * L)     add(dp[i][j][s + L][2] , dp[i - 1][j - 1][s +     a[i] + L][3]);
                  if(s + a[i] + L < 2 * L)    add(dp[i][j][s + L][1] , dp[i - 1][j - 1][s +     a[i] + L][3]);

            }
        }
    }

    ll ans = 0;

    for(ll s = 0 ; s <= l ; s++)
        add(ans , dp[n][1][s + L][0]);

    cout << ans;

    return 0;
}

Compilation message

skyscraper.cpp: In function 'int main()':
skyscraper.cpp:97:17: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   97 |                 if(s - a[i] + L >= 0) add(dp[i][j][s + L][2] , dp[i - 1][j][s - a[i] + L][3]);
      |                 ^~
skyscraper.cpp:98:39: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   98 |                                       add(dp[i][j][s + L][1] , dp[i - 1][j][s        + L][1]);
      |                                       ^~~
skyscraper.cpp:102:17: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
  102 |                 if(s - a[i] + L >= 0) add(dp[i][j][s + L][0] , dp[i - 1][j][s - a[i] + L][2]);
      |                 ^~
skyscraper.cpp:103:39: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
  103 |                                       add(dp[i][j][s + L][2] , dp[i - 1][j][s        + L][2]);
      |                                       ^~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 596 KB Output is correct
5 Correct 10 ms 3588 KB Output is correct
6 Correct 9 ms 3284 KB Output is correct
7 Correct 3 ms 980 KB Output is correct
8 Correct 1 ms 724 KB Output is correct
9 Correct 13 ms 3372 KB Output is correct
10 Correct 2 ms 852 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 1108 KB Output is correct
2 Correct 5 ms 1748 KB Output is correct
3 Correct 2 ms 1236 KB Output is correct
4 Correct 4 ms 1724 KB Output is correct
5 Correct 4 ms 1748 KB Output is correct
6 Correct 4 ms 1620 KB Output is correct
7 Correct 2 ms 1084 KB Output is correct
8 Correct 2 ms 1236 KB Output is correct
9 Correct 3 ms 1492 KB Output is correct
10 Correct 4 ms 1600 KB Output is correct

Subtask #3
0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 596 KB Output is correct
5 Correct 10 ms 3588 KB Output is correct
6 Correct 9 ms 3284 KB Output is correct
7 Correct 3 ms 980 KB Output is correct
8 Correct 1 ms 724 KB Output is correct
9 Correct 13 ms 3372 KB Output is correct
10 Correct 2 ms 852 KB Output is correct
11 Correct 3 ms 1108 KB Output is correct
12 Correct 5 ms 1748 KB Output is correct
13 Correct 2 ms 1236 KB Output is correct
14 Correct 4 ms 1724 KB Output is correct
15 Correct 4 ms 1748 KB Output is correct
16 Correct 4 ms 1620 KB Output is correct
17 Correct 2 ms 1084 KB Output is correct
18 Correct 2 ms 1236 KB Output is correct
19 Correct 3 ms 1492 KB Output is correct
20 Correct 4 ms 1600 KB Output is correct
21 Correct 14 ms 6868 KB Output is correct
22 Incorrect 729 ms 250792 KB Output isn't correct
23 Halted 0 ms 0 KB -