Codeforces 899 1-N两非空集合最小差 末尾最多9对数计算 pair/链表加优先队列最少次数清空

A

/*Huyyt*/
#include<bits/stdc++.h>
#define mem(a,b) memset(a,b,sizeof(a))
#define pb push_back
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const ll LLmaxn = 2e18;
const int N = ;
int main()
{
        int one = ;
        int two = ;
        int n;
        cin >> n;
        for (int i = ; i <= n; i++)
        {
                int now;
                cin >> now;
                if (now == )
                {
                        one++;
                }
                else
                {
                        two++;
                }
        }
        if (one < two)
        {
                cout << one << endl;
        }
        else
        {
                cout << two + (one - two) /  << endl;
        }
        return ;
}

B

/*Huyyt*/
#include<bits/stdc++.h>
#define mem(a,b) memset(a,b,sizeof(a))
#define pb push_back
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const ll LLmaxn = 2e18;
const int N = ;
int month1[] = {, , , , , , , , , , , , };
int month2[];
int now[];
int m[];
int cnt = ;
bool ok(int x)
{
        if (x %  == )
        {
                return true;
        }
        if (x %  ==  && x %  > )
        {
                return true;
        }
        return false;
}
int main()
{
        for (int i = ; i <= ; i++)
        {
                month2[i] = month1[i];
        }
        month2[] = ;
        for (int i = ; i <= ; i++)
        {
                if (ok(i))
                {
                        for (int j = ; j <= ; j++)
                        {
                                now[++cnt] = month2[j];
                        }
                }
                else
                {
                        for (int j = ; j <= ; j++)
                        {
                                now[++cnt] = month1[j];
                        }
                }
        }
        int n;
        cin >> n;
        for (int i = ; i <= n; i++)
        {
                cin >> m[i];
        }
        for (int i = ; i <=  + ; i++)
        {
                for (int j = ; j <= n + ; j++)
                {
                        if (j == n + )
                        {
                                cout << "Yes" << endl;
                                return ;
                        }
                        if (now[i + j] != m[j])
                        {
                                break;
                        }
                }
        }
        cout << "No" << endl;
}

C

/* Huyyt */
#include <bits/stdc++.h>
#define mem(a,b) memset(a,b,sizeof(a))
#define mkp(a,b) make_pair(a,b)
#define pb push_back
using namespace std;
typedef long long ll;
const long long mod = 1e9 + ;
const int N = 1e6 + ;
vector<int> ans;
int main()
{
        ll n;
        cin >> n;
        ll sum = (n + ) * n / ;
        ll want = sum / ;
        if (sum % )
        {
                cout <<  << endl;
                for (int i = n; i >= ; i--)
                {
                        if (i <= want)
                        {
                                ans.pb(i);
                                want -= i;
                        }
                }
                cout << ans.size() << " ";
                for (int ch : ans)
                {
                        cout << ch << " ";
                }
                cout << endl;
                return ;
        }
        else
        {
                cout <<  << endl;
                for (int i = n; i >= ; i--)
                {
                        if (i <= want)
                        {
                                ans.pb(i);
                                want -= i;
                        }
                }
                cout << ans.size() << " ";
                for (int ch : ans)
                {
                        cout << ch << " ";
                }
                cout << endl;
                return ;
        }
}

D

/* Huyyt */
#include <bits/stdc++.h>
#define mem(a,b) memset(a,b,sizeof(a))
#define mkp(a,b) make_pair(a,b)
#define pb push_back
using namespace std;
typedef long long ll;
const long long mod = 1e9 + ;
const int N = 1e6 + ;
vector<int> ans;
int main()
{
        ll now = ;
        ll aim = ;
        ll n;
        cin >> n;
        ll anser = ;
        if (n < )
        {
                cout << (n - )*n /  << endl;
                return ;
        }
        while (n >= now)
        {
                now *= ;
                aim++;
        }
        ll remain = ;
        ll ten = ;
        for (int i = ; i <= aim - ; i++)
        {
                remain *= ;
                ten *= ;
                remain += ;
        }
        //cout << remain << endl;
        //cout << ten << endl;
        ll cnt;
        for (int i = ; i <= ; i++)
        {
                cnt = ten * i + remain;
                if (n < (cnt + ) / )
                {
                        break;
                }
                if (n >= cnt)
                {
                        anser += 1LL * cnt / ;
                }
                else
                {
                        anser += n +  - (cnt + ) / ;
                }
        }
        cout << anser << endl;
}

E

/* Huyyt */
#include <bits/stdc++.h>
#define mem(a,b) memset(a,b,sizeof(a))
#define mkp(a,b) make_pair(a,b)
#define pb push_back
using namespace std;
typedef long long ll;
const long long mod = 1e9 + ;
const int N = 2e5 + ;
int cnt = ;
int t1, t2;
int pre[N], Next[N], num[N], col[N];
priority_queue<pair<int, int> > que, del;
int main()
{
        int anser = ;
        int x;
        int n;
        cin >> n;
        for (int i = ; i <= n; i++)
        {
                cin >> x;
                if (x == col[cnt])
                {
                        num[cnt]++;
                }
                else
                {
                        col[++cnt] = x;
                        num[cnt] = ;
                }
        }
        for (int i = ; i <= cnt; i++)
        {
                pre[i] = i - , Next[i] = i + ;
                que.push(mkp(num[i], -i));
        }
        while (cnt)
        {
                while (!del.empty() && que.top() == del.top()) //如果区间已经被合并不存在
                {
                        que.pop();
                        del.pop();
                }
                x = -que.top().second;
                que.pop();
                t1 = pre[x], t2 = Next[x];
                Next[t1] = t2, pre[t2] = t1;
                if (t1 && col[t1] == col[t2])
                {
                        del.push(mkp(num[t2], -t2));
                        del.push(mkp(num[t1], -t1));
                        num[t1] += num[t2];
                        Next[t1] = Next[t2];
                        pre[Next[t2]] = t1;
                        que.push(mkp(num[t1], -t1));
                        cnt--;
                }
                cnt--;
                anser++;
        }
        cout << anser << endl;
}