/ SeriousOJ /

Record Detail

Wrong Answer


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 532.0 KiB
#2 Wrong Answer 193ms 1.023 MiB
#3 Wrong Answer 200ms 1.52 MiB

Code

#include <bits/stdc++.h>
using namespace std;
#define MOD 998244353
#define ll long long
#define ull unsigned long long
#define ld long double
const int MAX_n = 1e5 + 5;
#define MAX_X 1000000
const int InF = 1e9; // for int
const ll INF = 1e18; // for ll

void solve()
{
    int t;
    cin >> t;
    while (t--)
    {
        int n, m, k;
        cin >> n >> m >> k;
        int a, b, c;
        vector<int> v;
        if (n % 2 != 0)
        {
            v.push_back(n);
        }
        if (m % 2 != 0)
        {
            v.push_back(m);
        }
        if (k % 2 != 0)
        {
            v.push_back(k);
        }
        sort(v.begin(), v.end(), greater<>());
        if (v.size() == 0)
        {
            cout << n + m + k << endl;
        }
        else
        {
            int ans = v[0];
            if (n != v[0])
            {
                n = n / 2;
                ans += (n * 2);
            }
            if (m != v[0])
            {
                m = m / 2;
                ans += (m * 2);
            }
            if (k != v[0])
            {
                k = k / 2;
                ans += (k * 2);
            }
            cout << ans << endl;
        }
    }
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);


    solve();
    return 0;
}

Information

Submit By
Type
Submission
Problem
P1195 B. Palindrome
Contest
Brain Booster #10
Language
C++17 (G++ 13.2.0)
Submit At
2025-06-13 16:00:47
Judged At
2025-06-13 16:00:47
Judged By
Score
0
Total Time
200ms
Peak Memory
1.52 MiB