QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#682103 | #9528. New Energy Vehicle | Tggdb# | WA | 1ms | 5688kb | C++20 | 1.0kb | 2024-10-27 13:56:04 | 2024-10-27 13:56:06 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ull unsigned long long
#define endl "\n"
using namespace std;
const int N = 1e5+5;
pair<int, int>op[N];
int a[N];
signed main(void)
{
ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
int t;
cin >> t;
while (t--)
{
int n, m;
cin >> n >> m;
int sumnow = 0;
for (int i = 1; i <= n; i++)
{
cin >> a[i];
sumnow += a[i];
}
for (int i = 1; i <= m; i++)
{
cin >> op[i].first >> op[i].second;
}
int now = 0;
int havenow = 0;
int anw = 0;
for (int i = 1; i <= m; i++)
{
int cango = sumnow - havenow;
if (cango < op[i].first - op[i - 1].first)
{
anw += cango;
break;
}
else
{
havenow += op[i].first - op[i - 1].first;
if (a[op[i].second] >= havenow)
{
havenow = 0;
}
else
{
havenow -= a[op[i].second];
}
anw += op[i].first - op[i - 1].first;
}
}
anw += sumnow - havenow;
cout << anw << endl;
}
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 1ms
memory: 5688kb
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: 3552kb
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 8 11 1999999998 2000000000
result:
wrong answer 1st lines differ - expected: '9', found: '10'