QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#683009#9528. New Energy VehiclealheWA 0ms3544kbC++231.1kb2024-10-27 18:22:262024-10-27 18:22:27

Judging History

This is the latest submission verdict.

  • [2024-10-27 18:22:27]
  • Judged
  • Verdict: WA
  • Time: 0ms
  • Memory: 3544kb
  • [2024-10-27 18:22:26]
  • Submitted

answer

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define re register
#define lowbit(x) (x & (-x))
typedef pair<int, int> PII;
const int INF = 1e18;
const int N = 1e5 + 10;
void solve()
{
    int n, m;
    cin >> n >> m;
    vector<int> a(n + 1);
    int sum = 0;
    for (int i = 1; i <= n; i++)
        cin >> a[i], sum += a[i];
    int now = 0, ans = 0, la = 0, f = 0, ll = 0, ma = sum;
    while (m--)
    {
        int l, p;
        cin >> l >> p;
        la = l;
        l -= ll;
        if (f)
            continue;
        if (a[p] - l >= 0)
        {
            ans += l;
            now -= a[p] - l;
            if (sum < ma)
                sum += a[p] - l;
        }
        else if (sum >= l)
        {
            sum -= (l - a[p]);
            now += l - a[p];
            ans += l;
        }
        else
            f = 1;
        ll = la;
    }
    ans += sum;
    cout << ans << '\n';
}
int T = 1;
signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    cin >> T;
    while (T--)
        solve();
    return 0;
}

詳細信息

Test #1:

score: 100
Accepted
time: 0ms
memory: 3508kb

input:

2
3 1
3 3 3
8 1
2 2
5 2
1 2
2 1

output:

12
9

result:

ok 2 lines

Test #2:

score: -100
Wrong Answer
time: 0ms
memory: 3544kb

input:

6
3 2
2 2 2
6 1
7 1
2 2
3 3
2 1
6 2
2 3
2 2
5 1
7 2
9 1
2 2
3 3
2 1
6 2
1 1
999999999
1000000000 1
1 1
1000000000
1000000000 1

output:

10
11
4
11
999999999
2000000000

result:

wrong answer 1st lines differ - expected: '9', found: '10'