Codeforces Round #493 (Div. 2) （1800分纪念）

A.Balloons
题意：给出长度为n的数组，问是否可以分成两组和不一样的数组，n<=10
题解：由于n很小，所以枚举子集就好了

#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define CLR(a) memset(a, 0, sizeof(a))
#define DBG(x) cout<<(#x)<<"="<<x<<endl
#define FOR(i, a, b)  for(int i=(a); i<(b); i++)
#define REP(i, a, b)  for(int i=(a); i<=(b); i++)
#define DOWN(i, a, b) for(int i=(a); i>=(b); i--)

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const double eps = 1e-8;
const int INF = 0x3f3f3f3f;
const ll LL_INF = 0x3f3f3f3f3f3f3f3f;
const ll mod = 1000000009;
const int N = 1e3 + 10;

int a[N], n, cnt, t, t2;
int sum;

int main() {
    cin>>n;
    REP(i, 1, n) {
        cin>>a[i];
        sum+=a[i];
    }
    REP(i, 1, (1<<n)-2) {
        t=0;
        cnt=0;
        for(int j=0; j<n; j++) {
            if ((1<<j)&i) {
                t+=a[j+1];
                cnt++;
            }
        }
        t2=sum-t;
        if (t!=t2) {
            cout<<cnt<<endl;
            for(int j=0; j<n; j++) {
                if ((1<<j)&i) {
                    cout<<j+1<<endl;
                    return 0;
                }
            }
        }
    }
    cout<<-1<<endl;
    //cout<<1.*clock()/CLOCKS_PER_SEC<<"ms"<<"\n";
    return 0;
}

B.Cutting
题意：给出一个长度为n的好数组和一个数B，定义好数组为偶数个数等于奇数个数的数组，问最多能切多少刀，切一刀的代价为相邻两元素的差的绝对值
题解：偶数看成+1，奇数看成-1，能切的地方为前缀和为0的地方，把所有能切的地方的代价排个序就好，从小切到大就好了

#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define CLR(a) memset(a, 0, sizeof(a))
#define DBG(x) cout<<(#x)<<"="<<x<<endl
#define FOR(i, a, b)  for(int i=(a); i<(b); i++)
#define REP(i, a, b)  for(int i=(a); i<=(b); i++)
#define DOWN(i, a, b) for(int i=(a); i>=(b); i--)

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const double eps = 1e-8;
const int INF = 0x3f3f3f3f;
const ll LL_INF = 0x3f3f3f3f3f3f3f3f;
const ll mod = 1000000009;
const int N = 1e3 + 10;

int n, b, a[N];
vector<int> t;
int cnt, ans;

int main() {
    cin>>n>>b;
    REP(i, 1, n) {
        cin>>a[i];
    }
    REP(i, 1, n) {
        if (a[i]%2==0) cnt++;
        if (a[i]%2==1) cnt--;
        if (cnt==0&&i!=n) {
            t.pb(abs(a[i]-a[i+1]));
        }
    }
    sort(t.begin(), t.end());
    FOR(i, 0, t.size()) {
        int u=t[i];
        if (b>=u) {
            b-=u;
            ans++;
        }
        else break;
    }
    cout<<ans<<endl;
    //cout<<1.*clock()/CLOCKS_PER_SEC<<"ms"<<"\n";
    return 0;
}

C.Convert To Ones
题意：给出一个01字符串，给出两种操作和两种操作的花费，第一种操作reverse一段序列，另一种操作为翻转一段序列，问全部变成1的最小花费
题解：01序列一般可以压缩，比如000111001，可以变成0101，简单算一下样例，可以注意到答案应该只与0的段数有关系，消除一段0的花费为x，将一段0变为1的花费为y，枚举一下消除多少次就好了

#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define CLR(a) memset(a, 0, sizeof(a))
#define DBG(x) cout<<(#x)<<"="<<x<<endl
#define FOR(i, a, b)  for(int i=(a); i<(b); i++)
#define REP(i, a, b)  for(int i=(a); i<=(b); i++)
#define DOWN(i, a, b) for(int i=(a); i>=(b); i--)

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const double eps = 1e-8;
const int INF = 0x3f3f3f3f;
const ll LL_INF = 0x3f3f3f3f3f3f3f3f;
const ll mod = 1000000009;
const int N = 3e5 + 10;

ll n, x, y, t;
char s[N];
ll ans;

int main() {
    cin>>n>>x>>y;
    scanf("%s", s+1);
    int len=strlen(s+1);
    for(int i=1; i<=len; i++) {
        if (s[i]=='1') continue;
        int j=i;
        while(s[j+1]=='0'&&j<=len-1) j++;
        t++;
        i=j;
    }
    if (t==0) {
        cout<<0<<endl;
        return 0;
    }
    ans=LL_INF;
    REP(i, 0, t-1) {
        ll tmp=i*x+(t-i)*y;
        ans=min(tmp, ans);
    }
    cout<<ans<<endl;
    //cout<<1.*clock()/CLOCKS_PER_SEC<<"ms"<<"\n";
    return 0;
}

D.Roman Digits
题意：用n位字符可以表示多少个不同数字，每位字符可以表示1，5，10，50其中一个
题解：遇事不决先打表。。

#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define CLR(a) memset(a, 0, sizeof(a))
#define DBG(x) cout<<(#x)<<"="<<x<<endl
#define FOR(i, a, b)  for(int i=(a); i<(b); i++)
#define REP(i, a, b)  for(int i=(a); i<=(b); i++)
#define DOWN(i, a, b) for(int i=(a); i>=(b); i--)

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const double eps = 1e-8;
const int INF = 0x3f3f3f3f;
const ll LL_INF = 0x3f3f3f3f3f3f3f3f;
const ll mod = 1000000009;
const int N = 1e3 + 10;

ll n;
ll ans;
set<int> S;
vector<int> V;

int main() {
    V.pb(0);
    REP(i, 1, 50) {
        S.clear();
        REP(a, 0, i) {
            REP(b, 0, i) {
                REP(c, 0, i) {
                    REP(d, 0, i) {
                        if ((a+b+c+d)!=i) continue;
                        S.insert(a+5*b+10*c+50*d);

                    }
                }
            }
        }
        // cout<<S.size()<<endl;
        V.pb(S.size());
    }
    // FOR(i, 0, V.size()) {
    //  cout<<V[i+1]-V[i]<<endl;
    // }
    cin>>n;
    if (n>20) {
        ans=(n-20)*49+V[20];
    }
    else ans=V[n];
    cout<<ans<<endl;
    //cout<<1.*clock()/CLOCKS_PER_SEC<<"ms"<<"\n";
    return 0;
}

迷茫中