text stringlengths 49 983k |
|---|
#include <bits/stdc++.h>
using namespace std;
long long mod = 1e9 + 7;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cout << fixed;
cout.precision(12);
long long n, p, w, d, x, y = 0, a;
cin >> n >> p >> w >> d;
int f = 0;
while (y <= (w - 1)) {
a = p - y * d;
x = a / w;
if (x * w == a) {
f = 1;
break;
}
y++;
}
long long z = n - x - y;
if (x >= 0 && z >= 0 && f)
cout << x << " " << y << " " << z << endl;
else
cout << "-1" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
pair<long long, long long> bs(pair<long long, long long> match, long long p,
long long w, long long d, long long n) {
if (((match.first == 0) && (p % d > 0)) || ((p % d == 0) && (d * n < p)))
return pair<long long, long long>(-1, -1);
if ((p == w * match.first + d * match.second) &&
(match.first + match.second <= n))
return match;
else if (p < w * match.first + d * match.second) {
match.first--;
} else {
long long x = p - w * match.first + d * match.second;
long long z = x / d;
if (x % d > 0) z++;
match.second += z;
if (match.first + match.second > n)
return (pair<long long, long long>(-1, -1));
}
}
int main() {
long long n, p, w, d;
cin >> n >> p >> w >> d;
long long win, draw;
win = p / w;
draw = (p % w) / d;
if ((p < d) && (p > 0)) {
cout << -1 << endl;
return 0;
}
long long prev1 = -1;
long long prev2 = -1;
while (1) {
prev2 = prev1;
prev1 = win * w + draw * d;
if (p == win * w + draw * d)
break;
else if (p < win * w + draw * d) {
if (win > 0)
win--;
else if (draw > 0) {
draw--;
} else {
cout << -1 << endl;
return 0;
}
} else {
long long x = p - (win * w + draw * d);
long long z = x / d;
if (x % d > 0) z++;
draw += z;
if (win + draw > n) {
cout << -1 << endl;
return 0;
}
}
if (w * win + d * draw == prev2) {
cout << -1 << endl;
return 0;
}
}
if ((p == win * w + draw * d) && (win + draw <= n))
cout << win << " " << draw << " " << n - win - draw << endl;
else {
cout << -1 << endl;
}
}
|
#include <bits/stdc++.h>
int main() {
long long int n, p, w, d;
scanf("%lld %lld %lld %lld", &n, &p, &w, &d);
long long int x, y, z;
for (y = 0; y <= w && y <= n; y++) {
if (w * n - p - (w - d) * y < 0) break;
if ((w * n - p - (w - d) * y) % w == 0) {
z = (w * n - p - (w - d) * y) / w;
x = n - y - z;
if (z < 0 || x < 0) break;
printf("%lld %lld %lld\n", x, y, z);
return 0;
}
}
printf("-1\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int p[400100];
int s[400100];
int cnt[1000100], ct[400100];
int main() {
int t;
cin >> t;
while (t--) {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; i++) scanf("%d", &p[i]);
int len = 0;
for (int i = 1; i <= n; i++) {
if (cnt[p[i]] == 0 and i > 1) {
ct[++len] = cnt[p[i - 1]];
cnt[p[i]]++;
continue;
}
cnt[p[i]]++;
}
ct[++len] = cnt[p[n]];
for (int i = 1; i <= len; i++) s[i] = s[i - 1] + ct[i];
int id = upper_bound(s + 1, s + len + 1, n / 2) - s - 1;
int g = ct[1];
int st = upper_bound(s + 1, s + len + 1, 2 * g) - s;
int ed = upper_bound(s + 1, s + len + 1, s[st] + g) - s;
if (ed <= id) {
printf("%d %d %d\n", g, s[st] - g, s[id] - s[st]);
} else {
puts("0 0 0");
}
for (int i = 1; i <= n; i++) cnt[p[i]] = 0;
for (int i = 1; i <= len; i++) s[i] = 0, ct[i] = 0;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
int p[n];
for (int i = 0; i < n; ++i) {
cin >> p[i];
}
int l = n / 2 - 1;
while (p[l] == p[l + 1] && l >= 0) --l;
if (l < 4) {
printf("0 0 0\n");
continue;
}
int g = 1, s = 0, b, i;
for (i = 1; p[i] == p[i - 1]; ++i) {
++g;
}
while (s <= g && i <= l) {
++s;
for (++i; p[i] == p[i - 1]; ++i) {
++s;
}
}
b = l + 1 - g - s;
if (g >= s || g >= b || g == 0 || s == 0 || b == 0 || (g + s + b) > n / 2) {
printf("0 0 0\n");
} else {
printf("%d %d %d\n", g, s, b);
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
struct po {
int num, count;
} ss[400020];
int main() {
int t;
scanf("%d", &t);
while (t--) {
int g = 0, s = 0, b = 0;
int n, k = 0;
scanf("%d", &n);
for (int i = 0; i <= n + 10; i++) {
ss[i].num = 0;
ss[i].count = 0;
}
int flag = 0;
scanf("%d", &ss[k].num);
ss[k].count++;
for (int i = 1; i < n; i++) {
int x;
scanf("%d", &x);
if (ss[k].num != x) {
if (flag == 0) {
flag++;
g = ss[k].count;
} else if (flag == 1) {
flag++;
s = s + ss[k].count;
if (g >= s) flag = 1;
} else if (flag == 2 && i <= n / 2) {
b = b + ss[k].count;
}
k++;
ss[k].num = x;
ss[k].count++;
} else
ss[k].count++;
}
if (g == 0 || s == 0 || b == 0 || g >= s || g >= b)
printf("0 0 0\n");
else
printf("%d %d %d\n", g, s, b);
}
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
inline int read();
const int M = 400016, MOD = 1000000007;
int save[M];
int main(void) {
int t = read();
while (t--) {
int n = read();
vector<int> psh;
for (int i = 1; i <= n; ++i) {
save[i] = read();
if (i == 1 || save[i] != save[i - 1])
psh.push_back(1);
else
++psh.back();
}
int g = 0, s = 0, b = 0, id = 0;
g = psh[0];
for (id = 1; s <= g && id < (int)psh.size(); ++id) s += psh[id];
for (; id < (int)psh.size(); ++id) {
if ((g + s + b + psh[id]) * 2 > n) break;
b += psh[id];
}
if (g < s && g < b && (g + s + b) * 2 <= n)
printf("%d %d %d\n", g, s, b);
else
printf("0 0 0\n");
}
return 0;
}
inline int read() {
int x = 0, f = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-') f = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
x = x * 10 + ch - '0';
ch = getchar();
}
return x * f;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
inline void smax(int &x, int y) { x = max(x, y); }
inline void smin(int &x, int y) { x = min(x, y); }
ll gcd(ll a, ll b) { return ((b == 0) ? a : gcd(b, a % b)); }
int main() {
std::ios::sync_with_stdio(false);
cin.tie(NULL);
int tcase;
cin >> tcase;
for (__typeof(tcase + 1) tc = (1) - ((1) > (tcase + 1));
tc != (tcase + 1) - ((1) > (tcase + 1));
tc += 1 - 2 * ((1) > (tcase + 1))) {
int n;
cin >> n;
vector<int> v(n);
for (__typeof(n) i = (0) - ((0) > (n)); i != (n) - ((0) > (n));
i += 1 - 2 * ((0) > (n)))
cin >> v[i];
int g = 1, b = 0, s = 0;
int st = -1;
for (int i = 1; i < n; i++) {
if (v[i] != v[i - 1]) {
st = i;
break;
} else
g++;
}
if (st == -1) {
cout << 0 << " " << 0 << " " << 0 << "\n";
continue;
}
vector<int> cnt;
int cur = 1;
for (int i = st + 1; i < n; i++) {
if (v[i] != v[i - 1]) {
cnt.push_back(cur);
cur = 1;
} else
cur++;
}
cnt.push_back(cur);
for (int i = 0; i < cnt.size(); i++) {
if (s <= g) {
s += cnt[i];
} else {
if (b <= g || 2 * (b + cnt[i] + s + g) <= n) {
b += cnt[i];
} else
break;
}
}
if (g < s && g < b && 2 * (b + s + g) <= n) {
cout << g << " " << s << " " << b << "\n";
} else {
cout << 0 << " " << 0 << " " << 0 << "\n";
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 400000;
int p[MAXN];
int t, n;
int main() {
scanf("%d", &t);
while (t--) {
scanf("%d", &n);
for (int i = 0; i < n; i++) scanf("%d", p + i);
int min_g = n;
for (int i = 0; i < n; i++) {
if (p[i] != p[0]) {
min_g = i;
break;
}
}
int min_gns = min_g * 2 + 1;
while (min_gns < n && p[min_gns - 1] == p[min_gns]) min_gns += 1;
int max_all = n / 2;
while (max_all > 0 && p[max_all - 1] == p[max_all]) max_all -= 1;
if (max_all > min_gns + min_g) {
cout << min_g << " " << min_gns - min_g << " " << max_all - min_gns
<< endl;
} else {
cout << "0 0 0" << endl;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int t, n, a;
cin >> t;
while (t--) {
cin >> n;
vector<int> v;
int c = 1, x, g, s, b;
cin >> a;
for (int i = 1; i < n; i++) {
cin >> x;
if (a != x) {
a = x;
v.push_back(c);
}
c++;
}
v.push_back(c);
g = *v.begin();
x = 2 * g;
a = n;
int l = 0, r = v.size() - 1, m;
while (l <= r) {
m = (l + r) / 2;
if (v[m] > x) {
a = v[m];
r = m - 1;
} else {
l = m + 1;
}
}
if (a >= n / 2)
g = s = b = 0;
else {
s = a - g;
x = n / 2;
l = m + 1;
r = v.size() - 1;
if (v[l] > x)
g = s = b = 0;
else {
while (l <= r) {
m = (l + r) / 2;
if (v[m] == x) {
a = v[m];
break;
} else if (v[m] < x) {
a = v[m];
l = m + 1;
} else
r = m - 1;
}
b = a - (s + g);
if (b <= g) g = s = b = 0;
}
}
cout << g << ' ' << s << ' ' << b << '\n';
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const double EPS = 1e-9;
int T, n;
int num[1000015], p[1000015], cnt, sum[1000015];
int main() {
scanf("%d", &T);
while (T--) {
scanf("%d", &n);
for (int i = 1; i <= n; ++i) {
scanf("%d", &p[i]);
}
num[cnt = 1] = 1;
for (int i = 2; i <= n; ++i) {
if (p[i] == p[i - 1]) {
++num[cnt];
} else {
num[++cnt] = 1;
}
}
for (int i = 1; i <= cnt; ++i) {
sum[i] = sum[i - 1] + num[i];
}
sum[cnt + 1] = INF;
int g = 0, s = 0, b = 0;
for (int i = 1, j = 2, k = 3; k <= n; ++i) {
while (j <= n && sum[j] - sum[i] <= sum[i]) ++j;
while (k < n && sum[k + 1] <= sum[cnt] / 2) ++k;
if (j <= n && k <= n && sum[i] < sum[k] - sum[j] &&
sum[k] <= sum[cnt] / 2) {
g = sum[i];
s = sum[j] - sum[i];
b = sum[k] - sum[j];
} else {
break;
}
}
printf("%d %d %d\n", g, s, b);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t;
cin >> t;
while (t--) {
int n, x;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; ++i) {
cin >> v[i];
}
int p = n / 2 - 1;
while (p > 0 && v[p] == v[p + 1]) {
p--;
}
int g = 1;
int b = 1;
while (g < p && v[g] == v[g - 1]) {
g++;
}
p--;
while (p > 0 && v[p] == v[p + 1] || b <= g) {
b++;
p--;
}
int s = p - g + 1;
if (p < g || g >= s || g >= b) {
cout << "0 0 0\n";
} else {
cout << g << " " << s << " " << b << "\n";
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 400005;
int T, n, p[N];
int main() {
scanf("%d", &T);
while (T--) {
scanf("%d", &n);
int l = n / 2;
p[0] = -1;
p[n + 1] = -1;
for (int i = 1; i <= n; i++) scanf("%d", &p[i]);
if (p[l] == p[l + 1]) {
while (p[l] == p[l - 1]) l--;
l--;
}
int g = 1, b = l;
while (p[g] == p[g + 1]) g++;
while (l - b + 1 <= g) b--;
if (b <= 0) {
puts("0 0 0");
continue;
}
while (p[b - 1] == p[b]) b--;
int G = g, B = l - b + 1, S = l - G - B;
if (S > G && B > G && G > 0)
printf("%d %d %d\n", G, S, B);
else
puts("0 0 0");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long INFL = 1LL << 60;
const long long INF = INFL;
long long MOD = 1000000007;
vector<long long> dy = {0, -1, 0, 1, 1, 1, -1, -1, 0};
vector<long long> dx = {1, 0, -1, 0, 1, -1, 1, -1, 0};
void pres(double A, long long x = 10) {
cout << fixed << setprecision(x) << A << endl;
}
void BinarySay(long long x, long long y = 60) {
for (long long i = 0; i < (y); i++) cout << (x >> (y - 1 - i) & 1);
cout << endl;
}
long long get_bit(long long x) { return __builtin_popcountll(x); }
long long pow_long(long long x, long long k) {
long long res = 1;
while (k > 0) {
if (k % 2) res *= x;
x *= x;
k /= 2;
}
return res;
}
long long pow_mod(long long x, long long k) {
long long res = 1;
while (k > 0) {
if (k % 2) {
res *= x;
res %= MOD;
}
x *= x;
x %= MOD;
k /= 2;
}
return res;
}
long long inverse(long long x) { return pow_mod(x, MOD - 2); };
long long gcd(long long a, long long b) {
if (b == 0) return a;
return gcd(b, a % b);
}
long long lcm(long long x, long long y) { return x / gcd(x, y) * y; };
long long kai_mod(long long x) {
if (x == 0) return 1;
return x * kai_mod(x - 1) % MOD;
}
vector<long long> divisor(long long n) {
vector<long long> res(0);
for (long long i = 1; i * i <= n; i++) {
if (n % i == 0) {
res.push_back(i);
if (i != n / i) res.push_back(n / i);
}
}
sort(res.begin(), res.end());
return res;
}
vector<long long> MakePrimeList(long long x) {
vector<long long> res;
for (long long k = 2; k * k <= x; k++) {
if (x % k == 0) {
res.push_back(k);
while (x % k == 0) x /= k;
}
}
if (x > 1) res.push_back(x);
return res;
}
const int MAXcomb = 2000100;
long long fac[MAXcomb], finv[MAXcomb], inv[MAXcomb];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAXcomb; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
long long comb(int n, int k) {
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * finv[k] % MOD * finv[n - k] % MOD;
}
long long disit(long long x, long long d = 10) {
long long res = 0;
while (x) {
res++;
x /= d;
}
return res;
}
void compress(vector<long long> &S) {
vector<long long> xs;
for (long long i = 0; i < (S.size()); i++) xs.push_back(S[i]);
sort(xs.begin(), xs.end());
xs.erase(unique(xs.begin(), xs.end()), xs.end());
for (long long i = 0; i < (S.size()); i++) {
S[i] = lower_bound(xs.begin(), xs.end(), S[i]) - xs.begin();
}
}
void solve() {
long long N;
cin >> N;
vector<long long> A(N);
for (long long i = 0; i < (N); i++) cin >> A[i];
compress(A);
long long M = A[0] + 1;
vector<long long> cnt(M, 0);
for (long long i = 0; i < (N); i++) cnt[A[i]]++;
long long g = cnt[M - 1];
long long second = 0;
long long at = M;
for (long long i = (M)-1; i >= 0; i--) {
if (i == M - 1) continue;
second += cnt[i];
at = i;
if (second > g) break;
}
long long B = 0;
long long b = 0;
for (long long i = at - 1; i >= 0; i--) {
b += cnt[i];
if (b <= g) continue;
if ((g + second + b) * 2 > N) break;
B = b;
}
if (B == 0) g = second = 0;
cout << g << " " << second << " " << B << endl;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
long long T;
cin >> T;
for (long long i = 0; i < (T); i++) {
solve();
}
}
|
#include <bits/stdc++.h>
using namespace std;
const long long INF = 1e18;
const int32_t M = 1e9 + 7;
const long long N = 1e6 + 5;
void no() { cout << "0 0 0" << endl; }
void cpc() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(NULL);
}
void solve() {
long long n;
cin >> n;
vector<long long> v(n);
for (long long i = 0; i < n; i++) cin >> v[i];
long long j = n / 2 - 1;
while (j >= 4 && v[j] <= v[j + 1]) j--;
if (j < 4) {
no();
return;
}
deque<long long> va;
va.push_front(j);
j--;
while (j >= 0) {
if (v[j] > v[j + 1]) va.push_front(j);
j--;
}
va.push_front(-1);
if (va.size() < 4) {
no();
return;
}
long long a, b, c, d;
a = va[0];
b = va[1];
c = -1;
d = va[va.size() - 1];
long long dis = b - a;
for (long long i = 0; i < n; i++) {
if ((va[i] - b) > dis) {
c = va[i];
break;
}
}
if (c == -1 || (d - c) <= dis) {
no();
return;
}
cout << b - a << " " << c - b << " " << d - c << " " << endl;
}
int32_t main() {
cpc();
long long t;
cin >> t;
while (t--) solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++) cin >> v[i];
int i = n / 2;
i -= 1;
while (i >= 0 && v[i] == v[i + 1]) i--;
int g = 0, s = 0, b = 0;
int j = 0;
while (v[0] == v[j] && j <= i) {
g++;
j++;
}
s = g + 1;
j += s - 1;
while (j <= i && v[j] == v[j + 1]) {
j++;
s++;
}
b = i - j;
if (b <= g)
cout << "0 0 0";
else
cout << g << " " << s << " " << b;
cout << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
const long long mod = 998244353;
long long a[400005];
vector<long long> v;
int main() {
int t;
cin >> t;
while (t--) {
int n;
v.clear();
scanf("%d", &n);
for (int i = 1; i <= n; i++) scanf("%lld", &a[i]);
for (int i = 1; i < n; i++) {
if (a[i] != a[i + 1]) {
v.push_back(i);
}
}
long long x = -1;
v.push_back(n);
for (int i = 0; i < v.size(); i++) {
if (v[i] <= n / 2) {
x = v[i];
}
}
if (x == -1) {
printf("0 0 0\n");
} else {
long long maxx = 0, aa = 0, bb = 0, cc = 0;
for (int i = 0; i < v.size(); i++) {
int in = upper_bound(v.begin(), v.end(), v[i] * 2) - v.begin();
if (in == n) break;
long long tmp = x - v[in];
if (tmp > v[i]) {
aa = v[i];
bb = v[in] - v[i];
cc = x - v[in];
}
}
printf("%lld %lld %lld\n", aa, bb, cc);
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long INF(0x3f3f3f3f3f3f3f3fll);
const int inf(0x3f3f3f3f);
template <typename T>
void read(T &res) {
bool flag = false;
char ch;
while (!isdigit(ch = getchar())) (ch == '-') && (flag = true);
for (res = ch - 48; isdigit(ch = getchar());
res = (res << 1) + (res << 3) + ch - 48)
;
flag && (res = -res);
}
template <typename T>
void Out(T x) {
if (x < 0) putchar('-'), x = -x;
if (x > 9) Out(x / 10);
putchar(x % 10 + '0');
}
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
long long lcm(long long a, long long b) { return a * b / gcd(a, b); }
long long pow_mod(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;
}
long long fact_pow(long long n, long long p) {
long long res = 0;
while (n) {
n /= p;
res += n;
}
return res;
}
long long mult(long long a, long long b, long long p) {
a %= p;
b %= p;
long long r = 0, v = a;
while (b) {
if (b & 1) {
r += v;
if (r > p) r -= p;
}
v <<= 1;
if (v > p) v -= p;
b >>= 1;
}
return r;
}
long long quick_pow(long long a, long long b, long long p) {
long long r = 1, v = a % p;
while (b) {
if (b & 1) r = mult(r, v, p);
v = mult(v, v, p);
b >>= 1;
}
return r;
}
bool CH(long long a, long long n, long long x, long long t) {
long long r = quick_pow(a, x, n);
long long z = r;
for (long long i = 1; i <= t; i++) {
r = mult(r, r, n);
if (r == 1 && z != 1 && z != n - 1) return true;
z = r;
}
return r != 1;
}
bool Miller_Rabin(long long n) {
if (n < 2) return false;
if (n == 2) return true;
if (!(n & 1)) return false;
long long x = n - 1, t = 0;
while (!(x & 1)) {
x >>= 1;
t++;
}
srand(time(NULL));
long long o = 8;
for (long long i = 0; i < o; i++) {
long long a = rand() % (n - 1) + 1;
if (CH(a, n, x, t)) return false;
}
return true;
}
const int N = 4e5 + 10;
int a[N];
int main() {
std::ios::sync_with_stdio(false);
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
for (int i = 1; i <= n; i++) cin >> a[i];
int one = 2;
int ans1 = 1;
while (one <= n / 2) {
if (a[one] != a[one - 1]) break;
ans1++;
one++;
}
if (one > n / 2) {
cout << "0 0 0" << '\n';
continue;
}
one++;
int ans2 = 1;
while (one <= n / 2) {
if (ans2 > ans1 && a[one] != a[one - 1]) break;
ans2++;
one++;
}
int two;
for (two = n / 2;; two--)
if (a[two] != a[two + 1]) break;
int ans3 = two - one + 1;
if (ans3 > ans1 && ans2 > ans1)
cout << ans1 << " " << ans2 << " " << ans3 << '\n';
else
cout << "0 0 0" << '\n';
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
const long long Q_MOD = 998244353;
void go() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout << fixed;
cout << setprecision(6);
}
void solve() {
long long n;
cin >> n;
long long arr[n];
for (long long i = 0; i < n; i++) cin >> arr[i];
if (n / 2 < 5) {
cout << "0 0 0\n";
return;
}
long long a, b, c;
long long k = 0;
while (k < n / 2 and arr[0] == arr[k]) k++;
a = k;
long long i = k;
while (i < n / 2 and (i - k) <= a) i++;
if (i >= n / 2) {
cout << "0 0 0\n";
return;
}
long long temp = i - 1;
while (i < n / 2 and arr[i] == arr[temp]) i++;
b = i - k;
k = i;
while (k < n and arr[i] == arr[k]) k++;
if (k > n / 2) {
cout << "0 0 0\n";
return;
}
c = k - i;
for (long long m = k; m < n / 2; m++) {
long long sm = m + 1;
while (sm < n and arr[sm] == arr[m]) sm++;
if (sm <= n / 2) {
c += (sm - m);
m = sm - 1;
} else {
break;
}
}
if (c <= a)
cout << "0 0 0\n";
else
cout << a << " " << b << " " << c << '\n';
}
signed main() {
go();
long long t = 1;
cin >> t;
while (t--) solve();
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
const int MOD = 998244353;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
vector<int> p(n);
for (auto& x : p) cin >> x;
vector<int> a;
for (int i = 0; i < n / 2; i++) a.push_back(p[i]);
while (a.size() && a.back() == p[n / 2]) a.pop_back();
if (a.empty()) {
cout << "0 0 0\n";
continue;
}
vector<int> vals({1});
for (int i = 1; i < a.size(); i++) {
if (a[i - 1] != a[i]) vals.push_back(0);
vals.back()++;
}
bool f = false;
for (int i = 0, j = vals.size() - 1, sum1 = 0, sum2 = 0; i < j; i++) {
sum1 += vals[i];
while (i < j && sum2 <= sum1) sum2 += vals[j--];
int sum3 = a.size() - sum1 - sum2;
if (sum3 > sum1 && sum2 > sum1) {
cout << sum1 << ' ' << sum3 << ' ' << sum2 << '\n';
f = true;
break;
}
}
if (!f) cout << "0 0 0\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int OO = 1e9;
const long long INF = 1e18;
const int irand(int lo, int hi) {
return ((double)rand() / (RAND_MAX + 1.0)) * (hi - lo + 1) + lo;
}
const long long lrand(long long lo, long long hi) {
return ((double)rand() / (RAND_MAX + 1.0)) * (hi - lo + 1) + lo;
}
template <typename T>
T getnum() {
int sign = 1;
T ret = 0;
char c;
do {
c = getchar();
} while (c == ' ' || c == '\n');
if (c == '-')
sign = -1;
else
ret = c - '0';
while (1) {
c = getchar();
if (c < '0' || c > '9') break;
ret = 10 * ret + c - '0';
}
return sign * ret;
}
inline void ini(int& x) { x = getnum<int>(); }
inline void scani(int& x) { scanf("%d", &x); }
const int N = 4e5 + 5;
int n;
int arr[N];
map<int, int> mep;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cout.setf(ios::fixed);
cout.setf(ios::showpoint);
cout.precision(10);
int t;
cin >> t;
while (t--) {
mep.clear();
cin >> n;
for (int i = 1; i <= n; i += 1) {
cin >> arr[i];
mep[arr[i]]++;
}
auto it = mep.end();
it--;
int g = it->second;
int s = 0, b = 0;
while (it != mep.begin()) {
it--;
if (s <= g)
s += it->second;
else if (b <= g)
b += it->second;
else if (g + s + b + it->second <= n / 2) {
b += it->second;
} else {
break;
}
}
if (g > 0 && s > 0 && b >= 0 && g + s + b <= n / 2) {
cout << g << " " << s << " " << b << '\n';
} else {
cout << "0 0 0" << '\n';
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int p[410000], num[410000], tot[410000];
int T, n, g, s, b, ng, ns, nb, j, cnt;
int main() {
scanf("%d", &T);
while (T--) {
scanf("%d", &n);
for (int i = 1; i <= n; ++i) scanf("%d", &p[i]);
cnt = 0;
g = s = b = 1;
for (int i = 1; i <= n; ++i) {
num[++cnt] = p[i];
tot[cnt] = 1;
j = i;
while (j + 1 <= n && p[j + 1] == num[cnt]) ++j, ++tot[cnt];
i = j;
}
if (cnt <= 3) {
puts("0 0 0");
continue;
}
g = tot[1];
s = tot[j = 2];
while (j + 1 <= cnt && s <= g) ++j, s += tot[j];
if (j + 1 > cnt) {
puts("0 0 0");
continue;
}
b = tot[++j];
while (j + 1 <= cnt && (b <= g || g + tot[j + 1] + b + s <= n / 2))
++j, b += tot[j];
if (g > s || g > b || g + s + b > n / 2) {
puts("0 0 0");
continue;
}
printf("%d %d %d\n", g, s, b);
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int Max_n = 4e5 + 10;
const int Max_m = 1e6 + 10;
int a[Max_n], cnt[Max_m];
int main() {
int T;
scanf("%d", &T);
while (T--) {
memset(cnt, 0, sizeof(cnt));
int n;
scanf("%d", &n);
int g = 0, s = 0, b = 0;
bool flag = true;
for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
for (int i = 1; i <= n; i++) cnt[a[i]]++;
int maximal = n / 2, inx = 0;
if (maximal <= 4)
flag = false;
else {
g = cnt[a[1]];
if (g >= maximal - g) flag = false;
for (int i = cnt[a[1]] + 1; i <= n; i += cnt[a[i]]) {
s += cnt[a[i]];
if (s + g >= maximal) flag = false;
if (s > g) {
inx = i;
break;
}
}
if (flag) {
for (int i = inx + cnt[a[inx]]; i <= n; i += cnt[a[i]]) {
b += cnt[a[i]];
if (b <= g) continue;
if (g + s + b <= maximal) {
int x = i + cnt[a[i]];
int ans = b + cnt[a[x]];
if (g + s + ans > maximal) break;
}
if (g + s + b > maximal) flag = false;
}
}
}
if (flag)
printf("%d %d %d\n", g, s, b);
else
puts("0 0 0");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long t = 1, test, i, j, n, m, flag, k, p, ans, g, s, b;
cin >> t;
for (test = 1; test <= t; test++) {
cin >> n;
vector<long long> a(n);
map<long long, long long> make_pair;
for (i = 0; i < n; i++) {
cin >> a[i];
make_pair[a[i]]++;
}
flag = 0;
g = 0;
s = 0;
b = 0;
if (n < 6) {
cout << 0 << " " << 0 << " " << 0 << "\n";
continue;
} else {
std::map<long long, long long>::reverse_iterator it;
for (it = make_pair.rbegin(); it != make_pair.rend(); it++) {
if (g < 1)
g = it->second;
else if (s <= g)
s += it->second;
else {
b += it->second;
flag = 1;
}
if (g + s + b > n / 2) break;
}
if (flag == 1) b = b - it->second;
}
if (g <= 0 || s <= 0 || b <= 0 || g >= s || g >= b)
cout << 0 << " " << 0 << " " << 0 << "\n";
else
cout << g << " " << s << " " << b << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int inf = 1e9 + 7;
const int maxN = 5e6 + 5;
int t, n, arr[maxN];
int main() {
ios_base::sync_with_stdio(0);
cin >> t;
for (int _ = (0); _ <= ((t)-1); ++_) {
cin >> n;
for (int i = (0); i <= ((n)-1); ++i) {
cin >> arr[i];
}
int fst = 0;
for (int i = (1); i <= ((n)); ++i) {
if (arr[i] != arr[0]) {
fst = i;
break;
}
}
if (fst == 0) {
cout << "0 0 0\n";
continue;
}
int snd = 0;
for (int i = (2 * fst + 1); i <= (n - 1); ++i) {
if (arr[i] != arr[i - 1]) {
snd = i;
break;
}
}
if (snd == 0) {
cout << "0 0 0\n";
continue;
}
int third = 0;
for (int i = (snd + fst + 1); i <= (n / 2); ++i) {
if (arr[i] != arr[i - 1]) {
third = i;
}
}
if (third != 0) {
cout << fst << " " << snd - fst << " " << third - snd << endl;
} else {
cout << "0 0 0\n";
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
map<int, int> mp;
vector<int> vi;
int main() {
int n, m, i, j, k, x, y, ans, curr, temp;
int tc;
cin >> tc;
while (tc--) {
scanf("%d", &n);
vi.clear();
mp.clear();
for (i = 1; i <= n; i++) {
scanf("%d", &curr);
vi.push_back(curr);
mp[curr]++;
}
sort(vi.begin(), vi.end());
reverse(vi.begin(), vi.end());
int take = 0;
int safe = 0;
int cnt = 0;
for (i = 0; i < n - 1; i++) {
take++;
if (vi[i] > vi[i + 1]) {
if (take <= n / 2) {
safe = take;
cnt++;
}
}
}
if (cnt < 3 || safe < 3) {
printf("0 0 0\n");
continue;
}
vector<int> sana;
int maxi = vi[0];
sana.push_back(mp[maxi]);
int last = sana[0];
cnt = 0;
for (i = last; i < safe; i++) {
cnt++;
if (vi[i] > vi[i + 1]) {
if (cnt > last) {
sana.push_back(cnt);
break;
}
}
}
sana.push_back(safe - cnt - last);
if (sana[1] <= sana[0] || sana[2] <= sana[0]) {
printf("0 0 0\n");
continue;
}
for (auto x : sana) printf("%d ", x);
printf("\n");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
struct custom_hash {
static uint64_t splitmix64(uint64_t x) {
x += 0x9e3779b97f4a7c15;
x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
return x ^ (x >> 31);
}
size_t operator()(uint64_t x) const {
static const uint64_t FIXED_RANDOM =
chrono::steady_clock::now().time_since_epoch().count();
return splitmix64(x + FIXED_RANDOM);
}
};
void shoot() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
}
long long power(long long n, long long pwr) {
long long ans = 1LL;
while (pwr) {
if (pwr & 1) ans = (ans * n) % 1000000007;
n = (n * n) % 1000000007;
pwr >>= 1;
}
return ans;
}
int main() {
shoot();
long long t;
cin >> t;
while (t--) {
long long i, n, g, s, b, cnt;
cin >> n;
long long a[n];
for (i = 0; i < n; i++) cin >> a[i];
i = 1;
while (i < n / 2 && a[i] == a[i - 1]) i++;
g = i;
i += g + 1;
while (i < n / 2 && a[i] == a[i - 1]) i++;
s = i - g;
i += g + 1;
b = cnt = g + 1;
bool ok = false;
for (; i < n / 2; i++) {
if (a[i] != a[i - 1]) ok = true, b = cnt;
cnt++;
}
if (i <= n / 2 && a[i] != a[i - 1]) ok = true, b = cnt;
if (g + s + b > n / 2 || !ok)
cout << "0 0 0" << endl;
else
cout << g << " " << s << " " << b << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long arr[400004];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
int golden_medals = 0, silver_medals = 0, bronze_medals = 0;
for (int i = 0; i < n; ++i) cin >> arr[i];
n >>= 1;
long long limit_for_golden = arr[0], limit_for_silver, limit_for_bronze;
int index_ = 0;
while (arr[index_] == limit_for_golden) {
++golden_medals;
++index_;
if (index_ > n) break;
}
index_ += golden_medals;
silver_medals += golden_medals;
int index_2 = index_;
while (arr[index_] == arr[index_2]) {
++index_;
++silver_medals;
}
int count_ = 0;
if (n >= 2 && arr[n] == arr[n - 1]) {
int pos = n;
while (arr[n - 1] == arr[pos--] && pos > -1) {
++count_;
}
--count_;
}
bronze_medals = n - (silver_medals + golden_medals);
bronze_medals -= count_;
if (golden_medals < silver_medals && golden_medals < bronze_medals)
cout << golden_medals << " " << silver_medals << " " << bronze_medals;
else
for (int i = 0; i < 3; ++i) cout << 0 << ' ';
cout << '\n';
}
}
|
#include <bits/stdc++.h>
using namespace std;
int T, N, p[400000];
int main(int argc, char *argv[]) {
if (argc == 2 && ((string)argv[1]) == "USE_IO_FILES")
freopen("in.txt", "r", stdin), freopen("out.txt", "w", stdout);
;
scanf("%d", &T);
while (T--) {
scanf("%d", &N);
for (int i = int(0); i < int(N); i++) {
scanf("%d", p + i);
}
int pst = N / 2;
while (pst >= 0 && p[pst] == p[pst - 1]) pst--;
int g = 1, s = 0, b = 0;
while (g < pst && p[g] == p[g - 1]) g++;
s = 2 * g + 1;
while (s < pst && p[s] == p[s - 1]) s++;
b = pst - s;
if (g >= b) g = s = b = 0;
printf("%d %d %d\n", g, s - g, b);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<int> award(int n, vector<int>& p) {
int pos = 0;
vector<int> res(3);
n /= 2;
while (pos < n && p[0] == p[pos]) {
res[0]++;
pos++;
}
while (pos < n && (res[0] >= res[1] || p[pos - 1] == p[pos])) {
res[1]++;
pos++;
}
while (p[pos] != p[n]) {
res[2]++;
pos++;
}
if (res[0] >= res[2]) fill(res.begin(), res.end(), 0);
return res;
}
int main() {
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
vector<int> res, p(n);
for (int i = 0; i < n; i++) cin >> p[i];
res = award(n, p);
for (int i = 0; i < res.size(); i++) cout << res[i] << " ";
cout << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
for (int i = 0; i < t; ++i) {
int n, g = 0, s = 0, b = 0, flag;
cin >> n;
long long int a[n];
int v1[n], v2[n];
int size = 0, size1 = 0;
for (int j = 0; j < n; ++j) {
cin >> a[j];
}
v1[0] = 0;
size++;
for (int j = 0; j < n - 1; ++j)
if (a[j] > a[j + 1]) {
v1[size] = j;
size++;
}
v1[size] = n - 1;
for (int j = 1; j < size + 1; ++j) {
if (j == 1 && v1[j] + 1 <= n / 2) {
v2[size1] = v1[j] - v1[0] + 1;
size1++;
}
if (j == 1 && v1[j] + 1 > n / 2) break;
if (j != 1 && v1[j] + 1 <= n / 2) {
v2[size1] = v1[j] - v1[j - 1];
size1++;
}
if (j != 1 && v1[j] > n / 2) break;
}
if (size1 > 0) g = v2[0];
int r = 0;
for (int j = 1; j < size1; ++j) {
if (s <= g) s += v2[j];
r += v2[j];
}
b = r - s;
if (g > 0 && s > 0 && b > 0 && b > g && s > g)
cout << g << " " << s << " " << b << "\n";
else
cout << "0 0 0\n";
}
}
|
#include <bits/stdc++.h>
using namespace std;
bool comp(int i, int j) { return i > j; }
int main() {
int t, g = 0, s = 0, b = 0;
vector<int> x;
int n;
cin >> t;
for (int i = 0; i < t; i++) {
cin >> n;
x.resize(n);
for (int j = 0; j < n; j++) {
cin >> x[j];
}
int temp = x[(n / 2)];
vector<int>::iterator low, upg, ups;
low = lower_bound(x.begin(), x.end(), temp, comp);
if ((low - x.begin()) > 2) {
temp = x[0];
upg = upper_bound(x.begin(), low, temp, comp);
g = upg - x.begin();
temp = x[g];
while (s <= g && ups < low) {
ups = upper_bound(upg, low, temp, comp);
s = ups - upg;
temp = x[ups - x.begin()];
}
b = low - ups;
if (s > g && b > g) {
cout << g << " " << s << " " << b << endl;
} else {
cout << "0 0 0" << endl;
}
} else {
cout << "0 0 0" << endl;
}
x.clear();
g = 0;
s = 0;
b = 0;
}
}
|
#include <bits/stdc++.h>
using namespace std;
const long long N = 4e5 + 10;
long long q, n, m, a[N];
int main() {
cin >> q;
for (long long k = 1; k <= q; k++) {
cin >> m;
for (long long i = 1; i <= m; i++) {
cin >> a[i];
}
n = m / 2;
while (a[n] == a[n + 1] && n >= 1) {
n--;
}
if (n == 0) {
cout << "0 0 0\n";
continue;
}
long long g = 1, s = 1, b = 1;
long long j = 1;
while (a[j] == a[j + 1] && j <= n) {
j++;
g++;
}
if (j == n + 1) {
cout << "0 0 0\n";
continue;
}
j += g + 1;
if (j >= n) {
cout << "0 0 0\n";
continue;
}
s = g + 1;
j++;
while (a[j] == a[j - 1] && j <= n) {
j++;
s++;
}
if (j == n + 1) {
cout << "0 0 0\n";
continue;
}
b = n - g - s;
if (g < s && g < b) {
cout << g << " " << s << " " << b << "\n";
} else {
cout << "0 0 0\n";
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int inf = (int)1e9 + 7;
const long long INF = (long long)1e18 + 7;
const int N = 100007;
int v[N * 4];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
;
int t;
cin >> t;
while (t--) {
int n, a, b, c;
a = b = c = -1;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> v[i];
}
v[n] = -1;
int i = 1;
for (; i < (n / 2); i++) {
if (v[i] != v[i - 1]) {
a = i;
i++;
break;
}
}
if (a == -1) {
cout << "0 0 0\n";
continue;
}
for (; i < (n / 2); i++) {
if (v[i] != v[i - 1] && (i - a) > a) {
b = (i - a);
i++;
break;
}
}
if (b == -1) {
cout << "0 0 0\n";
continue;
}
for (int j = (n / 2) - 1; j >= (a + b); j--) {
if (v[j] != v[j + 1] && (j - (a + b) + 1) > a) {
c = (j - (a + b) + 1);
break;
}
}
if (c == -1) {
cout << "0 0 0\n";
continue;
}
cout << a << ' ' << b << ' ' << c << '\n';
}
return 0;
}
|
#include <bits/stdc++.h>
const int maxn = 1e6 + 9;
int Read() {
int x(0), f(1);
char c = getchar();
while (c < '0' || c > '9') {
if (c == '-') f = -1;
c = getchar();
}
while (c >= '0' && c <= '9') {
x = (x << 3) + (x << 1) + c - '0';
c = getchar();
}
return x * f;
}
int T, n;
int a[maxn], pos[maxn], S[maxn];
int main() {
T = Read();
while (T--) {
n = Read();
a[0] = -1;
int tot(0);
for (int i = 1; i <= n; ++i) {
a[i] = Read();
if (a[i] != a[i - 1]) {
pos[++tot] = 1;
} else
pos[tot]++;
}
for (int i = 1; i <= tot; ++i) {
S[i] = S[i - 1] + pos[i];
}
int up(n / 2), sum(0), k(0);
for (int i = 1; i <= tot; ++i) {
if (sum <= up && sum + pos[i] > up) {
k = i - 1;
break;
}
sum += pos[i];
}
if (k >= 3) {
int f(0);
for (int i = 2; i < k; ++i) {
if (S[i] - S[1] > S[1] && S[k] - S[i] > S[1]) {
printf("%d %d %d\n", S[1], S[i] - S[1], S[k] - S[i]);
f = 1;
break;
}
}
if (!f) puts("0 0 0");
} else {
puts("0 0 0");
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 11;
int a[N];
void up() {
int n;
cin >> n;
for (int i = 1; i <= n; i++) cin >> a[i];
int p1 = 0, p2 = 0;
for (int i = 1; i <= n; i++)
if (a[i] > a[i + 1]) {
p1 = i;
break;
}
for (int j = p1 + 1; j <= n; j++)
if (j - p1 > p1 && a[j] > a[j + 1]) {
p2 = j;
break;
}
int p3 = 0, ans = 0;
for (int j = n / 2; j > p2; j--)
if (a[j] > a[j + 1] && (j - p2) > p1) {
ans = j;
p3 = j;
break;
}
if (ans == 0 || p1 == 0 || p2 == 0)
cout << 0 << " " << 0 << " " << 0 << "\n";
else
cout << p1 << " " << p2 - p1 << " " << p3 - p2 << "\n";
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t;
cin >> t;
while (t--) up();
}
|
#include <bits/stdc++.h>
using namespace std;
const long long INF = 1e18;
const long long mod = 998244353;
const long long N = 1e5 + 10;
int main() {
ios::sync_with_stdio(false);
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++) cin >> v[i];
if (n < 3) {
cout << "0 0 0" << endl;
continue;
}
vector<int> f;
int c = 1;
for (int i = 1; i < n / 2; i++) {
if (v[i] == v[i - 1])
c++;
else {
f.push_back(c);
c = 1;
}
}
if (c > 0) f.push_back(c);
if (v[n / 2] == v[n / 2 - 1]) f.erase(f.begin() + f.size() - 1);
if (f.size() < 3) {
cout << "0 0 0" << endl;
continue;
}
int g = f[0];
int s = 0, b = 0;
for (int i = 1; i < f.size(); i++) {
if (g >= s)
s += f[i];
else
b += f[i];
}
if (g == 0 || s == 0 || b == 0 || g >= s || g >= b)
cout << "0 0 0" << endl;
else
cout << g << ' ' << s << ' ' << b << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<vector<long long>> coprime(100001);
void prime_factorization() {
for (long long i = 2; i <= 100001; i += 2) {
coprime[i].push_back(2);
}
for (long long i = 3; i <= 100001; i += 3) {
coprime[i].push_back(3);
}
for (long long i = 5; i <= 50000; i += 6) {
if (coprime[i].size() == 0) {
for (long long j = i; j <= 100000; j += i) {
coprime[j].push_back(i);
}
}
if (coprime[i + 2].size() == 0) {
for (long long j = i + 2; j <= 100000; j += i + 2) {
coprime[j].push_back(i + 2);
}
}
}
}
bool isprime(long long n) {
if (n < 2) return false;
if (n == 2 || n == 3) return true;
if (n % 2 == 0) return false;
if (n % 3 == 0) return false;
for (long long i = 5; i <= sqrt(n); i += 6) {
if (n % i == 0 || n % (i + 2) == 0) return false;
}
return true;
}
void swap(long long &a, long long &b) {
long long temp = a;
a = b;
b = temp;
}
long long bin_power(long long a, long long n) {
if (a == 0) return 0;
long long res = 1;
while (n) {
if (n % 2) {
res = (res * a) % 1000000007;
n--;
} else {
a = (a * a) % 1000000007;
n /= 2;
}
}
return res;
}
void p_factors(long long &n, map<long long, long long> &m) {
if (n % 2 == 0) {
long long c = 0;
while (n % 2 == 0) {
n /= 2;
c++;
}
m[2] = c;
}
for (long long i = 3; i <= sqrt(n); i += 2) {
if (n % i == 0) {
long long c = 0;
while (n % i == 0) {
n /= i;
c++;
}
m[i] = c;
}
}
if (n != 1) m[n] = 1;
}
long long gcd(long long a, long long b) {
if (b == 0) return a;
return gcd(b, a % b);
}
long long extended_gcd(long long a, long long b, long long *x, long long *y) {
if (a == 0) {
*x = 0;
*y = 1;
return b;
}
long long x1, y1;
long long g = extended_gcd(b % a, a, &x1, &y1);
*x = y1 - (b / a) * x1;
*y = x1;
return g;
}
void simple_sieve(long long n, vector<long long> &primes) {
if (n < 2) return;
if (n < 3) {
primes.push_back(2);
return;
}
vector<bool> mark(n + 1, true);
mark[2] = true;
mark[3] = true;
primes.push_back(2);
primes.push_back(3);
for (long long i = 5; i * i < n; i += 6) {
if (mark[i]) {
for (long long j = i * i; j < n; j += i) mark[j] = false;
}
if (mark[i + 2] && (i + 2) < sqrt(n)) {
for (long long j = (i + 2) * (i + 2); j < n; j += (i + 2))
mark[j] = false;
}
}
for (long long i = 5; i < n; i += 6) {
if (mark[i]) primes.push_back(i);
if (mark[i + 2] && (i + 2) < n) primes.push_back(i + 2);
}
}
long long linear_sieve(long long n, vector<long long> &primes) {
if (n < 2) return 0;
if (n < 3) {
primes.push_back(2);
return 1;
}
vector<long long> mark(n + 1);
for (long long i = 2; i <= n; i++) {
if (mark[i] == 0) {
primes.push_back(i);
mark[i] = i;
}
for (long long j = 0;
j < primes.size() && primes[j] <= mark[i] && i * primes[j] <= n; j++)
mark[i * primes[j]] = primes[j];
}
return primes.size();
}
void segmented_sieve(long long n, vector<long long> &primes) {
if (n < 2) return;
long long limit = sqrt(n) + 1;
simple_sieve(limit, primes);
long long low = limit;
long long high = 2 * limit;
while (low < n) {
if (high >= n) high = n + 1;
vector<bool> mark(high - low + 2, true);
for (long long i = 0; i < primes.size(); i++) {
long long lolim = (low / primes[i]) * primes[i];
if (lolim < low) lolim += primes[i];
for (long long j = lolim; j < high; j += primes[i]) mark[j - low] = false;
}
for (long long j = low; j < high; j++) {
if (mark[j - low]) primes.push_back(j);
}
low += limit;
high += limit;
}
}
void ranged_primes(long long low, long long high, vector<long long> &primes) {
if (low < 2) low = 2;
if (high < 2) return;
long long lim = sqrt(high);
vector<long long> pr;
linear_sieve(lim, pr);
if (pr.size() == 0) {
if (high == 2) {
primes.push_back(2);
return;
}
if (high == 3) {
if (low <= 2) {
primes.push_back(2);
primes.push_back(3);
return;
}
primes.push_back(3);
return;
}
}
vector<bool> mark(high - low + 1, true);
for (auto &i : pr) {
long long j = i * i;
if (j < low) {
j = (low / i) * i;
if (j < low) j += i;
}
while (j <= high) {
mark[j - low] = false;
j += i;
}
}
for (long long i = low; i <= high; i++) {
if (mark[i - low]) primes.push_back(i);
}
}
long long totient(long long n) {
long long res = n;
for (long long i = 2; i * i <= n; i++) {
if (n % i == 0) {
while (n % i == 0) {
n /= i;
}
res -= res / i;
}
}
if (n > 1) res -= res / n;
return res;
}
void phi_1_to_n(long long n, vector<long long> &phi) {
for (long long i = 0; i <= n; i++) {
phi[i] = i;
}
for (long long i = 2; i <= n; i++) {
if (phi[i] == i) {
for (long long j = i; j <= n; j += i) {
phi[j] -= phi[j] / i;
}
}
}
}
long long factorial(long long n) {
long long res = 1;
for (long long i = 2; i <= n; i++) {
res = (res * i) % 1000000007;
}
return res % 1000000007;
}
long long sumofint(long long n) {
string s = to_string(n);
long long sum = 0;
for (long long i = 0; i < s.size(); i++) {
int j = s[i];
j -= 48;
sum += j;
}
return sum;
}
long long modinverse(long long n) { return bin_power(n, 1000000007 - 2); }
long long ncr(long long n, long long r) {
if (n < 0 || r > n || r < 0) return 0;
if (n - r < r) r = n - r;
vector<long long> c(n + 1);
c[0] = 1;
for (long long i = 1; i <= n; i++) {
for (long long j = min(i, r); j > 0; j--) {
c[j] = (c[j] + c[j - 1]) % 1000000007;
}
}
return c[r] % 1000000007;
}
void dfsinto(long long v, vector<vector<long long>> &adj,
vector<long long> &mark, stack<long long> &s) {
mark[v] = 1;
s.push(v);
for (long long x : adj[v]) {
if (!mark[x]) {
dfsinto(x, adj, mark, s);
}
}
}
void dfs(vector<vector<long long>> &v, stack<long long> &s,
vector<long long> &mark) {
for (long long i = 0; i < 26; i++) {
if (mark[i] || !v[i].size()) continue;
dfsinto(i, v, mark, s);
}
}
bool iscyclic(vector<vector<long long>> &g) {
queue<long long> q;
vector<long long> mark(26), p(26);
for (long long i = 0; i < 26; i++) {
if (mark[i] || !g[i].size()) continue;
mark[i] = 1;
q.push(i);
p[i] = -1;
while (!q.empty()) {
long long f = q.front();
q.pop();
for (long long x : g[f]) {
if (mark[x]) {
if (x != p[f]) return true;
} else {
mark[x] = 1;
q.push(x);
p[x] = f;
}
}
}
}
return false;
}
long long lcs(string &a, string &b, long long m, long long n, long long &l1,
long long &l2) {
vector<vector<long long>> L(n, vector<long long>(m));
long long i, j, flag = 0;
for (i = 0; i < m; i++) {
for (j = 0; j < n; j++) {
if (a[i - 1] == b[j - 1]) {
L[i][j] = L[i - 1][j - 1] + 1;
} else
L[i][j] = max(L[i - 1][j], L[i][j - 1]);
}
}
return L[m][n];
}
bool issorted(vector<long long> &v, long long n) {
for (long long i = 1; i < n; i++) {
if (v[i] < v[i - 1]) return false;
}
return true;
}
string lexogy(string &a, string &b) {
long long n = a.size(), m = b.size();
if (n < m) swap(n, m);
for (long long i = 0; i < m; i++) {
if (a[i] == b[i])
continue;
else if (a[i] < b[i])
return a;
else
return b;
}
if (a.size() > b.size())
return a;
else if (b.size() > a.size())
return b;
else
return "EQUAL";
}
string bin_string(long long n, long long l) {
string s;
for (long long i = l - 1; i >= 0; i--) {
if (n % 2)
s.push_back('1');
else
s.push_back('0');
n /= 2;
}
reverse(s.begin(), s.end());
return s;
}
int main() {
ios_base ::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
long long tc = 1;
cin >> tc;
while (tc--) {
long long n, g = 0, s = 0, b = 0;
cin >> n;
map<long long, long long, greater<long long>> m;
for (long long i = 0; i < n; i++) {
long long j;
cin >> j;
++m[j];
}
if (n < 6)
cout << g << " " << s << " " << b << endl;
else {
auto it = m.begin();
while (it != m.end()) {
if (g == 0)
g = it->second;
else if (s <= g)
s += it->second;
else if (b <= g)
b += it->second;
else if (s + b + g + it->second <= n / 2)
b += it->second;
else
break;
it++;
}
if (s + g + b > n / 2)
cout << "0 0 0\n";
else
cout << g << " " << s << " " << b << endl;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int upper(int l, int r, int k, const vector<int> &v) {
while (l < r) {
int mid = (l + r) >> 1;
if (v[mid] - k > k)
r = mid;
else
l = mid + 1;
}
return l;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int T;
cin >> T;
while (T--) {
int N;
cin >> N;
vector<pair<int, int>> v;
for (int i = 0; i < N; ++i) {
int c;
cin >> c;
if (v.empty() || v.back().first > c)
v.push_back({c, 1});
else
v.back().second += 1;
}
int maxVi = 0;
int sum = 0;
for (int i = 0; i < v.size(); ++i) {
if (sum + v[i].second > N / 2) break;
sum += v[i].second;
++maxVi;
}
if (maxVi < 1) {
cout << "0 0 0" << '\n';
continue;
}
vector<int> sectorPeopleC(maxVi);
sectorPeopleC[0] = v[0].second;
for (int i = 1; i < maxVi; ++i) {
sectorPeopleC[i] = sectorPeopleC[i - 1] + v[i].second;
}
bool no = false;
int gmedalistC = v[0].second;
int sIdx = upper(1, maxVi, gmedalistC, sectorPeopleC);
if (maxVi - 1 <= sIdx)
no = true;
else if (gmedalistC >= sectorPeopleC.back() - sectorPeopleC[sIdx])
no = true;
else {
cout << gmedalistC << ' ' << sectorPeopleC[sIdx] - sectorPeopleC[0] << ' '
<< sectorPeopleC.back() - sectorPeopleC[sIdx] << '\n';
}
if (no) {
cout << "0 0 0" << '\n';
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long t;
cin >> t;
long long i, j, k, l;
while (t--) {
long long g = 0, s = 0, b = 0;
long long n;
cin >> n;
long long p[n];
map<long long, long long> m;
for (i = 0; i < n; i++) {
cin >> p[i];
m[p[i]]++;
}
i = n / 2 - 1;
while (p[i] == p[n / 2] && i >= 0) {
i--;
}
long long len = i + 1;
j = 0;
if (m[p[j]] < len / 2) {
g = m[p[j]];
j += m[p[j]];
if (j < i + 1) {
while (g >= s && j < i + 1) {
s += m[p[j]];
j += m[p[j]];
}
b = i + 1 - g - s;
}
}
if ((s > g && b > g) && g > 0) {
cout << g << " " << s << " " << b << "\n";
} else
cout << "0 0 0"
<< "\n";
}
}
|
#include <bits/stdc++.h>
using namespace std;
long long mod = 1000000007;
const long long num = 1000000000;
int main() {
long long q = 1;
cin >> q;
while (q--) {
long long n;
cin >> n;
vector<long long> vec(n);
for (int i = 0; i < n; i++) {
cin >> vec[i];
}
long long g = 0, s = 0, b = 0;
while (g < n and vec[g] == vec[0]) g++;
set<long long> st;
for (int i = g; i < n; i++) {
if (st.count(vec[i]))
s++;
else if (s <= g) {
st.insert(vec[i]);
s++;
} else
break;
}
for (int i = g + s; i < n; i++) {
if (vec[i] <= vec[n / 2])
break;
else
b++;
}
if (!g or !s or !b or g + s + b > n / 2 or s <= g or b <= g) {
cout << "0 0 0" << endl;
} else {
cout << g << " " << s << " " << b << endl;
}
}
return 0;
}
|
#include <bits/stdc++.h>
int max(int a, int b) {
if (a > b) {
return a;
}
return b;
}
int min(int a, int b) {
if (a < b) {
return a;
}
return b;
}
int zt(int a, int b) { return max(a, b) - min(a, b); }
int round(int a, int b) {
if ((a % b) * 2 >= b) {
return (a / b) + 1;
}
return a / b;
}
int ceil(int a, int b) {
if (a % b == 0) {
return a / b;
}
return (a / b) + 1;
}
int gcd(int a, int b) {
int c;
while (b != 0) {
c = a % b;
a = b;
b = c;
}
return a;
}
int lcm(int a, int b) {
int c = gcd(a, b);
a /= c;
return a * b;
}
int nCr(int a, int b) {
int i, r = 1;
for (i = 1; i <= b; i++) {
r *= (a + 1 - i);
r /= i;
}
return r;
}
int nHr(int a, int b) { return nCr(a + b - 1, b); }
int fact(int a) {
int i, r = 1;
for (i = 1; i <= a; i++) {
r *= i;
}
return r;
}
int pow(int a, int b) {
int i, r = 1;
for (i = 1; i <= b; i++) {
r *= a;
}
return r;
}
int dsum(int x) {
int r = 0;
while (x) {
r += (x % 10);
x /= 10;
}
return r;
}
int dsumb(int x, int b) {
int r = 0;
while (x) {
r += (x % b);
x /= b;
}
return r;
}
int sankaku(int x) { return ((1 + x) * x) / 2; }
void swap(int *a, int *b) {
int c;
c = (*a);
(*a) = (*b);
(*b) = c;
}
long long llmax(long long a, long long b) {
if (a > b) {
return a;
}
return b;
}
long long llmin(long long a, long long b) {
if (a < b) {
return a;
}
return b;
}
long long llzt(long long a, long long b) { return llmax(a, b) - llmin(a, b); }
long long llround(long long a, long long b) {
if ((a % b) * 2 >= b) {
return (a / b) + 1;
}
return a / b;
}
long long llceil(long long a, long long b) {
if (a % b == 0) {
return a / b;
}
return (a / b) + 1;
}
long long llgcd(long long a, long long b) {
long long c;
while (b != 0) {
c = a % b;
a = b;
b = c;
}
return a;
}
long long lllcm(long long a, long long b) {
long long c = llgcd(a, b);
a /= c;
return a * b;
}
long long llnCr(long long a, long long b) {
long long i, r = 1;
for (i = 1; i <= b; i++) {
r *= (a + 1 - i);
r /= i;
}
return r;
}
long long llnHr(long long a, long long b) { return llnCr(a + b - 1, b); }
long long llfact(long long a) {
long long i, r = 1;
for (i = 1; i <= a; i++) {
r *= i;
}
return r;
}
long long llpow(long long a, long long b) {
long long i, r = 1;
for (i = 1; i <= b; i++) {
r *= a;
}
return r;
}
long long lldsum(long long x) {
long long r = 0;
while (x) {
r += (x % 10);
x /= 10;
}
return r;
}
long long lldsumb(long long x, long long b) {
long long r = 0;
while (x) {
r += (x % b);
x /= b;
}
return r;
}
long long llsankaku(long long x) { return ((1 + x) * x) / 2; }
void llswap(long long *a, long long *b) {
long long c;
c = (*a);
(*a) = (*b);
(*b) = c;
}
double dbmax(double a, double b) {
if (a > b) {
return a;
}
return b;
}
double dbmin(double a, double b) {
if (a < b) {
return a;
}
return b;
}
double dbzt(double a, double b) { return dbmax(a, b) - dbmin(a, b); }
void dbswap(double *a, double *b) {
double c;
c = (*a);
(*a) = (*b);
(*b) = c;
}
void chswap(char *a, char *b) {
char c;
c = (*a);
(*a) = (*b);
(*b) = c;
}
int sortfncsj(const void *a, const void *b) {
if (*(int *)a > *(int *)b) {
return 1;
}
if (*(int *)a == *(int *)b) {
return 0;
}
return -1;
}
int sortfnckj(const void *a, const void *b) {
if (*(int *)a < *(int *)b) {
return 1;
}
if (*(int *)a == *(int *)b) {
return 0;
}
return -1;
}
int llsortfncsj(const void *a, const void *b) {
if (*(long long *)a > *(long long *)b) {
return 1;
}
if (*(long long *)a == *(long long *)b) {
return 0;
}
return -1;
}
int llsortfnckj(const void *a, const void *b) {
if (*(long long *)a < *(long long *)b) {
return 1;
}
if (*(long long *)a == *(long long *)b) {
return 0;
}
return -1;
}
int dbsortfncsj(const void *a, const void *b) {
if (*(double *)a > *(double *)b) {
return 1;
}
if (*(double *)a == *(double *)b) {
return 0;
}
return -1;
}
int dbsortfnckj(const void *a, const void *b) {
if (*(double *)a < *(double *)b) {
return 1;
}
if (*(double *)a == *(double *)b) {
return 0;
}
return -1;
}
int strsortfncsj(const void *a, const void *b) {
return strcmp((char *)a, (char *)b);
}
int strsortfnckj(const void *a, const void *b) {
return strcmp((char *)b, (char *)a);
}
int chsortfncsj(const void *a, const void *b) {
if (*(char *)a > *(char *)b) {
return 1;
}
if (*(char *)a == *(char *)b) {
return 0;
}
return -1;
}
int chsortfnckj(const void *a, const void *b) {
if (*(char *)a < *(char *)b) {
return 1;
}
if (*(char *)a == *(char *)b) {
return 0;
}
return -1;
}
void shuffledget(int x[], int n) {
int i, b[524288], p, c;
for (i = 0; i < n; i++) {
b[i] = i;
}
for (i = n; i >= 1; i--) {
p = rand() % i;
c = b[i - 1];
b[i - 1] = b[p];
b[p] = c;
}
for (i = 0; i < n; i++) {
scanf("%d", &x[b[i]]);
}
}
int dx4[4] = {1, -1, 0, 0};
int dy4[4] = {0, 0, 1, -1};
int dx8[8] = {-1, -1, -1, 0, 0, 1, 1, 1};
int dy8[8] = {-1, 0, 1, -1, 1, -1, 0, 1};
int search(int x, int a[], int n) {
int st = 0, fi = n - 1, te;
while (st <= fi) {
te = (st + fi) / 2;
if (a[te] < x) {
st = te + 1;
} else {
fi = te - 1;
}
}
return st;
}
void prarr(int arr[], int n) {
int i;
for (i = 0; i < n; i++) {
if (i) {
printf(" ");
}
printf("%d", arr[i]);
}
printf("\n");
return;
}
void getperm(int a[], int n) {
int i, p;
for (i = 0; i < n; i++) {
a[i] = i;
}
for (i = n - 1; i >= 1; i--) {
p = rand() % (i + 1);
swap(&a[p], &a[i]);
}
}
typedef struct {
int val;
int node;
} sd;
int sdsortfnc(const void *a, const void *b) {
if (((sd *)a)->val < ((sd *)b)->val) {
return -1;
}
if (((sd *)a)->val > ((sd *)b)->val) {
return 1;
}
return 0;
}
void coordinate_comp(int a[], int n) {
int i, c = 0;
sd dat[524288];
for (i = 0; i < n; i++) {
dat[i].val = a[i];
dat[i].node = i;
}
qsort(dat, n, sizeof(dat[0]), sdsortfnc);
a[dat[0].node] = c;
for (i = 1; i < n; i++) {
if (dat[i - 1].val != dat[i].val) {
c++;
}
a[dat[i].node] = c;
}
}
int main(void) {
int i, j, n, m, k, a[524288], h, w, r = 0, l, t;
int g, s, b;
scanf("%d", &t);
while (t > 0) {
t--;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
a[n] = -1;
g = 0;
s = 0;
b = 0;
for (i = 0; i < n; i++) {
if (a[i] == a[i + 1]) {
continue;
}
g = i + 1;
break;
}
for (i = g; i < n; i++) {
if (a[i] == a[i + 1]) {
continue;
}
if (g >= i - (g - 1)) {
continue;
}
s = i - (g - 1);
break;
}
for (i = g + s; i < n; i++) {
if (a[i] == a[i + 1]) {
continue;
}
if (g >= i - (g + s - 1)) {
continue;
}
if (g + s + (i - (g + s - 1)) > n / 2) {
continue;
}
b = i - (g + s - 1);
}
if (b == 0) {
printf("%d %d %d\n", 0, 0, 0);
} else {
printf("%d %d %d\n", g, s, b);
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
int arr[n];
map<int, int> m;
for (int i = 0; i < n; i++) {
cin >> arr[i];
m[arr[i]]++;
}
int d[3] = {0};
int a = 0;
int b = arr[0];
d[a] = m[arr[0]];
int sum = 0;
for (int i = 0; i < n / 2; i++) {
if (b == arr[i]) {
sum++;
} else if ((b != arr[i] && a == 0) ||
(b != arr[i] && d[1] > d[0] && a == 1)) {
a++;
sum++;
d[a] = m[arr[i]];
b = arr[i];
} else if (b != arr[i] && d[1] <= d[0]) {
d[a] += m[arr[i]];
b = arr[i];
sum++;
} else if (a == 2) {
d[a] += m[arr[i]];
b = arr[i];
sum++;
}
}
if (arr[n / 2 - 1] == arr[n / 2]) d[2] -= m[arr[n / 2 - 1]];
if (d[0] < d[1] && d[0] < d[2])
cout << d[0] << " " << d[1] << " " << d[2] << endl;
else
cout << 0 << " " << 0 << " " << 0 << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int inf = (int)1e9;
const long long INF = (long long)5e18;
const int MOD = 998244353;
int _abs(int x) { return x < 0 ? -x : x; }
int add(int x, int y) {
x += y;
return x >= MOD ? x - MOD : x;
}
int sub(int x, int y) {
x -= y;
return x < 0 ? x + MOD : x;
}
void Add(int &x, int y) {
x += y;
if (x >= MOD) x -= MOD;
}
void Sub(int &x, int y) {
x -= y;
if (x < 0) x += MOD;
}
void Mul(int &x, int y) { x = (long long)(x) * (y) % MOD; }
int qpow(int x, int y) {
int ret = 1;
while (y) {
if (y & 1) ret = (long long)(ret) * (x) % MOD;
x = (long long)(x) * (x) % MOD;
y >>= 1;
}
return ret;
}
void checkmin(int &x, int y) {
if (x > y) x = y;
}
void checkmax(int &x, int y) {
if (x < y) x = y;
}
void checkmin(long long &x, long long y) {
if (x > y) x = y;
}
void checkmax(long long &x, long long y) {
if (x < y) x = y;
}
inline int read() {
int x = 0, f = 1;
char c = getchar();
while (c > '9' || c < '0') {
if (c == '-') f = -1;
c = getchar();
}
while (c >= '0' && c <= '9')
x = (x << 1) + (x << 3) + (c ^ 48), c = getchar();
return x * f;
}
const int N = 500005;
const int M = 1000005;
int n, a[N], t[M], tmp[N];
int main() {
int T = read();
while (T--) {
n = read();
for (int i = 1; i <= n; i++) a[i] = read(), t[a[i]]++, tmp[i] = a[i];
sort(a + 1, a + n + 1);
int m = unique(a + 1, a + n + 1) - a - 1;
if (m <= 2) {
puts("0 0 0");
for (int i = 1; i <= n; i++) t[tmp[i]]--;
continue;
}
int g = t[a[m]], b = 0, s = 0;
int x = m - 1;
while (x > 0 && s + t[a[x]] <= g) s += t[a[x]], x--;
if (x > 0) s += t[a[x]];
x--;
while (x > 0 && s + b + g + t[a[x]] <= n / 2) b += t[a[x]], x--;
if (g + s + b > n / 2 || g >= s || g >= b)
puts("0 0 0");
else
printf("%d %d %d\n", g, s, b);
for (int i = 1; i <= n; i++) t[tmp[i]]--;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
function<void(void)> ____ = []() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
};
const int MAXN = 4e5 + 7;
int t, n, A[MAXN];
int main() {
____();
cin >> t;
A[0] = -1;
while (t--) {
cin >> n;
vector<int> vec;
cin >> A[1];
for (int i = 2; i <= n; i++) {
cin >> A[i];
if (A[i] != A[i - 1]) vec.push_back(i - 1);
}
vec.push_back(n);
while (!vec.empty() && vec.back() > n / 2) vec.pop_back();
if (vec.size() < 3) {
cout << "0 0 0" << endl;
continue;
}
int pa = 0, pb = vec.size() - 2, pc = vec.size() - 1;
while (vec[pc] - vec[pb] <= vec[pa] && pb > 1) pb--;
if (vec[pc] - vec[pb] <= vec[pa] || vec[pb] - vec[pa] <= vec[pa]) {
cout << "0 0 0" << endl;
continue;
}
int ca = pa, cb = pb, cc = pc;
while (true) {
ca++;
while (vec[cc] - vec[cb] <= vec[ca] && cb > ca + 1) cb--;
if (vec[cc] - vec[cb] <= vec[ca] || vec[cb] - vec[ca] <= vec[ca])
break;
else
pa = ca, pb = cb, pc = cc;
}
cout << vec[pa] << ' ' << vec[pb] - vec[pa] << ' ' << vec[pc] - vec[pb]
<< endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long int divi[129];
map<long double, long long int> mp1;
map<long long int, long long int> mp2;
vector<int> stp[29];
string str1;
string str2;
long long int arra[100007];
deque<long long int> save;
long long int ans1[100005];
long long int ans2[100005];
long long int inp1[400009];
long long int inp2[200009];
long long int pos_b[200009];
vector<long long int> BRC;
map<long long int, long long int> vis;
pair<long long int, long long int> sol;
map<pair<long long int, long long int>, long long int> mp3;
int main() {
long long int a, b, c, d, e, f, g, h, i, j, k, l = 0, n, t, m, s;
cin >> t;
while (t--) {
cin >> n;
g = 0;
b = 0;
s = 0;
for (i = 1; i <= n; i++) {
cin >> inp1[i];
mp2[inp1[i]]++;
}
for (i = 1; i <= n; i++) {
if (vis[inp1[i]] == 0) {
vis[inp1[i]] = 1;
BRC.push_back(mp2[inp1[i]]);
}
}
m = BRC.size();
g = 0;
s = 0;
b = 0;
for (i = 0; i < m; i++) {
if (g == 0) {
g = g + BRC[i];
} else if (s <= g) {
s = s + BRC[i];
} else if (g + b + s + BRC[i] <= n / 2) {
b = b + BRC[i];
} else
break;
}
if (s > g && b > g && g > 0 && s > 0 && b > 0 && g + s + b <= n / 2) {
cout << g << " " << s << " " << b << '\n';
} else
cout << "0 0 0" << '\n';
mp2.clear();
vis.clear();
BRC.clear();
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int M = 1e9 + 7;
template <class T>
T ABS(const T &x) {
return x > 0 ? x : -x;
}
long long int gcd(long long int n1, long long int n2) {
return n2 == 0 ? ABS(n1) : gcd(n2, n1 % n2);
}
long long int lcm(long long int n1, long long int n2) {
return n1 == 0 && n2 == 0 ? 0 : ABS(n1 * n2) / gcd(n1, n2);
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
int a[n], cnt = 1;
vector<int> p;
cin >> a[0];
int i = 1;
for (i = 1; i < n; ++i) {
cin >> a[i];
if (a[i] == a[i - 1])
++cnt;
else {
p.push_back(cnt);
cnt = 1;
}
}
p.push_back(cnt);
int g = p[0], s = 0, b = 0, size = p.size(), given = g;
i = 1;
while (i < size) {
int cur = p[i];
if (given + cur > n / 2 || s > g) break;
given += cur;
s += cur;
++i;
}
while (i < size) {
int cur = p[i];
if (given + cur > n / 2) break;
given += cur;
b += cur;
++i;
}
if (g >= b || g >= s || g == 0 || b == 0 || s == 0 || g + s + b > n / 2) {
cout << 0 << " " << 0 << " " << 0 << "\n";
} else
cout << g << " " << s << " " << b << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void solve(map<int, int>& m, int n) {
int mx = n / 2;
int cnt = 0, g = 0, s = 0, b = 0;
if (n < 6 || m.size() < 3)
cout << s << " " << b << " " << g << endl;
else {
auto itr = m.begin();
g = itr->second;
itr++;
s = itr->second;
itr++;
while (g + s + itr->second <= mx && itr != m.end()) {
s += itr->second;
itr++;
}
itr--;
s = s - itr->second;
b = itr->second;
while (g >= b && itr != m.begin()) {
itr--;
b += itr->second;
s -= itr->second;
}
if (g < b && g < s)
cout << g << " " << s << " " << b << endl;
else
cout << "0 0 0" << endl;
}
}
int main() {
int t;
cin >> t;
while (t--) {
int i, k, n;
cin >> n;
map<int, int> m;
for (i = 0; i < n; i++) {
cin >> k;
m[-k]++;
}
solve(m, n);
}
}
|
#include <bits/stdc++.h>
using namespace std;
void func() {
int n;
cin >> n;
vector<int> arr;
int prev;
cin >> prev;
int cnt = 1;
for (long long int i = 0; i < n - 1; i++) {
int x;
cin >> x;
if (prev == x) {
cnt++;
} else {
arr.push_back(cnt);
cnt = 1;
prev = x;
}
}
arr.push_back(cnt);
int g, s, b;
g = 0;
s = 0;
b = 0;
for (long long int i = 0; i < n; i++) {
if (i == 0) {
g += arr[i];
continue;
}
if (g + s + b + arr[i] > n / 2) break;
if (s <= g)
s += arr[i];
else
b += arr[i];
}
if (g < s and g < b and s != 0 and b != 0)
cout << g << " " << s << " " << b << "\n";
else
cout << "0 0 0\n";
}
int main() {
int T;
cin >> T;
for (long long int _ = 0; _ < T; _++) func();
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAX_N = 1e5 + 1;
const int MOD = 998244353;
const int INF = 1e9;
const long long LINF = 1e18;
void solve() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
int hf = n / 2;
if (hf < 5) {
cout << "0 0 0" << endl;
return;
}
int mg = 0, ms = 0, mb = 0;
int cg = 0, cs = 0, cb = 0;
for (int i = 0; i < hf; ++i) {
if (mg == 0) {
mg = a[i];
cg++;
} else {
if (a[i] == mg) {
cg++;
} else if (ms == 0) {
ms = a[i];
cs++;
} else {
if (a[i] == ms) {
cs++;
} else {
if (cs > cg && ms > a[i]) {
if (a[i] == a[hf]) {
if (cg < cs && cg < cb) {
cout << cg << " " << cs << " " << cb << endl;
} else {
cout << "0 0 0" << endl;
}
return;
}
cb++;
} else {
cs++;
ms = a[i];
}
}
}
}
}
if (cg < cs && cg < cb) {
cout << cg << " " << cs << " " << cb << endl;
} else {
cout << "0 0 0" << endl;
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t = 1;
cin >> t;
while (t--) {
solve();
}
}
|
#include <bits/stdc++.h>
using namespace std;
void solve() {
int n, i, k, m = 1, s = 0, g = 0, b = 0, t = 0, d;
cin >> n;
vector<int> a(n);
for (i = 0; i != n; i++) {
cin >> a[i];
if (i) {
if (a[i] != a[i - 1]) {
if (m == 1)
m++;
else if (m == 2 && s > g)
m++;
else if (m == 3) {
if (i <= n / 2) t = b;
}
}
}
if (m == 1)
g++;
else if (m == 2)
s++;
else
b++;
}
if (t <= g)
cout << "0 0 0\n";
else
cout << g << ' ' << s << ' ' << t << '\n';
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cout << fixed << setprecision(10);
int t = 1;
cin >> t;
while (t--) solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long n;
long long a[400000];
int32_t main() {
long long t;
cin >> t;
while (t--) {
cin >> n;
for (long long i = 0; i < n; i++) cin >> a[i];
if (n < 5) {
cout << "0 0 0\n";
continue;
}
long long lim = n / 2;
long long i = 0;
while (i < lim - 1 && a[i] == a[i + 1]) i++;
long long g = i + 1;
long long s = i + 2;
long long b = i + 2;
if (g + s + b > lim) {
cout << "0 0 0\n";
continue;
}
i += s;
while (i < lim - 1 && a[i] == a[i + 1]) i++, s++;
i += b;
while (i < lim - 1) i++, b++;
if (a[i] == a[i + 1]) {
while (i >= 0 && a[i + 1] == a[i]) i--, b--;
}
if (g < s && g < b && s + g + b <= lim)
cout << g << " " << s << " " << b << "\n";
else
cout << "0 0 0\n";
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 2e6 + 10;
int a[N];
int main() {
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
map<int, int, greater<int> > ma;
for (int i = 1; i <= n; ++i) {
cin >> a[i];
ma[a[i]]++;
}
int s1 = ma[a[1]], s2 = 0, s3 = 0;
for (auto it = ma.begin(); it != ma.end(); it++) {
if (ma.size() <= 3) break;
if (it == ma.begin()) it++;
if (s2 <= s1)
s2 += it->second;
else {
if (s1 + s2 + s3 + it->second > n / 2) break;
s3 += it->second;
}
}
if (s1 < s2 && s1 < s3)
printf("%d %d %d\n", s1, s2, s3);
else
cout << "0 0 0\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
long long int a, b, c, d, i, j, k, l, g, s;
cin >> a;
map<long long int, long long int> m;
for (i = 0; i < a; i++) {
cin >> b;
auto it = m.find(b);
if (it == m.end()) {
m.insert(pair<long long int, long long int>(b, 1));
} else {
it->second++;
}
}
int cur = 0;
d = 0;
auto it = m.end();
it--;
vector<long long int> v, v1;
while (1) {
if (it->second + cur > a / 2) break;
cur = cur + it->second;
v.push_back(it->second);
d++;
if (it == m.begin()) break;
it--;
}
if (d < 3) {
cout << 0 << " " << 0 << " " << 0 << endl;
goto P;
} else {
g = v[0];
s = 0;
}
i = 1;
while (1) {
if (i >= v.size() || s > g) break;
s += v[i];
i++;
}
b = 0;
for (j = i; j < v.size(); j++) b += v[j];
if (g < s && g < b)
cout << g << " " << s << " " << b << endl;
else
cout << 0 << " " << 0 << " " << 0 << endl;
P:;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int A[400010];
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
for (int i = 1; i <= n; i++) cin >> A[i];
vector<int> df;
for (int i = 1; i <= n - 1; i++) {
if (A[i] != A[i + 1] && i <= n / 2) {
df.push_back(i);
}
}
int cta = 0, ctb = 0, ctc = 0;
int st = 0, cur = 0, prev = 0, mk = 0;
for (int i = 0; i < df.size(); i++) {
cur += df[i] - prev;
prev = df[i];
if (st == 0) {
cta = cur;
cur = 0;
st++;
}
if (st == 1 && cur > cta) {
ctb = cur;
cur = 0;
if (df[df.size() - 1] - df[i] > cta) {
cout << cta << " " << ctb << " " << df[df.size() - 1] - df[i] << '\n';
} else {
mk = 1;
}
st = 2;
break;
}
}
if (st == 0 || st == 1 || mk == 1) {
cout << 0 << " " << 0 << " " << 0 << '\n';
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int inf = 2000000000;
const long long infLL = 9000000000000000000;
template <typename first, typename second>
ostream& operator<<(ostream& os, const pair<first, second>& p) {
return os << "(" << p.first << ", " << p.second << ")";
}
template <typename T>
ostream& operator<<(ostream& os, const vector<T>& v) {
os << "{";
for (auto it = v.begin(); it != v.end(); ++it) {
if (it != v.begin()) os << ", ";
os << *it;
}
return os << "}";
}
template <typename T>
ostream& operator<<(ostream& os, const set<T>& v) {
os << "[";
for (auto it = v.begin(); it != v.end(); ++it) {
if (it != v.begin()) os << ",";
os << *it;
}
return os << "]";
}
template <typename T>
ostream& operator<<(ostream& os, const multiset<T>& v) {
os << "[";
for (auto it = v.begin(); it != v.end(); ++it) {
if (it != v.begin()) os << ", ";
os << *it;
}
return os << "]";
}
template <typename first, typename second>
ostream& operator<<(ostream& os, const map<first, second>& v) {
os << "[";
for (auto it = v.begin(); it != v.end(); ++it) {
if (it != v.begin()) os << ", ";
os << it->first << " = " << it->second;
}
return os << "]";
}
void faltu() { cerr << '\n'; }
template <typename T>
void faltu(T a[], int n) {
for (int i = 0; i < n; ++i) cerr << a[i] << ' ';
cerr << '\n';
}
template <typename T, typename... hello>
void faltu(T arg, const hello&... rest) {
cerr << arg << ' ';
faltu(rest...);
}
const int mx = 4e5 + 5;
int p[mx];
vector<pair<int, int> > vec;
int n;
int g, s, b;
bool check(int len) {
int sum1 = 0, sum2 = 0, sum3 = 0;
for (int i = 0; i < len; ++i) sum1 += vec[i].second;
sum2 += vec[len].second;
int idx = (int)vec.size();
for (int i = len + 1; i < (int)vec.size(); ++i) {
if (sum2 > sum1) {
idx = i;
break;
}
sum2 += vec[i].second;
}
for (int i = idx; i < (int)vec.size(); ++i) {
if ((sum1 + sum2 + sum3 + vec[i].second) * 2 > n) break;
sum3 += vec[i].second;
}
g = sum1, s = sum2, b = sum3;
return ((sum1 < sum2) && (sum1 < sum3));
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
int t;
cin >> t;
while (t--) {
vec.clear();
cin >> n;
for (int i = 0; i < n; ++i) cin >> p[i];
int cur = p[0], cnt = 0;
for (int i = 0; i < n; ++i) {
if (cur == p[i]) {
++cnt;
} else {
vec.push_back(make_pair(p[i], cnt));
cnt = 1;
cur = p[i];
}
}
vec.push_back(make_pair(cur, cnt));
int lo = 1, hi = (int)vec.size() - 2, mid;
while (lo <= hi) {
mid = (lo + hi) / 2;
if (check(mid))
lo = mid + 1;
else
hi = mid - 1;
}
if (hi <= 0) {
cout << "0 0 0" << '\n';
continue;
}
check(hi);
cout << g << " " << s << " " << b << '\n';
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 4e5 + 5;
const double eps = 1e-5;
int a[N], top = 0;
int bo[N], res[N];
int main() {
int t, n, tmp, g, s, b;
scanf("%d", &t);
while (t--) {
top = 1, a[0] = -1;
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &tmp);
if (tmp == a[top - 1]) {
bo[top - 1]++;
} else {
a[top] = tmp;
bo[top++] = 1;
}
}
g = s = b = 0;
int sum = 0, num = 0;
for (int i = 0; i < top; i++) {
if ((sum + bo[i]) * 2 <= n) {
sum += bo[i];
num++;
} else
break;
}
if (num < 3)
printf("0 0 0\n");
else {
g = bo[1];
for (int i = 2; i <= num; i++) {
if (s <= g)
s += bo[i];
else
break;
}
b = sum - g - s;
if (g < s && g < b)
printf("%d %d %d\n", g, s, b);
else
printf("0 0 0\n");
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int p[400010];
map<int, int> mp;
int main() {
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
mp.clear();
for (int i = 1; i <= n; i++) {
cin >> p[i];
mp[p[i]]++;
}
if (n < 10 || mp.size() < 4) {
cout << 0 << " " << 0 << " " << 0 << endl;
continue;
}
int maxP = n / 2;
vector<pair<int, int> > vc;
map<int, int>::iterator it;
it = mp.begin();
int lasttt = (*it).second;
it++;
for (; it != mp.end(); it++) {
vc.push_back(make_pair((*it).first, (*it).second));
}
sort(vc.begin(), vc.end());
int rem = n - lasttt;
maxP = min(maxP, rem);
int gans = 0, sans = 0, bans = 0;
int ii = 0, jj = 0;
int oo = 0;
for (int i = vc.size() - 1; i >= 0; i--) {
gans = vc[i].second;
ii = i;
break;
}
for (int i = ii - 1; i >= 0; i--) {
sans += vc[i].second;
if (sans > gans) {
jj = i;
break;
}
}
for (int i = jj - 1; i >= 0; i--) {
if (bans + vc[i].second + gans + sans <= maxP) {
bans += vc[i].second;
} else {
break;
}
}
if (gans > 0 && sans > 0 && bans > 0 && gans < sans && gans < bans &&
gans + sans + bans <= maxP) {
cout << gans << " " << sans << " " << bans << endl;
} else {
cout << 0 << " " << 0 << " " << 0 << endl;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int p[400010];
int main() {
int t;
scanf("%d", &t);
while (t--) {
int n;
cin >> n;
for (int i = 1; i <= n; i++) cin >> p[i];
n /= 2;
while (p[n] == p[n + 1]) n--;
int g = 0, s = 0, b = 0;
bool ok = true;
for (int i = 1; i <= n; i++) {
g++;
if (i < n && p[i] != p[i + 1]) break;
}
for (int i = g + 1; i <= n; i++) {
s++;
if (i < n && p[i] != p[i + 1] && s > g) break;
}
b = n - g - s;
if (!g || s <= g || b <= g)
cout << "0 0 0" << endl;
else
cout << g << " " << s << " " << b << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
#pragma GCC optimize("-O3")
using namespace std;
long long MOD = 998244353;
long long mpow(long long a, long long b) {
if (b >= (MOD - 1)) b %= (MOD - 1);
if (b == 0) return 1;
long long t1 = mpow(a, b / 2);
t1 *= t1;
t1 %= MOD;
if (b % 2) t1 *= a;
t1 %= MOD;
return t1;
}
long long mpow(long long a, long long b, long long p) {
if (b == 0) return 1;
long long t1 = mpow(a, b / 2, p);
t1 *= t1;
t1 %= p;
if (b % 2) t1 *= a;
t1 %= p;
return t1;
}
long long modinverse(long long a, long long m) {
long long m0 = m;
long long y = 0, x = 1;
if (m == 1) return 0;
while (a > 1) {
long long q = a / m;
long long t = m;
m = a % m, a = t;
t = y;
y = x - q * y;
x = t;
}
if (x < 0) x += m0;
return x;
}
long long range(long long l, long long r) { return l + rand() % (r - l + 1); }
void solve() {
int n;
cin >> n;
vector<int> vls(n);
for (long long i = 0; i < n; i++) {
cin >> vls[i];
}
vector<int> ot;
for (long long i = 0; i < n; i++) {
int j = i;
while (j < n && vls[i] == vls[j]) {
j++;
}
ot.push_back(j - i);
i = j - 1;
}
int g = 0, s = 0, b = 0;
int curr = 1;
g += ot[0];
while (curr < ot.size() && s <= g) {
s += ot[curr];
curr++;
}
while (curr < ot.size() && b <= g) {
b += ot[curr];
curr++;
}
while (curr < ot.size() && g + s + b <= n / 2) {
if (g + s + b + ot[curr] > n / 2) {
break;
}
b += ot[curr];
curr++;
}
bool flg = 1;
if (g + s + b > n / 2) {
flg = 0;
}
if (g >= s || g >= b || g == 0 || s == 0 || b == 0) {
flg = 0;
}
if (!flg) {
cout << 0 << " " << 0 << " " << 0 << "\n";
} else {
cout << g << " " << s << " " << b << "\n";
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long t = 1;
cin >> t;
for (long long i = 0; i < t; i++) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int p[500009], f[1000009];
void solve() {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &p[i]);
f[p[i]]++;
}
vector<int> v;
for (int i = 1; i <= n; i++) {
if (i > 1 && p[i] == p[i - 1]) continue;
v.push_back(f[p[i]]);
}
for (int i = 1; i <= n; i++) {
f[p[i]] = 0;
}
if (v.size() < 4) {
cout << 0 << " " << 0 << " " << 0 << endl;
return;
}
int g = v[0], s = 0, b = 0;
int i = 1;
while (i < v.size() && s <= g) s += v[i], i++;
while (i < v.size() && b <= g) b += v[i], i++;
while (i < v.size() && (s + b + g + v[i]) <= n / 2) b += v[i], i++;
if (s && b && g && (s + b + g) <= n / 2 && s > g && b > g) {
cout << g << " " << s << " " << b << endl;
return;
}
cout << 0 << " " << 0 << " " << 0 << endl;
}
int main() {
int t;
cin >> t;
while (t--) {
solve();
}
}
|
#include <bits/stdc++.h>
using namespace std;
int n, p[400000 + 1];
void quer() {
cin >> n;
for (int i = 1; i <= n; i++) cin >> p[i];
if (n < 6) {
cout << "0 0 0\n";
return;
}
int g = n + 1, b = 0;
for (int i = 1; i < n; i++)
if (p[i] != p[i + 1]) {
g = i;
break;
}
if (g > n / 6) {
cout << "0 0 0\n";
return;
}
for (int i = n / 2; i > 0; i--)
if (p[i] != p[i + 1]) {
b = i;
break;
}
if (b - g < 2) {
cout << "0 0 0\n";
return;
}
for (int s = b - g - 1; s > g + g; s--) {
if (p[s] != p[s + 1]) {
cout << g << ' ' << s - g << ' ' << b - s << '\n';
return;
}
}
cout << "0 0 0\n";
}
void run() {
int t;
cin >> t;
for (int i = 0; i < t; i++) quer();
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
run();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int t;
cin >> t;
while (t--) {
long long int n;
cin >> n;
long long int p[n];
for (long long int i = 0; i < n; i++) cin >> p[i];
long long int k = n / 2;
if (k < 5) {
cout << "0 0 0" << endl;
continue;
}
long long int g = 1, z = 1;
for (long long int i = 1; i < k; i++) {
if (p[i] == p[0]) {
g++;
z = i + 1;
}
}
if (g > k / 3) {
cout << "0 0 0" << endl;
continue;
}
long long int s = 1, x = z + 1;
for (long long int l = z + 1; l < k; l++) {
if (p[l - 1] == p[l] || s <= g) {
s++;
x++;
} else
break;
}
long long int ss, co = 0;
if (p[k - 1] == p[k]) {
for (long long int j = k - 1; j >= x; j--)
if (p[j] == p[k]) co++;
}
long long int b = k - x - co;
if (b <= g) {
cout << "0 0 0" << endl;
continue;
}
cout << g << " " << s << " " << b << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
int n;
vector<int> p;
vector<int> a;
vector<vector<int> > res;
for (int run = 0; run < t; run++) {
cin >> n;
p.clear();
a.clear();
for (int i = 0; i < n; i++) {
p.push_back(0);
cin >> p[i];
}
int x = 1;
int point = 0;
while (point < n) {
x = 1;
while (x < n && p[point] == p[point + x]) {
x++;
}
a.push_back(x);
point += x;
}
for (int i = 1; i < a.size(); i++) {
a[i] += a[i - 1];
}
int p1;
int p2;
int stop;
stop = 0;
while (a[stop] <= n / 2) {
stop++;
}
stop--;
res.push_back(vector<int>());
if (stop < 2 || a[0] * 3 + 2 > a[stop]) {
res[run].push_back(0);
res[run].push_back(0);
res[run].push_back(0);
continue;
}
p1 = 0;
while (true) {
if (p1 + 1 < stop - 1 && a[p1 + 1] * 3 + 2 <= a[stop]) {
p1++;
} else {
break;
}
}
p2 = 1;
int gold = 0;
int silver = 0;
int bronze = 0;
for (int i = 0; i <= p1; i++) {
while (p2 < stop && a[p2] - a[i] <= a[i]) {
p2++;
}
if (p2 >= stop) {
break;
}
if (a[stop] - a[p2] <= a[i]) {
break;
} else {
gold = a[i];
silver = a[p2] - a[i];
bronze = a[stop] - a[p2];
break;
}
}
res[run].push_back(gold);
res[run].push_back(silver);
res[run].push_back(bronze);
}
for (int i = 0; i < t; i++) {
cout << res[i][0] << " " << res[i][1] << " " << res[i][2] << endl;
}
cin.sync();
cin.get();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, m, k, a[1000004], b[1000004];
void exe() {
cin >> n;
for (int i = 0; i < n; i++) cin >> a[i];
a[n] = -1;
int x = 0, y = -1, z = -1, x1 = 0, y1 = 0, z1 = 0;
int zp = n / 2 - 1;
while (zp >= 0 and a[zp + 1] == a[zp]) zp--;
while (true) {
while (x < n and a[x] == a[x + 1]) x++;
if (y == -1) y = x + 1;
while (y < n and (a[y] == a[y + 1] or y - x <= x + 1)) y++;
if (z == -1) z = y + 1;
while (z < n and (a[z] == a[z + 1] or z - y <= x + 1)) z++;
if ((z + 1) * 2 <= n) {
x1 = x + 1, y1 = y - x, z1 = zp - y;
}
break;
}
cout << x1 << ' ' << y1 << ' ' << z1 << '\n';
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int t;
cin >> t;
while (t--) exe();
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 10;
const long long INF = 1e18;
long long a[N];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long t;
cin >> t;
while (t--) {
long long n;
cin >> n;
long long cntr = -1;
long long last = -1;
for (int i = 0; i < n; i++) {
long long x;
cin >> x;
if (x == last) {
a[cntr]++;
} else {
cntr++;
a[cntr] = 0;
a[cntr]++;
}
last = x;
}
vector<long long> p;
p.resize(cntr + 1);
for (int i = 0; i <= cntr; i++) {
if (i == 0) {
p[i] = a[i];
continue;
}
p[i] = p[i - 1] + a[i];
}
long long ag = 0;
long long as = 0;
long long ab = 0;
long long curmax = 0;
for (int i = 0; i <= cntr; i++) {
long long g = p[i];
long long s = 0;
if (upper_bound(p.begin(), p.end(), 2 * g) == p.end() ||
*upper_bound(p.begin(), p.end(), 2 * g) > n / 2) {
break;
} else {
s = *upper_bound(p.begin(), p.end(), 2 * g);
}
long long b = 0;
if (upper_bound(p.begin(), p.end(), s + g) == p.end() ||
*upper_bound(p.begin(), p.end(), s + g) > n / 2) {
break;
} else {
b = *upper_bound(p.begin(), p.end(), s + g);
}
long long mx = *(upper_bound(p.begin(), p.end(), n / 2) - 1);
ag = g;
as = s - g;
ab = mx - ag - as;
}
cout << ag << " " << as << " " << ab << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
vector<int> v(n);
map<int, int> mp;
set<int> s;
for (int i = 0; i < n; i++) cin >> v[i], mp[v[i]]++;
vector<int> res;
int sum = 0;
int cap = n / 2;
bool ok = true;
for (int i = 0; i < n; i++) {
if (s.count(v[i]) == 0) {
if (ok == true) {
if (sum + mp[v[i]] <= cap)
sum += mp[v[i]], res.push_back(mp[v[i]]), s.insert(v[i]);
else
ok = false;
} else
ok = false;
}
}
int a = 0;
int b = 0;
int c = 0;
if (!res.empty()) a = res[0];
ok = true;
for (int i = 1; i < res.size(); i++) {
if (b + res[i] <= a)
b += res[i];
else {
b += res[i];
break;
}
}
c = sum - a - b;
if (a > 0 && b > 0 && c > 0 && c > a)
cout << a << " " << b << " " << c << "\n";
else
cout << 0 << " " << 0 << " " << 0 << "\n";
}
}
|
#include <bits/stdc++.h>
using namespace std;
void solve() {
int n;
cin >> n;
map<int, int> cnt;
for (int i = 1; i <= n; i++) {
int p;
cin >> p;
cnt[-p]++;
}
vector<int> c;
for (auto x : cnt) c.push_back(x.second);
int d = (int)(c.size());
int g = c[0];
int s = 0, i1 = 1;
while (s <= g && i1 < d) {
s += c[i1];
i1++;
}
int b = 0;
while (2 * (g + s + b) <= n && i1 < d) {
b += c[i1];
i1++;
}
b -= c[i1 - 1];
if (g > 0 && s > 0 && b > 0 && g < s && g < b && (g + s + b) <= n / 2) {
cout << g << ' ' << s << ' ' << b << endl;
return;
}
cout << "0 0 0" << endl;
}
int main() {
int t;
cin >> t;
while (t--) solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int p[400005];
int main() {
int T = 1;
scanf("%d ", &T);
while (T--) {
int n, i, j;
scanf("%d", &n);
int rem = n / 2;
for (i = 0; i < n; i++) {
scanf("%d", &p[i]);
}
for (i = rem - 1; i >= 0; i--) {
if (i + 1 < n && p[i + 1] == p[i]) {
rem--;
} else {
break;
}
}
rem = rem - 3;
int g = 1, s = 1, b = 1;
for (i = 1; i < n && p[i] == p[i - 1]; i++) {
g++;
rem--;
}
i++;
for (; i < n && (p[i] == p[i - 1] || s <= g); i++) {
s++;
rem--;
}
i++;
for (; i < n && (p[i] == p[i - 1] || b <= g); i++) {
b++;
rem--;
}
if (rem < 0) {
printf("0 0 0");
} else {
b = b + rem;
printf("%d %d %d", g, s, b);
}
printf("\n");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long M = 1e9 + 7;
void inp(long long a[], long long n) {
for (long long i = 0; i < n; i++) cin >> a[i];
}
void solve() {
long long n, g = 1;
cin >> n;
long long a[n];
inp(a, n);
vector<long long> v;
for (long long i = 1; i < n; i++) {
if (a[i] == a[i - 1])
g++;
else {
v.push_back(g);
g = 1;
}
}
v.push_back(g);
long long s = 0, p;
for (long long i = 0; i < (long long)((v).size()); i++) {
s += v[i];
if (s > n / 2) {
p = i - 1;
break;
}
}
if (p < 2) {
cout << "0 0 0" << '\n';
return;
}
long long sum = 0;
for (long long i = 0; i < p + 1; i++) sum += v[i];
long long a1 = v[0], a2 = 0, a3 = 0;
for (long long i = 1; i < p + 1; i++) {
a2 += v[i];
if (a2 > a1) {
for (long long j = i + 1; j < p + 1; j++) {
a3 += v[j];
if (a3 > a1) {
cout << a1 << " " << a2 << " " << sum - a1 - a2 << '\n';
return;
} else {
if (j == p) {
cout << "0 0 0" << '\n';
return;
}
}
}
}
}
cout << "0 0 0" << '\n';
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long t = 1;
cin >> t;
while (t--) solve();
}
|
#include <bits/stdc++.h>
using namespace std;
const long long int MOD = 1000000007;
const long double PI = 2 * acos(0.0);
const vector<long long int> dx = {1, -1, 0, 0};
const vector<long long int> dy = {0, 0, 1, -1};
template <typename T = long long int>
vector<T> ga(long long int n, bool oneIndexed = false) {
vector<T> a = vector<T>(n + oneIndexed);
for (long long int i = 0; i < n; i++) {
T p;
cin >> p;
a[i + oneIndexed] = p;
}
return move(a);
}
template <typename T, typename A>
void pa(vector<T, A> const &a, long long int begin = 0,
long long int end = -1) {
if (end == -1) end = (long long int)a.size() - 1;
for (long long int i = begin; i <= end; i++) {
cout << a[i] << " ";
}
cout << "\n";
}
template <typename T, typename A>
void papair(vector<T, A> const &a, long long int begin = 0,
long long int end = -1) {
if (end == -1) end = (long long int)a.size() - 1;
for (long long int i = begin; i <= end; i++) {
cout << a[i].first << " " << a[i].second << "\n";
}
}
void solve() {
long long int n;
cin >> n;
vector<long long int> p = ga(n);
vector<long long int> ca;
map<long long int, long long int> mp;
for (long long int i = 0; i < n; i++) {
mp[-p[i]]++;
}
if (mp.size() < 3) {
cout << "0 0 0\n";
return;
}
long long int g = 0, s = 0, b = 0, cc = 0;
vector<long long int> arr;
long long int sss = 0;
for (auto a : mp) {
cc += a.second;
if (cc > n / 2) {
break;
}
if (g == 0) {
g = a.second;
} else {
sss += a.second;
arr.push_back(a.second);
}
}
if (arr.size() < 2) {
cout << "0 0 0\n";
return;
}
long long int cccc = 0;
for (long long int i = 0; i < arr.size() - 1; i++) {
cccc += arr[i];
if (cccc > g && (sss - cccc) > g) {
cout << g << " " << cccc << " " << sss - cccc << '\n';
return;
}
}
cout << "0 0 0\n";
return;
}
int main(void) {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long int t;
cin >> t;
while (t--) solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long int M = 998244353;
long long int inf = 1e18;
long long getpow(long long base, long long pow) {
long long res = 1;
base = base % M;
while (pow > 0) {
if (pow % 2 != 0) res = res * base;
res = res % M;
base = base * base;
base = base % M;
pow /= 2;
}
return res;
}
void swp(long long int *x, long long int *y) {
long long int t = *x;
*x = *y;
*y = t;
}
void init(vector<long long int> &v, long long int n) {
for (long long int i = 0; i < n; i++) {
cin >> v[i];
}
}
void print(vector<long long int> &v) {
for (long long int i = 0; i < v.size(); i++) cout << v[i] << " ";
cout << endl;
}
void initg(vector<vector<long long int> > &v, long long int m) {
long long int i, x, y;
for (i = 0; i < m; i++) {
cin >> x >> y;
v[x].push_back(y);
v[y].push_back(x);
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long t1, n, cnt, n1, n2, i, tot;
cin >> t1;
while (t1--) {
cin >> n;
vector<long long> v(n);
init(v, n);
if (n < 6) {
cout << 0 << " " << 0 << " " << 0 << endl;
continue;
}
vector<long long> v1;
cnt = 1;
n1 = n / 2;
for (i = 0; i < n1 - 1; i++) {
if (v[i] == v[i + 1])
cnt++;
else {
v1.push_back(cnt);
cnt = 1;
}
}
if (v[n1 - 1] != v[n1]) v1.push_back(cnt);
if (v1.size() < 3) {
cout << 0 << " " << 0 << " " << 0 << endl;
continue;
}
n2 = v1.size();
vector<long long> sum(n2);
sum[1] = v1[1];
for (i = 2; i < n2; i++) {
sum[i] = sum[i - 1] + v1[i];
}
bool ans = false;
tot = sum[n2 - 1];
for (i = 1; i < n2; i++) {
if (sum[i] > v1[0] && (tot - sum[i]) > v1[0]) {
ans = true;
cout << v1[0] << " " << sum[i] << " " << tot - sum[i] << endl;
break;
}
}
if (!ans) cout << 0 << " " << 0 << " " << 0 << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
const long long MAXN = (long long)((1e5) + 100);
long long gcd(long long a, long long b) {
if (a == 0) return b;
return gcd(b % a, a);
}
long long max(long long a, long long b) {
if (a > b)
return a;
else
return b;
}
long long min(long long a, long long b) {
if (a < b)
return a;
else
return b;
}
void pr(long long x) { cout << x; }
void prl(long long x) { cout << x << "\n"; }
long long cbrt(long long x) {
long long lo = 1, hi = min(2000000ll, x);
while (hi - lo > 1) {
long long mid = (lo + hi) / 2;
if (mid * mid * mid < x) {
lo = mid;
} else
hi = mid;
}
if (hi * hi * hi <= x)
return hi;
else
return lo;
}
const long long dx[4] = {-1, 1, 0, 0};
const long long dy[4] = {0, 0, -1, 1};
long long XX[] = {-1, -1, -1, 0, 0, 1, 1, 1};
long long YY[] = {-1, 0, 1, -1, 1, -1, 0, 1};
const long long N = (long long)(1 * 1e5 + 10);
bool isPowerOfTwo(long long x) { return x && (!(x & (x - 1))); }
long long solve() {
long long n;
cin >> n;
long long a[n];
for (long long i = 0; i < n; i++) cin >> a[i];
long long ans = -1;
for (long long i = n / 2 - 1; i >= 3; i--) {
if (a[i] == a[i + 1]) continue;
long long tot = i + 1;
for (long long j = 0; j < i / 2; j++) {
if (a[j] != a[j + 1]) {
long long g = j + 1;
long long s = 0;
for (long long k = j + 1; k < i; k++) {
s++;
if (s <= g) continue;
if (a[k] != a[k + 1]) break;
}
long long b = tot - (s + g);
if (b > g && s > g) {
cout << g << " " << s << " " << b << "\n";
return 0;
}
}
}
}
cout << "0 0 0\n";
return 0;
}
signed main() {
ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
long long T = 1;
cin >> T;
while (T--) {
solve();
}
}
|
#include <bits/stdc++.h>
using namespace std;
int a[1000005];
int main() {
int t, n;
cin >> t;
while (t--) {
cin >> n;
int g = 0, s = 0, b = 0;
int m = n / 2;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
int i = 1;
while (a[i] == a[1] && i <= m) {
i++;
g++;
}
int j = i;
while (a[i] == a[j] && i <= m) {
i++;
s++;
}
while (s <= g && i <= m) {
int k = i;
while (a[i] == a[k] && i <= m) {
s++;
i++;
}
}
while (a[i] != a[m + 1] && i <= m) {
b++;
i++;
}
if (g >= s || g >= b) {
cout << "0 0 0\n";
continue;
}
cout << g << " " << s << " " << b << " " << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int Maxn = 400004;
int t;
int n;
int p[Maxn];
int seq[Maxn], slen;
int a, b, c;
int main() {
scanf("%d", &t);
while (t--) {
scanf("%d", &n);
slen = 0;
for (int i = 0; i < n; i++) {
scanf("%d", &p[i]);
if (i && p[i - 1] != p[i]) seq[slen++] = i;
}
seq[slen++] = n;
a = b = c = 0;
int ca = seq[0], cb, cc;
int ind = upper_bound(seq, seq + slen, ca + ca) - seq;
if (ind < slen) {
cb = seq[ind] - ca;
ind = upper_bound(seq, seq + slen, n / 2) - seq - 1;
if (ind >= 0 && seq[ind] - ca - cb > ca) {
cc = seq[ind] - ca - cb;
a = ca;
b = cb;
c = cc;
}
}
printf("%d %d %d\n", a, b, c);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = (int)4e5 + 7;
int t;
int n;
int a[N];
bool ok[N];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cin >> t;
while (t--) {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
ok[i] = 0;
}
for (int i = 1; i < n; i++) {
ok[i] = (a[i] != a[i + 1]);
}
int h = n / 2;
int bef = -1;
for (int i = 1; i <= h; i++) {
if (ok[i]) {
bef = i;
}
}
int gg = 0, ss = 0, bb = 0;
if (bef != -1) {
int ls = 0;
for (int g = 1; g + (g + 1) + (g + 1) <= h; g++) {
if (!ok[g]) {
continue;
}
int lm = bef;
int sum = lm - g;
if (ls < 2 * g + 1) {
ls = 2 * g + 1;
}
while (ls <= n && ok[ls] == 0) {
ls++;
}
if (ls <= n && ok[ls] == 1) {
int s = ls - g;
int b = sum - s;
if (g > 0 && s > 0 && b > 0 && s >= g + 1 && b >= g + 1 &&
g + s + b > gg + ss + bb) {
gg = g;
ss = s;
bb = b;
}
}
}
}
cout << gg << " " << ss << " " << bb << "\n";
}
}
|
#include <bits/stdc++.h>
using namespace std;
const long long N = 400100;
long long a[N];
pair<long long, long long> b[N];
int32_t main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
long long q, n;
cin >> q;
while (q--) {
cin >> n;
for (long long i = 1; i <= n; ++i) {
cin >> a[i];
}
if (n < 6) {
cout << "0 0 0\n";
continue;
}
long long last, k, g, s, bb;
last = a[1];
b[0].first = 1;
b[0].second = 1;
k = 0;
g = s = bb = 0;
for (long long i = 2; i <= n; ++i) {
if (a[i] != last) {
last = a[i];
k++;
b[k].first = b[k].second = i;
} else {
b[k].second = i;
}
}
g = b[0].second - b[0].first + 1;
for (long long i = 1; i < k; ++i) {
if (b[i].second > (n / 2)) break;
if (s <= g) {
s += b[i].second - b[i].first + 1;
} else {
bb += b[i].second - b[i].first + 1;
}
}
if (g >= s || g >= bb || g == 0 || bb == 0 || s == 0) {
cout << "0 0 0\n";
} else {
cout << g << " " << s << " " << bb << "\n";
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int maxn = 4e5 + 10;
const int INF = 0x3f3f3f3f;
int n, a[maxn];
int cnt[1000000 + 10];
void solve() {
vector<int> p;
for (int i = 0; i < n; ++i) {
if (!cnt[a[i]]) {
p.push_back(a[i]);
}
cnt[a[i]]++;
}
int num = 0, sum = 0;
for (int i = 0; i < (int)p.size(); ++i) {
if (sum + cnt[p[i]] <= n / 2) {
sum += cnt[p[i]];
num++;
} else
break;
}
if (num <= 2)
cout << 0 << " " << 0 << " " << 0 << endl;
else {
num--;
int sum_s = 0, sum_g = cnt[p[0]];
for (int i = 1; i < (int)p.size(); ++i) {
if (num && sum_s <= sum_g) {
sum_s += cnt[p[i]];
num--;
}
}
int sum_b = sum - sum_s - sum_g;
if (sum_b <= sum_g || sum_s <= sum_g)
cout << 0 << " " << 0 << " " << 0 << endl;
else
cout << sum_g << " " << sum_s << " " << sum_b << endl;
}
}
int main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(0);
std::cout.tie(0);
int t;
cin >> t;
while (t--) {
cin >> n;
for (int i = 0; i < n; ++i) cin >> a[i];
solve();
for (int i = 0; i < n; ++i) cnt[a[i]] = 0;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
int n, i, a, sum = 0;
set<int> mset;
map<int, int> mmap;
priority_queue<int> Q, Q1;
cin >> n;
for (i = 0; i < n; i++) {
cin >> a;
if (mmap[a] == 0) {
Q.push(a);
}
mmap[a]++;
}
while (!Q.empty()) {
int fo = Q.top();
if (sum + mmap[fo] <= (n / 2)) {
sum += mmap[fo];
Q1.push(fo);
mset.insert(fo);
} else {
break;
}
Q.pop();
}
if (mset.size() < 3) {
cout << "0 0 0" << endl;
} else {
int fo = Q1.top();
int gold = mmap[fo];
int silver = 0, bronze = 0;
Q1.pop();
while (!Q1.empty()) {
fo = Q1.top();
if (gold >= silver) {
silver += mmap[fo];
} else {
bronze += mmap[fo];
}
Q1.pop();
}
if (gold > 0 && silver > 0 && bronze > 0 && gold < silver &&
gold < bronze) {
printf("%d %d %d\n", gold, silver, bronze);
} else {
cout << "0 0 0" << endl;
}
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int tc;
cin >> tc;
while (tc--) {
map<int, int> mp;
vector<int> v, res;
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
int x;
cin >> x;
v.push_back(x);
}
int sz = (n / 2);
for (int i = 0; i < sz; i++) {
mp[v[i]]++;
}
if (v[sz] == v[sz - 1]) mp[v[sz]] = 0;
for (auto x : mp) {
if (x.second) {
res.push_back(x.second);
}
}
if (res.size() < 3) {
cout << "0 0 0" << endl;
continue;
}
reverse(res.begin(), res.end());
long long sum = 0, taken = 0, mx = res[0];
for (int i = 1; i < res.size(); i++) {
sum += res[i];
}
bool ok = false;
for (int i = 1; i < res.size(); i++) {
taken += res[i];
if (taken > mx && (sum - taken > mx)) {
cout << mx << " " << taken << " " << sum - taken << endl;
ok = true;
break;
}
}
if (!ok) cout << "0 0 0" << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
int val;
map<int, int, greater<int> > mp;
for (int i = 1; i <= n; i++) {
cin >> val;
mp[val]++;
}
int lim = n / 2;
if (mp.size() <= 2) {
cout << 0 << " " << 0 << " " << 0 << "\n";
continue;
}
if (n < 5) {
cout << 0 << " " << 0 << " " << 0 << "\n";
continue;
}
int g = 0, s = 0, b = 0;
for (auto it = mp.begin(); it != mp.end(); it++) {
if ((g == 0) && ((lim - it->second) >= 0)) {
g += it->second;
lim -= g;
} else if ((g > 0) && (s == 0) && ((lim - it->second) >= 0)) {
s += it->second;
lim -= s;
} else if ((s > 0) && (s <= g) && ((lim - it->second) >= 0)) {
s += it->second;
lim -= it->second;
} else if ((g > 0) && (s > g) && ((lim - it->second) >= 0)) {
b += it->second;
lim -= it->second;
} else
break;
}
if ((g == 0) || (s == 0) || (b == 0))
cout << 0 << " " << 0 << " " << 0 << "\n";
else if ((g >= s) || (g >= b))
cout << 0 << " " << 0 << " " << 0 << "\n";
else
cout << g << " " << s << " " << b << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
for (int tt = 0; tt < int(t); tt++) {
int n;
cin >> n;
map<int, int> c;
for (int i = 0; i < int(n); i++) {
int pi;
cin >> pi;
c[-pi]++;
}
vector<int> pp;
for (auto p : c) pp.push_back(p.second);
bool ok = false;
int g = pp[0];
int i = 1;
int s = 0;
while (s <= g && i < pp.size()) s += pp[i++];
if (g < s) {
int b = 0;
while (b <= g && i < pp.size()) b += pp[i++];
while (i < pp.size() && g + s + b + pp[i] <= n / 2) b += pp[i++];
if (g < b && g + s + b <= n / 2) {
ok = true;
cout << g << " " << s << " " << b << endl;
}
}
if (!ok) cout << 0 << " " << 0 << " " << 0 << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int inf = (int)1e9;
const int mod = inf + 7;
const double eps = 1e-9;
const double pi = acos(-1.0);
int t;
int n, p[400400];
void solve() {
scanf("%d", &n);
int last = -1, cnt = 0;
vector<int> a;
for (int i = 0; i < n; i++) {
scanf("%d", p + i);
if (p[i] != last) {
if (cnt) a.push_back(cnt);
last = p[i];
cnt = 1;
} else
cnt++;
}
a.push_back(cnt);
if (a.size() < 3) {
printf("0 0 0\n");
return;
}
int j = 1;
int second = 0;
while (j < a.size() && a[0] >= second) second += a[j++];
int b = 0;
while (j < a.size() && a[0] >= b) b += a[j++];
if (2 * (a[0] + second + b) > n || a[0] >= second || a[0] >= b) {
printf("0 0 0\n");
return;
}
while (j < a.size() && (a[0] + second + b + a[j]) * 2 <= n) {
b += a[j++];
}
printf("%d %d %d\n", a[0], second, b);
}
int main() {
int t;
scanf("%d", &t);
while (t--) solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void err(istream_iterator<string> it) {}
template <typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args) {
cerr << *it << " = " << a << endl;
err(++it, args...);
}
using ll = long long;
const int N = 4e5 + 100;
int n, a[N];
vector<int> v;
int main() {
int T;
scanf("%d", &T);
while (T--) {
scanf("%d", &n);
for (int i = 0; i < n; i++) scanf("%d", &a[i]);
sort(a, a + n, greater<int>());
v.clear();
for (int i = 0; i < n; i++) {
int j = i;
while (a[j + 1] == a[i]) j++;
v.push_back(j - i + 1);
i = j;
}
int g = v[0];
if (g >= n / 2) {
puts("0 0 0");
continue;
}
int j = 1, s = 0;
while (j < n && s <= g) {
s += v[j];
j++;
}
if (g + s >= n / 2) {
puts("0 0 0");
continue;
}
int b = 0;
while (j < n && b <= g) {
b += v[j];
j++;
}
if (g + s + b > n / 2) {
puts("0 0 0");
continue;
}
while (j < n && g + s + b + v[j] <= n / 2) b += v[j++];
printf("%d %d %d\n", g, s, b);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long double PI = (long double)(3.1415926535897932384626433832795);
int parity_check(int n) {
int par = n;
par = par ^ (par >> 1);
par = par ^ (par >> 2);
par = par ^ (par >> 4);
par = par ^ (par >> 8);
par = par ^ (par >> 16);
if (par % 2 == 1) {
return 1;
} else {
return 0;
}
}
int lcs(string X, string Y, int m, int n) {
int L[m + 1][n + 1];
int i, j;
for (i = 0; i <= m; i++) {
for (j = 0; j <= n; j++) {
if (i == 0 || j == 0)
L[i][j] = 0;
else if (X[i - 1] == Y[j - 1] && i != j)
L[i][j] = L[i - 1][j - 1] + 1;
else
L[i][j] = max(L[i - 1][j], L[i][j - 1]);
}
}
return L[m][n];
}
int long long gcd(int long long a, int long long b) {
if (a == 0) {
return b;
}
return gcd(b % a, a);
}
int long long lcm(int long long a, int long long b) {
int long long pro = a * b;
int long long ans = gcd(a, b);
pro = pro / ans;
return pro;
}
int long long fast_power(int long long a, int long long b, int long long p) {
if (b == 0) {
return (1 % p);
}
int long long t = fast_power(a, b / 2, p);
int long long ans = (t * t) % p;
if (b % 2) {
ans = (ans * (a % p)) % p;
}
return ans;
}
bool prime_check(int long long n) {
int long long i, j;
if (n == 1) {
return false;
}
for (i = 2; i <= sqrt(n); i++) {
if (n % i == 0) {
return false;
}
}
return true;
}
int long long fact(int long long n, int long long mod) {
int long long prod = 1;
for (int long long i = 1; i <= n; i++) {
prod = (prod * i) % mod;
}
return prod;
}
void dfs(int long long s, int long long d,
vector<pair<int long long, int long long> > v[], bool visited[],
int long long *max, int long long *maxcount, int long long min,
int long long count) {
visited[s] = true;
if (s == d) {
if ((*max) < min) {
(*max) = min;
(*maxcount) = count;
} else if ((*max) == min) {
if ((*maxcount) < count) {
(*maxcount) = count;
}
}
} else {
for (int long long i = 0; i < v[s].size(); i++) {
if (!visited[v[s][i].first]) {
if (min > v[s][i].second) {
min = v[s][i].second;
}
dfs(v[s][i].first, d, v, visited, max, maxcount, min, count + 1);
}
}
}
visited[s] = false;
}
void polygonArea(int long long X[], int long long Y[], int long long n,
int long long dp[]) {
int long long area = 0;
int long long j = n - 1;
for (int long long i = 0; i < n; i++) {
area += (X[j] + X[i]) * (Y[j] - Y[i]);
dp[i + 1] = area;
j = i;
}
}
void mera_sieve() {
bool prime[6000013];
memset(prime, true, sizeof(prime));
for (int long long p = 2; p * p <= 6000012; p++) {
if (prime[p] == true) {
for (int long long i = p * p; i <= 6000012; i += p) prime[i] = false;
}
}
for (int long long i = 2; i <= 6000012; i++) {
if (prime[i]) {
}
}
}
string rev(string str) {
string r = "";
for (int i = str.length() - 1; i >= 0; i--) {
r += str[i];
}
return r;
}
bool palindrome(string str) {
int n = str.length();
for (int i = 0; i < str.length(); i++) {
if (str[i] != str[n - 1 - i]) {
return false;
}
}
return true;
}
int equal(vector<string> v1, vector<string> v2) {
if (v1.size() != v2.size()) {
return 0;
}
for (int i = 0; i < v1.size(); i++) {
if (v1[i] != v2[i]) {
return 0;
}
}
return 1;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
;
int test, n, i, j, k;
cin >> test;
while (test--) {
cin >> n;
int arr[n];
int save = n / 2;
for (i = 0; i < n; i++) {
cin >> arr[i];
}
vector<int> v;
int count = 1;
if (n == 1) {
v.push_back(count);
}
for (i = 1; i < n; i++) {
if (arr[i] != arr[i - 1]) {
v.push_back(count);
count = 1;
} else {
count++;
}
if (i == n - 1) {
v.push_back(count);
}
}
n = v.size();
int max = v[n - 1], smax = v[n - 1];
vector<pair<int, int> > ma(n);
ma[n - 1] = make_pair(max, smax);
for (i = n - 2; i >= 0; i--) {
if (max < v[i]) {
smax = max;
max = v[i];
} else if (smax < v[i]) {
smax = v[i];
}
ma[i] = (make_pair(max, smax));
}
max = -1;
if (n < 3) {
cout << "0 0 0"
<< "\n";
} else {
int g = v[0];
int s = 0;
int b = 0;
i = 1;
while (i < n && s <= g) {
s += v[i++];
}
while (i < n && b <= g) {
b += v[i++];
}
while (i < n && g + s + b + v[i] <= save) {
b += v[i++];
}
if (g + s + b > save) {
cout << "0 0 0"
<< "\n";
} else {
cout << g << " " << s << " " << b << "\n";
}
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long t;
cin >> t;
while (t--) {
long long n, i, g = 0, s = 0, b = 0, j;
cin >> n;
long long a[n];
vector<long long> v(n, 1);
for (i = 0; i < n; i++) {
cin >> a[i];
}
if (n < 6)
cout << "0 0 0\n";
else {
for (i = 0; i < n - 1; i++) {
if (a[i] == a[i + 1]) v[i + 1] = v[i] + 1;
}
for (i = 0; i < n - 1; i++) {
if (a[i] != a[i + 1]) {
g = g + v[i];
break;
}
}
for (j = i + 1; j < n - 1; j++) {
if (a[j] != a[j + 1] && j < n / 2) {
s = s + v[j];
if (s > g) {
break;
}
}
}
for (long long l = j + 1; l < n - 1; l++) {
if (l < n / 2 && a[l] != a[l + 1]) {
b = b + v[l];
}
}
if (g > 0 && s > 0 && b > 0 && g < s && g < b) {
cout << g << " " << s << " " << b << "\n";
} else
cout << "0 0 0\n";
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int arr[400007];
int main() {
int t;
scanf("%d", &t);
while (t--) {
vector<int> v;
int n;
scanf("%d", &n);
int req = n / 2;
for (int i = 0; i < n; i++) {
scanf("%d", &arr[i]);
if (i && arr[i] == arr[i - 1])
v.back()++;
else
v.push_back(1);
}
int g = v[0];
int ans = g;
int s = 0, b = 0;
int cnt = 1;
while (s <= g && cnt < v.size()) {
s += v[cnt];
ans += v[cnt];
cnt++;
}
while (b <= g && cnt < v.size()) {
b += v[cnt];
ans += v[cnt];
cnt++;
}
while (ans < req && cnt < v.size()) {
if (ans + v[cnt] <= req) {
b += v[cnt];
ans += v[cnt];
} else
break;
cnt++;
}
if (g && s && b && ans <= req)
printf("%d %d %d\n", g, s, b);
else
printf("0 0 0\n");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void solve() {
long long n, g = 0, s = 0, b = 0, i, tm;
cin >> n;
map<long long, long long> mpp;
for (i = 0; i < n; i++) {
cin >> tm;
mpp[-tm]++;
}
auto it = mpp.begin();
g = it->second;
it++;
for (; it != mpp.end(); it++) {
s += it->second;
if (s > g) {
it++;
break;
}
}
for (; it != mpp.end(); it++) {
b += it->second;
if (g + s + b > n / 2) {
b -= it->second;
break;
}
}
if (g > 0 && b > 0 && s > 0 && g < s && g < b && (g + s + b) <= n / 2)
cout << g << " " << s << " " << b;
else
cout << "0 0 0";
cout << "\n";
return;
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0), cout.tie(0);
srand(time(NULL));
long long t = 1;
cin >> t;
while (t--) solve();
}
|
#include <bits/stdc++.h>
using namespace std;
long long n, a[4000002], m;
bool cmp(long long a, long long b) { return a > b; }
void nhap() {
cin >> n;
for (int i = 1; i <= n; ++i) cin >> a[i];
sort(a + 1, a + n + 1, cmp);
}
void sol() {
long long o = 1;
while (o < n && a[o] == a[o + 1]) ++o;
if (o > n / 2) {
cout << "0 0 0\n";
return;
}
long long k = n / 2;
while (k > 0 && a[k] == a[k + 1]) --k;
for (int i = o + 1; i <= k; ++i) {
if (a[i] == a[i + 1]) continue;
long long s = i - o;
if (s > o && k - i > o) {
cout << o << " " << s << " " << k - i << "\n";
return;
}
}
cout << "0 0 0\n";
}
int main(int argc, const char* argv[]) {
long long t;
cin >> t;
for (int i = 1; i <= t; ++i) {
nhap();
sol();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void solve() {
int n;
cin >> n;
vector<int> p(n);
for (int i = 0; i < (int)n; i++) cin >> p[i];
int g = 1;
while (g < n && p[g] == p[g - 1]) g++;
if (g == n) {
cout << "0 0 0\n";
return;
};
int s = 1;
while (g + s < n && (p[g + s] == p[g + s - 1] || s <= g)) s++;
if (g + s == n) {
cout << "0 0 0\n";
return;
};
int ansb = 0;
int b = g + 1;
while (g + s + b <= n / 2) {
if (p[g + s + b - 1] != p[g + s + b]) ansb = b;
b++;
}
if (ansb == 0) {
cout << "0 0 0\n";
return;
};
cout << g << " " << s << " " << ansb << "\n";
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t;
cin >> t;
while (t--) solve();
}
|
#include <bits/stdc++.h>
using namespace std;
struct custom_hash {
static uint64_t splitmix64(uint64_t x) {
x += 0x9e3779b97f4a7c15;
x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
return x ^ (x >> 31);
}
size_t operator()(uint64_t x) const {
static const uint64_t FIXED_RANDOM =
chrono::steady_clock::now().time_since_epoch().count();
return splitmix64(x + FIXED_RANDOM);
}
};
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int t, cnt = 1;
cin >> t;
while (t--) {
unordered_map<int, int, custom_hash> m;
set<int> s;
vector<int> v, v2;
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
if (n <= 9) {
cout << "0 0 0" << '\n';
continue;
}
long long n2 = (n / 2) - 1, el = -1;
if (arr[n2] == arr[n2 + 1]) {
el = arr[n2];
}
long long fel = arr[0], fc = 0;
for (int i = 0; i < n2 + 1; i++) {
if (arr[i] == fel) fc++;
if (arr[i] == el) break;
if (arr[i] != fel) {
v.push_back(arr[i]);
m[arr[i]]++;
s.insert(arr[i]);
}
}
for (int a : s) v2.push_back(a);
reverse(v2.begin(), v2.end());
if (s.size() < 2 || (s.size() == 2 && (m[v2[0]] == 1 || m[v2[1]] == 1)))
cout << "0 0 0" << '\n';
else if (s.size() == 3) {
if (v.size() == 3)
cout << "0 0 0" << '\n';
else if ((m[v2[0]] + m[v2[1]] >= 2 && m[v2[2]] >= 2) ||
(m[v2[1]] + m[v2[2]] >= 2 && m[v2[0]] >= 2)) {
goto here;
} else
cout << "0 0 0" << '\n';
} else {
here:;
long long n3 = ((v.size()) / 2) - 1, l = (v.size()) / 2, r = v.size() - l,
c = 0;
for (int i = n3; i >= 0; i--) {
if (v[i] == v[n3])
c++;
else
break;
}
l -= c, r -= (m[v[n3]] - c);
long long g = fc, s, b;
if (l > r)
s = l, b = r + m[v[n3]];
else
s = l + m[v[n3]], b = r;
if (g >= s || g >= b) g = 0, s = 0, b = 0;
cout << g << " " << s << " " << b << '\n';
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void sep(string SS = "BLOCK") {
cout << "-------------" << SS << "-----------------\n";
}
template <typename t>
void pr(t a) {
cout << a << endl;
}
template <typename t>
void prs(t a) {
cout << a << " ";
}
template <typename T>
void debugv(vector<T> arr) {
for (auto t : arr) cout << t << " ";
cout << "\n";
}
template <typename T>
void debugarr(T arr, int n) {
for (int i = 0; i < n; i++) cout << arr[i] << " ";
cout << "\n";
}
template <typename T>
void chmax(T& a, T b) {
if (a < b) a = b;
}
template <typename T>
void chmin(T& a, T b) {
if (a > b) a = b;
}
long long min(long long a, long long b) { return a < b ? a : b; }
long long max(long long a, long long b) { return a > b ? a : b; }
const int maxn = 4e6 + 100;
const long long INF = 1e18;
long long a[maxn], n, m, t, k, q;
unordered_map<long long, long long> u;
string s;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> t;
while (t--) {
cin >> n;
for (long long i = 0; i < n; i++) cin >> a[i];
long long c = n / 2;
while (c > 0 && a[c - 1] == a[c]) --c;
if (c == 0) {
prs(0);
prs(0);
pr(0);
continue;
}
long long g = 1;
while (g < c && a[g - 1] == a[g]) ++g;
long long s = 1 + g;
while (g + s < c && a[g + s - 1] == a[g + s]) ++s;
long long b = c - g - s;
if (b > g) {
prs(g);
prs(s);
pr(b);
} else {
prs(0);
prs(0);
pr(0);
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int nTest, n;
vector<int> p, l, r;
void Main() {
cin >> n;
p.assign(n, 0);
for (int i = 0; i < n; ++i) cin >> p[i];
l.assign(n, -1);
for (int i = 0; i < n; ++i) {
if (i && p[i] == p[i - 1])
l[i] = l[i - 1];
else
l[i] = i;
}
r.assign(n, n);
for (int i = n - 1; i >= 0; --i) {
if (i + 1 < n && p[i] == p[i + 1])
r[i] = r[i + 1];
else
r[i] = i;
}
array<int, 4> ans{0, 0, 0, 0};
for (int g = 0; g < n; ++g)
if (r[g] == g) {
int s = g + g + 2;
if (s >= n) continue;
s = r[s];
int b = n / 2;
b = l[b] - 1;
if (g < s && s < b && g + 1 < s - g && g + 1 < b - s)
ans = max(ans, array<int, 4>{b + 1, g + 1, s - g, b - s});
}
for (int i = 1; i < 4; ++i) cout << ans[i] << ' ';
cout << '\n';
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> nTest;
while (nTest--) Main();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long int N = 100005;
bool powertwo(long long int n) { return (n and !(n & (n - 1))); }
int32_t main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long int t;
cin >> t;
while (t--) {
long long int n;
cin >> n;
long long int arr[n];
map<long long int, long long int> mp;
for (long long int i = 0; i < n; i++) {
cin >> arr[i];
mp[arr[i]]++;
}
long long int g = 0, s = 0, b = 0;
vector<long long int> v;
for (auto it = mp.rbegin(); it != mp.rend(); it++) v.push_back(it->second);
g = v[0];
long long int i = 1;
while (s <= g and i < v.size()) {
s += v[i];
i++;
}
while (b <= g and i < v.size()) {
b += v[i];
i++;
}
while ((g + s + b + v[i]) <= n / 2 and i < v.size()) {
b += v[i];
i++;
}
if ((g + s + b) > n / 2 or s < g or b < g)
cout << "0 0 0\n";
else if (g == 0 or s == 0 or b == 0)
cout << "0 0 0\n";
else
cout << g << " " << s << " " << b << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int T;
cin >> T;
while (T--) {
int N;
cin >> N;
map<int, int> cnt;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
cnt[A[i]]++;
}
int g = 0, s = 0, b = 0;
int i = 0;
while (i < N) {
if (A[0] != A[i]) break;
g++;
i++;
}
while (i < N) {
if (g < s) break;
i++;
s++;
}
while (i < N) {
if (A[i - 1] != A[i]) break;
i++;
s++;
}
int sobran = (N % 2 == 0) ? N / 2 : (N - 1) / 2;
sobran -= g;
sobran -= s;
while (i < N) {
if (cnt[A[i]] <= sobran) {
sobran -= cnt[A[i]];
b += cnt[A[i]];
i += cnt[A[i]];
continue;
}
break;
}
if (b <= 0 || g >= s || g >= b) {
g = s = b = 0;
}
cout << g << ' ' << s << ' ' << b << '\n';
}
return 0;
}
|
#include <bits/stdc++.h>
using lli = long long int;
using li = long int;
using namespace std;
const lli MOD{1000000007};
const lli INF{(lli)1e18 + 1};
int main() {
li T{1};
cin >> T;
while (T--) {
lli n{};
cin >> n;
vector<lli> arr(n);
for (auto &i : arr) cin >> i;
reverse((arr).begin(), (arr).end());
lli g{n -
(lower_bound((arr).begin(), (arr).end(), arr.back()) - arr.begin())};
if (n - 2 * g < 1) {
cout << "0 0 0\n";
continue;
}
lli s{n -
(lower_bound((arr).begin(), (arr).end(), arr[n - 2 * g - 1]) -
arr.begin()) -
g};
lli half{n - n / 2};
lli b{};
if (lower_bound((arr).begin(), (arr).end(), arr[half]) - arr.begin() < half)
b = n -
((upper_bound((arr).begin(), (arr).end(), arr[half]) - arr.begin())) -
s - g;
else
b = n -
(lower_bound((arr).begin(), (arr).end(), arr[half]) - arr.begin()) -
s - g;
if (b <= g)
cout << "0 0 0\n";
else
cout << g << ' ' << s << ' ' << b << '\n';
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int32_t main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
long long t;
cin >> t;
while (t--) {
long long n;
cin >> n;
vector<pair<long long, long long>> arr;
for (long long i = 0, x; i < n; i++) {
cin >> x;
if ((long long)arr.size() == 0)
arr.push_back({x, 1});
else {
if (arr.back().first == x)
arr.back().second++;
else
arr.push_back({x, 1});
}
}
long long g = 0, s = 0, b = 0;
g = arr.front().second;
long long i = 1;
while (i < (long long)arr.size() && s <= g) {
s += arr[i].second;
i++;
}
while (i < (long long)arr.size() && s + g + b + arr[i].second <= n / 2) {
b += arr[i].second;
i++;
}
if (g > 0 && s > 0 && b > 0 && g < s && g < b && g + b + s <= n / 2) {
cout << g << " " << s << " " << b << "\n";
} else
cout << "0 0 0\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxN = 4e5 + 5;
int t, n, a[maxN];
int g, s, b, m, p;
void input() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> t;
}
void solve() {
cin >> n;
for (int i = 1; i <= n; ++i) cin >> a[i];
m = n / 2;
while (a[m] == a[m + 1]) m--;
if (m == 0) {
cout << "0 0 0\n";
return;
}
g = 1;
while (a[g] == a[g + 1]) g++;
if (g == m) {
cout << "0 0 0\n";
return;
}
p = g + 1;
while ((a[p] == a[p + 1] || p - g <= g) && p < m) p++;
if (p == m || m - p <= g) {
cout << "0 0 0\n";
return;
}
s = p - g;
b = m - p;
cout << g << " " << s << " " << b << "\n";
}
int main() {
input();
while (t--) solve();
}
|
#include <bits/stdc++.h>
using namespace std;
const long long N = 2e5 + 5;
void solve() {
long long n;
cin >> n;
map<long long, long long> c;
for (long long i = 0; i < n; i++) {
long long x;
cin >> x;
c[-x]++;
}
vector<long long> pr;
for (auto i : c) pr.push_back(i.second);
bool ok = 0;
long long g = pr[0];
long long i = 1;
long long s = 0;
while (s <= g && i < pr.size()) s += pr[i++];
if (g < s) {
long long b = 0;
while (b <= g && i < pr.size()) b += pr[i++];
while (i < pr.size() && g + s + b + pr[i] <= n / 2) b += pr[i++];
if (g < b && g + s + b <= n / 2) {
ok = true;
cout << g << " " << s << " " << b << endl;
}
}
if (!ok) cout << 0 << " " << 0 << " " << 0 << endl;
}
signed main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
srand(chrono::high_resolution_clock::now().time_since_epoch().count());
long long t = 1;
cin >> t;
while (t--) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
vector<int> run_length(const vector<int>& v) {
vector<int> res;
int now = v[0];
int cnt = 1;
for (int i = (int)1; i < (int)v.size(); ++i) {
if (now == v[i])
++cnt;
else {
res.push_back(cnt);
now = v[i];
cnt = 1;
}
}
res.push_back(cnt);
return res;
}
void solve() {
int N;
cin >> N;
vector<int> P(N);
for (int i = (int)0; i < (int)N; ++i) cin >> P[i];
vector<int> p = run_length(P);
if (p.size() < 3) {
cout << "0 0 0" << endl;
return;
}
int g = p[0];
int s = 0;
int pos = 1;
while (pos < p.size() && s <= g) {
s += p[pos++];
}
if (s < g) {
cout << "0 0 0" << endl;
return;
}
int b = 0;
while (pos < p.size()) {
if ((g + s + b + p[pos]) * 2 <= N) {
b += p[pos++];
} else
break;
}
if (b <= g) {
cout << "0 0 0" << endl;
return;
}
cout << g << ' ' << s << ' ' << b << endl;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int T;
cin >> T;
for (int i = (int)0; i < (int)T; ++i) solve();
return 0;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.