CodeForces 294B Shaass and Bookshelf 【规律 & 模拟】或【Dp】

这道题目的意思就是排两排书，下面这排只能竖着放，上面这排可以平着放，使得宽度最小

根据题意可以得出一个结论，放上这排书的Width 肯定会遵照从小到大的顺序放上去的

Because the total thickness of vertical books is fixed it's good to calculate the minimum possible total width of horizontal books. 

那么只需要模拟一遍放书的过程即可，不会TLE

　

不过正统解法是Dp

Dp Source Code:

//#pragma comment(linker, "/STACK:16777216") //for c++ Compiler
#include <stdio.h>
#include <iostream>
#include <fstream>
#include <cstring>
#include <cmath>
#include <stack>
#include <string>
#include <map>
#include <set>
#include <list>
#include <queue>
#include <vector>
#include <algorithm>
#define Max(a,b) (((a) > (b)) ? (a) : (b))
#define Min(a,b) (((a) < (b)) ? (a) : (b))
#define Abs(x) (((x) > 0) ? (x) : (-(x)))
#define MOD 1000000007
#define pi acos(-1.0)

using namespace std;

typedef long long           ll      ;
typedef unsigned long long  ull     ;
typedef unsigned int        uint    ;
typedef unsigned char       uchar   ;

template<class T> inline void checkmin(T &a,T b){if(a>b) a=b;}
template<class T> inline void checkmax(T &a,T b){if(a<b) a=b;}

const double eps = 1e-      ;
const int N =             ;
const int M = *      ;
const ll P = 10000000097ll   ;
const int MAXN =     ;
const int INF = 0x3f3f3f3f   ;

int dp[][][];

int main(){
    std::ios::sync_with_stdio(false);
    int i, j, t, k, u, v, x, y, numCase = ;
    int n, a, b;
    dp[][][] = ;
    cin >> n;
    int cur = ;
    for(i = ; i < n; ++i){
        cin >> a >> b;
        for(j = ; j < cur + ; ++j){
            for(k = ; k < ; ++k){
                dp[i + ][j + a][k] |= dp[i][j][k];
                dp[i + ][j][k + b] |= dp[i][j][k];
            }
        }
        cur += a;
    }
    for(i = ; i < ; ++i){
        for(j = ; j < i + ; ++j){
            if(dp[n][i][j]){
                cout << i << endl;
                return ;
            }
        }
    }

    return ;
}

My Source Code:

//#pragma comment(linker, "/STACK:16777216") //for c++ Compiler
#include <stdio.h>
#include <iostream>
#include <fstream>
#include <cstring>
#include <cmath>
#include <stack>
#include <string>
#include <map>
#include <set>
#include <list>
#include <queue>
#include <vector>
#include <algorithm>
#define Max(a,b) (((a) > (b)) ? (a) : (b))
#define Min(a,b) (((a) < (b)) ? (a) : (b))
#define Abs(x) (((x) > 0) ? (x) : (-(x)))
#define MOD 1000000007
#define pi acos(-1.0)

using namespace std;

typedef long long           ll      ;
typedef unsigned long long  ull     ;
typedef unsigned int        uint    ;
typedef unsigned char       uchar   ;

template<class T> inline void checkmin(T &a,T b){if(a>b) a=b;}
template<class T> inline void checkmax(T &a,T b){if(a<b) a=b;}

const double eps = 1e-      ;
const int N =             ;
const int M = *      ;
const ll P = 10000000097ll   ;
const int MAXN =     ;
const int INF = 0x3f3f3f3f   ;

int a[][];
int one, two, n;

int main(){
    std::ios::sync_with_stdio(false);
    int i, j, t, k, u, v, x, y, numCase = ;
    cin >> n;
    for(u = ; u < n; ++u){
        cin >> x >> y;
        if(x == ){
            a[][one++] = y;
        } else{
            a[][two++] = y;
        }
    }
    sort(a[], a[] + one);
    sort(a[], a[] + two);
    int ans = INF;
    for(i = ; i <= one; ++i){
        for(j = ; j <= two; ++j){
            int cur = ;
            for(k = ; k < one - i; ++k){
                cur += a[][k];
            }
            for(k = ; k < two - j; ++k){
                cur += a[][k];
            }
            if((i +  * j) < ans && (i +  * j) >= cur){
                ans = i +  * j;
            }
        }
    }
    cout << ans << endl;

    return ;
}