2024牛客寒假算法基础集训营2

A.Tokitsukaze and Bracelet

签到题，直接上代码。

#include
using namespace std;
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    int T; cin >> T;
    while (T--){
        int a, b, c;
        cin >> a >> b >> c;
        int ans = 0;
        ans += (a - 100) / 50;
        if (b > 32 && b  32 && c > m >> k;
    int ans = 0;
    for (int i = 0; i > x >> y;
        if (st[{x - 1, y}] == false) ans++;
        if (st[{x + 1, y}] == false) ans++;
        if (st[{x, y - 1}] == false) ans++;
        if (st[{x, y + 1}] == false) ans++;
        st[{x, y}] = true;
    }
    cout > T;
    while (T--){
        int n; cin >> n;
        vector a(n);
        for (int i = 0; i > a[i];
        map mp;
        for (int i = 0; i = t) mp[1].pop_back();
            while (mp[2].size() && mp[2].back() >= t) mp[2].pop_back();
        }
        cout  T;
    while (T--){
        int n; cin >> n;
        vector a(n);
        for (int i = 0; i > a[i];
        map mp;
        for (int i = 0; i = 0){
            int res = t;
            vector c;
            //遍历每一中颜色
            for (auto &[x, y] : mp){ //一定要使用&带修，不然也会WA
                while (y.size() && y.back() > t) y.pop_back(); //将上一次操作后应该删除的数字删除
                if (y.size()) res = min(res, y.back()); //取所有颜色的最右端中最小的一个
                else c.push_back(x); //某个数字不再出现在剩下的数组中
            }
            //从map中删除已经删完的数字
            for (auto x : c){
                mp.erase(x);
            }
            t = res - 1;
            ans++;
        }
        cout  T;
    while (T--){
        ll n;
        cin >> n;
        vector a(n + 5);
        for (int i = 1; i > a[i];
        if (n == 1){
            cout  a[i];
        if (n == 1){
            cout  n;
        string s; cin >> s;
        cin >> y;
        int ans = 0;
        for (a[0] = 0; a[0]