QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#788069 | #9528. New Energy Vehicle | CSQ# | WA | 0ms | 3592kb | C++20 | 947b | 2024-11-27 15:48:37 | 2024-11-27 15:48:37 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define sz(a) (int)(a.size())
signed main()
{
int T;
cin>>T;
while(T--){
int n, m;
cin >> n >> m;
vector<int> bat(n);
for ( int& a: bat ) cin >> a;
int prev = 0;
int oob = 0;
int remain = 0;
for ( int& a: bat ) remain += a;
int x, t;
bool done = false;
while ( m-- ) {
cin >> x >> t; t--;
if ( done ) continue;
remain -= x-prev;
if ( remain < 0 ) {
cout << x+remain << '\n';
done = true;
continue;
}
oob += x-prev;
int charge = min(bat[t], oob);
remain += charge;
oob -= charge;
prev = x;
}
if ( !done ) cout << prev+remain << '\n';
}
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3592kb
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: 3592kb
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'