QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #310559 | #7964. 转化 | yimon | WA | 354ms | 36116kb | C++23 | 690b | 2024-01-21 15:33:00 | 2024-01-21 15:33:00 |
Judging History
answer
#include<iostream>
#include<cmath>
#include<map>
#include<cstdlib>
#include<cstring>
#include<string>
#include<algorithm>
using namespace std;
typedef long long ll;
ll a[500000], b[500000], c[500000];
map<ll, ll> x;
signed main()
{
ll n;
ll k = 0;
ll kc = 0;
ll ans = 0;
cin >> n;
for (ll i = 1; i <= n; i++)
{
cin >> a[i];
ans += a[i];
}
for (ll i = 1; i <= n; i++)
{
cin >> b[i];
k += b[i];
}
for (ll i = 1; i <= n; i++)
{
cin >> c[i];
kc += c[i];
}
for (ll i = 1; i <= n; i++)
{
x[i] = k - b[i];
}
for (ll i = 1; i <= n; i++)
{
cout << a[i] + x[i]+c[i] << " ";
}
cout << endl;
cout << ans + kc << endl;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 354ms
memory: 36116kb
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:
87897846951636 87897354278117 87897182509346 87897363629614 87897354278117 87897670639242 87897410030477 87897354278117 87897726260576 87897666081065 87897045329706 87897048968448 87897830567897 87896914313793 87897147265959 87897549087358 87897432235842 87897354278117 87897513450242 87897354278117 ...
result:
wrong answer 1st lines differ - expected: '60073965049724 60073472376204 ...4 60073701685447 60073472376204', found: '87897846951636 87897354278117 ... 87897583587359 87897015452996 '