AtCoder beginner contest #159 题解(EF)

比赛地址

E:
题意：
给你一个高为h宽为w的矩阵，里面由01构成，现在问你最少切几刀能使每块1的和不超过k。

思路：
一开始没看到h<=10， 就觉得枚举肯定做不了，后来看到<=10就豁然开朗，用状压来枚举嘛。所以题目条件对于思路的提示也是很重要的，以后看到数据范围很小的，又感觉可以枚举每个条件做的，就可以考虑一下状压了。

ac代码：

/**
* Think twice, code once.
* 1.integer overflow(maybe even long long overflow : (a+b >= c) -> (a >= c-b)
* 2.runtime error
* 3.boundary condition
* ---------------------------------------------------------------------------------------
* Author : zzy
* Date : 2020-03-22-20.33.12 Sunday
*/
#include <bits/stdc++.h>

#define eb emplace_back
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
#define for1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define ford(i, a, b) for (int i = (int)(a); i >= (int)b; --i)
#define fore(i, a, b) for (int i = (int)(a); i <= (int)(b); ++i)
#define rep(i, l, r) for (int i = (l); i <= (r); i++)
#define per(i, r, l) for (int i = (r); i >= (l); i--)
#define ms(x, y) memset(x, y, sizeof(x))
#define SZ(x) ((int)(x).size())

using namespace std;

typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pii> vpi;
typedef vector<vi> vvi;
typedef long long i64;
typedef vector<i64> vi64;
typedef vector<vi64> vvi64;
typedef pair<i64, i64> pi64;
typedef double ld;

template<class T> bool uin(T &a, T b) { return a > b ? (a = b, true) : false; }
template<class T> bool uax(T &a, T b) { return a < b ? (a = b, true) : false; }

int h, w, k, team[50], val[50][1100];
char mat[50][1100];

int makeTeam(int x) {
    vi a;
    for (int i = 0; i <= h-2; ++i) {
        if (x&(1<<i)) {
            a.eb(i);
        }
    }
    int tot = 1;
    if (!SZ(a)) {
        forn(i, h) team[i] = 1;
    } else {
        int len = SZ(a);
        for (int i = 0; i <= a[0]; ++i) team[i] = tot;
        ++tot;
        for (int i = 0; i < len-1; ++i) {
            for (int j = a[i]+1; j <= a[i+1]; ++j) {
                team[j] = tot;
            }
            ++tot;
        }
        for (int i = a[len-1]+1; i < h; ++i) team[i] = tot;
    }
    return tot;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.precision(10);
    cout << fixed;
#ifdef LOCAL_DEFINE
    freopen("input.txt", "r", stdin);
#endif

    cin >> h >> w >> k;
    for (int i = 0; i < h; ++i){
        for (int j = 0; j < w; ++j) {
            cin >> mat[i][j];
            val[i][j] = int(mat[i][j]-'0');
        }
    }
    int ans = h-1+w-1;
    for (int i = 0; i < (1<<(h-1)); ++i) {
        ms(team, -1);
        int cnt = makeTeam(i)-1;
        int now[50];
        ms(now, 0);
        bool impossible = false;
        int pref = 0;
        for (int j = 0; j < w; ++j) {
            for (int o = 0; o < h; ++o) {
                now[team[o]] += val[o][j];
                if (now[team[o]] > k) {
                    ms(now, 0);
                    ++cnt;
                    if (pref == j) impossible = true;
                    pref = j;
                    --j;
                    break;
                }
            }
            if (impossible) break;
        }
        if (!impossible) ans = min(ans, cnt);
    }
    cout << ans << '\n';

#ifdef LOCAL_DEFINE
    cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
#endif
    return 0;
}

F
题意：
输入n，s， 接下来输入n个数ai，现在定义f（l，r）为[l,r]区间内一段子序列（可以不连续）的数和为s的个数，（比如有三个数2，2, 4， s为4，因为2+2=4， 4=4， 所以f（1,3）= 2），因为[l,r]有n*（n-1）/2种可能，现在问你计算这全部情况然后加起来的答案是多少。

思路：
感觉思路很巧妙，比赛时没做出来，是道好题。
比较明显的可以想到从每个区间等于s的贡献度出发，一个区间的贡献度等于左边的长度*右边的长度，然而如果把每个区间都这么搞的话肯定又很多重复的，所以这题可以用dp[i][j]来表示处理到前i数的所有区间内和为j的个数（这样可以保证不重复），开始转移：
1.dp[i][j]=dp[i-1][j]+dp[i-1][j-a[i]] (a[i] <= j <= s)
2.dp[i][a[i]]=dp[i][a[i]]+i

ac代码：

/**
* Think twice, code once.
* 1.integer overflow(maybe even long long overflow : (a+b >= c) -> (a >= c-b)
* 2.runtime error
* 3.boundary condition
* ---------------------------------------------------------------------------------------
* Author : zzy
* Date : 2020-03-23-03.25.36 Sunday
*/
#include <bits/stdc++.h>

#define eb emplace_back
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
#define for1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define ford(i, a, b) for (int i = (int)(a); i >= (int)b; --i)
#define fore(i, a, b) for (int i = (int)(a); i <= (int)(b); ++i)
#define rep(i, l, r) for (int i = (l); i <= (r); i++)
#define per(i, r, l) for (int i = (r); i >= (l); i--)
#define ms(x, y) memset(x, y, sizeof(x))
#define SZ(x) ((int)(x).size())

using namespace std;

typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pii> vpi;
typedef vector<vi> vvi;
typedef long long i64;
typedef vector<i64> vi64;
typedef vector<vi64> vvi64;
typedef pair<i64, i64> pi64;
typedef double ld;

template<class T> bool uin(T &a, T b) { return a > b ? (a = b, true) : false; }
template<class T> bool uax(T &a, T b) { return a < b ? (a = b, true) : false; }

const i64 maxn = 3100;
const i64 mod = 998244353;
i64 dp[maxn][maxn], n, s, a[maxn], ans=0;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.precision(10);
    cout << fixed;
#ifdef LOCAL_DEFINE
    freopen("input.txt", "r", stdin);
#endif

    cin >> n >> s;
    for1(i, n) cin >> a[i];
    ms(dp, 0);
    for (int i = 1; i <= n; ++i) {
        for (int j = 0; j <= s; ++j) {
            dp[i][j] = dp[i-1][j];
        }
        for (int j = a[i]; j <= s; ++j) {
            dp[i][j] = (dp[i-1][j]+dp[i-1][j-a[i]])%mod;
        }
        dp[i][a[i]] = (dp[i][a[i]]+i)%mod;
        ans = (ans+dp[i][s])%mod;
    }
    cout << ans << '\n';

#ifdef LOCAL_DEFINE
    cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
#endif
    return 0;
}

滚动数组优化：

/**
* Think twice, code once.
* 1.integer overflow(maybe even long long overflow : (a+b >= c) -> (a >= c-b)
* 2.runtime error
* 3.boundary condition
* ---------------------------------------------------------------------------------------
* Author : zzy
* Date : 2020-03-23-03.25.36 Sunday
*/
#include <bits/stdc++.h>

#define eb emplace_back
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
#define for1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define ford(i, a, b) for (int i = (int)(a); i >= (int)b; --i)
#define fore(i, a, b) for (int i = (int)(a); i <= (int)(b); ++i)
#define rep(i, l, r) for (int i = (l); i <= (r); i++)
#define per(i, r, l) for (int i = (r); i >= (l); i--)
#define ms(x, y) memset(x, y, sizeof(x))
#define SZ(x) ((int)(x).size())

using namespace std;

typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pii> vpi;
typedef vector<vi> vvi;
typedef long long i64;
typedef vector<i64> vi64;
typedef vector<vi64> vvi64;
typedef pair<i64, i64> pi64;
typedef double ld;

template<class T> bool uin(T &a, T b) { return a > b ? (a = b, true) : false; }
template<class T> bool uax(T &a, T b) { return a < b ? (a = b, true) : false; }

const i64 maxn = 3100;
const i64 mod = 998244353;
i64 dp[maxn], n, s, a[maxn], ans=0;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.precision(10);
    cout << fixed;
#ifdef LOCAL_DEFINE
    freopen("input.txt", "r", stdin);
#endif

    cin >> n >> s;
    for1(i, n) cin >> a[i];
    ms(dp, 0);
    for (int i = 1; i <= n; ++i) {
        for (int j = s; j >= a[i]; --j) dp[j] = (dp[j]+dp[j-a[i]])%mod;
        dp[a[i]] = (dp[a[i]]+i)%mod;
        ans = (ans+dp[s])%mod;
    }
    cout << ans << '\n';

#ifdef LOCAL_DEFINE
    cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
#endif
    return 0;
}