QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#687734 | #9528. New Energy Vehicle | 1926406757 | WA | 0ms | 3660kb | C++14 | 612b | 2024-10-29 20:55:17 | 2024-10-29 20:55:18 |
Judging History
answer
#include<iostream>
using namespace std;
typedef long long ll;
const int N=1e5+10;
ll a[N],x[N],t[N];
int main()
{
cin.tie(0),cout.tie(0),ios::sync_with_stdio(false);
int T;
cin>>T;
while(T--)
{
ll res=0;
int n,m;
cin>>n>>m;
for(int i=1;i<=n;i++) cin>>a[i],res+=a[i];
for(int i=1;i<=m;i++) cin>>x[i]>>t[i];
int es=0;
for(int i=1;i<=m;i++)
{
if(res+x[i-1]<x[i])
{
es=i-1;
break;
}
if(a[t[i]]>=x[i]-x[i-1]) res=res;
else res=res-x[i]+x[i-1]+a[t[i]];
}
if(es==0) cout<<res+x[m]<<endl;
else cout<<res+a[es]<<endl;
}
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3660kb
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: 3588kb
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:
9 11 13 11 1999999999 2000000000
result:
wrong answer 3rd lines differ - expected: '4', found: '13'