QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#690513 | #9528. New Energy Vehicle | yazhi | WA | 0ms | 3620kb | C++14 | 986b | 2024-10-30 22:46:51 | 2024-10-30 22:46:52 |
Judging History
answer
#include <iostream>
#include <map>
#include <vector>
#define int long long
using namespace std;
const int N = 2e5+5;
int n,m,a[N];
void solve() {
cin >> n >> m;
int sum = 0;
for(int i=1;i<=n;i++) cin >> a[i],sum+=a[i];
int pre = 0;
int tot = 0;
int flag = 0;
for(int i=1;i<=m;i++) {
int x,y;
cin >> x >> y;
if(flag == 1) continue;
x = x - pre;
// cout << x << endl;
if(sum >= x) sum -= x;
else {
cout << pre + sum << endl;
for(;i<m;i++) cin >> x >> y;
return;
flag = 1;
}
tot += x;
int dis = min(tot,a[y]);
// cout<<dis<<' '<<sum<<endl;
tot -= dis;
sum += dis;
// cout << sum << endl;
pre = pre + x;
}
cout << pre + sum << endl;
}
signed main() {
int t;
cin >> t;
// t = 1;
while(t--) solve();
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3608kb
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: 3620kb
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'