QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#788422 | #9528. New Energy Vehicle | CSQ# | WA | 0ms | 3576kb | C++20 | 857b | 2024-11-27 16:52:18 | 2024-11-27 16:52:30 |
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;
int sum = 0;
vector<int>a(n),x(m),t(m),d(m+1,4e18);
for(int i=0;i<n;i++){
cin>>a[i];
sum += a[i];
}
for(int i=0;i<m;i++){
cin>>x[i]>>t[i];
t[i]--;
}
for(int i=0;i<m;i++){
if(!i)d[i] = x[i];
else d[i] = x[i] - x[i-1];
}
int ans = 0;
for(int i=0;i<m;i++){
if(d[i] > sum)break;
ans += min(d[i],a[t[i]]);
int lf = max(0LL,d[i]-a[t[i]]);
d[i+1] += lf;
}
ans += sum;
cout<<ans<<'\n';
}
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3576kb
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: 3572kb
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'