QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#692912 | #9528. New Energy Vehicle | candy34# | WA | 0ms | 3776kb | C++14 | 857b | 2024-10-31 15:12:48 | 2024-10-31 15:12:53 |
Judging History
answer
#include <iostream>
#include <cstdio>
#include <cctype>
#define il inline
#define ll long long
#define int long long
#define gc getchar
using namespace std;
il int read() {
int x=0;bool f=0;char ch=gc();
while(!isdigit(ch)) {f|=ch=='-';ch=gc();}
while(isdigit(ch)) {x=(x<<1)+(x<<3)+(ch^48);ch=gc();}
return f?-x:x;
}
const int N=1e5+10;
int T,n,m;
int a[N];
int x[N],t[N];
signed main() {
T=read();
while(T--) {
n=read();m=read();
int sum=0;
int now=0;
for(int i=1;i<=n;++i) {
a[i]=read();
sum+=a[i];
}
now=sum;
for(int i=1;i<=m;++i) {
x[i]=read();t[i]=read();
}
int xb=0;
for(int i=1;i<=m;++i) {
if(now>=x[i]-x[i-1]) {
now-=(x[i]-x[i-1]);
xb=i;
now+=a[t[i]];
now=min(now,sum);
}
else break;
}
printf("%lld\n",x[xb]+now);
}
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3752kb
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: 3776kb
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'