QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#546904 | #7964. 转化 | wangjingheng# | WA | 81ms | 25224kb | C++20 | 1.2kb | 2024-09-04 15:40:31 | 2024-09-04 15:40:32 |
Judging History
answer
#include<bits/stdc++.h>
#define int long long
#define db long double
using namespace std;
const int N=5e5+10;
int a[N],b[N],c[N],f[N],s[N],ss[N];
void solve(){
int n;cin>>n;
for(int i=1;i<=n;i++) cin>>a[i];
for(int i=1;i<=n;i++) cin>>c[i];
for(int i=1;i<=n;i++) cin>>b[i];
for(int i=1;i<=n;i++){
//转移
if(a[i]==0){
f[i]=min(b[i]+1,c[i])-1;
ss[i]=ss[i-1]+f[i];
s[i]=s[i-1];
}
else{
int mid=c[i]-a[i];
// mid=max(0ll,mid);
mid=min(mid,b[i]);
f[i]=a[i]+mid;
ss[i]=ss[i-1];
s[i]=f[i]+s[i-1];
}
}
for(int i=1;i<=n;i++){
if(a[i]){
int res=a[i]+b[i]+s[n]-f[i];
if(ss[n]&&s[n]){
res+=ss[n];
}
cout<<res<<" ";
}
else{
int res=b[i]+s[n];
if(s[n]&&ss[n]) res+=ss[n]-f[i];
if(!s[n]) res=0;
cout<<res<<" ";
}
}
int ans=0;
cout<<"\n";
for(int i=1;i<=n;i++){
ans+=a[i]+b[i];
}
cout<<ans;
}
signed main(){
ios::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
// int T;cin>>T;
// while(T--)
solve();
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 81ms
memory: 25224kb
input:
351493 0 37836791 46095966 46912389 21595941 0 3 86568894 3 0 0 0 0 39910208 0 2 4 86885825 1 67660833 0 24488082 52447896 0 67190942 70457491 11166998 90470470 11095822 0 0 5 47222930 2 49736354 0 0 0 77339472 0 5 3 0 25347727 0 3 2 0 48844622 0 65142757 1 73733079 80634668 46683173 0 31644647 9760...
output:
60073965049724 60073472376204 60073472376204 60073481727701 60073472376204 60073788737330 60073528128564 60073472376204 60073844358663 60073784179153 60073472376204 60073472376204 60073948665985 60073472376204 60073472376204 60073667185445 60073550333929 60073472376204 60073631548329 60073472376204 ...
result:
ok 2 lines
Test #2:
score: -100
Wrong Answer
time: 51ms
memory: 24912kb
input:
351493 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 3 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 3 2 0 0 0 0 0 0 0 0 0 0 0 0 0 0 2 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 1 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0...
output:
388926442 772736063 284712941 34822711 -169739 959846114 229990383 741978839 421987176 716309259 558961765 167197252 440347255 979741773 288644113 -169739 37456922 995280450 890324547 918791639 697029738 651590098 818279524 248403041 345516429 145652403 168899798 798225416 375078239 724349412 344862...
result:
wrong answer 1st lines differ - expected: '389246793 773056414 285033292 ...47596 273937941 15883376 150613', found: '388926442 772736063 284712941 ...245 273617590 15563025 -169739 '