QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #354072 | #7964. 转化 | Bilkyes | WA | 73ms | 14708kb | C++17 | 847b | 2024-03-14 21:16:21 | 2024-03-14 21:16:22 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
#define f first
#define s second
#define pb push_back
#define int long long
typedef long long ll;
typedef pair<int,int> PII;
const int N=4e5,M=320,mod=1e18;
int T;
int n,ans=0,sum=0;
struct ball{
int a,b,c,d;
}e[N];
int s[N];
void solve()
{
cin>>n;
for(int i=1;i<=n;i++) cin>>e[i].a;
for(int i=1;i<=n;i++) cin>>e[i].b;
for(int i=1;i<=n;i++)
{
cin>>e[i].c;
ans+=e[i].a+e[i].c;
if(e[i].b<e[i].a+e[i].c) sum+=e[i].b;
else sum+=e[i].a+e[i].c;
}
for(int i=1;i<=n;i++)
{
if(e[i].b<e[i].a+e[i].c)
cout<<sum-e[i].b+e[i].a+e[i].c;
else
cout<<sum;
if(i!=n) cout<<' ';
else cout<<endl;
}
cout<<ans;
}
signed main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
T=1;
while(T--)
{
solve();
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 73ms
memory: 14708kb
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:
60073965108098 60073472434579 60073472434579 60073481786076 60073472434579 60073788795704 60073528186939 60073472434579 60073844417038 60073784237527 60073472434579 60073472434579 60073948724359 60073472434579 60073472434579 60073667243820 60073550392304 60073472434579 60073631606704 60073472434579 ...
result:
wrong answer 1st lines differ - expected: '60073965049724 60073472376204 ...4 60073701685447 60073472376204', found: '60073965108098 60073472434579 ...9 60073701743821 60073472434579'