QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#693770 | #9528. New Energy Vehicle | nahida_qaq | WA | 1ms | 7740kb | C++23 | 950b | 2024-10-31 16:43:13 | 2024-10-31 16:43:15 |
Judging History
answer
#include <bits/stdc++.h>
#define int long long
#define io ios::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define pb push_back
using namespace std;
const int N=1e6+5,mod1=1e9+7,mod2=998244353,inf=1e18;
typedef pair<int,int> pi;
int a[N];
int x[N],y[N];
void solve()
{
int n,m;
cin>>n>>m;
int ans=0;
for(int i=1;i<=n;i++)
{
cin>>a[i];
ans+=a[i];
}
//cout<<ans<<'\n';
for(int i=1;i<=m;i++)cin>>x[i]>>y[i];
int last=0;
for(int i=1;i<=m;i++)
{
if(ans>=x[i])
{
ans+=min(a[y[i]],x[i]-x[i-1]+last);
last+=max(0ll,x[i]-x[i-1]-a[y[i]]);
// if(a[y[i]]<=x[i]-x[i-1])ans+=a[y[i]];
// else
// {
// }
}
else break;
}
cout<<ans<<'\n';
}
signed main()
{
io;
int t=1;
cin>>t;
while(t--)
{
solve();
}
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 1ms
memory: 7740kb
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: 7672kb
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'