关于vscode
  • 板块灌水区
  • 楼主thhuanghaizhe
  • 当前回复11
  • 已保存回复11
  • 发布时间2024/9/25 17:04
  • 上次更新2024/9/25 17:17:45
查看原帖
关于vscode
1260366
thhuanghaizhe楼主2024/9/25 17:04

rt为什么运行不了(code runner)
只有这一个运行不了,其他的都能运行

以下是我的代码

#include <bits/stdc++.h>
#define int long long

using namespace std;
const int MAXN = 5e7 + 5;
struct node
{
    int num;
    int s;
    bool bj = 0;
    friend bool operator<(const node &a, const node &b)
    {
        if (a.num != b.num)
            return a.num < b.num;
        return a.s < b.s;
    }
    friend bool operator>(const node &a, const node &b)
    {
        if (a.num != b.num)
            return a.num > b.num;
        return a.s > b.s;
    }
};
node msin[MAXN], mcos[MAXN];
int sin_cnt = 1, cos_cnt = 1;
string a[MAXN];

signed main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n;
    cin >> n;
    int ans = 0;
    for (int i = 1; i <= n; ++i)
    {
        node x;
        string s;
        int ssin = 0, ccos = 0;
        cin >> s;
        for (int i = 0; i < (int)s.size(); ++i)
        {
            if (s[i] == '+')
                continue;
            if (s[i] == 's')
                ssin++;
            if (s[i] == 'c')
                ccos++;
        }
        if (ssin == ccos)
        {
            ans += ssin;
            continue;
        }
        if (ssin > ccos)
        {
            x.num = ccos;
            x.s = ssin - ccos;
            msin[sin_cnt] = x;
            sin_cnt++;
            continue;
        }
        if (ssin < ccos)
        {
            x.num = ssin;
            x.s = ccos - ssin;
            mcos[cos_cnt] = x;
            cos_cnt++;
            continue;
        }
    }
    sort(msin + 1, msin + sin_cnt, greater<node>());
    sort(mcos + 1, mcos + cos_cnt, greater<node>());
    for (int i = 1; i < sin_cnt; ++i)
        for (int j = 1; j < cos_cnt; ++j)
            if (msin[i].s == mcos[j].s && !mcos[j].bj)
            {
                ans += msin[i].num + mcos[j].num + msin[i].s;
                mcos[j].bj = 1;
                continue;
            }
    cout << ans << endl;

    return 0;
}
2024/9/25 17:04
加载中...