QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#788028 | #9528. New Energy Vehicle | CSQ# | RE | 0ms | 3564kb | C++20 | 843b | 2024-11-27 15:39:53 | 2024-11-27 15:39:55 |
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;
while ( m-- ) {
cin >> x >> t; t--;
remain -= x-prev;
if ( remain < 0 ) {
cout << x+remain << '\n';
break;
}
oob += x-prev;
int charge = min(bat[t], oob);
remain += charge;
oob -= charge;
prev = x;
if ( m == 0 ) cout << prev+remain << '\n';
}
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3564kb
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
Runtime Error
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 24