QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #300798 | #7964. 转化 | defyers# | WA | 77ms | 12608kb | C++20 | 831b | 2024-01-08 20:10:20 | 2024-01-08 20:10:20 |
Judging History
answer
#include "bits/stdc++.h"
using namespace std;
#pragma GCC optimize("Ofast")
#pragma GCC target("avx2")
using ll = long long;
using LL = long long;
#define int long long
const int N = 4e5 + 11;
int a[N], b[N], c[N];
void solve(int TC) {
int n; cin >> n;
for(int i = 0; i < n; i++) cin >> a[i];
for(int i = 0; i < n; i++) cin >> b[i];
for(int i = 0; i < n; i++) cin >> c[i];
for(int i = 0; i < n; i++) a[i] += c[i];
int s = 0; for(int i = 0; i < n; i++) s += min(b[i], a[i]);
for(int i = 0; i < n; i++){
cout << a[i] + s - min(b[i], a[i]) << " \n"[i == n - 1];
}
int t = accumulate(a, a + n, 0LL);
cout << t << '\n';
}
int32_t main() {
cin.tie(0)->sync_with_stdio(0);
cout << fixed << setprecision(10);
int t = 1;
// cin >> t;
for (int i = 1; i <= t; i++) {
solve(i);
}
}
详细
Test #1:
score: 0
Wrong Answer
time: 77ms
memory: 12608kb
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'