QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#725343 | #9528. New Energy Vehicle | bluejellyfish | WA | 0ms | 3772kb | C++23 | 1016b | 2024-11-08 17:13:06 | 2024-11-08 17:13:07 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
#define pii pair<int,int>
#define int long long
#define x first
#define y second
void miss() {
int n,m;
cin >> n >> m;
vector<int>ai(n + 1);
int zlm = 0;
for(int i = 1; i <= n; i++) {
cin >> ai[i];
zlm += ai[i];
}
pii q[m + 1];
for(int i = 1; i <= m; i++) {
cin >> q[i].x >> q[i].y;
}
int len = 0;
int qqq = 0;
for(int i = 1; i <= m; i++) {
len = q[i].x - q[i - 1].x;
if(len + qqq > zlm) {
cout << q[i - 1].x + (zlm - qqq) << endl;
return;
}else {
if(len + qqq > ai[q[i].y]) {
qqq = (len + qqq) - ai[q[i].y];
}
else {
qqq = 0;
}
}
}
cout << q[m].x + (zlm - qqq) << endl;
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int T = 1;
cin >> T;
while(T--) miss();
//system("pause");
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3584kb
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: 3772kb
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'