답안 #244315

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
244315 2020-07-03T15:28:49 Z b00n0rp Skyscraper (JOI16_skyscraper) C++17
100 / 100
186 ms 255352 KB
// --------------------------------------------------<TEMPLATE>--------------------------------------------------
// --------------------<optimizations>--------------------
#pragma GCC optimize("Ofast,unroll-loops")
/* I don't understand these pragmas at all. 
   Earlier I added all the optimizations I could find but 
   upon my short amount of testing, these 2 are enough and adding more makes it slower. */
 
// -------------------</optimizations>--------------------
 
// ---------------<Headers and namespaces>----------------
#include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <ratio>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
 
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace __gnu_pbds;
using namespace __gnu_cxx;
*/
 
// ---------------</Headers and namespaces>---------------
 
// -----------------<Defines and typedefs>----------------
// typedef tree<int,null_type,less<int>,rb_tree_tag, \
tree_order_statistics_node_update> indexed_set; // use less_equal for multiset
// order_of_key (val): returns the no. of values less than val
// find_by_order (k): returns the iterator to kth largest element.(0-based)
 
typedef long double LD;
typedef long long ll;
#define int ll
#define pb push_back
#define mp make_pair
#define REP(i,n) for (int i = 0; i < n; i++)
#define FOR(i,a,b) for (int i = a; i < b; i++)
#define REPD(i,n) for (int i = n-1; i >= 0; i--)
#define FORD(i,a,b) for (int i = a; i >= b; i--)
#define remax(a,b) a = max(a,b)
#define remin(a,b) a = min(a,b)
#define all(v) v.begin(),v.end()
typedef map<int,int> mii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> pii;
typedef vector<pii> vpii;
#define F first
#define S second
#define PQ(type) priority_queue<type>
#define PQD(type) priority_queue<type,vector<type>,greater<type> >
#define ITR :: iterator it
#define WL(t) while(t --)
#define SZ(x) ((int)(x).size())
#define runtime() ((double)clock() / CLOCKS_PER_SEC)
#define TR(container,it) for(typeof(container.begin()) it=container.begin();it!=container.end();it++)
#define sqr(x) ((x)*(x))
#define inrange(i,a,b) ((i>=min(a,b)) && (i<=max(a,b)))
 
// -----<SCANF>-----
#define sfi(x) scanf("%d",&x);
#define sfi2(x,y) scanf("%d%d",&x,&y);
#define sfi3(x,y,z) scanf("%d%d%d",&x,&y,&z);
 
#define sfl(x) scanf("%lld",&x);
#define sfl2(x,y) scanf("%lld%lld",&x,&y);
#define sfl3(x,y,z) scanf("%lld%lld%lld",&x,&y,&z);
#define sfl4(x,y,z,x1) scanf("%lld%lld%lld%lld",&x,&y,&z,&x1);
#define sfl5(x,y,z,x1,y1) scanf("%lld%lld%lld%lld%lld",&x,&y,&z,&x1,&y1);
#define sfl6(x,y,z,x1,y1,z1) scanf("%lld%lld%lld%lld%lld%lld",&x,&y,&z,&x1,&y1,&z1);
 
#define sfs(x) scanf("%s",x);
#define sfs2(x,y) scanf("%s%s",x,y);
#define sfs3(x,y,z) scanf("%s%s%s",x,y,z);
// ----</SCANF>-----
 
// ----<PRINTF>-----
#define pfi(x) printf("%d\n",x);
#define pfi2(x,y) printf("%d %d\n",x,y);
#define pfi3(x,y,z) printf("%d %d %d\n",x,y,z);
 
#define pfl(x) printf("%lld\n",x);
#define pfl2(x,y) printf("%lld %lld\n",x,y);
#define pfl3(x,y,z) printf("%lld %lld %lld\n",x,y,z);
 
#define pfs(x) printf("%s\n",x);
#define pfs2(x,y) printf("%s %s\n",x,y);
#define pfs3(x,y,z) printf("%s %s %s\n",x,y,z);
 
#define pwe(x) printf("%lld ",x); // print without end
// ----</PRINTF>----
 
#define FLSH fflush(stdout)
#define fileIO(name) \
    freopen(name".in", "r", stdin); \
    freopen(name".out", "w", stdout);
#define PRECISION(x) cout << fixed << setprecision(x); 
#define FAST_IO ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
 
// ----------------</Defines and typedefs>----------------
 
// -------------------<Debugging stuff>-------------------
#define TRACE
 
#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
    cerr << name << " : " << arg1 << std::endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
    const char* comma = strchr(names + 1, ',');cerr.write(names, comma - names) << " : " << arg1<<" | ";__f(comma+1, args...);
}
#else
#define trace(...)
#endif
 
// ------------------</Debugging stuff>-------------------
 
// ------------------------<Consts>-----------------------
const int MAXN = 1000005;
const int SQRTN = 1003;
const int LOGN = 22;
const double PI=acos(-1);
 
#ifdef int
const int INF=1e16;
#else
const int INF=1e9;
#endif
 
const int MOD = 1000000007;
const int FMOD = 998244353;
const double eps = 1e-9;
 
// -----------------------</Consts>-----------------------
 
// -------------------------<RNG>-------------------------
mt19937 RNG(chrono::steady_clock::now().time_since_epoch().count()); 
#define SHUF(v) shuffle(all(v), RNG);
// Use mt19937_64 for 64 bit random numbers.
 
// ------------------------</RNG>-------------------------
 
// ----------------------<MATH>---------------------------
template<typename T> T gcd(T a, T b){return(b?__gcd(a,b):a);}
template<typename T> T lcm(T a, T b){return(a*(b/gcd(a,b)));}
int add(int a, int b, int c = MOD){int res=a+b;return(res>=c?res-c:res);}
int mod_neg(int a, int b, int c = MOD){int res;if(abs(a-b)<c)res=a-b;else res=(a-b)%c;return(res<0?res+c:res);}
int mul(int a, int b, int c = MOD){ll res=(ll)a*b;return(res>=c?res%c:res);}
int muln(int a, int b, int c = MOD){ll res=(ll)a*b;return ((res%c)+c)%c;}
ll mulmod(ll a,ll b, ll m = MOD){ll q = (ll)(((LD)a*(LD)b)/(LD)m);ll r=a*b-q*m;if(r>m)r%=m;if(r<0)r+=m;return r;}
template<typename T>T expo(T e, T n){T x=1,p=e;while(n){if(n&1)x=x*p;p=p*p;n>>=1;}return x;}
template<typename T>T power(T e, T n, T m = MOD){T x=1,p=e;while(n){if(n&1)x=mul(x,p,m);p=mul(p,p,m);n>>=1;}return x;}
template<typename T>T extended_euclid(T a, T b, T &x, T &y){T xx=0,yy=1;y=0;x=1;while(b){T q=a/b,t=b;b=a%b;a=t;\
t=xx;xx=x-q*xx;x=t;t=yy;yy=y-q*yy;y=t;}return a;}
template<typename T>T mod_inverse(T a, T n = MOD){T x,y,z=0;T d=extended_euclid(a,n,x,y);return(d>1?-1:mod_neg(x,z,n));}
 
const int FACSZ = 1; // Make sure to change this
 
int fact[FACSZ],ifact[FACSZ];
 
void precom(int c = MOD){
    fact[0] = 1;
    FOR(i,1,FACSZ) fact[i] = mul(fact[i-1],i,c);
    ifact[FACSZ-1] = mod_inverse(fact[FACSZ-1],c);
    REPD(i,FACSZ-1){
        ifact[i] = mul(i+1,ifact[i+1],c);
    }
}
 
int ncr(int n,int r,int c = MOD){
    return mul(mul(ifact[r],ifact[n-r],c),fact[n],c);
} 
// ----------------------</MATH>--------------------------
// --------------------------------------------------</TEMPLATE>--------------------------------------------------
 
void solvethetestcase();
 
signed main(){
    // (UNCOMMENT FOR CIN/COUT) \
    FAST_IO
    PRECISION(10)
 
    int t = 1;
    // (UNCOMMENT FOR MULTIPLE TEST CASES) \
    sfl(t);
    FOR(testcase,1,t+1){
        // (UNCOMMENT FOR CODEJAM) \
        printf("Case #%lld: ",testcase); 
        solvethetestcase();
    }
}   
 
int N,L;
int a[105];
int dp[105][1005][105][3];
 
void solvethetestcase(){
    sfl2(N,L)
    FOR(i,1,N+1) sfl(a[i])
    sort(a+1,a+N+1);
    REP(i,N+3) REP(j,L+3) REP(k,N+3) REP(l,3) dp[i][j][k][l] = 0;
    dp[0][0][0][0] = 1;
    if(N == 1){
        printf("1\n");
        return;
    }
    FOR(i,1,N+1){
        REP(sm,L+1){
            REP(cmp,i+1){
                REP(ep,3){
                    int new_sm = sm+(a[i]-a[i-1])*(2*cmp-ep); // we're essentially filling the ? with a[i]
                    // trace(i-1,sm,cmp,ep,new_sm);
                    if(cmp-(N-i+1) > 1) dp[i-1][sm][cmp][ep] = 0;
                    if(new_sm > L or (!dp[i-1][sm][cmp][ep])) continue; 
                    
                    dp[i][new_sm][cmp+1][ep] = add(dp[i][new_sm][cmp+1][ep],mul(dp[i-1][sm][cmp][ep],(cmp+1-ep)));
                    if(ep != 2) dp[i][new_sm][cmp+1][ep+1] = add(dp[i][new_sm][cmp+1][ep+1],mul(dp[i-1][sm][cmp][ep],(2-ep)));
 
                    dp[i][new_sm][cmp][ep] = add(dp[i][new_sm][cmp][ep],mul(dp[i-1][sm][cmp][ep],(2*cmp-ep)));
                    if(cmp and (ep == 0 or (ep == 1 and i == N) or (ep == 1 and cmp > 1))) dp[i][new_sm][cmp][ep+1] = add(dp[i][new_sm][cmp][ep+1],mul(dp[i-1][sm][cmp][ep],(2-ep)));
 
                    if(cmp)
                    dp[i][new_sm][cmp-1][ep] = add(dp[i][new_sm][cmp-1][ep],mul(dp[i-1][sm][cmp][ep],(cmp-1)));
 
                    // trace(i,sm,cmp,ep,dp[i-1][sm][cmp][ep]); 
                }
            }
        }
    }
    // FOR(i,1,N+1){
    //     REP(sm,L+1){
    //         REP(cmp,i+1){
    //             REP(ep,3){
    //                 if(dp[i][sm][cmp][ep]){
    //                     if(i == 4){
    //                         if(cmp == 1 and ep == 2) trace(i,sm,cmp,ep,dp[i][sm][cmp][ep]);
    //                     }
    //                     else if(i == 0){
    //                         int new_sm = sm+(a[i]-a[i-1])*(2*cmp-ep);
    //                         if(new_sm == 7) trace(i,sm,cmp,ep,dp[i][sm][cmp][ep]);
    //                     }
    //                     else if(i == 0){
    //                         int new_sm = sm+(a[i]-a[i-1])*(2*cmp-ep);
    //                         if(new_sm == 1 or new_sm == 4 or new_sm == 7) trace(i,sm,cmp,ep,dp[i][sm][cmp][ep]);
    //                     }
    //                     else{
    //                         trace(i,sm,cmp,ep,dp[i][sm][cmp][ep]);
    //                     }
    //                 }
    //             }
    //         }
    //     }
    // }
    int ans = 0;
    FOR(i,1,L+1) ans = add(ans,dp[N][i][1][2]);
    pfl(ans)
}

Compilation message

skyscraper.cpp:54:1: warning: multi-line comment [-Wcomment]
 // typedef tree<int,null_type,less<int>,rb_tree_tag, \
 ^
skyscraper.cpp:210:5: warning: multi-line comment [-Wcomment]
     // (UNCOMMENT FOR CIN/COUT) \
     ^
skyscraper.cpp:215:5: warning: multi-line comment [-Wcomment]
     // (UNCOMMENT FOR MULTIPLE TEST CASES) \
     ^
skyscraper.cpp:218:9: warning: multi-line comment [-Wcomment]
         // (UNCOMMENT FOR CODEJAM) \
         ^
skyscraper.cpp: In function 'void solvethetestcase()':
skyscraper.cpp:94:24: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
 #define sfl2(x,y) scanf("%lld%lld",&x,&y);
                   ~~~~~^~~~~~~~~~~~~~~~~~
skyscraper.cpp:229:5: note: in expansion of macro 'sfl2'
     sfl2(N,L)
     ^~~~
skyscraper.cpp:93:21: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
 #define sfl(x) scanf("%lld",&x);
                ~~~~~^~~~~~~~~~~
skyscraper.cpp:230:18: note: in expansion of macro 'sfl'
     FOR(i,1,N+1) sfl(a[i])
                  ^~~
# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 512 KB Output is correct
3 Correct 5 ms 512 KB Output is correct
4 Correct 6 ms 2560 KB Output is correct
5 Correct 17 ms 26112 KB Output is correct
6 Correct 16 ms 23424 KB Output is correct
7 Correct 7 ms 4864 KB Output is correct
8 Correct 5 ms 2560 KB Output is correct
9 Correct 16 ms 24960 KB Output is correct
10 Correct 6 ms 3712 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 2816 KB Output is correct
2 Correct 8 ms 4608 KB Output is correct
3 Correct 6 ms 2432 KB Output is correct
4 Correct 7 ms 4608 KB Output is correct
5 Correct 7 ms 4608 KB Output is correct
6 Correct 7 ms 4352 KB Output is correct
7 Correct 5 ms 1792 KB Output is correct
8 Correct 6 ms 2304 KB Output is correct
9 Correct 6 ms 3584 KB Output is correct
10 Correct 6 ms 3968 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 512 KB Output is correct
3 Correct 5 ms 512 KB Output is correct
4 Correct 6 ms 2560 KB Output is correct
5 Correct 17 ms 26112 KB Output is correct
6 Correct 16 ms 23424 KB Output is correct
7 Correct 7 ms 4864 KB Output is correct
8 Correct 5 ms 2560 KB Output is correct
9 Correct 16 ms 24960 KB Output is correct
10 Correct 6 ms 3712 KB Output is correct
11 Correct 6 ms 2816 KB Output is correct
12 Correct 8 ms 4608 KB Output is correct
13 Correct 6 ms 2432 KB Output is correct
14 Correct 7 ms 4608 KB Output is correct
15 Correct 7 ms 4608 KB Output is correct
16 Correct 7 ms 4352 KB Output is correct
17 Correct 5 ms 1792 KB Output is correct
18 Correct 6 ms 2304 KB Output is correct
19 Correct 6 ms 3584 KB Output is correct
20 Correct 6 ms 3968 KB Output is correct
21 Correct 7 ms 4992 KB Output is correct
22 Correct 120 ms 165368 KB Output is correct
23 Correct 165 ms 250872 KB Output is correct
24 Correct 131 ms 190072 KB Output is correct
25 Correct 162 ms 253944 KB Output is correct
26 Correct 145 ms 216184 KB Output is correct
27 Correct 49 ms 63920 KB Output is correct
28 Correct 67 ms 78072 KB Output is correct
29 Correct 109 ms 146936 KB Output is correct
30 Correct 186 ms 255352 KB Output is correct