solution
stringlengths 11
983k
| difficulty
int64 0
21
| language
stringclasses 2
values |
|---|---|---|
#include <bits/stdc++.h>
using namespace std;
long long n, a, b, i, sum, sum1, j;
vector<long long> v;
int main() {
cin >> n;
for (i = 1; i <= n; i++) {
cin >> a;
if (a % 2 == 0) {
for (j = 1; j <= a; j++) {
cin >> b;
if (j <= a / 2) {
sum += b;
} else {
sum1 += b;
}
}
} else {
for (j = 1; j <= a; j++) {
cin >> b;
if (j <= (a - 1) / 2) {
sum += b;
} else if (j == a / 2 + 1) {
v.push_back(b);
} else {
sum1 += b;
}
}
}
}
sort(v.begin(), v.end());
reverse(v.begin(), v.end());
for (i = 0; i < v.size(); i++) {
if (i % 2 == 0) {
sum += v[i];
} else {
sum1 += v[i];
}
}
cout << sum << " " << sum1 << endl;
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int cd[101];
int main() {
int n;
int da = 0, db = 0;
int zs = 0;
cin >> n;
for (int xx = 1; xx <= n; xx++) {
int x, y;
cin >> x;
for (int yy = 1; yy <= x / 2; yy++) cin >> y, da += y;
if (x & 1) zs++, cin >> cd[zs];
for (int yy = 1; yy <= x / 2; yy++) cin >> y, db += y;
}
sort(cd + 1, cd + zs + 1);
for (int xx = zs; xx >= 1; xx -= 2) da += cd[xx];
zs--;
for (int xx = zs; xx >= 1; xx -= 2) db += cd[xx];
cout << da << ' ' << db;
}
| 9 | CPP |
#!/usr/bin/env python3
odd, even = [], []
player1_turn = True
player1 = player2 = 0
pile_number = int(input())
for _ in range(pile_number):
n, *pile = tuple(map(int, input().split()))
if n % 2 == 0:
even.append(pile)
else:
odd.append(pile)
for pile in even:
n = len(pile)
player1 += sum(pile[:n//2])
player2 += sum(pile[n//2:])
for pile in sorted(odd, reverse=True, key=lambda x: x[len(x)//2]):
n = len(pile)
top, middle, bottom = pile[:n//2], pile[n//2], pile[n//2+1:]
player1 += sum(top)
player2 += sum(bottom)
if player1_turn:
player1 += middle
player1_turn = not player1_turn
else:
player2 += middle
player1_turn = not player1_turn
print(player1, player2)
| 9 | PYTHON3 |
#include <bits/stdc++.h>
#pragma comment(linker, "/stack:20000000")
using namespace std;
double __begin;
template <typename T1, typename T2, typename T3>
struct triple {
T1 a;
T2 b;
T3 c;
triple(){};
triple(T1 _a, T2 _b, T3 _c) : a(_a), b(_b), c(_c) {}
};
template <typename T1, typename T2, typename T3>
bool operator<(const triple<T1, T2, T3> &t1, const triple<T1, T2, T3> &t2) {
if (t1.a != t2.a)
return t1.a < t2.a;
else
return t1.b < t2.b;
}
template <typename T1, typename T2, typename T3>
inline std::ostream &operator<<(std::ostream &os, const triple<T1, T2, T3> &t) {
return os << "(" << t.a << ", " << t.b << ", " << t.c << ")";
}
inline int bits_count(int v) {
v = v - ((v >> 1) & 0x55555555);
v = (v & 0x33333333) + ((v >> 2) & 0x33333333);
return ((v + (v >> 4) & 0xF0F0F0F) * 0x1010101) >> 24;
}
unsigned int reverse_bits(register unsigned int x) {
x = (((x & 0xaaaaaaaa) >> 1) | ((x & 0x55555555) << 1));
x = (((x & 0xcccccccc) >> 2) | ((x & 0x33333333) << 2));
x = (((x & 0xf0f0f0f0) >> 4) | ((x & 0x0f0f0f0f) << 4));
x = (((x & 0xff00ff00) >> 8) | ((x & 0x00ff00ff) << 8));
return ((x >> 16) | (x << 16));
}
inline int sign(int x) { return (x >> 31) | (-x >> 31); }
inline bool ispow2(int x) { return (x != 0 && (x & (x - 1)) == 0); }
template <typename T1, typename T2>
inline std::ostream &operator<<(std::ostream &os, const std::pair<T1, T2> &p) {
return os << "(" << p.first << ", " << p.second << ")";
}
template <typename T>
inline std::ostream &operator<<(std::ostream &os, const std::vector<T> &v) {
bool first = true;
os << "[";
for (unsigned int i = 0; i < v.size(); i++) {
if (!first) os << ", ";
os << v[i];
first = false;
}
return os << "]";
}
template <typename T>
inline std::ostream &operator<<(std::ostream &os, const std::set<T> &v) {
bool first = true;
os << "[";
for (typename std::set<T>::const_iterator ii = v.begin(); ii != v.end();
++ii) {
if (!first) os << ", ";
os << *ii;
first = false;
}
return os << "]";
}
template <typename T1, typename T2>
inline std::ostream &operator<<(std::ostream &os, const std::map<T1, T2> &v) {
bool first = true;
os << "[";
for (typename std::map<T1, T2>::const_iterator ii = v.begin(); ii != v.end();
++ii) {
if (!first) os << ", ";
os << *ii;
first = false;
}
return os << "]";
}
template <typename T, typename T2>
void printarray(T a[], T2 sz, T2 beg = 0) {
for (T2 i = beg; i < sz; i++) cout << a[i] << " ";
cout << endl;
}
inline long long binpow(long long x, long long n) {
long long res = 1;
while (n) {
if (n & 1) res *= x;
x *= x;
n >>= 1;
}
return res;
}
inline long long powmod(long long x, long long n, long long _mod) {
long long res = 1;
while (n) {
if (n & 1) res = (res * x) % _mod;
x = (x * x) % _mod;
n >>= 1;
}
return res;
}
inline long long gcd(long long a, long long b) {
long long t;
while (b) {
a = a % b;
t = a;
a = b;
b = t;
}
return a;
}
inline int gcd(int a, int b) {
int t;
while (b) {
a = a % b;
t = a;
a = b;
b = t;
}
return a;
}
inline long long lcm(int a, int b) { return a / gcd(a, b) * (long long)b; }
inline long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
inline long long gcd(long long a, long long b, long long c) {
return gcd(gcd(a, b), c);
}
inline int gcd(int a, int b, int c) { return gcd(gcd(a, b), c); }
inline long long lcm(long long a, long long b, long long c) {
return lcm(lcm(a, b), c);
}
inline long long lcm(int a, int b, int c) {
return lcm(lcm(a, b), (long long)c);
}
inline long long max(long long a, long long b) { return (a > b) ? a : b; }
inline int max(int a, int b) { return (a > b) ? a : b; }
inline double max(double a, double b) { return (a > b) ? a : b; }
inline long long max(long long a, long long b, long long c) {
return max(a, max(b, c));
}
inline int max(int a, int b, int c) { return max(a, max(b, c)); }
inline double max(double a, double b, double c) { return max(a, max(b, c)); }
inline long long min(long long a, long long b) { return (a < b) ? a : b; }
inline int min(int a, int b) { return (a < b) ? a : b; }
inline double min(double a, double b) { return (a < b) ? a : b; }
inline long long min(long long a, long long b, long long c) {
return min(a, min(b, c));
}
inline int min(int a, int b, int c) { return min(a, min(b, c)); }
inline double min(double a, double b, double c) { return min(a, min(b, c)); }
template <class T>
inline void getar(T a, int n, int m) {
for (int i = 0; i < n; i++)
for (int j = 0; j < m; ++j) {
scanf("%d", &a[i][j]);
}
}
inline void getar(int *a, int n) {
for (int ii = 0; ii < n; ii++) {
scanf("%d", a + ii);
}
}
inline void getar(pair<int, int> *a, int n) {
for (int ii = 0; ii < n; ii++) {
scanf("%d%d", &a[ii].first, &a[ii].second);
}
}
inline void getar(long long *a, int n) {
for (int ii = 0; ii < n; ii++) {
scanf("%I64d", a + ii);
}
}
vector<int> v[100];
vector<int> *a[101];
bool cmp(const vector<int> *v1, const vector<int> *v2) {
int s1 = v1->size();
int s2 = v2->size();
return (*v1)[s1 / 2] > (*v2)[s2 / 2];
}
int main() {
int n;
scanf("%d", &n);
int a1 = 0, a2 = 0;
int k = 0;
for (int i = 0; i < n; ++i) {
int s;
scanf("%d", &s);
v[i].reserve(s);
for (int j = 0; j < s; ++j) {
int x;
scanf("%d", &x);
v[i].push_back(x);
}
if (s & 1) {
a[k++] = v + i;
} else {
for (int j = 0; j < s / 2; ++j) {
a1 += v[i][j];
a2 += v[i][s - 1 - j];
}
}
}
sort(a, a + k, cmp);
for (int i = 0; i < k; ++i) {
vector<int> &v = *a[i];
int s = v.size();
for (int i = 0; i < s / 2; ++i) {
a1 += v[i];
a2 += v[s - i - 1];
}
if (i & 1) {
a2 += v[s / 2];
} else {
a1 += v[s / 2];
}
}
cout << a1 << " " << a2 << endl;
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
long long t, l, r, i, x, n, y, m, j, z, k, v, q, w, mini, g;
cin >> n;
vector<long long> a;
l = 0;
r = 0;
for (j = 0; j < n; j++) {
cin >> m;
for (i = 0; i < m / 2; i++) {
cin >> x;
l = l + x;
}
if (m % 2 == 1) {
cin >> x;
a.push_back(x);
}
for (i = 0; i < m / 2; i++) {
cin >> x;
r = r + x;
}
}
sort(a.begin(), a.end());
n = a.size();
for (i = n - 1; i >= 0; i--) {
if (i % 2 == (n - 1) % 2) {
l = l + a[i];
} else {
r = r + a[i];
}
}
cout << l << " " << r << endl;
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int INT_MAX_VAL = (int)0x3F3F3F3F;
int INT_MIN_VAL = (int)-0x3F3F3F3F;
long long LONG_MAX_VAL = (long long)0x3F3F3F3F3F3F3F3F;
long long LONG_MIN_VAL = (long long)-0x3F3F3F3F3F3F3F3F;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> vs;
int s1 = 0, s2 = 0;
for (long long(i) = 0LL; (i) < (n); (i)++) {
int s;
cin >> s;
for (long long(i) = 0LL; (i) < (s / 2); (i)++) {
int a;
cin >> a;
s1 += a;
}
if ((s % 2) == 1) {
int a;
cin >> a;
vs.push_back(a);
}
for (long long(i) = 0LL; (i) < (s / 2); (i)++) {
int a;
cin >> a;
s2 += a;
}
}
sort(vs.rbegin(), vs.rend());
for (long long(i) = 0LL; (i) < (vs.size()); (i)++) {
if (i % 2 == 0) {
s1 += vs[i];
} else {
s2 += vs[i];
}
}
cout << s1 << " " << s2 << '\n';
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
int a[105][105], n;
int b[105];
bool vis[105];
using namespace std;
struct node {
int v, i;
bool operator<(const node b) const {
if (this->v == b.v) return this->i < b.i;
return this->v > b.v;
};
};
set<node> q;
int main() {
scanf("%d", &n);
int sum = 0;
int sum2 = 0;
int ans1 = 0, ans2 = 0;
for (int i = 1; i <= n; i++) {
scanf("%d", &b[i]);
for (int j = 1; j <= b[i]; j++) {
scanf("%d", &a[i][j]);
if (j == b[i] / 2 + 1 && b[i] % 2 == 1) {
node tmp;
tmp.v = a[i][j];
tmp.i = i;
q.insert(tmp);
}
if (j != 1) {
a[i][j] += a[i][j - 1];
}
}
}
for (int i = 1; i <= n; i++) {
if (b[i] % 2 == 0) {
ans1 += a[i][b[i] / 2];
ans2 += a[i][b[i]] - a[i][b[i] / 2];
} else {
ans1 += a[i][b[i] / 2];
ans2 += a[i][b[i]] - a[i][b[i] / 2 + 1];
}
}
set<node>::const_iterator pos;
int i;
for (pos = q.begin(), i = 0; pos != q.end(); pos++, i++) {
if (i % 2 == 0) {
ans1 += pos->v;
} else {
ans2 += pos->v;
}
}
printf("%d %d", ans1, ans2);
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
const long long int inf = (long long int)1e18 + 10;
vector<long long int> v;
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
long long int n, ans1 = 0, ans2 = 0, sz, x;
cin >> n;
for (long long int i = 1; i <= n; i++) {
cin >> sz;
for (long long int j = 1; j <= (sz / 2); j++) {
cin >> x;
ans1 += x;
}
cin >> x;
if (sz % 2 == 1)
v.push_back(x);
else
ans2 += x;
for (long long int j = (sz / 2) + 2; j <= sz; j++) cin >> x, ans2 += x;
}
if (v.size() == 0) {
cout << ans1 << " " << ans2 << endl;
return 0;
}
sort(v.begin(), v.end());
long long int k = 0;
for (long long int i = v.size() - 1; i >= 0; i--) {
if (k % 2 == 0)
ans1 += v[i];
else
ans2 += v[i];
k++;
}
cout << ans1 << " " << ans2 << endl;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int a[200][200];
int s[200];
vector<int> v;
int n;
int main() {
cin >> n;
int sum1 = 0, sum2 = 0;
for (int i = 0; i < n; i++) {
cin >> s[i];
for (int j = 0; j < s[i]; j++) {
cin >> a[i][j];
if (j < s[i] / 2)
sum1 += a[i][j];
else if (j == s[i] / 2 && s[i] % 2)
v.push_back(a[i][j]);
else
sum2 += a[i][j];
}
}
sort(v.begin(), v.end());
reverse(v.begin(), v.end());
for (int i = 0; i < v.size(); i++) {
if (i % 2 == 0)
sum1 += v[i];
else
sum2 += v[i];
}
cout << sum1 << " " << sum2 << endl;
}
| 9 | CPP |
import sys
from functools import reduce
for n in sys.stdin:
n = int(n)
cards = [list(map(int, input().split()[1:])) for i in range(n)]
mid = []
a, b = 0, 0
add = lambda x=0, y=0: x + y
for c in cards:
s = len(c)
m = s >> 1
if s & 1 == 0:
a += reduce(add, c[:m])
b += reduce(add, c[m:])
else:
a += reduce(add, c[:m] or [0])
b += reduce(add, c[m + 1:] or [0])
mid.append(c[m])
mid.sort(reverse=True)
j = True
for c in mid:
if j:
a += c
else:
b += c
j = not j
print(a, b)
| 9 | PYTHON3 |
#include <bits/stdc++.h>
int diru[] = {-1, -1, -1, 0, 0, 1, 1, 1};
int dirv[] = {-1, 0, 1, -1, 1, -1, 0, 1};
using namespace std;
class Debugger {
public:
Debugger(const string& _separator = " ")
: first(true), separator(_separator) {}
template <typename ObjectType>
Debugger& operator,(const ObjectType& v) {
if (!first) cerr << separator;
cerr << v;
first = false;
return *this;
}
~Debugger() { cerr << endl; }
private:
bool first;
string separator;
};
template <typename T1, typename T2>
inline ostream& operator<<(ostream& os, const pair<T1, T2>& p) {
return os << "(" << p.first << "," << p.second << ")";
}
template <typename T>
inline ostream& operator<<(ostream& os, const vector<T>& v) {
bool first = true;
os << "{";
for (unsigned int i = 0; i < v.size(); i++) {
if (!first) os << ",";
os << v[i];
first = false;
}
return os << "}";
}
template <typename T>
inline ostream& operator<<(ostream& os, const set<T>& v) {
bool first = true;
os << "{";
for (typename set<T>::const_iterator ii = v.begin(); ii != v.end(); ++ii) {
if (!first) os << ",";
os << *ii;
first = false;
}
return os << "}";
}
template <typename T1, typename T2>
inline ostream& operator<<(ostream& os, const map<T1, T2>& v) {
bool first = true;
os << "{";
for (typename map<T1, T2>::const_iterator ii = v.begin(); ii != v.end();
++ii) {
if (!first) os << ",";
os << *ii;
first = false;
}
return os << "}";
}
template <class T>
T sq(T n) {
return n * n;
}
template <class T>
T gcd(T a, T b) {
return (b != 0 ? gcd<T>(b, a % b) : a);
}
template <class T>
T lcm(T a, T b) {
return (a / gcd<T>(a, b) * b);
}
template <class T>
bool inside(T a, T b, T c) {
return a <= b && b <= c;
}
template <class T>
void setmax(T& a, T b) {
if (a < b) a = b;
}
template <class T>
void setmin(T& a, T b) {
if (b < a) a = b;
}
template <class T>
T power(T N, T P) {
return (P == 0) ? 1 : N * power(N, P - 1);
}
priority_queue<int> q;
int main() {
int n, T, t = 1, m, i, j, k;
scanf("%d", &n);
int tot = 0;
int ans = 0;
for (i = 0; i < n; i++) {
scanf("%d", &m);
for (j = 0; j < m; j++) {
scanf("%d", &k);
if (j < m / 2) {
ans += k;
} else if (m % 2 && j == m / 2)
q.push(k);
tot += k;
}
}
bool f = 1;
while (!q.empty()) {
if (f) ans += q.top();
q.pop();
f = !f;
}
printf("%d %d\n", ans, tot - ans);
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 105;
int s[N];
int ma[N][N];
int main() {
int n;
vector<int> v;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> s[i];
for (int j = 0; j < s[i]; ++j) {
cin >> ma[i][j];
}
}
int r1 = 0, r2 = 0;
for (int i = 0; i < n; ++i) {
for (int j = 0; j < s[i] / 2; ++j) {
r1 += ma[i][j];
r2 += ma[i][s[i] - 1 - j];
}
if (s[i] % 2) v.push_back(ma[i][s[i] / 2]);
}
sort(v.begin(), v.end(), greater<int>());
for (int i = 0; i < v.size(); ++i) {
if (i % 2)
r2 += v[i];
else
r1 += v[i];
}
cout << r1 << " " << r2 << endl;
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n;
vector<int> v;
int a1, a2;
void init() {
scanf("%d", &n);
for (int i = 0; i < n; i++) {
int sz, a;
scanf("%d", &sz);
for (int j = 0; j < sz; j++) {
scanf("%d", &a);
if (j < sz / 2)
a1 += a;
else if (j > (sz - 1) / 2)
a2 += a;
else
v.push_back(a);
}
}
sort(v.begin(), v.end(), [&](int x, int y) { return x > y; });
}
void process() {
for (int i = 0; i < (int)v.size(); i++) {
if (i % 2 == 0)
a1 += v[i];
else
a2 += v[i];
}
printf("%d %d\n", a1, a2);
}
int main() {
init();
process();
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
void speed() {
ios::sync_with_stdio(false);
cin.tie(NULL);
}
const int MOd = 1e9 + 7;
int main() {
long long n, m, p1 = 0, p2 = 0;
vector<long long> v;
cin >> n;
while (n--) {
long long x;
cin >> m;
for (int i = 0; i < m / 2; i++) {
cin >> x;
p1 += x;
}
if (m % 2) {
cin >> x;
v.push_back(x);
}
for (int i = 0; i < m / 2; i++) {
cin >> x;
p2 += x;
}
}
bool ok = 0;
sort(v.begin(), v.end());
while (!(v.empty())) {
if (!ok)
p1 += v.back();
else
p2 += v.back();
v.pop_back();
ok = !ok;
}
cout << p1 << " " << p2;
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
const long long INF = 1LL << 60;
const int inf = 1 << 30;
const int maxn = 2e5 + 5;
inline void fastio() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
}
int n;
int main() {
fastio();
cin >> n;
int ans1 = 0, ans2 = 0;
vector<int> g;
for (int i = (1); i <= (n); i++) {
int t, x;
cin >> t;
if (t & 1) {
for (int j = (1); j <= (t / 2); j++) {
cin >> x;
ans1 += x;
}
cin >> x;
g.push_back(x);
for (int j = (t / 2 + 2); j <= (t); j++) {
cin >> x;
ans2 += x;
}
} else {
for (int j = (1); j <= (t / 2); j++) {
cin >> x;
ans1 += x;
}
for (int j = (t / 2 + 1); j <= (t); j++) {
cin >> x;
ans2 += x;
}
}
}
sort(g.begin(), g.end());
reverse(g.begin(), g.end());
int o = 1;
for (int x : g) {
if (o)
ans1 += x;
else
ans2 += x;
o ^= 1;
}
cout << ans1 << " " << ans2 << endl;
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
int arr[101], x[101];
int main() {
int n;
scanf("%d", &n);
int a = 0, b = 0, cnt = 0, sz;
for (int i = 1; i <= n; ++i) {
scanf("%d", &sz);
for (int j = 1; j <= sz; ++j) scanf("%d", x + j);
if (sz & 1) arr[++cnt] = x[(sz >> 1) + 1];
for (int j = sz >> 1; j >= 1; --j) a += x[j];
for (int j = (sz >> 1) + 1 + (sz & 1); j <= sz; ++j) b += x[j];
}
std::sort(arr + 1, arr + cnt + 1, std::greater<int>());
for (int i = 1; i <= cnt; i += 2) a += arr[i];
for (int i = 2; i <= cnt; i += 2) b += arr[i];
printf("%d %d", a, b);
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 105;
int n, m, c[N], s[N];
bool cmp(const int& a, const int& b) { return a > b; }
int main() {
int cnt = 0, p = 0, q = 0;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &m);
int tmp = m / 2;
for (int j = 0; j < m; j++) {
scanf("%d", &c[j]);
if (j < tmp)
p += c[j];
else
q += c[j];
}
if (m & 1) {
q -= c[tmp];
s[cnt++] = c[tmp];
}
}
sort(s, s + cnt, cmp);
for (int i = 0; i < cnt; i++) {
if (i & 1)
q += s[i];
else
p += s[i];
}
printf("%d %d\n", p, q);
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, s[110], a[110][110], id[110], suml[110], sumr[110];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> s[i];
for (int j = 1; j <= s[i]; j++) {
cin >> a[i][j];
if (j <= (s[i] + 1) / 2) suml[i] += a[i][j];
if (j > s[i] / 2) sumr[i] += a[i][j];
}
}
int ans1 = 0, ans2 = 0;
vector<int> t;
for (int i = 1; i <= n; i++) {
if (s[i] % 2 == 0) {
ans1 += suml[i];
ans2 += sumr[i];
} else {
ans1 += suml[i] - a[i][s[i] / 2 + 1];
ans2 += sumr[i] - a[i][s[i] / 2 + 1];
t.push_back(a[i][s[i] / 2 + 1]);
}
}
sort(t.rbegin(), t.rend());
if (t.size())
for (int i = 0; i <= t.size() - 1; i++)
if (i % 2 == 0)
ans1 += t[i];
else
ans2 += t[i];
cout << ans1 << " " << ans2;
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
void itval(istream_iterator<string> it) {}
template <typename T, typename... Args>
void itval(istream_iterator<string> it, T a, Args... args) {
cerr << *it << " = " << a << endl;
itval(++it, args...);
}
const long long int MOD = 1e9 + 7;
template <typename T>
inline void print(T x) {
cout << x << "\n";
}
template <typename T>
inline void printvec(T x) {
for (auto a : x) cout << a << ' ';
cout << '\n';
}
struct custom {
bool operator()(
const pair<long long int, pair<long long int, long long int> > &p1,
const pair<long long int, pair<long long int, long long int> > &p2)
const {
return p1.first < p2.first;
}
};
long long int get_pow(long long int a, long long int b, long long int M = MOD) {
long long int res = 1;
while (b) {
if (b & 1) res = (res * a) % M;
a = (a * a) % M;
b >>= 1;
}
return res;
}
const long long int N = 1e6 + 5, inf = 1e18;
void solve() {
long long int n;
cin >> n;
std::vector<long long int> v[n];
std::vector<bool> used[n];
long long int sa = 0, sb = 0;
vector<long long> t;
for (long long int i = (long long int)0; i < (long long int)(n); i++) {
int k, x;
cin >> x;
for (long long int j = (long long int)0; j < (long long int)(x); j++) {
cin >> k;
v[i].push_back(k);
}
for (long long int j = (long long int)0; j < (long long int)(x / 2); j++) {
sa += v[i][j];
}
if (x & 1) {
for (long long int j = (long long int)x / 2 + 1; j < (long long int)(x);
j++) {
sb += v[i][j];
}
t.push_back(v[i][x / 2]);
} else {
for (long long int j = (long long int)x / 2; j < (long long int)(x);
j++) {
sb += v[i][j];
}
}
}
sort(t.begin(), t.end(), greater<long long int>());
for (long long int i = (long long int)0; i < (long long int)(t.size()); i++) {
if (i & 1)
sb += t[i];
else
sa += t[i];
}
cout << sa << ' ' << sb;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int test = 1;
clock_t z = clock();
for (long long int tes = (long long int)0; tes < (long long int)(test);
tes++) {
solve();
}
fprintf(stderr, "Total Time:%.4f\n", (double)(clock() - z) / CLOCKS_PER_SEC),
fflush(stderr);
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
template <typename T>
bool mmax(T &m, const T q) {
if (m < q) {
m = q;
return true;
} else
return false;
}
template <typename T>
bool mmin(T &m, const T q) {
if (m > q) {
m = q;
return true;
} else
return false;
}
void __print(long long first) { cerr << first; }
void __print(long first) { cerr << first; }
void __print(unsigned first) { cerr << first; }
void __print(unsigned long first) { cerr << first; }
void __print(unsigned long long first) { cerr << first; }
void __print(float first) { cerr << first; }
void __print(double first) { cerr << first; }
void __print(long double first) { cerr << first; }
void __print(char first) { cerr << '\'' << first << '\''; }
void __print(const char *first) { cerr << '\"' << first << '\"'; }
void __print(const string &first) { cerr << '\"' << first << '\"'; }
void __print(bool first) { cerr << (first ? "true" : "false"); }
template <typename T, typename V>
void __print(const pair<T, V> &first) {
cerr << '{';
__print(first.first);
cerr << ',';
__print(first.second);
cerr << '}';
}
template <typename T>
void __print(const T &first) {
long long f = 0;
cerr << '{';
for (auto &i : first) cerr << (f++ ? "," : ""), __print(i);
cerr << "}";
}
void _print() { cerr << "]\n"; }
template <typename T, typename... V>
void _print(T t, V... v) {
__print(t);
if (sizeof...(v)) cerr << ", ";
_print(v...);
}
std::mt19937 rng(
(long long)std::chrono::steady_clock::now().time_since_epoch().count());
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cout << fixed << setprecision(12);
long long n;
cin >> n;
long long c = 0, ji = 0;
vector<long long> v;
for (long long i = 0; i < n; i++) {
long long s;
cin >> s;
long long a[s];
for (long long j = 0; j < s; j++) {
cin >> a[j];
if (j < s / 2)
c += a[j];
else if (j == s / 2 and s & 1) {
v.push_back(a[j]);
} else
ji += a[j];
}
}
sort((v).begin(), (v).end());
reverse((v).begin(), (v).end());
for (long long i = 0; i < v.size(); i++) {
if (i & 1)
ji += v[i];
else
c += v[i];
}
cout << c << " " << ji;
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, ans1, ans2;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
vector<int> v;
cin >> n;
for (int i = 0; i < n; i++) {
int m;
cin >> m;
for (int j = 0; j < m; j++) {
int t;
cin >> t;
if (m % 2 and j == m / 2)
v.push_back(t);
else if (j < m / 2)
ans1 += t;
else
ans2 += t;
}
}
sort(v.begin(), v.end());
for (int i = v.size() - 1; i >= 0; i--) {
if ((v.size() - 1 - i) % 2 == 0)
ans1 += v[i];
else
ans2 += v[i];
}
cout << ans1 << endl << ans2 << endl;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int MX = 101;
vector<int> ip;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int N;
cin >> N;
int a1 = 0, a2 = 0;
for (int i = 0; i < N; i++) {
int k;
cin >> k;
for (int j = 0; j < k; j++) {
int a;
cin >> a;
if (j < k / 2)
a1 += a;
else if (j >= (k + 1) / 2)
a2 += a;
else
ip.push_back(a);
}
}
sort(ip.begin(), ip.end());
reverse(ip.begin(), ip.end());
for (int i = 0; i < (int)ip.size(); i++) {
if (not(i & 1))
a1 += ip[i];
else
a2 += ip[i];
}
cout << a1 << ' ' << a2 << endl;
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
int crit(const void* a, const void* b);
int main() {
int i, j, n, s, x;
int arriba = 0;
scanf("%d", &n);
int cartas[101];
int ciel = 0;
int jiro = 0;
for (i = 0; i < n; i++) {
scanf("%d", &s);
for (j = 0; j < s; j++) {
scanf("%d", &x);
if (j < s / 2) {
ciel = ciel + x;
} else if (s % 2 != 0 && j == s / 2) {
cartas[arriba] = x;
arriba++;
} else {
jiro = jiro + x;
}
}
}
qsort(cartas, arriba, sizeof(int), crit);
for (i = 0; i < arriba; i++) {
if (i % 2) {
jiro = jiro + cartas[i];
} else {
ciel = ciel + cartas[i];
}
}
printf("%d %d", ciel, jiro);
return 0;
}
int crit(const void* a, const void* b) { return (*(int*)b - *(int*)a); }
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, v[105], rm[105];
int main() {
scanf("%d", &n);
int ans1 = 0, ans2 = 0, m = 0, l;
for (int i = 1; i <= n; i++) {
scanf("%d", &l);
for (int j = 1; j <= l; j++) scanf("%d", &v[j]);
for (int j = 1; j <= l / 2; j++) ans1 += v[j], ans2 += v[l - j + 1];
if (l % 2 == 1) rm[++m] = -v[(l + 1) / 2];
}
sort(rm + 1, rm + 1 + m);
for (int i = 1; i <= m; i++)
if (i & 1)
ans1 -= rm[i];
else
ans2 -= rm[i];
printf("%d %d\n", ans1, ans2);
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int i, j, t;
int n;
scanf("%d", &n);
;
vector<int> v;
long long answer = 0, chu = 0;
for (i = 0; i < n; i++) {
int siz;
scanf("%d", &siz);
;
if (siz % 2) {
for (j = 0; j < siz; j++) {
int num;
scanf("%d", &num);
;
if ((j * 2 + 1) != siz && j * 2 < siz)
chu += num;
else if (j * 2 + 1 == siz)
v.push_back(num);
answer += num;
}
} else {
for (j = 0; j < siz; j++) {
int num;
scanf("%d", &num);
;
if (j * 2 < siz) chu += num;
answer += num;
}
}
}
sort(v.begin(), v.end());
reverse(v.begin(), v.end());
int siz = v.size();
for (i = 0; i < siz; i++) {
if (i % 2 == 0) chu += v[i];
}
printf("%lld %lld\n", chu, answer - chu);
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
template <typename T>
bool elem(set<T> st, T val) {
return (st.find(val) != st.end());
}
template <typename T>
void printv(vector<T> vt) {
if (vt.size() == 0) return;
for (int i = 0; i < (int)vt.size() - 1; ++i) cout << vt[i] << " ";
cout << vt[vt.size() - 1] << endl;
}
vector<vector<int> > p;
int main(void) {
ios::sync_with_stdio(false);
int n;
cin >> n;
for (int i = 0; i < (int)n; ++i) {
int m;
cin >> m;
vector<int> a(m);
for (int j = 0; j < (int)m; ++j) cin >> a[j];
p.push_back(a);
}
int sum = 0;
for (int i = 0; i < (int)n; ++i)
for (int j = 0; j < (int)p[i].size(); ++j) sum += p[i][j];
int sc = 0;
vector<int> rem;
for (int i = 0; i < (int)n; ++i) {
for (int j = 0; j < (int)p[i].size() / 2; ++j) sc += p[i][j];
if (p[i].size() % 2 == 1) rem.push_back(p[i][p[i].size() / 2]);
}
sort(rem.begin(), rem.end(), greater<int>());
for (int i = 0; i < (int)rem.size(); i += 2) sc += rem[i];
cout << sc << " " << sum - sc << endl;
return 0;
}
| 9 | CPP |
import sys
from functools import reduce
for n in sys.stdin:
n = int(n)
cards = [list(map(int, input().split()[1:])) for i in range(n)]
mid = []
a, b = 0, 0
add = lambda x=0, y=0: x + y
for c in cards:
s = len(c)
m = s >> 1
a += reduce(add, c[:m] or [0])
b += reduce(add, c[m + (s & 1):] or [0])
if s & 1 == 1:
mid.append(c[m])
mid.sort(reverse=True)
j = True
for c in mid:
if j:
a += c
else:
b += c
j = not j
print(a, b)
| 9 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int n, v[110], sum, sol;
pair<int, int> dif[110];
inline bool Sortare(pair<int, int> a, pair<int, int> b) {
return a.first - a.second > b.first - b.second;
}
int main() {
int i, j, size, sa, sb;
cin >> n;
for (i = 1; i <= n; ++i) {
cin >> size;
for (j = 1; j <= size; ++j) {
cin >> v[j];
sum += v[j];
}
if (size % 2 == 1) {
sa = sb = 0;
for (j = 1; j <= size / 2; ++j) sa += v[j];
for (j = size / 2 + 2; j <= size; ++j) sb += v[j];
j = size / 2 + 1;
dif[i].first = sa + v[j] - sb;
dif[i].second = sa - v[j] - sb;
} else {
sa = sb = 0;
for (j = 1; j <= size / 2; ++j) sa += v[j];
for (j = size / 2 + 1; j <= size; ++j) sb += v[j];
dif[i].first = sa - sb;
dif[i].second = sa - sb;
}
}
sort(dif + 1, dif + n + 1, Sortare);
for (i = 1; i <= n; ++i) {
if (i % 2 == 1)
sol += dif[i].first;
else
sol += dif[i].second;
}
sa = (sum - sol) / 2 + sol;
sb = (sum - sol) / 2;
cout << sa << ' ' << sb << "\n";
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
void insercion_rev(int impares[], int odd);
int main(void) {
int n, odd = 0, i, j, A, B, ciel = 0, jiro = 0;
scanf("%d", &n);
int impares[100];
for (i = 0; i < n; i++) {
scanf("%d", &A);
if (A == 1) {
scanf("%d", &B);
impares[odd] = B;
odd++;
} else {
for (j = 1; j <= A / 2; j++) {
scanf("%d", &B);
ciel += B;
}
if (A % 2 != 0 && A > 1) {
scanf("%d", &B);
impares[odd] = B;
odd++;
j++;
}
for (; j <= A; j++) {
scanf("%d", &B);
jiro += B;
}
}
}
if (odd > 0) {
insercion_rev(impares, odd);
for (i = 0; i < odd; i++) {
if (i % 2 == 0)
ciel += impares[i];
else
jiro += impares[i];
}
}
printf("%d %d", ciel, jiro);
return 0;
}
void insercion_rev(int impares[], int odd) {
int i, k, j;
for (i = 1; i < odd; i++) {
k = impares[i];
j = i - 1;
while (j >= 0 && impares[j] < k) {
impares[j + 1] = impares[j];
j = j - 1;
}
impares[j + 1] = k;
}
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
template <typename T1, typename T2>
using pr = pair<T1, T2>;
template <typename T>
using vec = vector<T>;
int n, s[102], a[102][102];
int up[102], down[102], diff[102];
int main() {
int answ1 = 0;
int sum = 0;
cin >> n;
vector<int> mids;
for (int(i) = (0); (i) < (n); ++(i)) {
cin >> s[i];
int sm = 0;
for (int(j) = (0); (j) < (s[i]); ++(j)) {
cin >> a[i][j];
sm += a[i][j];
sum += a[i][j];
}
for (int(j) = (0); (j) < (s[i] / 2); ++(j)) {
answ1 += a[i][j];
}
if (s[i] % 2 == 1) mids.push_back(a[i][s[i] / 2]);
}
sort(mids.begin(), mids.end());
for (int(i) = (((int)mids.size())) - (1); (i) >= (0); --(i)) {
if ((((int)mids.size()) - i) % 2 == 1) answ1 += mids[i];
}
cout << answ1 << " " << sum - answ1 << endl;
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
template <class T>
inline T bigmod(T p, T e, T M) {
if (e == 0) return 1;
if (e % 2 == 0) {
long long t = bigmod(p, e / 2, M);
return (T)((t * t) % M);
}
return (T)((long long)bigmod(p, e - 1, M) * (long long)p) % M;
}
template <class T>
inline T gcd(T a, T b) {
if (b == 0) return a;
return gcd(b, a % b);
}
template <class T>
inline T modinverse(T a, T M) {
return bigmod(a, M - 2, M);
}
int ar[101][101], sz[101];
int tmp[101];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
long long a = 0, b = 0, c, d, e = 0, f = 0, g, h = 0, x, y, z;
cin >> a;
for (int i = (0); i < (a); ++i) {
cin >> sz[i];
for (int j = (0); j < (sz[i]); ++j) cin >> ar[i][j];
c = sz[i] / 2;
for (int j = (0); j < (c); ++j) e += ar[i][j];
for (int j = sz[i] - 1; j >= sz[i] - c; j--) f += ar[i][j];
if (sz[i] % 2 == 0)
tmp[i] = 0;
else {
tmp[i] = ar[i][sz[i] - c - 1];
b++;
}
}
sort(tmp, tmp + a);
reverse(tmp, tmp + a);
for (int i = 0; i < a; i++) {
if (i % 2 == 0)
e += tmp[i];
else
f += tmp[i];
}
cout << e << " " << f << endl;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int a[110][110], s[110], ans1, ans2, n;
vector<int> mids;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &s[i]);
for (int j = 1; j <= s[i]; j++) {
scanf("%d", &a[i][j]);
if (j <= s[i] / 2)
ans1 += a[i][j];
else if (j == (s[i] + 1) / 2 && (s[i] & 1))
mids.push_back(a[i][j]);
else
ans2 += a[i][j];
}
}
sort(mids.begin(), mids.end());
reverse(mids.begin(), mids.end());
for (int i = 0; i < mids.size(); i++) {
if (i & 1)
ans2 += mids[i];
else
ans1 += mids[i];
}
printf("%d %d\n", ans1, ans2);
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
bool debug = 1;
int n, m, k;
int dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0};
long long ln, lk, lm;
int toto, other;
vector<int> ps;
int main() {
scanf("%d", &n);
for (int(i) = 0; (i) < (int)(n); (i)++) {
scanf("%d", &k);
int l = (k - 1) / 2, r = l + 1, mid = -1;
if (k & 1) {
mid = l;
l--;
}
for (int(j) = 0; (j) < (int)(k); (j)++) {
scanf("%d", &m);
if (j <= l)
toto += m;
else if (r <= j)
other += m;
else
ps.push_back(m);
}
}
sort(ps.begin(), ps.end());
for (int i = ps.size() - 1, t = 0; i >= 0; i--, t ^= 1) {
if (t == 0)
toto += ps[i];
else
other += ps[i];
}
printf("%d %d\n", toto, other);
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 110;
struct Niz {
int val, sum;
Niz() {}
Niz(int _a, int _b) {
val = _a;
sum = _b;
}
} niz[maxn];
bool cmp1(const Niz &a, const Niz &b) { return a.val > b.val; }
int main() {
int n, z = 0, d = 0, a = 0;
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
int s, sum = 0, sum1 = 0;
scanf("%d", &s);
for (int j = 1; j <= s; j++) {
int x;
scanf("%d", &x);
z += x;
if (j <= s >> 1) sum1 += x;
if (j == (s >> 1) + (s & 1)) sum = x;
}
if (s & 1)
niz[++d] = Niz(sum, sum1);
else
a += sum1;
}
sort(niz + 1, niz + d + 1, cmp1);
for (int i = 1; i <= d; i++)
if (i & 1)
a += niz[i].sum + niz[i].val;
else
a += niz[i].sum;
printf("%d %d\n", a, z - a);
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int N;
vector<int> for_battle;
int main() {
scanf("%d", &N);
long long a = 0, b = 0;
for (int i = 0; i < N; i++) {
int x;
scanf("%d ", &x);
int mid = x % 2 == 0 ? (x / 2) - 1 : (x / 2) - 1;
int right_mid = x % 2 == 0 ? (x / 2) : (x / 2) + 1;
for (int j = 0; j < x; j++) {
int y;
scanf("%d ", &y);
if (j <= mid)
a += y;
else if (j >= right_mid)
b += y;
else
for_battle.push_back(y);
}
}
sort(for_battle.begin(), for_battle.end());
for (int i = for_battle.size() - 1, j = 0; i >= 0; i--, j++)
if (j % 2 == 0)
a += for_battle[i];
else
b += for_battle[i];
printf("%I64d %I64d\n", a, b);
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
const long long C = 106;
const long long N = 2e5 + 17;
const long long mod = 1e9 + 7;
deque<long long> v[C];
void solve() {
long long n, cnt = 0;
cin >> n;
multiset<pair<long long, long long>> s;
multiset<pair<long long, long long>> q;
vector<long long> p;
for (long long i = (long long)1; i <= (long long)n; i++) {
long long m;
cin >> m;
for (long long j = (long long)1; j <= (long long)m; j++) {
long long x;
cin >> x;
v[i].push_back(x);
cnt++;
}
if (m % 2 == 1) {
cnt--;
p.push_back(v[i][v[i].size() / 2]);
v[i].erase(v[i].begin() + (long long)v[i].size() / 2ll);
}
if ((long long)v[i].size()) {
s.insert({v[i][0], i});
q.insert({v[i].back(), i});
}
}
long long cur_A = 0, cur_B = 0, ind = -1;
for (long long i = (long long)1; i <= (long long)cnt; i++) {
if (i & 1) {
auto x = *s.rbegin();
s.erase(s.find(x));
cur_A += x.first;
v[x.second].pop_front();
if (!v[x.second].size()) {
q.erase(q.find({x.first, x.second}));
ind = -1;
} else {
ind = x.second;
s.insert({v[x.second][0], x.second});
}
} else {
if (ind == -1) {
auto x = *q.rbegin();
q.erase(q.find(x));
cur_B += x.first;
v[x.second].pop_back();
if (!v[x.second].size())
s.erase(s.find({x.first, x.second}));
else {
q.insert({v[x.second].back(), x.second});
}
} else {
auto x = make_pair(v[ind].back(), ind);
q.erase(q.find(x));
cur_B += x.first;
v[x.second].pop_back();
if (!v[x.second].size())
s.erase(s.find({x.first, x.second}));
else
q.insert({v[x.second].back(), x.second});
}
}
}
sort(p.begin(), p.end());
reverse(p.begin(), p.end());
for (long long i = (long long)0; i <= (long long)(long long)p.size() - 1;
i++) {
if (i & 1)
cur_B += p[i];
else
cur_A += p[i];
}
cout << cur_A << " " << cur_B;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
srand(time(0));
long long t24 = 1ll;
while (t24--) {
solve();
cout << "\n";
}
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long cn1, cn2;
vector<int> v;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
cn1 = cn2 = 0;
for (int i = 0; i < (n); i++) {
int x;
cin >> x;
for (int j = 0; j < x; j++) {
int y;
cin >> y;
if (x % 2 == 1 && j == x / 2)
v.push_back(y);
else if (j < x / 2)
cn1 += y;
else
cn2 += y;
}
}
sort(v.begin(), v.end());
reverse(v.begin(), v.end());
for (int i = 0; i < (((int)v.size())); i++)
if (i % 2 == 0)
cn1 += v[i];
else
cn2 += v[i];
cout << cn1 << " " << cn2 << endl;
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int T, N, S, C;
T = 1;
while (T--) {
scanf("%d", &N);
vector<int> X;
int A = 0, B = 0;
for (int i = 0; i < N; i++) {
scanf("%d", &S);
for (int j = 0; j < S; j++) {
scanf("%d", &C);
if (2 * j + 1 < S) A += C;
if (2 * j + 1 > S) B += C;
if (2 * j + 1 == S) X.push_back(C);
}
}
sort(X.begin(), X.end(), greater<int>());
for (int i = 0; i < (int)X.size(); i++) i % 2 ? B += X[i] : A += X[i];
printf("%d %d\n", A, B);
}
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
inline int read() {
int f = 1, x = 0;
char ch = getchar();
while (!isdigit(ch)) {
if (ch == '-') f = -1;
ch = getchar();
}
while (isdigit(ch)) {
x = x * 10 + ch - '0';
ch = getchar();
}
return x * f;
}
inline long long readll() {
long long f = 1, x = 0;
char ch = getchar();
while (!isdigit(ch)) {
if (ch == '-') f = -1;
ch = getchar();
}
while (isdigit(ch)) {
x = x * 10 + ch - '0';
ch = getchar();
}
return x * f;
}
int c[105];
int main() {
int n = read();
long long ans = 0, sum = 0;
vector<int> vec;
for (int i = 1; i <= n; ++i) {
int s = read();
for (int j = 1; j <= s; ++j) c[j] = read(), sum += c[j];
if (s & 1) vec.push_back(c[s / 2 + 1]);
for (int j = 1; j <= s / 2; ++j) ans += c[j];
}
sort(vec.begin(), vec.end());
reverse(vec.begin(), vec.end());
for (int i = 0; i < (int)vec.size(); i += 2) ans += vec[i];
cout << ans << " " << sum - ans << endl;
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
int main() {
int n, i, j, k, d = 0, cartas = 0, raro = 0;
int sumanena = 0, sumanene = 0;
int aux1 = 0;
scanf("%d", &n);
int aux[n];
for (i = 0; i < n; i++) {
aux[i] = 0;
}
for (i = 0; i < n; i++) {
scanf("%d", &cartas);
if (cartas % 2 == 0) {
for (j = 0; j < (cartas / 2); j++) {
scanf("%d", &k);
sumanena = sumanena + k;
}
for (j = cartas / 2; j < (cartas); j++) {
scanf("%d", &k);
sumanene = sumanene + k;
}
} else if (cartas % 2 != 0 && cartas != 1) {
for (j = 0; j < cartas / 2; j++) {
scanf("%d", &k);
sumanena = sumanena + k;
}
scanf("%d", &k);
aux[d] = k;
d++;
raro++;
for (j = (cartas / 2) + 1; j < cartas; j++) {
scanf("%d", &k);
sumanene = sumanene + k;
}
} else if (cartas == 1) {
scanf("%d", &k);
aux[d] = k;
d++;
}
}
int cambio;
cambio = 1;
j = 0;
while (cambio == 1) {
cambio = 0;
j++;
for (i = 0; i < n - j; i++) {
if (aux[i] < aux[i + 1]) {
aux1 = aux[i];
aux[i] = aux[i + 1];
aux[i + 1] = aux1;
cambio = 1;
}
}
}
for (i = 0; i < n; i++) {
if (aux[i] != 0) {
if (i % 2 == 0) {
sumanena = sumanena + aux[i];
} else if (i % 2 != 0) {
sumanene = sumanene + aux[i];
}
}
}
printf("%d %d", sumanena, sumanene);
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
typedef struct {
int vector[100];
} cartas;
void cerar(int *vect, int dim);
int pivot(int *unarray, int izq, int der);
void Quicksort(int *unarray, int izq, int der);
int main() {
int k, n, i, j, aux = 0, sumaCiel = 0, sumaJiro = 0;
scanf("%d", &n);
cartas pilas[n];
int dimension[n];
int sobrante[n];
int div = 0;
int encontrado = 0, controlador = 0;
int resto, indice = 0;
cerar(sobrante, n);
for (i = 0; i < n; i++) {
scanf("%d", &dimension[i]);
aux = dimension[i];
for (j = 0; j < aux; j++) {
scanf("%d", &pilas[i].vector[j]);
}
}
for (i = 0; i < n; i++) {
aux = dimension[i];
resto = aux % 2;
div = aux / 2;
if (resto == 0) {
for (j = 0; j < div; j++) {
sumaCiel += pilas[i].vector[j];
pilas[i].vector[j] = 0;
}
for (k = div; k < aux; k++) {
sumaJiro += pilas[i].vector[k];
pilas[i].vector[k] = 0;
}
} else {
for (j = 0; j < div; j++) {
sumaCiel += pilas[i].vector[j];
}
for (k = div + 1; k < aux; k++) {
sumaJiro += pilas[i].vector[k];
}
sobrante[indice] = pilas[i].vector[div];
indice++;
}
}
Quicksort(sobrante, 0, n - 1);
for (i = 0; i < n; i++) {
if (sobrante[i] != 0) {
if (encontrado == 0) {
sumaCiel += sobrante[i];
encontrado = 1;
} else {
sumaJiro += sobrante[i];
encontrado = 0;
}
} else {
i = n;
}
}
printf("%d %d", sumaCiel, sumaJiro);
return 0;
}
void cerar(int *vect, int dim) {
int i = 0;
for (i = 0; i < dim; i++) {
vect[i] = 0;
}
}
int pivot(int *unarray, int izq, int der) {
int i;
int pivote, valor_pivote;
int aux;
pivote = izq;
valor_pivote = unarray[pivote];
for (i = izq + 1; i <= der; i++) {
if (unarray[i] > valor_pivote) {
pivote++;
aux = unarray[i];
unarray[i] = unarray[pivote];
unarray[pivote] = aux;
}
}
aux = unarray[izq];
unarray[izq] = unarray[pivote];
unarray[pivote] = aux;
return pivote;
}
void Quicksort(int *unarray, int izq, int der) {
int pivote;
if (izq < der) {
pivote = pivot(unarray, izq, der);
Quicksort(unarray, izq, pivote - 1);
Quicksort(unarray, pivote + 1, der);
}
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int i, j, k, n, temp;
long long int cei, jiro;
int main() {
cin >> n;
vector<int> a;
for (i = 0; i < n; i++) {
cin >> k;
if (k % 2) {
for (j = 1; j <= k; j++) {
cin >> temp;
if ((k + 1) / 2 > j)
cei += temp;
else if ((k + 1) / 2 < j)
jiro += temp;
else
a.push_back(temp);
}
} else {
for (j = 1; j <= k; j++) {
cin >> temp;
if ((k + 1) / 2 >= j)
cei += temp;
else if ((k + 1) / 2 < j)
jiro += temp;
}
}
}
sort(a.begin(), a.end());
j = 0;
for (i = a.size() - 1; i >= 0; i--) {
if (j % 2 == 0)
cei += a[i];
else
jiro += a[i];
j++;
}
cout << cei << " " << jiro << "\n";
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, m, C, J;
vector<int> c[100], sr;
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &m);
for (int j = 0; j < m; j++) {
int card;
scanf("%d", &card);
if ((m & 1) && (j == m / 2))
sr.push_back(card);
else if (j < m / 2)
C += card;
else
J += card;
}
}
sort(sr.begin(), sr.end());
for (int i = sr.size() - 1; i >= 0; i--) {
if ((i & 1) != ((sr.size() - 1) & 1))
J += sr[i];
else
C += sr[i];
}
printf("%d %d", C, J);
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
inline void R(int &x) {
char ch = getchar();
x = 0;
for (; ch < '0'; ch = getchar())
;
for (; ch >= '0'; ch = getchar()) x = x * 10 + ch - '0';
}
const int N = 105;
int n, cnt[N], a[N][N];
int main() {
R(n);
int m, s1 = 0, s2 = 0;
vector<int> rem;
for (int i = 1; i <= n; ++i) {
R(cnt[i]);
for (int j = 1; j <= cnt[i]; ++j) R(a[i][j]);
m = cnt[i] / 2;
for (int j = 1; j <= m; ++j) s1 += a[i][j], s2 += a[i][cnt[i] + 1 - j];
if (cnt[i] & 1) rem.push_back(a[i][m + 1]);
}
sort(rem.begin(), rem.end());
reverse(rem.begin(), rem.end());
for (int i = 0; i < rem.size(); ++i)
if (i & 1)
s2 += rem[i];
else
s1 += rem[i];
printf("%d %d\n", s1, s2);
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 100 + 10;
int a[maxn][maxn];
int main() {
int n, m;
while (scanf("%d", &n) != EOF) {
int sum1 = 0, sum2 = 0;
int N = 0;
set<pair<int, int> > S;
for (int i = 1; i <= n; i++) {
scanf("%d", &m);
for (int j = 1; j <= m; j++) scanf("%d", &a[i][j]);
if (m % 2 == 0) {
for (int j = 1; j <= m / 2; j++) sum1 += a[i][j];
for (int j = m / 2 + 1; j <= m; j++) sum2 += a[i][j];
} else {
for (int j = 1; j <= m / 2; j++) sum1 += a[i][j];
for (int j = m / 2 + 2; j <= m; j++) sum2 += a[i][j];
N++;
S.insert(make_pair(a[i][m / 2 + 1], N));
}
}
int flag = 0;
while (!S.empty()) {
if (flag == 0) {
int u = S.rbegin()->first;
int v = S.rbegin()->second;
sum1 += u;
S.erase(make_pair(u, v));
flag = 1 - flag;
} else {
int u = S.rbegin()->first;
int v = S.rbegin()->second;
sum2 += u;
S.erase(make_pair(u, v));
flag = 1 - flag;
}
}
printf("%d %d\n", sum1, sum2);
}
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> v;
int n;
cin >> n;
int p[2] = {0, 0};
while (n--) {
int s;
cin >> s;
int x;
for (int i = 0; i <= (s / 2 - 1); i++) {
cin >> x;
p[0] += x;
}
if (s % 2 == 1) {
cin >> x;
v.push_back(x);
}
for (int i = ((s % 2 == 0) ? (s / 2) : (s / 2) + 1); i < s; i++) {
cin >> x;
p[1] += x;
}
}
sort(v.begin(), v.end());
int gamer = 0;
for (int i = (v.size() - 1); i >= 0; i--) {
p[gamer] += v[i];
gamer = (gamer + 1) % 2;
}
cout << p[0] << " " << p[1] << endl;
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
const long long N = 2e5 + 7, NS = 5e3 + 7, lg = 20, sq = 550, inf = 1e9 + 7,
mod = 1e9 + 7;
const long double eps = 1e-7;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
vector<long long> c[N], t;
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
long long n, ans1 = 0, ans2 = 0;
cin >> n;
for (long long i = 0; i < n; i++) {
long long s, a;
cin >> s;
while (s--) {
cin >> a;
c[i].push_back(a);
}
if (c[i].size() % 2) t.push_back(c[i][c[i].size() / 2]);
for (long long j = 0; j < c[i].size() / 2; j++) {
ans1 += c[i][j];
ans2 += c[i][c[i].size() - j - 1];
}
}
sort((t).begin(), (t).end());
reverse((t).begin(), (t).end());
for (long long i = 0; i < t.size(); i++) {
if (i % 2)
ans2 += t[i];
else
ans1 += t[i];
}
cout << ans1 << ' ' << ans2 << '\n';
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 100, S = 100, M = N * S, INF = 1e9;
int c[N][S], s[N], n;
int main() {
cin >> n;
int ciel = 0, jiro = 0;
vector<int> remain;
for (int i = 0; i < n; ++i) {
cin >> s[i];
for (int j = 0; j < s[i]; ++j) cin >> c[i][j];
for (int x = 0, y = s[i] - 1; x <= y; ++x, --y) {
if (x == y)
remain.push_back(c[i][x]);
else
ciel += c[i][x], jiro += c[i][y];
}
}
sort(remain.rbegin(), remain.rend());
for (unsigned i = 0; i < remain.size(); ++i) {
if ((i & 1) == 0)
ciel += remain[i];
else
jiro += remain[i];
}
cout << ciel << ' ' << jiro;
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
const long long n_ = 1e5 + 1000;
const long double PI = acos(-1.0);
long long gcd(long long a, long long b) { return (a ? gcd(b % a, a) : b); }
long long power(long long a, long long n) {
long long p = 1;
while (n > 0) {
if (n % 2) {
p = p * a;
}
n >>= 1;
a *= a;
}
return p;
}
long long power(long long a, long long n, long long mod) {
long long p = 1;
while (n > 0) {
if (n % 2) {
p = p * a;
p %= mod;
}
n >>= 1;
a *= a;
a %= mod;
}
return p % mod;
}
class UnionFind {
private:
vector<long long> p, rank, setSize;
long long numSets;
public:
UnionFind(long long N) {
setSize.assign(N, 1);
numSets = N;
rank.assign(N, 0);
p.assign(N, 0);
for (long long i = 0; i < N; i++) p[i] = i;
}
long long findSet(long long i) {
return (p[i] == i) ? i : (p[i] = findSet(p[i]));
}
bool isSameSet(long long i, long long j) { return findSet(i) == findSet(j); }
void unionSet(long long i, long long j) {
if (!isSameSet(i, j)) {
numSets--;
long long x = findSet(i), y = findSet(j);
if (rank[x] > rank[y]) {
p[y] = x;
setSize[x] += setSize[y];
} else {
p[x] = y;
setSize[y] += setSize[x];
if (rank[x] == rank[y]) rank[y]++;
}
}
}
long long numDisjointSets() { return numSets; }
long long sizeOfSet(long long i) { return setSize[findSet(i)]; }
};
long long a[3000005];
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long n, s, x;
cin >> n;
vector<long long> v[n];
for (long long i = 0; i < n; i++) {
cin >> s;
for (long long j = 0; j < s; j++) {
cin >> x;
v[i].push_back(x);
}
}
long long a = 0, b = 0;
vector<long long> c;
for (long long i = 0; i < n; i++) {
long long l = v[i].size();
if (l % 2) {
for (long long j = 0; j < l; j++) {
if (j < l / 2)
a += v[i][j];
else if (j > l / 2)
b += v[i][j];
else
c.push_back(v[i][j]);
}
} else {
for (long long j = 0; j < l; j++) {
if (j < l / 2)
a += v[i][j];
else
b += v[i][j];
}
}
}
sort(c.rbegin(), c.rend());
for (long long i = 0; i < c.size(); i++) {
if (i % 2 == 0)
a += c[i];
else
b += c[i];
}
cout << a << " " << b;
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 100 + 10;
struct dong {
int x, y, z;
friend bool operator<(dong a, dong b) {
return a.z > b.z || a.z == b.z && a.x < b.x ||
a.z == b.z && a.x == b.x && a.y < b.y;
}
} zlt, wdc;
multiset<dong> s1, s2, s3;
int a[maxn][maxn], f[maxn][maxn * maxn], s[maxn], b[maxn];
int i, j, k, l, t, n, m, num, sum, ans1, ans2, now, top;
int main() {
scanf("%d", &n);
for (i = 1; i <= n; i++) {
scanf("%d", &s[i]);
num += s[i];
for (j = 1; j <= s[i]; j++) scanf("%d", &a[i][j]), sum += a[i][j];
if (s[i] % 2 == 0) {
for (j = 1; j <= s[i] / 2; j++) ans1 += a[i][j];
for (j = s[i] / 2 + 1; j <= s[i]; j++) ans2 += a[i][j];
} else {
for (j = 1; j <= s[i] / 2; j++) ans1 += a[i][j];
for (j = s[i] / 2 + 2; j <= s[i]; j++) ans2 += a[i][j];
b[++top] = a[i][s[i] / 2 + 1];
}
}
sort(b + 1, b + top + 1);
now = 0;
for (i = top; i >= 1; i--) {
if (!now)
ans1 += b[i];
else
ans2 += b[i];
now = 1 - now;
}
printf("%d %d\n", ans1, ans2);
}
| 9 | CPP |
n = int(input())
lista = []
aux = []
somaA = 0
somaB = 0
for i in range(n):
a = [int(i) for i in input().split()][1:]
if len(a) > 1:
somaA += sum(a[0:len(a)//2])
somaB += sum(a[-(len(a)//2):])
if len(a) % 2 == 1:
aux.append(a[len(a)//2])
aux.sort(reverse=True)
for i in range(0, len(aux), 2):
somaA += aux[i]
for i in range(1, len(aux), 2):
somaB += aux[i]
print(somaA, somaB) | 9 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
vector<int> v;
int main() {
int n;
int a;
int i;
int c = 0;
int j = 0;
int f;
int m;
int k;
cin >> n;
for (i = 0; i < n; i++) {
cin >> a;
for (f = 0; f < a / 2; f++) {
cin >> k;
c = c + k;
}
if (a % 2) {
cin >> m;
v.push_back(m);
}
for (f = 0; f < a / 2; f++) {
cin >> k;
j = j + k;
}
}
sort(v.begin(), v.end());
for (i = v.size() - 1; i >= 0; i -= 2) {
c += v[i];
if (i - 1 >= 0) j += v[i - 1];
}
cout << c << " " << j << endl;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N_MAX = 100 + 10;
int N, a[N_MAX], fir = 0, sec = 0;
vector<int> mid;
int main() {
scanf("%d", &N);
for (int i = 1; i <= N; ++i) {
memset(a, 0, sizeof(a));
int tmp;
scanf("%d", &tmp);
for (int j = 1; j <= tmp; ++j) scanf("%d", &a[j]);
if (tmp % 2 == 0) {
for (int j = 1; j <= tmp / 2; ++j) fir += a[j];
for (int j = tmp / 2 + 1; j <= tmp; ++j) sec += a[j];
} else {
for (int j = 1; j <= tmp / 2; ++j) fir += a[j];
for (int j = tmp / 2 + 2; j <= tmp; ++j) sec += a[j];
if (tmp / 2 + 1 <= tmp) mid.push_back(a[tmp / 2 + 1]);
}
}
sort(mid.begin(), mid.end(), greater<int>());
for (int j = 0, size = mid.size(); j < size; ++j)
if (j % 2 == 0)
fir += mid[j];
else
sec += mid[j];
printf("%d %d\n", fir, sec);
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
vector<int> v;
int N, M, s1, s2;
int ok = 1;
int main() {
scanf("%d", &N);
for (int i = 1; i <= N; ++i) {
scanf("%d", &M);
for (int i = 1; i <= M; ++i) {
int x;
scanf("%d", &x);
if (i == (M + 1) / 2 && M % 2 == 1) {
v.push_back(x);
} else if (i <= M / 2) {
s1 += x;
} else {
s2 += x;
}
}
}
sort(v.begin(), v.end());
reverse(v.begin(), v.end());
for (int i = 0; i < v.size(); ++i) {
if (i % 2 == 0) {
s1 += v[i];
} else {
s2 += v[i];
}
}
printf("%d %d", s1, s2);
}
| 9 | CPP |
#include <bits/stdc++.h>
const int N = 998244;
inline int gi() {
char c = getchar();
int s = 0, f = 1;
while (c > '9' || c < '0') {
if (c == '-') f = -f;
c = getchar();
}
while (c <= '9' && c >= '0')
s = (s << 3) + (s << 1) + (c - '0'), c = getchar();
return s * f;
}
int n, m, aan, ban;
bool a;
std::priority_queue<int> q;
signed main() {
n = gi();
for (int i = 1; i <= n; i++) {
m = gi();
if (m % 2) {
for (int o = 1; o <= (m >> 1); o++) aan += gi();
q.push(gi());
for (int o = 1; o <= (m >> 1); o++) ban += gi();
} else {
for (int o = 1; o <= (m >> 1); o++) aan += gi();
for (int o = 1; o <= (m >> 1); o++) ban += gi();
}
}
while (!q.empty()) {
if (!a)
aan += q.top();
else
ban += q.top();
q.pop();
a ^= 1;
}
printf("%d %d\n", aan, ban);
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
{
int n;
cin >> n;
long long int sumchef = 0;
long long int sumram = 0;
vector<int> arr(1000000, 0);
int noodd = 0;
int noofpair = 0;
vector<int> arrextra;
for (int i = 1; i <= n; i++) {
int c;
cin >> c;
for (int j = 0; j < c; j++) {
cin >> arr[j];
}
if (c % 2 == 0) {
for (int x = 0; x < c / 2; x++) sumchef += arr[x];
for (int x = c / 2; x < c; x++) sumram += arr[x];
} else if (c % 2 != 0) {
for (int x = 0; x < c / 2; x++) sumchef += arr[x];
for (int x = c / 2 + 1; x < c; x++) sumram += arr[x];
arrextra.push_back(arr[c / 2]);
noodd++;
}
noofpair += c / 2;
}
bool turnchef = true;
if (noofpair % 2 == 0) turnchef = true;
sort(arrextra.begin(), arrextra.end(), greater<int>());
for (int idx = 0; idx < noodd; idx++) {
if (turnchef == true) {
sumchef += arrextra[idx];
} else {
sumram += arrextra[idx];
}
turnchef = (turnchef == 1) ? 0 : 1;
}
cout << sumchef << " " << sumram << endl;
}
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int a[105];
int b[105];
bool cmp(int a, int b) { return a > b; }
int main() {
int n, x = 0, y = 0, m;
int cnt = 0;
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &m);
for (int j = 1; j <= m; j++) {
scanf("%d", &a[j]);
}
if (m & 1) {
for (int j = 1; j <= m / 2; j++) {
x += a[j];
}
b[cnt++] = a[m / 2 + 1];
for (int j = m / 2 + 2; j <= m; j++) {
y += a[j];
}
} else {
for (int j = 1; j <= m / 2; j++) {
x += a[j];
}
for (int j = m / 2 + 1; j <= m; j++) {
y += a[j];
}
}
}
sort(b, b + cnt, cmp);
for (int i = 0; i < cnt; i++) {
if (i & 1)
y += b[i];
else
x += b[i];
}
printf("%d %d", x, y);
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
vector<int> v;
int main() {
int ciel = 0, jiro = 0, i, j, s[105], n, m;
scanf("%d", &n);
s[0] = 0;
while (n--) {
scanf("%d", &m);
for (i = 1; i <= m; ++i) {
scanf("%d", &j);
s[i] = s[i - 1] + j;
}
ciel += s[m >> 1];
jiro += s[m] - s[(m + 1) >> 1];
if (m & 1) v.push_back(-s[(m >> 1) + 1] + s[m >> 1]);
}
sort(v.begin(), v.end());
for (i = 0; i < v.size(); ++i)
if (i & 1)
jiro -= v[i];
else
ciel -= v[i];
printf("%d %d", ciel, jiro);
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
int x = 0, y = 0;
vector<int> odd;
for (int i = (0); i < (n); ++i) {
int u;
scanf("%d", &u);
if (u % 2 == 0) {
for (int j = (0); j < (u); ++j) {
int a;
scanf("%d", &a);
if (j < u / 2)
x += a;
else
y += a;
}
} else {
for (int j = (0); j < (u); ++j) {
int a;
scanf("%d", &a);
if (j < u / 2)
x += a;
else if (2 * j + 1 == u)
odd.push_back(a);
else
y += a;
}
}
}
sort(odd.begin(), odd.end(), greater<int>());
for (int i = (0); i < (odd.size()); ++i) {
if (i % 2)
y += odd[i];
else
x += odd[i];
}
cout << x << " " << y << endl;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int a[1000];
int main() {
int n, m, x, t1, t2;
while (scanf("%d", &n) != EOF) {
t1 = t2 = 0;
for (int i = 1; i <= n; i++) {
scanf("%d", &m);
a[i] = 0;
for (int j = 1; j <= m; j++) {
scanf("%d", &x);
if (j == (m + 1) / 2 && m % 2 == 1) a[i] = x;
t1 += (j <= m / 2 ? x : 0);
t2 += x;
}
}
sort(a + 1, a + 1 + n);
for (int i = n; i >= 1; i--) t1 += ((n - i) % 2 == 0 ? a[i] : 0);
printf("%d %d\n", t1, t2 - t1);
}
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007;
long long POW(long long a, long long b, long long MMM = MOD) {
long long ret = 1;
for (; b; b >>= 1, a = (a * a) % MMM)
if (b & 1) ret = (ret * a) % MMM;
return ret;
}
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
long long lcm(long long a, long long b) {
if (a == 0 || b == 0) return a + b;
return a * (b / gcd(a, b));
}
int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0};
int ddx[] = {0, 0, 1, 1, 1, -1, -1, -1}, ddy[] = {1, -1, 1, 0, -1, 1, 0, -1};
int ans[2];
int main() {
priority_queue<int> q;
int n;
scanf("%d", &n);
for (int(i) = (0); (i) <= (n - 1); (i) += (1)) {
int k;
scanf("%d", &k);
int m = k / 2;
if (k & 1) {
for (int(t) = (0); (t) <= (k - 1); (t) += (1)) {
int x;
scanf("%d", &x);
if (t < m)
ans[0] += x;
else if (t == m)
q.push(x);
else
ans[1] += x;
}
} else {
for (int(t) = (0); (t) <= (k - 1); (t) += (1)) {
int x;
scanf("%d", &x);
if (t < m)
ans[0] += x;
else
ans[1] += x;
}
}
}
int now = 0;
while (!q.empty()) {
ans[now] += q.top();
q.pop();
now = 1 - now;
}
printf("%d %d", ans[0], ans[1]);
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 105;
int n, i, j;
struct Pipe {
int s[N], top, bottom, sum;
} p[N];
bool cmp(Pipe a, Pipe b) { return a.sum > b.sum; }
int main() {
memset(p, 0, sizeof(p));
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &p[i].bottom);
for (j = 0; j < p[i].bottom; j++) {
scanf("%d", &p[i].s[j]);
p[i].sum = p[i].s[p[i].bottom / 2];
}
}
sort(p, p + n, cmp);
int ans1 = 0, ans2 = 0, bo = 0;
for (i = 0; i < n; i++) {
if (p[i].bottom % 2 == 0) {
for (j = 0; j < p[i].bottom / 2; j++) {
ans1 += p[i].s[j];
}
for (; j < p[i].bottom; j++) ans2 += p[i].s[j];
} else {
for (j = 0; j < p[i].bottom / 2 + (bo % 2 == 0); j++) ans1 += p[i].s[j];
for (; j < p[i].bottom; j++) ans2 += p[i].s[j];
bo++;
}
}
printf("%d %d\n", ans1, ans2);
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
typedef struct mazo {
struct mazo* sigmazo;
int dato;
struct mazo* sigcarta;
struct mazo* antcarta;
} CARTAS;
CARTAS* crearMazo(int, long int*, long int*);
void eliminar(CARTAS*);
int main() {
long int sumPar = 0, sumImpar = 0;
int mazos, i, sum = 0, mayor, menor, cartas;
CARTAS *cabeza, *ptr, *ptrcartas, *nodoeliminar, *mazo;
scanf("%d", &mazos);
for (i = 0; i < mazos; i++) {
scanf("%d", &cartas);
sum += cartas;
if (i == 0) {
cabeza = crearMazo(cartas, &sumPar, &sumImpar);
ptr = cabeza;
} else {
ptr->sigmazo = crearMazo(cartas, &sumPar, &sumImpar);
ptr = ptr->sigmazo;
}
}
for (i = 0; i < sum; i++) {
ptr = cabeza;
mayor = -10;
if (i % 2 == 0) {
while (ptr != NULL) {
if (ptr->dato != 0) {
if (ptr->sigcarta->dato > mayor) {
mayor = ptr->sigcarta->dato;
nodoeliminar = ptr->sigcarta;
mazo = ptr;
}
}
ptr = ptr->sigmazo;
}
if (nodoeliminar != NULL) {
eliminar(nodoeliminar);
mazo->dato--;
sumPar += (long int)mayor;
nodoeliminar = NULL;
}
} else {
mayor = -10;
while (ptr != NULL) {
if (ptr->dato != 0) {
if (ptr->antcarta->dato > mayor) {
mayor = ptr->antcarta->dato;
nodoeliminar = ptr->antcarta;
mazo = ptr;
}
}
ptr = ptr->sigmazo;
}
if (nodoeliminar != NULL) {
eliminar(nodoeliminar);
mazo->dato--;
sumImpar += (long int)mayor;
nodoeliminar = NULL;
}
}
}
printf("%ld %ld", sumPar, sumImpar);
return 0;
}
CARTAS* crearMazo(int cartas, long int* sumPar, long int* sumImpar) {
CARTAS *cabezamazo, *ptr, *nodo;
int dato = 0, i;
cabezamazo = (CARTAS*)malloc(sizeof(CARTAS));
if (cartas % 2 == 0) {
cabezamazo->dato = 0;
} else {
cabezamazo->dato = 1;
}
cabezamazo->antcarta = cabezamazo;
cabezamazo->sigcarta = cabezamazo;
ptr = cabezamazo;
for (i = 0; i < cartas; i++) {
scanf("%d", &dato);
if (i < (cartas / 2)) {
*sumPar += dato;
} else if (i == (cartas / 2) && cartas % 2 == 1) {
nodo = (CARTAS*)malloc(sizeof(CARTAS));
nodo->dato = dato;
nodo->sigmazo = NULL;
nodo->sigcarta = cabezamazo;
nodo->antcarta = ptr;
cabezamazo->antcarta = nodo;
ptr->sigcarta = nodo;
ptr = ptr->sigcarta;
} else if (i == (cartas / 2) && cartas % 2 == 0) {
*sumImpar += dato;
} else if (i > (cartas / 2)) {
*sumImpar += dato;
}
}
cabezamazo->sigmazo = NULL;
return cabezamazo;
}
void eliminar(CARTAS* nodo) {
nodo->antcarta->sigcarta = nodo->sigcarta;
nodo->sigcarta->antcarta = nodo->antcarta;
free(nodo);
}
| 9 | CPP |
#include <bits/stdc++.h>
std::mt19937 rng(
(int)std::chrono::steady_clock::now().time_since_epoch().count());
int main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(NULL);
int n;
std::cin >> n;
std::vector<int> middle;
int ans[2] = {0, 0};
while (n--) {
int size;
std::cin >> size;
std::vector<int> a(size);
for (int i = 0; i < size; i++) {
std::cin >> a[i];
}
int l = 0, r = size - 1;
while (l < r) {
ans[0] += a[l++];
ans[1] += a[r--];
}
if (l == r) {
middle.push_back(a[l]);
}
}
std::sort(middle.rbegin(), middle.rend());
for (int i = 0; i < (int)middle.size(); i++) {
ans[i % 2] += middle[i];
}
std::cout << ans[0] << ' ' << ans[1] << '\n';
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, F = 0, sum = 0, x, lim, s, y;
scanf("%d", &n);
vector<int> V;
for (int i = 0; i < n; i++) {
scanf("%d", &m);
lim = m / 2;
s = y = 0;
for (int j = 0; j < m; j++) {
scanf("%d", &x);
sum += x;
if (j < lim) s += x;
if (j == lim) y = x;
}
if (m & 1) V.push_back(y);
F += s;
}
sort((V.rbegin()), (V.rend()));
for (int i = 0; i < ((int)V.size()); i += 2) {
F += V[i];
}
printf("%d %d\n", F, sum - F);
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 105;
int a[maxn];
vector<int> vc;
int main() {
ios::sync_with_stdio(false);
int n, m;
int tot = 0;
int i, j, k;
int sa = 0, sb = 0;
scanf("%d", &n);
for (i = 0; i < n; ++i) {
scanf("%d", &m);
for (j = 0; j < m; ++j) scanf("%d", &a[j]);
for (j = 0, k = m - 1; j < k; ++j, --k) {
sa += a[j];
sb += a[k];
}
if (m & 1) vc.push_back(a[m >> 1]);
}
sort((vc).begin(), (vc).end(), greater<int>());
n = ((int)(vc).size());
for (i = 0; i < n; ++i) {
if (i & 1) {
sb += vc[i];
} else {
sa += vc[i];
}
}
printf("%d %d\n", sa, sb);
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int t, ans1, ans2;
vector<int> v;
int main() {
cin >> t;
for (int i = 1; i <= t; ++i) {
int n;
cin >> n;
int sum1 = 0, sum2 = 0;
for (int j = 0; j < n; ++j) {
int a;
cin >> a;
if (j < (n / 2))
sum1 += a;
else if (j >= ((n + 1) / 2))
sum2 += a;
else
v.push_back(a);
}
ans1 += sum1;
ans2 += sum2;
}
sort(v.begin(), v.end());
reverse(v.begin(), v.end());
for (int i = 0; i < (int)(v.size()); ++i) {
if (i % 2)
ans2 += v[i];
else
ans1 += v[i];
}
cout << ans1 << ' ' << ans2;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace ::std;
int n, m, s;
int in[105];
int mid[105];
int ans1, ans2;
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &s);
for (int j = 0; j < s; j++) scanf("%d", &in[j]);
for (int j = 0; j < s - j - 1; j++) {
ans1 += in[j];
ans2 += in[s - j - 1];
}
if (s % 2 == 1) mid[m++] = in[(s - 1) / 2];
}
sort(mid, mid + m);
for (int i = m - 1; i >= 0; i--) {
if ((m - i - 1) % 2 == 0)
ans1 += mid[i];
else
ans2 += mid[i];
}
printf("%d %d", ans1, ans2);
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
bool compare(int a, int b) { return a > b; }
inline long long int fastRead() {
long long int a = 0;
char c = getchar();
while (c < '0' || c > '9') c = getchar();
while (c >= '0' && c <= '9') {
a = (a << 3) + (a << 1) + c - '0';
c = getchar();
}
return a;
}
int main() {
int n;
cin >> n;
int temp[104], chef = 0, jiro = 0;
int k = 0, i, j, s, a;
for (i = 0; i < n; i++) {
s = fastRead();
if (s % 2) {
for (j = 0; j < s / 2; j++) {
a = fastRead();
chef += a;
}
a = fastRead();
temp[k++] = a;
j++;
for (; j < s; j++) {
a = fastRead();
jiro += a;
}
} else {
for (j = 0; j < s / 2; j++) {
a = fastRead();
chef += a;
}
for (; j < s; j++) {
a = fastRead();
jiro += a;
}
}
}
sort(temp, temp + k, compare);
int flag = 1;
for (i = 0; i < k; i++) {
if (flag)
chef += temp[i];
else
jiro += temp[i];
flag = !flag;
}
cout << chef << " " << jiro << endl;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int score[2];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
multiset<int> left;
for (int i = 0; i < n; i++) {
int s;
cin >> s;
for (int j = 0; j < s; j++) {
int x;
cin >> x;
if (j < s / 2) {
score[0] += x;
} else if (j >= (s + 1) / 2)
score[1] += x;
if (s % 2 && j == s / 2) left.insert(x);
}
}
int f = 0;
while (!left.empty()) {
score[f] += *(--left.end());
f = 1 - f;
left.erase(--left.end());
}
cout << score[0] << " " << score[1];
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
void swap(int* a, int* b);
void ordena(int n, int v[n]);
int main() {
int n, i, s, k, c = 0, pos, ceil = 0, jiro = 0, p, cant = 0;
int vecs[100];
scanf("%d", &n);
int sobra[n];
for (p = 0; p < n; p++) sobra[p] = 0;
for (i = 0; i < n; i++) {
scanf("%d", &s);
for (k = 0; k < s; k++) {
scanf("%d", &vecs[k]);
}
if (s % 2 == 0) {
for (p = 0; p < s / 2; p++) ceil += vecs[p];
for (p = s / 2; p < s; p++) jiro += vecs[p];
} else {
for (p = 0; p < s / 2; p++) ceil += vecs[p];
for (p = s / 2 + 1; p < s; p++) jiro += vecs[p];
sobra[c] = vecs[s / 2];
c++;
}
for (p = 0; p < s; p++) vecs[p] = 0;
}
ordena(n, sobra);
for (i = 0; i < c; i++) {
if (i % 2 == 0)
ceil += sobra[i];
else
jiro += sobra[i];
}
printf("%d %d", ceil, jiro);
return 0;
}
void ordena(int n, int v[n]) {
int i, j;
for (i = 0; i < n - 1; i++) {
for (j = 0; j < n - 1 - i; j++) {
if (v[j] < v[j + 1]) swap(&v[j], &v[j + 1]);
}
}
}
void swap(int* a, int* b) {
int f;
f = *a;
*a = *b;
*b = f;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, i, j, k, l, m, n;
cin >> n;
int l1 = 0;
int l2 = 0;
vector<int> v1;
for (i = 0; i < n; i++) {
cin >> m;
if (m % 2 == 0) {
for (j = 1; j <= m; j++) {
cin >> a;
if (j <= m / 2)
l1 += a;
else
l2 += a;
}
} else {
for (j = 1; j <= m; j++) {
cin >> a;
if (j <= m / 2)
l1 += a;
else
l2 += a;
if (j == (m / 2) + 1) {
v1.push_back(a);
l2 -= a;
}
}
}
}
sort(v1.rbegin(), v1.rend());
for (i = 0; i < v1.size(); i++) {
if (i % 2 == 0)
l1 += v1[i];
else
l2 += v1[i];
}
cout << l1 << " " << l2 << endl;
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
void RI(int& x) {
x = 0;
char c = getchar();
while (!(c >= '0' && c <= '9' || c == '-')) c = getchar();
bool flag = 1;
if (c == '-') {
flag = 0;
c = getchar();
}
while (c >= '0' && c <= '9') {
x = x * 10 + c - '0';
c = getchar();
}
if (!flag) x = -x;
}
void RII(int& x, int& y) { RI(x), RI(y); }
void RIII(int& x, int& y, int& z) { RI(x), RI(y), RI(z); }
void RC(char& c) {
c = getchar();
while (c == ' ' || c == '\n') c = getchar();
}
char RC() {
char c = getchar();
while (c == ' ' || c == '\n') c = getchar();
return c;
}
const long long mod = 1e9 + 7;
const long long LINF = 1e18;
const int INF = 1e9;
const double EPS = 1e-8;
int main() {
int n;
cin >> n;
int ans1 = 0, ans2 = 0;
vector<int> vec;
for (int i = 1; i <= n; i++) {
int num;
cin >> num;
if (num & 1) {
for (int i = 1; i <= num / 2; i++) {
int t;
cin >> t;
ans1 += t;
}
int t;
cin >> t;
vec.push_back(t);
for (int i = num / 2 + 2; i <= num; i++) {
int t;
cin >> t;
ans2 += t;
}
} else {
for (int i = 1; i <= num / 2; i++) {
int t;
cin >> t;
ans1 += t;
}
for (int i = num / 2 + 1; i <= num; i++) {
int t;
cin >> t;
ans2 += t;
}
}
}
sort((vec).begin(), (vec).end());
int t = 0;
for (int i = (int)vec.size() - 1; i >= 0; i--) {
if (t == 0)
ans1 += vec[i];
else
ans2 += vec[i];
t ^= 1;
}
cout << ans1 << " " << ans2 << endl;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int a[110][110];
int s[110];
vector<int> f;
int main() {
int n, m = 0, sum = 0;
scanf("%d", &n);
f.clear();
for (int i = 0; i < n; i++) {
scanf("%d", &s[i]);
for (int j = 0; j < s[i]; j++) scanf("%d", &a[i][j]), sum += a[i][j];
if (s[i] & 1) f.push_back(a[i][s[i] / 2]);
}
int ans = 0;
sort(f.begin(), f.end());
for (int i = f.size() - 1, j = 1; i >= 0; i--, j ^= 1)
if (j) ans += f[i];
for (int i = 0; i < n; i++)
for (int j = 0; j < s[i] / 2; j++) ans += a[i][j];
printf("%d %d\n", ans, sum - ans);
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int INF = (int)1E9;
const long long LINF = (long long)4E18;
const long double PI = acos(-1.0);
const long double E = 2.718281828459045L;
template <typename T>
T gcd(T a, T b) {
return (b = 0) ? abs(a) : gcd(b, a % b);
}
template <typename T>
inline T lcm(T a, T b) {
return a / gcd(a, b) * b;
}
template <typename T>
inline T mod(T a, T b) {
return (a % b + b) % b;
}
template <typename T>
inline T sqr(T x) {
return x * x;
}
template <typename T>
inline string toString(const T& x) {
ostringstream os;
os << x;
return os.str();
}
inline long long toInt(const string& s) {
istringstream is(s);
long long x;
is >> x;
return x;
}
inline long double toDouble(const string& s) {
istringstream is(s);
long double x;
is >> x;
return x;
}
inline string toLower(string s) {
for (typeof((s).begin()) it = (s).begin(); it != (s).end(); ++it)
*it = tolower(*it);
return s;
}
inline string toUpper(string s) {
for (typeof((s).begin()) it = (s).begin(); it != (s).end(); ++it)
*it = toupper(*it);
return s;
}
const char DEBUG_PARAM[] = "__LOCAL_TESTING";
const char IN[] = "e.in";
const char OUT[] = "e.out";
int ntest = 1, test;
const int dx[] = {-1, 0, 0, 1};
const int dy[] = {0, -1, 1, 0};
const long double EPS = 1E-9;
const long long MODULO = 1000000007LL;
int main() {
ios_base::sync_with_stdio(false);
int t, n, d = 0, x, t1;
int a[1001];
cin >> t;
int s = 0, c = 0;
for (int j = (1); j <= (t); j++) {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> x;
s += x;
t1 = i * 2 - n;
if (t1 == 1)
a[c++] = -x;
else if (t1 <= 0)
d += x;
}
}
sort(a, a + c);
for (int i = 0; i < c; i += 2) d -= a[i];
cout << d << " " << s - d;
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, s[200], a[200][200], b[200];
int main() {
while (~scanf("%d", &n)) {
for (int i = 1; i <= n; i++) {
scanf("%d", &s[i]);
for (int j = 1; j <= s[i]; j++) scanf("%d", &a[i][j]);
}
int s1 = 0;
int s2 = 0;
int k = 0;
for (int i = 1; i <= n; i++) {
if (s[i] % 2 == 1) {
k++;
b[k] = a[i][s[i] / 2 + 1];
}
for (int j = 1; j <= s[i] / 2; j++) s1 += a[i][j];
for (int j = (s[i] + 3) / 2; j <= s[i]; j++) s2 += a[i][j];
}
sort(b + 1, b + k + 1);
for (int i = k; i >= 1; i--)
if (i % 2 == k % 2)
s1 += b[i];
else
s2 += b[i];
printf("%d %d\n", s1, s2);
}
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int t;
int first = 0;
int second = 0;
int temp;
vector<int> middle;
for (int i = 0; i < n; i++) {
cin >> t;
for (int i = 0; i < t / 2; i++) {
cin >> temp;
first += temp;
}
if (t % 2 == 1) {
cin >> temp;
middle.push_back(temp);
}
for (int i = 0; i < t / 2; i++) {
cin >> temp;
second += temp;
}
}
sort(middle.begin(), middle.end());
while (true) {
if (middle.empty()) break;
temp = middle.back();
middle.pop_back();
first += temp;
if (middle.empty()) break;
temp = middle.back();
middle.pop_back();
second += temp;
}
cout << first << " " << second << endl;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int t[105], a[105], sum1, sum2, n, m, tot;
int main() {
scanf("%d", &n);
for (int i = 0; i < n; ++i) {
scanf("%d", &m);
for (int i = 0; i < m; ++i) {
int t;
scanf("%d", &t);
if ((m & 1) && i == m / 2)
a[tot++] = t;
else if (i < m / 2)
sum1 += t;
else
sum2 += t;
}
}
sort(a, a + tot, greater<int>());
for (int i = 0; i < tot; ++i)
if (i & 1)
sum2 += a[i];
else
sum1 += a[i];
printf("%d %d", sum1, sum2);
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int ans1 = 0, ans2 = 0;
long long int n;
cin >> n;
vector<long long int> v;
for (int i = 1; i <= n; i++) {
long long int second, t;
cin >> second;
for (int j = 1; j <= second; j++) {
cin >> t;
if (second % 2 == 0) {
if (j <= second / 2)
ans1 += t;
else
ans2 += t;
} else {
if (j <= second / 2)
ans1 += t;
else if (j > second / 2 + 1)
ans2 += t;
else
v.push_back(t);
}
}
}
sort(v.begin(), v.end());
reverse(v.begin(), v.end());
for (int i = 0; i < v.size(); i++) {
if (i % 2 == 0)
ans1 += v[i];
else
ans2 += v[i];
}
cout << ans1 << " " << ans2;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
bool sor(int x, int y) { return x >= y; }
int main() {
int n, s, c;
int ret0 = 0, ret1 = 0;
vector<int> z;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &s);
for (int j = 0; j < s / 2; j++) {
scanf("%d", &c);
ret0 += c;
}
if (s % 2 == 1) {
scanf("%d", &c);
z.push_back(c);
}
for (int j = 0; j < s / 2; j++) {
scanf("%d", &c);
ret1 += c;
}
}
sort(z.begin(), z.end(), sor);
s = z.size();
for (int i = 0; i < s; i++) {
if (i % 2 == 0)
ret0 += z[i];
else
ret1 += z[i];
}
printf("%d %d\n", ret0, ret1);
}
| 9 | CPP |
#include <bits/stdc++.h>
int pile[105][105], buf[105];
int main() {
int n, first = 0, second = 0, cnt = 0;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
int k, t;
scanf("%d", &k);
for (int i = 0; i < k / 2; i++) {
scanf("%d", &t);
first += t;
}
if (k % 2) scanf("%d", &buf[cnt++]);
for (int i = 0; i < k / 2; i++) {
scanf("%d", &t);
second += t;
}
}
std::sort(buf, buf + cnt);
for (int i = cnt - 1, flg = 1; i >= 0; i--, flg = !flg) {
if (flg)
first += buf[i];
else
second += buf[i];
}
printf("%d %d\n", first, second);
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int INF = 1000000000;
struct debugger {
template <typename T>
debugger& operator,(const T& v) {
cerr << v << " ";
return *this;
}
} dbg;
int main() {
int N;
scanf("%d", &N);
int C = 0, J = 0;
vector<int> mid;
for (int i = 0; i < (N); i++) {
int s;
scanf("%d", &s);
for (int j = 0; j < (s / 2); j++) {
int c;
scanf("%d", &c);
C += c;
}
if (s & 1) {
int c;
scanf("%d", &c);
mid.push_back(c);
}
for (int j = 0; j < (s / 2); j++) {
int c;
scanf("%d", &c);
J += c;
}
}
sort((mid).begin(), (mid).end());
for (int i = 0; i < (((int)(mid).size())); i++) {
(i % 2 ? J : C) += mid[((int)(mid).size()) - 1 - i];
}
printf("%d ", C);
printf("%d\n", J);
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 105;
int n, m, c[N], s[N];
bool cmp(int a, int b) { return a > b; }
int main() {
int cnt = 0, p = 0, q = 0;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &m);
int tmp = m / 2;
for (int j = 0; j < m; j++) {
scanf("%d", &c[j]);
if (j < tmp)
p += c[j];
else
q += c[j];
}
if (m & 1) {
q -= c[tmp];
s[cnt++] = c[tmp];
}
}
sort(s, s + cnt, cmp);
for (int i = 0; i < cnt; i++) {
if (i & 1)
q += s[i];
else
p += s[i];
}
printf("%d %d\n", p, q);
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int sum[110], a, ans[110];
bool cmp(int a, int b) { return a > b; }
int main() {
int i, j, n, m;
scanf("%d", &n);
int r = 0;
int C = 0, J = 0;
for (i = 0; i < n; i++) {
scanf("%d", &m);
scanf("%d", &a);
sum[0] = a;
for (j = 1; j < m; j++) {
scanf("%d", &a);
sum[j] = sum[j - 1] + a;
}
if (m & 1) {
ans[r++] = sum[m / 2] - sum[m / 2 - 1];
J += sum[m - 1] - sum[m / 2];
} else
J += sum[m - 1] - sum[m / 2 - 1];
C += sum[m / 2 - 1];
}
sort(ans, ans + r, cmp);
for (i = 0; i < r; i++)
if ((i & 1) == 0)
C += ans[i];
else
J += ans[i];
printf("%d %d\n", C, J);
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
vector<long long> v;
long long n, second, sum, sum2, a;
int32_t main() {
cin >> n;
for (long long i = 0; i < n; i++) {
cin >> second;
for (long long j = 1; j <= second; j++) {
cin >> a;
if (j <= second / 2) sum += a;
if (j > (second + 1) / 2) sum2 += a;
if (second % 2)
if (j == (second + 1) / 2) v.push_back(a);
}
}
sort(v.begin(), v.end(), greater<long long>());
for (long long i = 0; i < (long long)v.size(); i++)
if (i % 2)
sum2 += v[i];
else
sum += v[i];
return cout << sum << " " << sum2 << endl, 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int N;
vector<int> v;
int ans[2];
int main() {
cin.tie(0);
ios_base::sync_with_stdio(0);
cin >> N;
for (int i = 1; i <= N; i++) {
int t, x;
cin >> t;
for (int j = 1; j <= t; j++) {
cin >> x;
if (j <= t / 2)
ans[0] += x;
else if (j >= ((t + 1) / 2) + 1)
ans[1] += x;
else
v.push_back(x);
}
}
sort(v.begin(), v.end());
int idx = 0;
for (int i = v.size() - 1; i >= 0; i--) {
ans[idx] += v[i];
idx = !idx;
}
cout << ans[0] << " " << ans[1] << "\n";
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 100 + 10;
int a[maxn], cnt;
bool cmp(int x, int y) { return x > y; }
int main() {
int n;
int ans1 = 0, ans2 = 0;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
int k, kk;
scanf("%d", &k);
kk = k / 2;
for (int i = 1; i <= kk; i++) {
int tmp;
scanf("%d", &tmp);
ans1 += tmp;
}
if (k & 1) {
int tmp;
scanf("%d", &tmp);
a[cnt++] = tmp;
}
for (int i = 1; i <= kk; i++) {
int tmp;
scanf("%d", &tmp);
ans2 += tmp;
}
}
sort(a, a + cnt, cmp);
for (int i = 0; i < cnt; i++) {
if ((i & 1) == 0)
ans1 += a[i];
else
ans2 += a[i];
}
printf("%d %d\n", ans1, ans2);
}
| 9 | CPP |
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using uint8 = unsigned char;
using uint16 = unsigned short int;
using uint32 = unsigned int;
using uint64 = unsigned long long;
using int8 = signed char;
using int16 = short int;
using int32 = int;
using int64 = long long;
using pi32 = std::pair<int32, int32>;
using pi64 = std::pair<int64, int64>;
namespace Useful {
const int Dirx4[4] = {1, 0, -1, 0};
const int Diry4[4] = {0, 1, 0, -1};
const int Dirx8[8] = {1, 1, 1, 0, 0, -1, -1, -1};
const int Diry8[8] = {-1, 0, 1, -1, 1, -1, 0, 1};
const double exp = 1e-8;
template <typename _Tp>
inline _Tp Gcd(_Tp x, _Tp y) {
return y ? gcd(x, y) : x;
}
template <typename _Tp>
inline void Sort(_Tp &x, _Tp &y) {
if (x > y) std::swap(x, y);
}
template <typename _Tp>
inline bool InRange(_Tp x, _Tp l, _Tp r) {
return l <= x && x <= r;
}
template <typename _Tp>
inline bool InMap(_Tp x, _Tp y, _Tp n, _Tp m) {
return 1 <= x && x <= n && 1 <= y && y <= m;
}
template <typename _Tp>
inline _Tp Power(_Tp x, int64 m) {
return m == 1 ? x : (m & 1 ? power(x * x, m / 2) * x : power(x * x, m / 2));
}
template <typename _Tp1, typename _Tp2>
inline std::pair<_Tp1, _Tp2> operator+(std::pair<_Tp1, _Tp2> x,
std::pair<_Tp1, _Tp2> y) {
return x.first += y.first, x.second += y.second, x;
}
} // namespace Useful
using namespace std;
using namespace Useful;
const int maxn = 1000;
int a[maxn], cnt;
int main() {
int n;
int ans1 = 0, ans2 = 0;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
int k, kk;
scanf("%d", &k);
kk = k / 2;
for (int i = 1; i <= kk; i++) {
int tmp;
scanf("%d", &tmp);
ans1 += tmp;
}
if (k & 1) {
int tmp;
scanf("%d", &tmp);
a[cnt++] = tmp;
}
for (int i = 1; i <= kk; i++) {
int tmp;
scanf("%d", &tmp);
ans2 += tmp;
}
}
sort(a, a + cnt);
reverse(a, a + cnt);
for (int i = 0; i < cnt; i++)
if ((i & 1) == 0)
ans1 += a[i];
else
ans2 += a[i];
printf("%d %d\n", ans1, ans2);
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
bool cmp(const vector<int> &a, const vector<int> &b) {
return a.size() % 2 > b.size() % 2;
}
vector<vector<int> > s;
int main() {
ios_base::sync_with_stdio(false);
int n;
cin >> n;
s.resize(n);
for (int i = 0; i < n; i++) {
int tmp;
cin >> tmp;
for (int j = 0; j < tmp; j++) {
int tt;
cin >> tt;
s[i].push_back(tt);
}
}
sort(s.begin(), s.end(), &cmp);
int it = 0;
while (it < n && s[it].size() % 2 == 1) it++;
long long sc[2] = {};
vector<int> odd;
for (int i = 0; i < it; i++) odd.push_back(s[i][s[i].size() / 2]);
sort(odd.begin(), odd.end());
for (int i = it - 1; i >= 0; i--) sc[(it - 1 - i) % 2] += odd[i];
for (int i = 0; i < n; i++)
for (int j = 0; j < (int)s[i].size() / 2; j++)
sc[0] += s[i][j], sc[1] += s[i][s[i].size() - 1 - j];
cout << sc[0] << " " << sc[1] << endl;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 105;
int n, s, c[maxn], res[maxn], res0;
bool cmp(int a, int b) { return a > b; }
int main() {
scanf("%d", &n);
int sa = 0, sb = 0;
for (int i = 1; i <= n; i++) {
scanf("%d", &s);
for (int j = 1; j <= s; j++) scanf("%d", &c[j]);
for (int j = 1; j <= s / 2; j++) sa += c[j], sb += c[s - j + 1];
if (s & 1) res[++res0] = c[s / 2 + 1];
}
sort(res + 1, res + 1 + res0, cmp);
for (int i = 1; i <= res0; i++)
if (i & 1)
sa += res[i];
else
sb += res[i];
printf("%d %d\n", sa, sb);
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
int n, m, x;
cin >> n;
int s1(0), s2(0);
vector<int> v;
for (int i = 0; i < n; ++i) {
cin >> m;
for (int j = 0; j < m; ++j) {
cin >> x;
if (m % 2) {
if (j == m / 2)
v.push_back(x);
else if (2 * j < m)
s1 += x;
else
s2 += x;
} else {
if (2 * j < m)
s1 += x;
else
s2 += x;
}
}
}
sort(v.begin(), v.end());
for (int i = 0; i < v.size(); ++i)
if (i % 2)
s2 += v[v.size() - 1 - i];
else
s1 += v[v.size() - 1 - i];
cout << s1 << " " << s2 << "\n";
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 100;
int n, m, a[maxn + 3], k, b[maxn + 3], sum, num;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &m);
for (int j = 1; j <= m; j++) {
scanf("%d", &a[j]);
sum += a[j];
if (j * 2 <= m) {
num += a[j];
}
}
if (m & 1) {
b[++k] = a[(m + 1) >> 1];
}
}
sort(b + 1, b + k + 1);
reverse(b + 1, b + k + 1);
for (int i = 1; i <= k; i += 2) {
num += b[i];
}
printf("%d %d\n", num, sum - num);
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main(void) {
long long int n, x;
cin >> n;
vector<vector<long long int> > a(n);
for (long long int i = 0; i < n; i++) {
cin >> x;
for (long long int j = 0; j < x; j++) {
long long int tp;
cin >> tp;
a[i].push_back(tp);
}
}
long long int a1 = 0, b = 0;
vector<long long int> q;
for (long long int i = 0; i < n; i++) {
long long int f = a[i].size();
if (f % 2 != 0) {
for (long long int j = 0; j < (f - 1) / 2; j++) {
a1 += a[i][j];
}
for (long long int j = (f - 1) / 2 + 1; j < f; j++) {
b += a[i][j];
}
q.push_back(a[i][(f - 1) / 2]);
} else {
for (long long int j = 0; j < f / 2; j++) {
a1 += a[i][j];
}
for (long long int j = f / 2; j < f; j++) {
b += a[i][j];
}
}
}
sort(q.begin(), q.end(), greater<long long int>());
for (long long int k = 0; k < q.size(); k++) {
if (k % 2 == 0)
a1 += q[k];
else
b += q[k];
}
cout << a1 << " " << b;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
struct __timestamper {};
vector<int> v;
int ans[2];
int main() {
int n;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
int k;
scanf("%d", &k);
for (int i = 0; i < k; i++) {
int x;
scanf("%d", &x);
if (i < k / 2)
ans[0] += x;
else if (i >= (k + 1) / 2)
ans[1] += x;
else
v.push_back(x);
}
}
sort(v.begin(), v.end());
reverse(v.begin(), v.end());
for (int i = 0; i < (int)v.size(); i++) ans[i % 2] += v[i];
printf("%d %d\n", ans[0], ans[1]);
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
long long n, i, j, k, t, id, x, v, ans, nn, r, total;
cin >> n;
vector<vector<int>> a(n);
ans = 0;
total = 0;
vector<int> qq;
for (i = 0; i < n; i++) {
cin >> r;
a[i].resize(r);
for (j = 0; j < r; j++) {
cin >> a[i][j];
total += a[i][j];
if (j < r / 2) ans += a[i][j];
if ((j == r / 2) && (r % 2 == 1)) qq.push_back(a[i][j]);
}
}
sort(qq.rbegin(), qq.rend());
for (i = 0; i < qq.size(); i += 2) ans += qq[i];
cout << ans << " " << total - ans << "\n";
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int DEBUG = 0;
namespace defs {
template <class Type>
Type read() {
Type aa;
int bb = 1, ch;
while (ch = getchar(), (ch < '0' || ch > '9') && ch != '-')
;
ch == '-' ? aa = 0, bb = -1 : aa = ch - '0';
while (ch = getchar(), ch >= '0' && ch <= '9') aa = aa * 10 + ch - '0';
return bb == 1 ? aa : -aa;
}
const unsigned int rand_x = 11309;
const unsigned int rand_y = 1000000019;
unsigned int rand_cur;
unsigned int rand_int() { return rand_cur = rand_cur * rand_x + rand_y; }
const int inf = 1071026353;
const int mod = 1000000007;
const int modx = 998244353;
} // namespace defs
namespace lightningwork {
int (*read)() = defs::read<int>;
int n, t[110];
int num[110][110];
int s1, s2;
int que[110], tot;
void work() {
n = read();
for (int i = 1; i <= n; ++i) {
t[i] = read();
for (int j = 1; j <= t[i]; ++j) {
num[i][j] = read();
}
int mid = t[i] / 2;
for (int j = 1; j <= mid; ++j) {
s1 += num[i][j];
s2 += num[i][t[i] + 1 - j];
}
if (t[i] & 1) {
que[++tot] = num[i][mid + 1];
}
}
sort(que + 1, que + tot + 1);
for (int i = 1; i <= tot; ++i) {
if (i & 1)
s1 += que[tot + 1 - i];
else
s2 += que[tot + 1 - i];
}
printf("%d %d\n", s1, s2);
}
} // namespace lightningwork
int main() {
if (0)
freopen(
"work"
".in",
"r", stdin),
freopen(
"work"
".out",
"w", stdout);
lightningwork::work();
if (0) fclose(stdin), fclose(stdout);
return 0;
}
| 9 | CPP |
n = int(input())
c = [list(map(int, input().split())) for _ in range(n)]
a, b = 0, 0
d = []
for i in range(n):
if len(c[i]) % 2:
a += sum(c[i][1:c[i][0]//2+1])
b += sum(c[i][c[i][0]//2+1:])
else:
a += sum(c[i][1:c[i][0]//2+1])
b += sum(c[i][c[i][0]//2+2:])
d.append(c[i][c[i][0]//2+1])
d.sort(reverse=True)
print(a+sum(d[0::2]), b+sum(d[1::2])) | 9 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int sum[110][110], a[110][110], ans[110];
bool cmp(int a, int b) { return a > b; }
int main() {
int i, j, n, m;
scanf("%d", &n);
int r = 0;
int C = 0, J = 0;
for (i = 0; i < n; i++) {
scanf("%d", &m);
scanf("%d", &a[i][0]);
sum[i][0] = a[i][0];
for (j = 1; j < m; j++) {
scanf("%d", &a[i][j]);
sum[i][j] = sum[i][j - 1] + a[i][j];
}
if (m & 1) {
ans[r++] = a[i][m / 2];
J += sum[i][m - 1] - sum[i][m / 2];
} else
J += sum[i][m - 1] - sum[i][m / 2 - 1];
C += sum[i][m / 2 - 1];
}
sort(ans, ans + r, cmp);
for (i = 0; i < r; i++)
if ((i & 1) == 0)
C += ans[i];
else
J += ans[i];
printf("%d %d\n", C, J);
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int inf = 1000000000;
const int mo = 1000000007;
const int N = 2005;
int a[N], b[N];
int main() {
int t, sum = 0, sub = 0;
cin >> t;
vector<int> c;
while (t--) {
int n;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> a[i];
sum += a[i];
}
if (n % 2 == 1) c.push_back(a[n / 2]);
for (int l = 0, r = n - 1; l < r;) {
sub += a[l];
sub -= a[r];
++l;
--r;
}
}
sort(c.begin(), c.end());
reverse(c.begin(), c.end());
for (int i = 0; i < ((int)((c).size())); ++i)
if (i % 2 == 0)
sub += c[i];
else
sub -= c[i];
int A = (sum + sub) / 2;
int B = sum - A;
cout << A << ' ' << B << endl;
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, k, t, suma, sumb, midc;
int mid[200];
int main() {
scanf("%d", &n);
suma = 0;
sumb = 0;
midc = 0;
for (int j = 0; j < n; ++j) {
scanf("%d", &k);
for (int i = 0; i < k / 2; ++i) {
scanf("%d", &t);
suma += t;
}
if (k & 1) {
scanf("%d", &t);
mid[midc++] = t;
}
for (int i = 0; i < k / 2; ++i) {
scanf("%d", &t);
sumb += t;
}
}
sort(mid, mid + midc);
for (int i = 0; i < midc; ++i) {
if (i % 2 == midc % 2)
sumb += mid[i];
else
suma += mid[i];
}
printf("%d %d\n", suma, sumb);
return 0;
}
| 9 | CPP |
Subsets and Splits
No saved queries yet
Save your SQL queries to embed, download, and access them later. Queries will appear here once saved.