/ SeriousOJ /

Record Detail

Wrong Answer


  
# Status Time Cost Memory Cost
#1 Wrong Answer 1ms 532.0 KiB
#2 Wrong Answer 1ms 324.0 KiB
#3 Wrong Answer 1ms 580.0 KiB
#4 Wrong Answer 2ms 340.0 KiB
#5 Wrong Answer 24ms 588.0 KiB
#6 Accepted 26ms 1.641 MiB
#7 Accepted 26ms 1.832 MiB
#8 Wrong Answer 26ms 1.512 MiB
#9 Accepted 24ms 1.602 MiB
#10 Accepted 24ms 1.605 MiB
#11 Wrong Answer 23ms 1.562 MiB
#12 Wrong Answer 23ms 1.578 MiB
#13 Wrong Answer 24ms 1.578 MiB
#14 Wrong Answer 24ms 1.488 MiB
#15 Wrong Answer 24ms 1.562 MiB
#16 Wrong Answer 23ms 1.562 MiB

Code

#include <bits/stdc++.h>
#define ll long long
#define F first
#define S second
#define endl '\n'
#define Endl '\n'

using namespace std;

const int N = 2e5 + 5;
int tc, n, m, a[N], b[N], c[N];

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); // cout.tie(0);
    cin >> tc;
    while (tc--) {
        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];
        }
        ll sum = 0;
        for (int i = 0; i < n; i++) {
            sum += max({a[i], b[i], c[i]});
        }
        cout << sum << endl;
    }

    return 0;
}

Information

Submit By
Type
Submission
Problem
P1046 Maximum sum in 3-array
Contest
TLE_Headquarters - round #1
Language
C++17 (G++ 13.2.0)
Submit At
2024-03-27 17:14:29
Judged At
2024-10-03 13:55:59
Judged By
Score
20
Total Time
26ms
Peak Memory
1.832 MiB