QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #613683 | #7964. 转化 | yzj123# | WA | 51ms | 14600kb | C++20 | 827b | 2024-10-05 14:28:07 | 2024-10-05 14:28:17 |
Judging History
answer
#include <bits/stdc++.h>
#define int long long
using namespace std;
int read()
{
int res = 0, bj = 1;
char ch = getchar();
while (ch < '0' || ch > '9')
{
if (ch == '-') bj = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9')
{
res = res * 10 + ch - '0';
ch = getchar();
}
return res * bj;
}
const int MAXN = 351493 + 5;
int n, a[MAXN], b[MAXN], c[MAXN], d[MAXN];
int suma, sumc, sumd;
signed main()
{
n = read();
for (int i = 1; i <= n; i++) a[i] = read(), suma += a[i];
for (int i = 1; i <= n; i++) b[i] = read();
for (int i = 1; i <= n; i++) c[i] = read(), sumc += c[i];
for (int i = 1; i <= n; i++) d[i] = min(a[i] + c[i], b[i]), sumd += d[i];
for (int i = 1; i <= n; i++) cout << sumd - d[i] + a[i] + c[i] << " ";
cout << "\n";
cout << suma + sumc;
return 0;
}
详细
Test #1:
score: 0
Wrong Answer
time: 51ms
memory: 14600kb
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 ... 60073701743821 60073472434579 '