QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#695678#9528. New Energy VehicleScarlett_boy#WA 1ms7812kbC++171.1kb2024-10-31 20:33:572024-10-31 20:33:58

Judging History

This is the latest submission verdict.

  • [2024-10-31 20:33:58]
  • Judged
  • Verdict: WA
  • Time: 1ms
  • Memory: 7812kb
  • [2024-10-31 20:33:57]
  • Submitted

answer

#include "bits/stdc++.h"

typedef long long ll;

using namespace std;
const int N = 2e5 + 10;
int n, m;
ll A[N], val[N];
ll x[N];
int t[N];

void solve() {
    cin >> n >> m;
    for (int i = 1; i <= n; i++) cin >> A[i], val[i] = A[i];
    for (int i = 1; i <= m; i++) cin >> x[i] >> t[i];
    t[m + 1] = 0;
    int l = 0, r = 0, mid;
    ll tmp = 0, last = 0;
    for (int i = 1; i <= n; i++) tmp += val[i];
    while (r + 1 <= m) {
        int it = r;
        while (r + 1 <= m && tmp >= x[r + 1]) r++;
        while (l < r) {
            last += x[l + 1] - x[l];
            l++;
            if (last >= A[t[l]]) {
                last -= A[t[l]];
                tmp += A[t[l]];
            } else {
                tmp += last;
                last = 0;
            }
        }
        while (r + 1 <= m && tmp >= x[r + 1]) r++;
        if (it == r) break;
    }
    cout << tmp << '\n';
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int _ = 1;
    cin >> _;
    while (_--) {
        solve();
    }
    return 0;
}
/*

1
3 1
3 3 3
8 1

 */

詳細信息

Test #1:

score: 100
Accepted
time: 1ms
memory: 7812kb

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: 7804kb

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:

8
11
4
11
999999999
2000000000

result:

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