U490259 OVOI T2 30pts求条
  • 板块学术版
  • 楼主11514zbs
  • 当前回复5
  • 已保存回复5
  • 发布时间2025/1/29 09:46
  • 上次更新2025/1/29 20:06:09
查看原帖
U490259 OVOI T2 30pts求条
1125106
11514zbs楼主2025/1/29 09:46
#include <cstdio>
long long n, x, x1, x2, sum;
int main()
{
    scanf("%lld", &n);
    for (int i = 0; i < n; i++)
    {
        scanf("%lld", &x);
        if (!(x))
        {
            x1++;
        }
        else if (x == 1)
        {
            x2 = 1;
        }
        else
        {
            x2 = (x2 == 1) ? 1 : 2;
        }
        sum += x;
    }
    if (n == 1)
    {
        printf("%lld\n", sum);
    }
    else if (x2 == 1 && x1)
    {
        sum += x1 << 1;
        printf("%lld\n", sum);
    }
    else if (!(x1))
    {
        printf("%lld\n", sum);
    }
    else
    {
        sum += (x1 << 1) - 1;
        printf("%lld\n", sum);
    }
    return 0;
}

Subtask#3 & Subtask#4 WA

2025/1/29 09:46
加载中...