QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#695877#9528. New Energy VehicleScarlett_boy#WA 1ms5760kbC++171.0kb2024-10-31 20:58:412024-10-31 20:58:43

Judging History

This is the latest submission verdict.

  • [2024-10-31 20:58:43]
  • Judged
  • Verdict: WA
  • Time: 1ms
  • Memory: 5760kb
  • [2024-10-31 20:58:41]
  • Submitted

answer

#include "bits/stdc++.h"

typedef long long ll;

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

ll tmp = 0, last = 0;

void calcR() {
    if (r + 1 <= m && tmp >= x[r + 1]) r++;
}

void calcL() {
    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;
        }
    }
}

void solve() {
    cin >> n >> m;
    for (int i = 1; i <= n; i++) cin >> A[i];
    for (int i = 1; i <= m; i++) cin >> x[i] >> t[i];
    tmp = 0, last = 0;
    l = 0, r = 0;
    for (int i = 1; i <= n; i++) tmp += A[i];
    for (int i = 1; i <= 4 * max(n, m); i++) {
        calcL(), calcR();
    }
    cout << tmp << '\n';
}

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

1
1 4
2
1 1
2 1
3 1
4 1

 */

详细

Test #1:

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

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: 1ms
memory: 5760kb

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'