QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#690067 | #9528. New Energy Vehicle | wzdxhxx | WA | 104ms | 14396kb | C++17 | 1.0kb | 2024-10-30 20:06:47 | 2024-10-30 20:06:47 |
Judging History
answer
#include <bits/stdc++.h>
#define int long long
using namespace std;
int t;
int n,m;
int a[200005];
signed main(){
ios::sync_with_stdio(false);
cin.tie(nullptr);
cin>>t;
while(t--){
cin>>n>>m;
int sum=0;
vector<pair<int,int> > v;
for(int i=1;i<=n;i++){
cin>>a[i];
sum+=a[i];
}
map<int,int> ma;
map<int,int> fa;
int x,w;
for(int i=1;i<=m;i++){
cin>>x>>w;
v.push_back({x,w});
fa[x]=ma[w];
ma[w]=x;
}
int ff=0;
for(int i=0;i<m;i++){
x=v[i].first;
w=v[i].second;
if(fa[x]!=0){
sum-=x-v[i-1].first;
if(sum<0){
sum+=x-v[i-1].first;
break;
}
sum+=min(a[w],x-fa[x]);
}else{
if(i==0){
sum-=v[i].first;
if(sum<0){
sum+=v[i].first;
break;
}
sum+=min(a[v[i].second],v[i].first);
}else{
sum-=x-v[i-1].first;
if(sum<0){
sum+=x-v[i-1].first;
break;
}
sum+=min(a[w],x-v[i-1].first);
}
}
ff=x;
}
int ans=0;
ans=ff+sum;
cout<<ans<<'\n';
}
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3812kb
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: 0
Accepted
time: 0ms
memory: 3780kb
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 4 11 999999999 2000000000
result:
ok 6 lines
Test #3:
score: -100
Wrong Answer
time: 104ms
memory: 14396kb
input:
10 230 8042 599 1039 69 1011 1366 824 14117 1523 806 5002 332 55 3769 996 359 1040 255 1135 3454 3609 6358 2509 3695 8785 3890 1304 3394 14611 33 89 2245 508 22 1043 10411 628 1279 714 903 585 7413 5099 845 148 4689 2110 8683 1613 143 3263 2599 110 244 3297 4742 1571 425 1822 15692 572 9397 328 1691...
output:
16754067 27330570 2606328 41046941 14466841 39705883 854645 46191028 987605 893808
result:
wrong answer 1st lines differ - expected: '1543020', found: '16754067'