QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#683839 | #9528. New Energy Vehicle | star | WA | 1ms | 5660kb | C++20 | 836b | 2024-10-28 00:22:34 | 2024-10-28 00:22:34 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int long long
const int N=1e5+5;
int a[N],x[N],t[N];
void slove(){
int n,m;
cin>>n>>m;
int sum=0;
for(int i=1;i<=n;i++){
cin>>a[i];
sum+=a[i];
}
for(int i=1;i<=m;i++){
cin>>x[i]>>t[i];
}
int sum1=0,ans=0;
int las=0;
for(int i=1;i<=m;i++){
if(sum<x[i])break;
int p=x[i]-las-sum1;
sum1+=a[t[i]];
if(sum1<=x[i]-las){
//cout<<"gg"<<'\n';
sum+=a[t[i]];
//continue;
}
else{
ans+=x[i]-las;
sum+=p;
sum1=0;
las=x[i];
}
}
cout<<sum<<'\n';
}
signed main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t;
cin>>t;
while(t--){
slove();
}
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3636kb
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: 5660kb
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'