Accepted
Code
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll t;cin>>t;
while (t--) {
ll arr[3];
ll sum = 0;
for (ll i = 0 ; i < 3 ; i++) {
cin>>arr[i];
sum += arr[i];
}
map<ll, ll> m;
for (ll i = 0 ; i < 3 ; i++) {
m[arr[i]%2]++;
}
// 111222
// 1221
if ((m[1] == 1 && m[0] == 2) || (m[0] == 3)) cout<<arr[0]+arr[1]+arr[2];
else {
// ll ans = 0;
// sort(arr, arr+3);
// // for (ll i = 2 ; i >= 0 ; i--) {
// // if (arr[i]%2 == 0) ans+=arr[i];
// // else ans += (arr[i]-1);
// // }
// if (arr[2]%2 != 0) {
// ans += arr[2];
// ans += (arr[0]+arr[1])-2;
// } else {
// }
// cout<<ans;
if (m[1]==2) {
cout<<sum-1;
} else {
cout<<sum-2;
}
}
cout<<endl;
}
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:12:52
- Judged At
- 2025-06-13 16:12:52
- Judged By
- Score
- 100
- Total Time
- 299ms
- Peak Memory
- 1.52 MiB