text stringlengths 49 983k |
|---|
#include <bits/stdc++.h>
int main() {
int T;
std::cin >> T;
for (int kase = 1; kase <= T; kase++) {
int n;
std::cin >> n;
std::vector<int> a(n);
for (int i = 0; i < n; i++) std::cin >> a[i];
std::vector<int> pre;
for (int i = 0, j = 0, sum = 0; i < n; i = j) {
while (j < n && a[i] == a[j]) j++;
if (n < 2 * (sum + j - i)) break;
sum = sum + j - i;
pre.push_back(sum);
}
if (pre.empty()) {
std::cout << "0 0 0\n";
continue;
}
auto it = std::upper_bound(pre.begin(), pre.end(), pre[0] * 2);
if (it != pre.end() && pre[0] < pre.back() - *it)
std::cout << pre[0] << " " << *it - pre[0] << " " << pre.back() - *it
<< "\n";
else
std::cout << "0 0 0\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
srand(time(NULL));
;
long long n, ans = 0, k, m, j = 0, t = 1, x = 0, y = 0, c = 0, i, z = 0;
cin >> t;
while (t--) {
cin >> n;
long long a[n];
x = 0;
y = 0;
z = 0;
j = 0;
for (i = 0; i < n; i++) cin >> a[i];
if (n < 5) {
cout << "0 0 0\n";
continue;
}
i = 1;
while (a[i] == a[i - 1]) {
if (i >= n - 1) {
j = 1;
break;
}
i++;
}
x = i;
y = 2 * x + 1;
i = y;
if (i <= n - 1) {
while (a[i] == a[i - 1]) {
if (i >= n - 1) {
j = 1;
break;
}
y++;
i++;
}
} else
j = 1;
z = y + x + 1;
i = z;
if (i <= n - 1) {
while (a[i] == a[i - 1]) {
if (i >= n - 1) {
j = 1;
break;
}
z++;
i++;
}
} else
j = 1;
c = 0;
for (i = n / 2; i > 0; i--) {
if (a[i] == a[i - 1])
c++;
else
break;
}
if (z > n / 2 || j == 1) {
cout << "0 0 0\n";
} else {
cout << x << " " << y - x << " " << max(z, n / 2 - c) - y << "\n";
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
struct node {
int a, b, c;
} ans;
int x[400005], sum = 0, k, n, i, t, _, u[400005], tot = 0, pre;
int main() {
scanf("%d", &t);
for (_ = 1; _ <= t; _++) {
scanf("%d", &n);
ans.a = ans.b = ans.c = 0;
for (i = 1; i <= n; i++) scanf("%d", &x[i]);
pre = x[1];
tot = 0;
sum = 0;
for (i = 1; i <= n; i++) {
if (x[i] != pre) {
u[++tot] = sum;
sum = 0;
}
sum++;
pre = x[i];
}
u[++tot] = sum;
sum = 0;
for (i = 1; i <= tot; i++) {
sum += u[i];
u[i] = sum;
if (sum > n / 2) break;
}
k = i;
for (i = 1; i < k; i++) {
if (u[i] - u[1] > u[1] && u[k - 1] - u[i] > u[1]) {
ans.a = u[1];
ans.b = u[i] - u[1];
ans.c = u[k - 1] - u[i];
break;
}
}
printf("%d %d %d\n", ans.a, ans.b, ans.c);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void work() {
vector<int> vt;
int n;
scanf("%d", &n);
int last, cnt = 0, a;
scanf("%d", &a);
last = a;
for (int i = 1; i < n; ++i) {
scanf("%d", &a);
if (a == last) {
cnt++;
} else {
last = a;
vt.push_back(cnt + 1);
cnt = 0;
}
}
vt.push_back(cnt + 1);
if (n < 10) {
printf("0 0 0\n");
return;
}
int mx = n / 2, g = vt[0], s = 0, b = 0, p = 1, sum = vt[0];
int len = vt.size();
while (s <= g && p < len) {
s += vt[p];
++p;
}
sum += s;
while (p < len && sum + vt[p] <= mx) {
b += vt[p];
sum += vt[p];
p++;
}
if (s > g && b > g)
printf("%d %d %d\n", g, s, b);
else
printf("0 0 0\n");
}
int main() {
int t;
scanf("%d", &t);
while (t--) {
work();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[500005];
void lol() {
int n;
cin >> n;
for (int i = 1; i <= n; i++) cin >> a[i];
int k = n / 2;
while (a[k] == a[k + 1] && k > 0) k--;
int alt = 1;
while (a[alt] == a[alt + 1] && alt <= k) alt++;
int mungu = alt + 1;
while (a[mungu + alt] == a[mungu + alt + 1] && alt + mungu <= k) mungu++;
int hurel = k - (mungu + alt);
if (hurel <= alt)
cout << "0 0 0\n";
else
cout << alt << " " << mungu << " " << hurel << "\n";
}
int main() {
int n;
cin >> n;
while (n--) {
lol();
}
}
|
#include <bits/stdc++.h>
using namespace std;
int a[400005], freq[1000005];
vector<int> v;
int main() {
int t;
scanf("%d", &t);
while (t--) {
v.clear();
int n;
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
v.push_back(a[i]);
freq[a[i]]++;
}
sort(v.begin(), v.end());
v.erase(unique(v.begin(), v.end()), v.end());
reverse(v.begin(), v.end());
int g = 0, s = 0, b = 0;
int j = 0;
for (int i = j; i < v.size(); i++) {
int x = v[i];
g += freq[x];
j = i + 1;
break;
}
for (int i = j; i < v.size(); i++) {
int x = v[i];
s += freq[x];
j = i + 1;
if (s > g) break;
}
for (int i = j; i < v.size(); i++) {
int x = v[i];
if ((g + s + b + freq[x]) * 2 > n) break;
b += freq[x];
j = i + 1;
}
if (g == 0 || s == 0 || b == 0 || (g + s + b) * 2 > n || g >= s || g >= b)
printf("0 0 0 \n");
else
printf("%d %d %d\n", g, s, b);
for (int i = 1; i <= n; i++) freq[a[i]] = 0;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
int a[n + 1];
for (int i = 1; i <= n; i++) cin >> a[i];
if (n < 10)
cout << "0 0 0\n";
else {
sort(a + 1, a + n + 1, greater<int>());
vector<int> vc;
for (int i = 1; i <= n / 2; i++) vc.push_back(a[i]);
int g = 1, b = 0, s = 0;
int flag = 0;
int index = 0;
for (int i = 0; i < vc.size(); i++) {
if (i == vc.size() - 1) {
flag = 1;
index = i;
break;
}
if (vc[i] == vc[i + 1])
++g;
else {
index = i + 1;
break;
}
}
if (flag == 1)
cout << "0 0 0\n";
else {
int flag = 0;
for (int i = index; i < vc.size(); i++) {
if (i == vc.size() - 1) {
flag = 1;
index = i;
break;
} else if (s <= g)
++s;
else if (s > g && vc[i - 1] != vc[i]) {
index = i;
break;
} else if (s > g && vc[i - 1] == vc[i])
++s;
}
if (flag == 1)
cout << "0 0 0\n";
else {
g = g;
s = s;
int o = 0;
int curr = a[(n / 2) + 1];
for (int i = vc.size() - 1; i >= 0; i--) {
if (vc[i] == curr) o++;
}
b = ((vc.size() - 1) - index) + 1;
b = b - o;
if (g < s && g < b)
cout << g << " " << s << " " << b << endl;
else
cout << "0 0 0\n";
}
}
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long t;
cin >> t;
char a[3] = {'a', 'b', 'c'};
while (t--) {
int n;
cin >> n;
vector<int> v;
int x, y;
cin >> x;
for (int i = 1; i < n; i++) {
cin >> y;
if (y != x) v.push_back(i);
x = y;
}
int f = 0;
v.push_back(n);
int g = v[0], s, b;
auto upper = upper_bound(v.begin(), v.end(), 2 * g);
if (upper - v.begin() == v.size()) {
cout << "0 0 0" << endl;
continue;
}
s = *upper;
upper = upper_bound(v.begin(), v.end(), s + g);
if (upper - v.begin() == v.size()) {
cout << "0 0 0" << endl;
continue;
}
b = *upper;
upper = upper_bound(v.begin(), v.end(), n / 2);
if (upper != v.begin()) {
upper--;
b = max(*upper, b);
}
if (b > n / 2) {
cout << "0 0 0" << endl;
continue;
} else
cout << g << ' ' << s - g << ' ' << b - s << endl;
}
}
|
#include <bits/stdc++.h>
const int MAXN = 400000 + 5;
int a[MAXN], b[MAXN], c[MAXN];
void solve() {
int N, i, cnt = 0;
scanf("%d", &N);
a[0] = -1;
for (i = 1; i <= N; i++) {
scanf("%d", a + i);
if (a[i] != a[i - 1]) {
b[++cnt]++;
} else {
b[cnt]++;
}
}
if (N < 10 || cnt < 4) {
printf("0 0 0\n");
for (i = 1; i <= cnt; i++) {
b[i] = 0;
}
return;
}
for (i = 1; i <= cnt; i++) {
c[i] = c[i - 1] + b[i];
}
for (i = cnt; i && c[i] > (N >> 1); i--)
;
int g = b[1], s = 0, br = 0, j;
for (j = 2; j <= i && s <= g; j++) {
s += b[j];
}
for (; j <= i; j++) {
br += b[j];
}
for (i = 1; i <= cnt; i++) {
b[i] = 0;
}
if (g < s && g < br) {
printf("%d %d %d\n", g, s, br);
} else {
printf("0 0 0\n");
}
}
int main() {
int T;
scanf("%d", &T);
while (T--) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using db = double;
using str = string;
using pi = pair<int, int>;
using pl = pair<ll, ll>;
using pd = pair<db, db>;
using vi = vector<int>;
using vb = vector<bool>;
using vl = vector<ll>;
using vd = vector<db>;
using vs = vector<str>;
using vpi = vector<pi>;
using vpl = vector<pl>;
using vpd = vector<pd>;
void setIn(str second) { freopen(second.c_str(), "r", stdin); }
void setOut(str second) { freopen(second.c_str(), "w", stdout); }
void setIO(str second) {
setIn(second + ".inp");
setOut(second + ".out");
}
const int MOD = 998244353;
const int MX = 2e5 + 5;
const ll INF = 1e15;
const db PI = acos((db)-1);
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
ll TC;
cin >> TC;
while (TC--) {
ll n;
cin >> n;
vl p;
vl medal(3, 0);
ll pre, fol;
cin >> pre;
p.push_back(1);
for (int i = (0); i < (n - 1); ++i) {
cin >> fol;
if (fol != pre) {
p.push_back(1);
} else
p.back()++;
pre = fol;
}
if (p.size() < 3) {
cout << "0 0 0\n";
continue;
}
ll cnt = 0;
ll lenP = p.size();
medal[0] = p[0];
cnt += medal[0];
ll i = 1;
while (i < lenP && cnt <= n / 2) {
medal[1] += p[i];
cnt += p[i];
i++;
}
i--;
if (cnt > n / 2) {
medal[1] -= p[i];
i--;
}
if (medal[1] <= medal[0]) {
cout << "0 0 0\n";
continue;
}
while (i >= 1 && medal[1] > medal[0] && medal[2] <= medal[0]) {
medal[1] -= p[i];
medal[2] += p[i];
i--;
}
if (medal[1] <= medal[0] || medal[2] <= medal[0]) {
cout << "0 0 0\n";
continue;
}
for (auto& hihi : medal) cout << hihi << ' ';
cout << '\n';
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int __SIZE = 1 << 18;
char ibuf[__SIZE], *iS, *iT;
template <typename T>
inline void read(T &x) {
char ch, t = 0;
x = 0;
while (!isdigit(ch = (iS == iT
? (iT = (iS = ibuf) + fread(ibuf, 1, __SIZE, stdin),
(iS == iT ? EOF : *iS++))
: *iS++)))
t |= ch == '-';
while (isdigit(ch))
x = x * 10 + (ch ^ 48),
ch = (iS == iT ? (iT = (iS = ibuf) + fread(ibuf, 1, __SIZE, stdin),
(iS == iT ? EOF : *iS++))
: *iS++);
x = t ? -x : x;
}
inline int read_int() {
int x;
return read(x), x;
}
inline long long read_ll() {
long long x;
return read(x), x;
}
template <typename T>
inline void chkmin(T &a, T b) {
a = a < b ? a : b;
}
template <typename T>
inline void chkmax(T &a, T b) {
a = a > b ? a : b;
}
const int MAXN = 400010;
int a[MAXN];
int main() {
int Case = read_int();
while (Case--) {
int n = read_int();
for (int i = 1; i <= n; i++) a[i] = read_int();
int g = 1;
while (g < n && a[g] == a[g + 1]) ++g;
int s = g;
while (s < n && (s - g <= g || a[s] == a[s + 1])) ++s;
int b = s;
while (b < n && (b - s <= g || a[b] == a[b + 1])) ++b;
if (b * 2 > n)
puts("0 0 0");
else {
int tb = b;
while (tb * 2 <= n) {
b = tb, ++tb;
while (tb <= n && a[tb] == a[tb + 1]) ++tb;
}
printf("%d %d %d\n", g, s - g, b - s);
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void item() {
int n;
cin >> n;
map<int, int, greater<int>> m;
int k = n / 2;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
m[x]++;
}
int g = 0, s = 0, b = 0, sum = 0;
for (auto x : m) {
if (g == 0) {
if (sum + x.second <= k) {
g += x.second;
sum += x.second;
} else
break;
} else if (s == 0 || s <= g) {
if (sum + x.second <= k) {
sum += x.second;
s += x.second;
} else
break;
} else {
if (sum + x.second <= k) {
b += x.second;
sum += x.second;
} else
break;
}
}
if (g < s && g < b && g != 0)
cout << g << " " << s << " " << b << "\n";
else
cout << "0 0 0\n";
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long n = 1;
cin >> n;
while (n--) item();
}
|
#include <bits/stdc++.h>
using namespace std;
int p[400010], unq[400010];
int main() {
int t;
scanf("%d", &t);
while (t--) {
int n;
scanf("%d", &n);
unq[1] = 1;
for (int i = 1; i <= n; i++) {
scanf("%d", p + i);
if (i > 1) unq[i] = unq[i - 1] + (p[i] == p[i - 1] ? 0 : 1);
}
if (n < 3) {
printf("0 0 0\n");
continue;
}
int b;
for (b = n / 2; b > 0; b--)
if (p[b] != p[b + 1]) break;
if (b == 0 || unq[b] < 3) {
printf("0 0 0\n");
continue;
}
int g;
for (g = b / 2; g > 0; g--)
if (p[g] != p[g + 1]) break;
if (g == 0) {
printf("0 0 0\n");
continue;
}
if (unq[b] < 3) {
printf("0 0 0\n");
continue;
}
int s;
bool flag = false;
for (int i = 1; i <= b; i++) {
if (!flag && p[i] != p[i + 1]) {
g = i;
flag = true;
} else if (flag && 2 * g < i && p[i] != p[i + 1]) {
s = i - g;
break;
}
}
b = b - s - g;
if (g >= b) {
printf("0 0 0\n");
continue;
}
printf("%d %d %d\n", g, s, b);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int arr[4 * 100000 + 5], n, type, g, s, b, pointer;
bool solve() {
pointer = -1;
for (int i = 1; i <= n / 2; i++)
if (arr[i] != arr[1]) {
pointer = i;
break;
}
if (pointer == -1) {
return false;
}
g = pointer - 1;
int t = 0;
s = 0;
for (int i = pointer; i <= n / 2; i++) {
t++;
if (arr[i] > arr[i + 1]) {
s += t;
t = 0;
if (g < s) {
pointer = i + 1;
break;
}
}
}
t = 0;
b = 0;
for (int i = pointer; i <= n / 2; i++) {
t++;
if (arr[i] > arr[i + 1]) {
b += t;
t = 0;
}
}
if (g >= s || g >= b) {
return false;
} else
return true;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int t;
cin >> t;
while (t--) {
cin >> n;
for (int i = 1; i <= n; i++) cin >> arr[i];
if (!solve())
cout << 0 << ' ' << 0 << ' ' << 0 << '\n';
else
cout << g << ' ' << s << ' ' << b << '\n';
}
}
|
#include <bits/stdc++.h>
using namespace std;
int a[500000], N, n, g, s, b;
bool ff(int x) {
int y;
for (int i = 0; i < x; i++) {
if (a[i] == a[0])
g++;
else {
if (s <= g || a[i] == y) {
s++;
y = a[i];
} else {
b++;
}
}
}
if (g >= b || g >= s)
return 0;
else
return 1;
}
void fff() {
int m = n / 2;
g = s = b = 0;
while (m > 1 && a[m - 1] == a[m]) {
m--;
}
if (ff(m))
printf("%d %d %d\n", g, s, b);
else
printf("0 0 0\n");
}
int main() {
scanf("%d", &N);
while (N--) {
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
fff();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }
template <typename T, typename V>
void __print(const pair<T, V> &x) {
cerr << '{';
__print(x.first);
cerr << ',';
__print(x.second);
cerr << '}';
}
template <typename T>
void __print(const T &x) {
int f = 0;
cerr << '{';
for (auto &i : x) cerr << (f++ ? "," : ""), __print(i);
cerr << "}";
}
void _print() { cerr << "]\n"; }
template <typename T, typename... V>
void _print(T t, V... v) {
__print(t);
if (sizeof...(v)) cerr << ", ";
_print(v...);
}
using ll = long long;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
vector<int> P;
for (int i = 0; i < n; i++) {
int p;
cin >> p;
P.push_back(p);
}
reverse((P).begin(), (P).end());
vector<int> golds;
while (!P.empty() && (golds.empty() || golds.back() == P.back())) {
golds.push_back(P.back());
P.pop_back();
}
vector<int> silvers;
while (!P.empty() && (int((silvers).size()) <= int((golds).size()) ||
silvers.back() == P.back())) {
silvers.push_back(P.back());
P.pop_back();
}
vector<int> bronzes;
while (!P.empty() && (int((bronzes).size()) <= int((golds).size()) ||
bronzes.back() == P.back())) {
bronzes.push_back(P.back());
P.pop_back();
}
if (int((golds).size()) == 0 || int((silvers).size()) == 0 ||
int((bronzes).size()) == 0 ||
int((golds).size()) + int((silvers).size()) + int((bronzes).size()) >
int((P).size())) {
cout << "0 0 0\n";
continue;
}
vector<int> ans = {int((golds).size()), int((silvers).size()),
int((bronzes).size())};
while (!P.empty()) {
bronzes.push_back(P.back());
P.pop_back();
while (!P.empty() && P.back() == bronzes.back()) {
bronzes.push_back(P.back());
P.pop_back();
}
if (int((golds).size()) + int((silvers).size()) + int((bronzes).size()) <=
int((P).size()))
ans = {int((golds).size()), int((silvers).size()),
int((bronzes).size())};
else
break;
}
for (auto a : ans) cout << a << " ";
cout << "\n";
}
}
|
#include <bits/stdc++.h>
using namespace std;
long long mod = 1e9 + 7;
long long inf = 1e18;
long long m_inf = INT_MIN;
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
std::cout.unsetf(std::ios::fixed);
std::cout.precision(9);
long long t = 1;
cin >> t;
while (t--) {
long long n;
cin >> n;
vector<long long> arr(n);
for (long long i = 0; i < n; i++) cin >> arr[i];
if (n < 5) {
cout << 0 << ' ' << 0 << ' ' << 0 << '\n';
continue;
}
long long g = 1;
long long i = 1;
long long temp = 0;
while (i < n && arr[i - 1] == arr[i]) {
i++;
g++;
}
while (temp <= g) {
i++;
temp++;
}
while (i < n && arr[i - 1] == arr[i]) {
temp++;
i++;
}
if (temp + g > n / 2) {
cout << "0 0 0" << '\n';
continue;
}
long long b = 0;
while (i < n / 2) {
long long j = i + 1;
long long k = 1;
while (j < n && arr[j - 1] == arr[j]) {
j++;
k++;
}
if (j > n / 2) {
break;
} else {
i = j;
b += k;
}
}
if (b > g) {
cout << g << ' ' << temp << ' ' << b << '\n';
} else
cout << "0 0 0" << '\n';
}
}
|
#include <bits/stdc++.h>
using namespace std;
const long long MXN = 1e6 + 7;
const long long MOD = 1e9 + 7;
const long long INF = 2e18 + 7;
inline void Need_for_speed() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
int q, a[MXN];
int main() {
Need_for_speed();
cin >> q;
while (q--) {
bool flag = true;
int n, g = 0, s = 0, b = 0, mn;
cin >> n;
if (n < 10) {
flag = false;
}
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = 1; i <= n / 2; i++) {
if (a[i] == a[1] && a[i] > a[n / 2 + 1]) {
g++;
}
}
mn = a[g + 1];
for (int i = g + 1; i <= n / 2; i++) {
if (a[i] <= mn && s <= g) {
mn = min(a[i], mn);
s++;
} else if (a[i] == mn && s > g) {
s++;
} else if (a[i] < mn && s > g) {
break;
}
}
for (int i = g + s + 1; i <= n / 2; i++) {
if (a[i] > a[n / 2 + 1]) {
b++;
}
}
if (g >= s || g >= b || g + b + s > n / 2 || !g || !s || !b) {
flag = false;
}
if (flag) {
cout << g << ' ' << s << ' ' << b << endl;
} else {
cout << "0 0 0" << endl;
}
}
exit(0);
}
|
#include <bits/stdc++.h>
using namespace std;
long long power(long long a, long long b);
long long a[400001];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
long long t = 1, i;
cin >> t;
while (t--) {
long long n;
cin >> n;
map<long long, long long> m;
for (long long i = 1; i <= n; i++) {
cin >> a[i];
}
long long index = n / 2;
long long count = 1;
vector<long long> s;
for (long long i = 2; i <= index + 1; i++) {
if (a[i] != a[i - 1])
s.push_back(count), count = 1;
else
count++;
}
if (s.size() < 3)
cout << "0"
<< " "
<< "0"
<< " "
<< "0"
<< "\n";
else {
long long sum = 0;
for (long long i = 1; i < s.size(); i++) sum += s[i];
long long gold = s[0];
long long silver = 0, bronze = 0;
long long flag = 0;
for (long long i = 1; i < s.size(); i++) {
if (gold >= silver) {
silver += s[i];
} else {
flag = 1;
break;
}
}
if (flag == 0) {
cout << "0"
<< " "
<< "0"
<< " "
<< "0"
<< "\n";
} else {
bronze = sum - silver;
if (gold >= bronze)
cout << "0"
<< " "
<< "0"
<< " "
<< "0"
<< "\n";
else
cout << gold << " " << silver << " " << bronze << "\n";
}
}
}
return 0;
}
long long power(long long a, long long b) {
long long res = 1;
while (b) {
if (b % 2)
b--, res = res * a;
else
b = b / 2, a *= a;
}
return res;
}
|
#include <bits/stdc++.h>
using namespace std;
signed main() {
ios_base::sync_with_stdio(false);
long long t;
cin >> t;
while (t--) {
long long n;
cin >> n;
long long a[n];
for (long long i = 0; i < n; i++) cin >> a[i];
if (n < 10) {
cout << "0 0 0" << endl;
continue;
}
long long z = n / 2 - 1;
if (a[z] == a[z + 1]) {
for (long long k = 0; k < n; k++)
if (a[k] == a[z]) {
z = k - 1;
break;
}
}
if (z < 3) {
cout << "0 0 0" << endl;
continue;
}
vector<long long> vc;
long long u = 0;
for (long long i = 0; i < z; i++) {
if (a[i] == a[i + 1])
u++;
else {
vc.push_back(u + 1);
u = 0;
}
if (i == z - 1) vc.push_back(u + 1);
}
if (vc.size() < 3) {
cout << "0 0 0" << endl;
continue;
}
long long g = vc[0];
long long s = 0;
for (long long i = 1; i < vc.size(); i++) {
s += vc[i];
if (s > g) break;
}
long long yuyu = 0;
for (long long i = 0; i < vc.size(); i++) yuyu += vc[i];
long long b = yuyu - s - g;
if (g < s && g < b) {
cout << g << " " << s << " " << b << endl;
} else {
cout << "0 0 0" << endl;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int tac;
int n;
int a[400010];
int g, s, b;
vector<int> v;
int main() {
scanf("%d", &tac);
while (tac--) {
scanf("%d", &n);
for (int i = 0; i < n; i++) scanf("%d", &a[i]);
v.clear();
g = s = b = 0;
int bc = 0;
for (int i = 0; i < n; i++) {
if (a[i] != a[bc]) {
v.push_back(i - bc);
bc = i;
}
}
v.push_back(n - bc);
g = v[0];
int t = 1;
while (s <= g && s + g + v[t] <= n / 2 && t < v.size()) s += v[t++];
while (b + s + g + v[t] <= n / 2 && t < v.size()) b += v[t++];
if (b <= g || s <= g || g + b + s > n / 2) {
cout << "0 0 0\n";
continue;
}
cout << g << " " << s << " " << b << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <typename T>
bool chkmax(T &x, T y) {
return x < y ? x = y, true : false;
}
template <typename T>
bool chkmin(T &x, T y) {
return x > y ? x = y, true : false;
}
int readint() {
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;
}
int n, cnt;
int a[400005], b[400005];
int main() {
int T = readint();
while (T--) {
n = readint();
for (int i = 1; i <= n; i++) a[i] = readint();
cnt = 0;
for (int i = 2; i <= n; i++)
if (a[i] != a[i - 1]) b[++cnt] = i;
int G = -1, S = -1, B = -1;
G = b[1] - 1;
for (int i = 2; i <= cnt; i++) {
if (b[i] - b[1] > G) {
S = b[i] - b[1];
break;
}
}
for (int i = 2; i <= cnt; i++) {
if (b[i] - S - b[1] > G) {
B = b[i] - S - b[1];
break;
}
}
if (G < 0 || S < 0 || B < 0)
printf("0 0 0\n");
else if (G + S + B > n / 2)
printf("0 0 0\n");
else {
for (int i = 2; i <= cnt; i++)
if (b[i] - 1 <= n / 2) chkmax(B, b[i] - S - b[1]);
printf("%d %d %d\n", G, S, B);
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long M = 1000000007;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long t;
cin >> t;
while (t--) {
long long n;
cin >> n;
long long p[n];
map<long long, long long> m;
for (long long i = 0; i < n; i++) {
cin >> p[i];
m[-p[i]]++;
}
if (n < 6)
cout << 0 << " " << 0 << " " << 0 << endl;
else {
long long g = 0, s = 0, b = 0;
for (auto j : m) {
if (g == 0) {
g += j.second;
} else if (s <= g) {
s += j.second;
} else {
b += j.second;
}
if (g + s + b > n / 2) {
b -= j.second;
break;
}
}
if (b > g && g + s + b <= n / 2)
cout << g << " " << s << " " << b << endl;
else
cout << 0 << " " << 0 << " " << 0 << endl;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
long long power(long long x, long long y) {
long long res = 1;
while (y > 0) {
if (y % 2 == 1) res = (res * x);
x = (x * x);
y = y / 2;
}
return res;
}
int main() {
long long t;
cin >> t;
while (t--) {
map<long long, long long> mp;
vector<long long> v;
long long n, p, temp = -1;
cin >> n;
for (long long i = 0; i < n; i++) {
cin >> p;
v.push_back(p);
mp[p]++;
}
if (n <= 5) {
cout << 0 << " " << 0 << " " << 0 << endl;
continue;
}
v.erase(unique(v.begin(), v.end()), v.end());
long long g = mp[v[0]], s = 0, b = 0;
if (v.size() < 3 || g > n / 2) {
cout << 0 << " " << 0 << " " << 0 << endl;
continue;
}
long long c = 0, f = 0;
for (long long i = 0; i < v.size(); i++) {
c += mp[v[i]];
if (c > n / 2) break;
if (c - g > g && f == 0) {
s = c - g;
f = 1;
}
if (c - g - s > g) b = c - g - s;
}
if (s == 0 || b == 0) {
cout << 0 << " " << 0 << " " << 0 << endl;
continue;
} else
cout << g << " " << s << " " << b << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int T, n, a[1000005], cnt[1000005], cc;
int main() {
scanf("%d", &T);
while (T--) {
int g = 0, s = 0, b = 0, cc = 0, st = 1;
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]), cnt[a[i]]++, cc += (cnt[a[i]] == 1);
if (cc < 3) {
for (int i = 1; i <= n; i++) cnt[a[i]] = 0;
puts("0 0 0");
continue;
}
g = cnt[a[1]], st += g;
while (s <= g && st < n) s += cnt[a[st]], st += cnt[a[st]];
for (int i = st; i <= n; i += cnt[a[i]]) {
if (g + s + b + cnt[a[i]] > n / 2) break;
b += cnt[a[i]];
}
for (int i = 1; i <= n; i++) cnt[a[i]] = 0;
if (b > g && s > g)
printf("%d %d %d\n", g, s, b);
else
puts("0 0 0");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void solve() {
int n;
cin >> n;
map<int, int> mp;
for (int i = 0; i < n; ++i) {
int x;
cin >> x;
x *= -1;
mp[x]++;
}
int pos = n / 2;
int g = mp.begin()->second, b = 0, s = 0;
mp.erase(mp.begin());
while (!mp.empty() && g >= s) {
s += mp.begin()->second;
mp.erase(mp.begin());
}
while (!mp.empty() && g >= b) {
b += mp.begin()->second;
mp.erase(mp.begin());
}
while (!mp.empty() && b + s + g < pos) {
if (mp.begin()->second + b + s + g <= pos) {
b += mp.begin()->second;
} else {
break;
}
mp.erase(mp.begin());
}
if (g < s && g < b && g + s + b <= pos && g > 0 && s > 0 & b > 0) {
cout << g << " " << s << " " << b;
} else {
cout << "0 0 0";
}
cout << '\n';
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int t;
cin >> t;
while (t--) {
solve();
}
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll t, n, m;
cin >> t;
while (t--) {
cin >> n;
ll a[n];
unordered_map<ll, ll> mp;
for (ll i = 0; i < n; i++) {
cin >> a[i];
mp[a[i]]++;
}
ll p = a[mp[a[0]]];
ll g = a[0], c = 0, ans = 2;
ll arr[3] = {0};
if (a[n / 2 - 1] == a[n / 2]) c = 1;
if (mp[a[0]] >= n / 3) {
cout << "0 0 0\n";
} else {
ll flag = 0;
for (ll i = 0; i < n / 2; i++) {
if (arr[2] == 0) {
arr[2] += mp[a[i]];
i += mp[a[i]] - 1;
continue;
}
if (ans == 1) {
if (arr[0] + arr[1] + arr[2] + mp[a[i]] > n / 2) break;
arr[0] += mp[a[i]];
i += mp[a[i]] - 1;
} else {
arr[1] += mp[a[i]];
if (arr[1] + arr[2] >= n / 2) {
flag++;
break;
}
if (arr[1] <= arr[2]) ans++;
ans--;
i += mp[a[i]] - 1;
}
}
if (arr[0] <= arr[2] || flag)
cout << "0 0 0\n";
else
cout << arr[2] << " " << arr[1] << " " << arr[0] << "\n";
}
}
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];
}
if (n < 6) {
cout << "0 0 0" << endl;
continue;
}
int l = n / 2 - 1;
while (l >= 0 && P[l] == P[l + 1]) l--;
vector<int> count;
int idx = -1;
for (int i = 0; i <= l; i++) {
if (i == 0 || !(P[i - 1] == P[i])) {
count.push_back(1);
idx++;
} else {
count[idx]++;
}
}
int g = 0, s = 0, b = 0;
if (count.size() > 0) g = count[0];
int i;
for (i = 1; i < count.size() && s <= g; i++) {
s += count[i];
}
for (; i < count.size(); i++) {
b += count[i];
}
if (g == 0 || s == 0 || b == 0 || s <= g || b <= g) {
cout << "0 0 0" << endl;
} else {
cout << g << " " << s << " " << b << endl;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
const long long INF = 1e18;
const double EPS = 1e-6;
const int MAX_N = 4e5 + 5;
int a[MAX_N];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int t;
cin >> t;
for (int tt = 0; tt < t; ++tt) {
int n;
cin >> n;
int cur = 0;
vector<pair<int, int> > v;
for (int i = 0; i < n; ++i) {
int x;
cin >> x;
a[i] = x;
if (i > 0 && a[i] < a[i - 1]) {
v.push_back(make_pair(a[i - 1], cur));
cur = 0;
}
++cur;
}
v.push_back(make_pair(a[n - 1], cur));
vector<pair<int, int> > use;
int idx = 0;
long long sum = 0;
while (idx < int(v.size()) && sum + v[idx].second <= n / 2) {
sum += v[idx].second;
use.push_back(v[idx]);
++idx;
}
if (idx < 3) {
cout << "0 0 0\n";
continue;
}
long long pre[MAX_N]{};
pre[0] = use[1].second;
for (int i = 1; i < int(use.size()) - 1; ++i) {
pre[i] = pre[i - 1] + use[i + 1].second;
}
bool works = false;
long long ag = use[0].second, as = 0, ab = 0;
for (int i = 0; i < int(use.size()); ++i) {
if (ag < pre[i] && ag < sum - ag - pre[i]) {
as = pre[i];
ab = sum - ag - pre[i];
works = true;
break;
}
}
if (works) {
cout << ag << ' ' << as << ' ' << ab << '\n';
} else {
cout << "0 0 0\n";
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t;
cin >> t;
for (int _ = 0; _ < t; _++) {
int n, g = 1, s = 0, b = 0;
cin >> n;
vector<int> p(n);
bool gold = true, ser = true;
for (int i = 0; i < n; i++) cin >> p[i];
int last = p[min(n - 1, n / 2)];
for (int j = 2; j <= n / 2; j++) {
int i = j - 1;
if (p[i] == p[i - 1] && gold)
g++;
else if (p[i] != p[i - 1] && gold) {
gold = false;
s++;
} else if (ser && p[i] == p[i - 1])
s++;
else if (ser && p[i] != p[i - 1]) {
if (s <= g)
s++;
else {
ser = false;
b++;
}
} else if (p[i] != last)
b++;
}
if (s <= g || b <= g)
cout << "0 0 0" << endl;
else
cout << g << " " << s << " " << b << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
inline int read() {
int num = 0, f = 1;
char ch = getchar();
while (ch > '9' || ch < '0') {
if (ch == '-') f = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
num = (num << 3) + (num << 1) + (ch ^ 48);
ch = getchar();
}
return num * f;
}
const int maxn(4e5 + 5);
int t, n;
int p[maxn], a[maxn], c[maxn], cnt;
int main() {
t = read();
while (t--) {
n = read();
for (int i = 1; i <= n; ++i) a[i] = p[i] = read();
sort(p + 1, p + n + 1);
int tmp = 1;
p[0] = -1;
for (int i = 1; i <= n; ++i) {
if (p[i] != p[i - 1])
c[cnt] = tmp, a[++cnt] = p[i], tmp = 1;
else
++tmp;
}
c[cnt] = tmp;
int g = 0, s = 0, b = 0, sum = 0;
for (int i = cnt; i; --i) {
sum += c[i];
if (sum > (n >> 1)) break;
if (g == 0)
g = c[i];
else if (s <= g)
s += c[i];
else
b += c[i];
}
if (b <= g)
printf("%d %d %d\n", 0, 0, 0);
else
printf("%d %d %d\n", g, s, b);
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int q;
cin >> q;
while (q--) {
int n, x, g = 0, s = 0, b = 0;
cin >> n;
map<int, int, greater<int>> mp;
for (int i = 0; i < n; i++) {
cin >> x;
mp[x]++;
}
for (auto it = mp.begin(); it != --mp.end(); it++) {
if (g == 0) {
g = it->second;
} else if (s <= g) {
s += it->second;
} else {
b += it->second;
if ((g + s + b) > n / 2) {
b -= it->second;
break;
}
}
}
if (g > 0 and s > 0 and b > 0 and g < s and g < b)
cout << g << ' ' << s << ' ' << b << endl;
else
cout << "0 0 0\n";
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int kN = 1e6 + 10;
int n;
int cnt[kN];
int pre[kN];
vector<int> tmp;
int main() {
int T;
scanf("%d", &T);
while (T--) {
scanf("%d", &n);
for (int i : tmp) cnt[i] = 0;
tmp.clear();
for (int i = 0; i < n; i++) {
int x;
scanf("%d", &x);
cnt[x]++;
tmp.push_back(x);
}
sort(tmp.begin(), tmp.end(), greater<int>());
tmp.resize(unique(tmp.begin(), tmp.end()) - tmp.begin());
vector<int> v;
for (int x : tmp) v.push_back(cnt[x]);
int m = int(v.size());
int g = v[0];
int res[2] = {0, 0};
int id = 0;
int cur = 1;
for (int i = 1; i <= m; i++) {
pre[i] = pre[i - 1] + v[i - 1];
if (id < 2 && pre[i] - pre[cur] > g) {
res[id++] = pre[i] - pre[cur];
cur = i;
}
}
int tot = n / 2;
int k = upper_bound(pre + 1, pre + m + 1, tot) - pre - 1;
if (id < 2 || cur > k)
puts("0 0 0");
else {
res[1] = pre[k] - g - res[0];
printf("%d %d %d\n", g, res[0], res[1]);
}
}
return 0;
}
|
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
using namespace std;
const long long mod = 998244353;
int t;
int n, m, a[400005];
void no() { cout << 0 << " " << 0 << " " << 0 << '\n'; }
void solve() {
cin >> n;
for (int i = (int)0; i < (int)n; i = i + 1) cin >> a[i];
;
int i = 0;
m = n / 2;
while (i < m && a[i] == a[0]) i++;
if (i == m) return no();
int cnt = 1;
while (m > i && a[m - 1] == a[m]) m--;
vector<int> v;
a[m] = 1e9;
for (int j = (int)i + 1; j < (int)m + 1; j = j + 1) {
if (a[j] != a[j - 1]) {
v.emplace_back(cnt);
cnt = 1;
} else {
cnt++;
}
}
cnt = 0;
int j = 0;
while (j < (int)v.size() && cnt <= i) {
cnt += v[j];
j++;
}
int s = cnt;
cnt = 0;
while (j < (int)v.size()) {
cnt += v[j++];
}
if (s <= i || cnt <= i) return no();
cout << i << " " << s << " " << cnt << '\n';
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t = 1;
cin >> t;
while (t--) {
solve();
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 400005;
int T, n, a[N], pr[N], x, y, z;
int main() {
cin >> T;
while (T--) {
x = y = z = 0;
scanf("%d", &n);
for (int i = 1; i <= n; i++) scanf("%d", a + i);
int k = n;
while (k > n / 2) {
int x = a[k];
while (k && a[k] == x) k--;
}
n = k;
k = 0;
for (int i = 1; i <= n; i++) {
if (i == 1 || a[i] != a[i - 1]) {
k++;
pr[k] = 0;
}
pr[k]++;
}
for (int i = 1; i <= k; i++) pr[i] += pr[i - 1];
for (int i = 1; i <= k; i++) {
int l, r, m, pos;
pos = -1;
l = i + 1;
r = k;
while (l <= r) {
m = (l + r) / 2;
if (pr[m] - pr[i] > pr[i]) {
r = m - 1;
pos = m;
} else
l = m + 1;
}
if (pos == -1 || pr[k] - pr[pos] <= pr[i]) continue;
x = pr[i];
y = pr[pos] - pr[i];
z = pr[k] - pr[pos];
}
printf("%d %d %d\n", x, y, z);
}
return 0;
}
|
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
using ll = int64_t;
using ld = long double;
const ld EPS = 1e-9;
const ll MOD = 998244353;
const ld PI = 3.141592653589793;
const int maxn = 4e5 + 1;
int p[maxn];
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.precision(10);
cout << fixed;
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
int last = -1;
int uniq = 0;
int cnt = 0;
vector<int> cnts;
for (int i = 1; i <= n; ++i) {
cin >> p[i];
if (p[i] != last) {
cnts.push_back(cnt);
++uniq;
last = p[i];
cnt = 0;
}
++cnt;
}
cnts.push_back(cnt);
vector<int> pref(cnts.size());
for (int i = 1; i < cnts.size(); ++i) {
pref[i] = pref[i - 1] + cnts[i];
}
if (uniq < 3) {
cout << "0 0 0\n";
continue;
}
int s_it = 2;
int b_it = 3;
tuple<int, int, int> best{0, 0, 0};
for (int g_it = 1; g_it < cnts.size(); ++g_it) {
while (s_it < cnts.size() && pref[s_it] - pref[g_it] <= pref[g_it]) {
++s_it;
}
if (s_it + 1 >= cnts.size()) {
break;
}
b_it = max(b_it, s_it + 1);
while (b_it + 1 < cnts.size() && 2 * pref[b_it + 1] <= n) {
++b_it;
}
if (pref[b_it] - pref[s_it] <= pref[g_it]) {
break;
}
if (2 * pref[b_it] > n) {
break;
}
best = {pref[g_it], pref[s_it] - pref[g_it], pref[b_it] - pref[s_it]};
}
cout << get<0>(best) << " " << get<1>(best) << " " << get<2>(best) << "\n";
}
}
|
#include <bits/stdc++.h>
using namespace std;
mt19937 mt_rand(time(0));
const int N = 4e5 + 5;
int n, tab[N], t;
int main() {
scanf("%d", &t);
while (t--) {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &tab[i]);
}
int wsk = 1;
while (wsk != n && tab[wsk] == tab[wsk + 1]) wsk++;
if (wsk == n) {
printf("0 0 0\n");
continue;
}
int g = wsk;
int il = 0;
wsk++;
while (wsk != n && (il < g || tab[wsk] == tab[wsk + 1])) {
wsk++;
il++;
}
if (wsk == n) {
printf("0 0 0\n");
continue;
}
int s = wsk - g;
il = 0;
wsk++;
while (wsk != n && (il < g || tab[wsk] == tab[wsk + 1])) {
wsk++;
il++;
}
if (il < g || wsk > n / 2) {
printf("0 0 0\n");
continue;
}
int x = wsk;
for (int i = x; i <= n / 2 + 1; i++)
if (tab[i] != tab[i - 1]) x = i - 1;
printf("%d %d %d\n", g, s, x - g - s);
}
return 0;
}
|
#include <bits/stdc++.h>
const int N = 400010;
int s[N];
int cnt[N];
int sum[N];
int n, m;
int T;
int a, b, c;
inline bool check(int R) {
if (R < 3) return false;
if (sum[R] > n / 2) return false;
int l = 2, r = R, ans = -1;
while (l <= r) {
int i = (l + r) >> 1;
if (sum[i] - sum[1] > sum[1]) {
ans = i;
r = i - 1;
} else {
l = i + 1;
}
}
if (ans == -1) return false;
int ta = sum[1], tb = sum[ans] - sum[1], tc = sum[R] - sum[ans];
if (ta < tb && ta < tc) {
a = ta, b = tb, c = tc;
}
return false;
}
int main(void) {
scanf("%d", &T);
while (T--) {
scanf("%d", &n);
scanf("%d", &s[1]);
m = 0;
a = b = c = 0;
cnt[++m] = 1;
for (register int i = 2; i <= n; ++i) {
scanf("%d", &s[i]);
if (s[i] == s[i - 1]) {
++cnt[m];
} else {
cnt[++m] = 1;
}
}
for (register int i = 1; i <= m; ++i) {
sum[i] = sum[i - 1] + cnt[i];
}
for (register int i = 3; i <= m && sum[i] <= n / 2; ++i) {
check(i);
}
printf("%d %d %d\n", a, b, c);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int h = n / 2;
while (h > 0 && a[h] == a[h - 1]) {
h--;
}
if (h == 0)
cout << "0 0 0"
<< "\n";
else {
int g = 1;
while (g < h && a[g] == a[g - 1]) g++;
int s = g + 1;
while (s + g < h && a[s + g] == a[s + g - 1]) s++;
int b = h - s - g;
if (b > 0 && g < s && g < b)
cout << g << " " << s << " " << b << endl;
else
cout << "0 0 0"
<< "\n";
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 4e5 + 10;
int a[N], b[N];
void solve() {
int n, m = 0;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", a + i);
}
for (int i = 0, j; i < n; i = j) {
for (j = i; j < n && a[i] == a[j]; j++)
;
b[m++] = j - i;
}
int x, y, z, t, i, j;
x = b[0];
y = z = t = 0;
for (i = 1; i < m && y <= x; y += b[i], i++)
;
for (; i < m && z <= x; z += b[i], i++)
;
j = i;
for (; i < m; t += b[i], i++)
;
if (x >= y || x >= z || x + y + z > n - x - y - z) {
puts("0 0 0");
return;
}
while (x + y + z + b[j] <= n - x - y - z - b[j]) {
z += b[j];
j++;
}
cout << x << ' ' << y << ' ' << z << endl;
}
int main() {
int T;
scanf("%d", &T);
while (T--) solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[400005];
int main() {
int t, n;
scanf("%d", &t);
while (t--) {
scanf("%d", &n);
int k = 0;
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
if (i <= n / 2 + 1 && a[i] != a[i - 1]) {
k = i - 1;
}
}
if (k == 0) {
printf("0 0 0\n");
} else {
int g = 0, s = 0, b = 0;
for (int i = 1; i <= k; i++) {
if (g == 0 && a[i] != a[i + 1]) {
g = i;
}
if (g != 0 && s == 0 && a[i] != a[i + 1] && i - g > g) {
s = i - g;
}
if (s != 0 && g != 0) {
b = k - g - s;
break;
}
}
if (b > g && s > g && b != 0 && g != 0 && s != 0) {
printf("%d %d %d\n", g, s, b);
} else {
printf("0 0 0\n");
}
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
namespace debug {
void err() { cout << endl; }
template <template <typename...> class T, typename t, typename... Args>
void err(T<t> a, Args... args) {
for (auto x : a) cout << x << ' ';
err(args...);
}
template <typename T, typename... Args>
void err(T a, Args... args) {
cout << a << ' ';
err(args...);
}
} // namespace debug
using namespace debug;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
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);
}
};
long long power(long long a, long long b) {
if (b < 0) return 1;
long long res = 1;
while (b) {
if (b & 1) res = (res * a);
a = (a * a);
b >>= 1;
}
return res;
}
bool ispoweroftwo(long long x) { return (x && !(x & (x - 1))); }
long long GCD(long long a, long long b) {
long long r;
while (b) {
r = a % b;
a = b;
b = r;
}
return a;
}
long long LCM(long long a, long long b) { return a / GCD(a, b) * b; }
const long long int inf = 1e9;
const long long INF = 1e18;
const long double pi = 3.141592653589793238;
long long int dx[] = {-1, 0, 1, 0};
long long int dy[] = {0, 1, 0, -1};
char MV[] = {'U', 'R', 'D', 'L'};
void solve() {
long long int n;
cin >> n;
vector<long long int> pp;
map<long long int, long long int> mp;
for (long long int i = 0; i < n; ++i) {
long long int pi;
cin >> pi;
mp[-pi]++;
}
bool ok = 0;
for (auto [i, j] : mp) pp.push_back(j);
long long int g = pp[0];
long long int i = 1;
long long int s = 0, b = 0;
while (s <= g && i < ((long long int)((pp).size()))) s += pp[i++];
if (g < s) {
while (b <= g && i < ((long long int)((pp).size()))) b += pp[i++];
while ((g + s + b + pp[i]) <= n / 2 && i < ((long long int)((pp).size())))
b += pp[i++];
if (!g || !b || !s || s <= g || b <= g || (g + s + b) > n / 2) goto done;
ok = 1;
cout << g << ' ' << s << ' ' << b << '\n';
}
done:
if (!ok) cout << "0 0 0\n";
}
int32_t main() {
ios_base::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;
int t, n, m, j, g, s, b, k, v[1000010];
int main() {
cin >> t;
while (t--) {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> v[i];
}
m = n / 2;
g = s = b = 0;
while (m > 0 && v[m] == v[n / 2 + 1]) {
m--;
}
j = 1;
for (int i = 1; i <= m / 3; i++) {
if (v[i] != v[i + 1]) {
j = max(j, i + 1);
while (j - i <= i || v[j + 1] == v[j]) {
j++;
}
k = m - j;
if (i < min(j - i, k)) {
g = i;
s = j - i;
b = k;
}
}
}
cout << g << " " << s << " " << b << "\n";
}
}
|
#include <bits/stdc++.h>
using namespace std;
int seq[400005];
int main() {
int t;
scanf("%d", &t);
int n;
for (int data = 1; data <= t; data++) {
scanf("%d", &n);
int last = 0;
int prev = -1;
int silver_cnt = 0;
int bronze_cnt = 0;
int c;
for (int i = 1; i <= n; i++) {
int a;
scanf("%d", &a);
if (a != prev) {
last++;
}
seq[last]++;
prev = a;
}
if (last < 3) goto fail;
for (c = 2; c <= last; c++) {
silver_cnt += seq[c];
if (silver_cnt > seq[1]) break;
}
c++;
if (silver_cnt <= seq[1]) goto fail;
for (; c <= last; c++) {
if ((seq[1] + silver_cnt + bronze_cnt + seq[c]) * 2 > n) break;
bronze_cnt += seq[c];
}
if (bronze_cnt <= seq[1]) goto fail;
printf("%d %d %d\n", seq[1], silver_cnt, bronze_cnt);
goto succeed;
fail:
printf("0 0 0\n");
succeed:
for (int i = 1; i <= last; i++) seq[i] = 0;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
int n, x, y, i, g, s, b, csum, cnt = 1;
cin >> n;
vector<int> f;
cin >> x;
for (int i = 1; i < n; i++) {
cin >> y;
if (y == x)
cnt++;
else {
f.push_back(cnt);
cnt = 1;
x = y;
}
}
if (cnt > 0) f.push_back(cnt);
i = g = s = b = csum = 0;
while (i < f.size()) {
if (csum + f[i] <= n / 2) {
csum += f[i++];
} else
break;
}
i--;
if (i < 2) {
cout << "0 0 0\n";
continue;
} else {
g = f[0];
int index = 1;
while (index <= i && s <= g) s += f[index++];
if (index > i || s <= g) {
cout << "0 0 0\n";
continue;
}
while (index <= i) b += f[index++];
if (b <= g) {
cout << "0 0 0\n";
continue;
}
cout << g << " " << s << " " << b << endl;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 4e6;
const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
int qpow(long long x, long long n) {
long long res = 0;
while (n) {
if (n & 1) res = res * x % MOD;
x = x * x % MOD;
n >>= 1;
}
return res;
}
int a[MAXN + 5];
void test_case() {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; ++i) scanf("%d", &a[i]);
if (n <= 9) {
printf("0 0 0\n");
return;
}
sort(a + 1, a + 1 + n, greater<int>());
int last = n / 2;
if (a[last] == a[last + 1]) {
while (last >= 1 && a[last - 1] == a[last]) {
--last;
}
--last;
}
if (last <= 4) {
printf("0 0 0\n");
return;
}
int g = 0, s = 0, b = 0;
int i;
for (i = 1; i <= last; ++i) {
if (a[i] == a[1]) {
++g;
} else {
break;
}
}
if (i >= last) {
printf("0 0 0\n");
return;
}
int firsts = i;
for (; i <= last; ++i) {
if (a[i] == a[firsts]) {
++s;
} else if (s <= g) {
firsts = i;
++s;
} else {
break;
}
}
if (i >= last) {
printf("0 0 0\n");
return;
}
b = last - i + 1;
if (b <= g) {
printf("0 0 0\n");
return;
}
printf("%d %d %d\n", g, s, b);
}
int main() {
int t = 1;
scanf("%d", &t);
for (int ti = 1; ti <= t; ++ti) {
test_case();
}
}
|
#include <bits/stdc++.h>
using namespace std;
template <class T>
inline void sary(T* st, T* nd) {
while (st < nd) cin >> *st++;
}
const long long int mod = 998244353;
void calc() {
long long int n;
cin >> n;
map<long long int, long long int, greater<long long int>> ma;
for (long long int i = 0; i < n; i++) {
long long int x;
cin >> x;
ma[x]++;
}
long long int g = 0, s = 0, b = 0;
map<long long int, long long int, greater<long long int>>::iterator it =
ma.begin();
g = it->second;
it++;
while (s <= g && it != ma.end()) {
s += it->second;
it++;
}
while (it != ma.end()) {
b += it->second;
if (g + s + b > (n / 2)) {
b -= it->second;
break;
}
it++;
}
if (s > g && b > g)
cout << g << " " << s << " " << b << "\n";
else
cout << 0 << " " << 0 << " " << 0 << "\n";
}
int32_t main() {
long long int t;
cin >> t;
while (t--) calc();
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
int *p = new int[n + 3];
for (int i = 0; i < n; i++) cin >> p[i];
int x = (n - 2) / 2;
if (x == -1) {
cout << "0 0 0\n";
continue;
}
int mn = p[x], g = 0, b;
while (~x && p[x + 1] == p[x]) x--;
b = x;
while (g <= x && p[g] == p[0]) g++;
while (~b && p[b] == p[x]) b--;
while (b > g && (x - b <= g || g >= 1 + b - g)) {
int z = b;
while (~b && p[b] == p[z]) b--;
}
if (x - b > g && g < 1 + b - g && g > 0 && x - b > 0 && 1 + b - g > 0)
cout << g << ' ' << 1 + b - g << ' ' << x - b << '\n';
else
cout << "0 0 0\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
int a[n], g = 0, s = 0, b = 0;
for (int i = 0; i < n; i++) cin >> a[i];
if (n >= 10) {
int j = 0;
vector<int> occ;
for (int i = 0; i < n; i++) {
j = i;
while (j < n && a[j] == a[i]) j++;
occ.push_back(j - i);
i = j - 1;
}
int mid = n / 2, k = 1, sz = occ.size();
while (g + s + b <= mid) {
g = occ.front();
while (k < sz && s <= g) {
s += occ[k];
k++;
}
while (k < sz && g + s + b <= mid) {
b += occ[k];
k++;
}
}
if (g + s + b > mid) b -= occ[k - 1];
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 solve() {
long long n;
cin >> n;
vector<long long> vec(n);
map<long long, long long, greater<long long>> mp;
for (int i = 0; i < n; i++) {
cin >> vec[i];
mp[vec[i]]++;
}
if (mp.size() < 3) {
cout << "0 0 0";
return;
} else {
vector<long long> s;
long long sum = 0;
for (auto x : mp) {
s.push_back(x.second);
sum += x.second;
}
long long s2 = 0;
long long exp = sum / 2;
long long ind = -1;
for (int i = 0; i < s.size(); i++) {
if (s2 + s[i] <= exp) {
s2 += s[i];
ind = i + 1;
} else
break;
}
if (ind < 3) {
cout << "0 0 0";
} else {
long long a1 = s[0];
long long indd = -1;
long long a2 = 0, a3 = 0;
for (long long i = 1; i < ind; i++) {
if (a2 > a1) {
indd = i;
break;
} else {
a2 += s[i];
}
}
if (indd == -1) {
cout << "0 0 0";
return;
} else {
for (long long i = indd; i < ind; i++) {
a3 += s[i];
}
if (a3 <= a1) {
cout << "0 0 0";
} else {
cout << a1 << " " << a2 << " " << a3;
}
}
}
}
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int test = 1;
cin >> test;
while (test--) {
solve();
cout << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int Set(int N, int pos) { return N = N | (1 << pos); }
int reset(int N, int pos) { return N = N & ~(1 << pos); }
bool check(int N, int pos) { return (bool)(N & (1 << pos)); }
inline int addmod(int x, int y) {
return (x % 1000000007 + y % 1000000007) % 1000000007;
}
inline int submod(int x, int y) {
return (x % 1000000007 - y % 1000000007 + 1000000007) % 1000000007;
}
inline int mulmod(int x, int y) {
return (x % 1000000007 * 1LL * y % 1000000007) % 1000000007;
}
inline int nextSubMask(int i, int mask) { return (i - 1) & mask; }
template <typename T>
void we_r_done(T mssg) {
cout << mssg;
exit(0);
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
;
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
int a[n + 1];
a[0] = 1e9;
for (int i = 1; i <= n; i++) {
cin >> a[i];
if (a[i - 1] < a[i])
while (true)
;
}
if (n <= 7) {
cout << "0 0 0\n";
continue;
}
int last = n / 2;
while (last > 0 && a[last] == a[last + 1]) last--;
set<int> bal;
for (int i = 1; i <= last; i++) {
bal.insert(a[i]);
if (bal.size() >= 3) break;
}
if (bal.size() < 3) {
cout << "0 0 0\n";
continue;
}
int g = 0, s = 0, b = 0;
int i = 1;
while (a[1] == a[i] && i < last) {
g++;
i++;
}
int gg = g, sum = 0;
for (int j = i; i < last; i++) {
if (a[i] > a[i + 1]) {
int nb = last - i, ns = i - j + 1;
int now = g + ns + nb;
if (now > sum && g < min(nb, ns)) {
sum = now;
b = nb;
s = ns;
}
}
}
if (!g || !b || !s) {
g = b = s = 0;
}
cout << g << " " << s << " " << b << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
void testcase() {
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i <= (n - 1); ++i) cin >> v[i];
if (n < 5) {
cout << "0 0 0" << endl;
return;
}
int limit = v[n / 2];
int final = n / 2 - 1;
for (int i = n / 2 - 1; i >= (0); --i) {
if (v[i] == limit) {
final--;
} else {
break;
}
}
int pos = final + 1;
int i = 1, g = 1, s = 0, b = 0;
int val = v[0];
while (i < n) {
if (v[i] == val)
g++;
else
break;
i++;
}
while (i < n && s <= g) {
s++;
val = v[i++];
}
while (i < n && v[i] == val) s++, i++;
while (i < n && b <= g) {
b++;
val = v[i++];
}
while (i < pos) b++, i++;
if (g == 0 || s == 0 || b == 0 || g + s + b > pos || g >= s || g >= b) {
cout << "0 0 0" << endl;
} else {
cout << g << " " << s << " " << b << endl;
}
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t = 1;
if (1) cin >> t;
while (t--) {
testcase();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void solve() {
int n;
cin >> n;
int a[n + 3];
for (int i = (1); i < (n + 1); i++) {
cin >> a[i];
}
if (n >= 6) {
int j = n / 2;
while (a[j] == a[j - 1] && a[j] == a[j + 1]) j--;
if (a[j] == a[j + 1]) j--;
int g = 0, s = 0, b = 0;
map<int, int> m;
queue<int> s1;
for (int i = 1; i <= j; i++) {
if (m[a[i]] == 0) s1.push(a[i]);
m[a[i]]++;
}
int c = 0;
int t1 = 0, t2 = 0, t3 = 0;
if (s1.size() >= 3) {
while (!s1.empty()) {
auto it = s1.front();
c++;
if (c == 1)
t1 = m[it];
else if (c >= 2) {
if (t2 <= t1) {
t2 += m[it];
} else if (t2 > t1 && t3 <= t1) {
t3 += m[it];
} else
t3 += m[it];
}
s1.pop();
}
if (t1 < t2 && t1 < t3) {
cout << t1 << " " << t2 << " " << t3 << '\n';
} else
cout << 0 << " " << 0 << " " << 0 << '\n';
} else {
cout << 0 << " " << 0 << " " << 0 << '\n';
}
} else
cout << 0 << " " << 0 << " " << 0 << '\n';
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int T;
cin >> T;
while (T--) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int T;
cin >> T;
for (int test_case = 1; test_case <= T; ++test_case) {
int n;
cin >> n;
int input[n + 1];
for (int i = 1; i <= n; ++i) cin >> input[i];
int idx = n / 2;
while (idx >= 1 and input[n / 2 + 1] == input[idx]) --idx;
int count_x = 0, count_y = 0, count_z = 0;
for (int i = 2; i <= idx; ++i) {
if (input[i] != input[i - 1]) {
count_x = i - 1;
break;
}
}
if (count_x == 0) {
cout << 0 << ' ' << 0 << ' ' << 0 << '\n';
continue;
}
for (int i = count_x + 1; i <= idx; ++i) {
++count_y;
if (input[i] != input[i - 1] and count_y - 1 > count_x) {
--count_y;
break;
}
}
if (idx - (count_x + count_y) > count_x) {
count_z = idx - (count_x + count_y);
}
if (count_x != 0 and count_y != 0 and count_z != 0) {
cout << count_x << ' ' << count_y << ' ' << count_z << '\n';
} else {
cout << 0 << ' ' << 0 << ' ' << 0 << '\n';
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
const int nax = 1e6 + 111;
int pt(int a, int b) {
int c = 1;
while (b) {
if (b & 1) c = 1ll * c * a % mod;
a = 1ll * a * a % mod;
b /= 2;
}
return c;
}
int fac[nax];
int rev[nax];
void elo() {
fac[0] = rev[0] = 1;
for (int i = 1; i < nax; ++i) {
fac[i] = 1ll * fac[i - 1] * i % mod;
rev[i] = pt(fac[i], mod - 2);
}
}
int T;
int n;
int a[nax];
multiset<int> secik;
int main() {
elo();
scanf("%d", &T);
while (T--) {
secik.clear();
scanf("%d", &n);
for (int i = 1; i <= n; ++i) scanf("%d", a + i);
int pr = n / 2;
while (pr > 0 && a[pr] == a[n / 2 + 1]) pr--;
int best = 0;
int A = 0;
int B = 0;
int C = 0;
for (int i = 1; i < pr; ++i)
if (a[i] != a[i + 1]) secik.insert(i);
for (int i = 1; i < pr; ++i) {
if (a[i] == a[i + 1]) continue;
auto it = secik.lower_bound(2 * i + 1);
if (it == secik.end() || *it == pr - 1 || pr - *it <= i) continue;
A = i;
B = *it - i;
C = pr - *it;
}
printf("%d %d %d\n", A, B, C);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ld = long double;
using ll = long long;
using vi = vector<int>;
using pii = pair<int, int>;
const int MX = 4 * 1e5;
int p[MX + 2];
void matate() { cout << "0 0 0" << '\n'; }
void resuelve(int n) {
int g = 0;
int idx = 0;
while (idx < n && p[idx] == p[0]) idx++;
g = idx;
int s = 0;
while (s <= g) {
int pos = idx;
while (idx < n && p[idx] == p[pos]) {
idx++;
s++;
}
if (idx >= n) break;
}
if (s <= g) {
matate();
return;
}
int b = 0;
while (b <= g) {
int pos = idx;
while (idx < n && p[idx] == p[pos]) {
idx++;
b++;
}
if (idx >= n) break;
}
if (b <= g) {
matate();
return;
}
int limite = n / 2;
if (idx > limite) {
matate();
return;
}
int pos = limite;
while (limite >= 0 && p[limite] == p[pos]) limite--;
if (idx - 1 > limite) {
matate();
return;
}
while (idx <= limite) {
b++;
idx++;
}
cout << g << " " << s << " " << b << '\n';
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
for (int i = 0; i < n; ++i) cin >> p[i];
resuelve(n);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <class T>
using vec = vector<T>;
template <class T>
using vvec = vector<vec<T>>;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int T;
cin >> T;
for (int t = 0; t < T; t++) {
int N;
cin >> N;
map<int, int> m;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
m[-a]++;
}
int g = -1, s = -1, b = -1;
int sum = 0;
for (auto x : m) {
if (g == -1) {
g = x.second;
sum += x.second;
} else if (s <= g) {
if (s == -1)
s = x.second;
else
s += x.second;
sum += x.second;
} else {
if (sum + x.second <= N / 2) {
if (b == -1)
b = x.second;
else
b += x.second;
sum += x.second;
} else
break;
}
}
if (b <= g)
cout << 0 << " " << 0 << " " << 0 << endl;
else
cout << g << " " << s << " " << b << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int a[4 * 100000 + 5];
int main(int argc, char *argv[]) {
int t, n;
cin >> t;
while (t--) {
cin >> n;
int x;
for (int i = 0; i < n; i++) a[i] = 0;
int i = 0, j = 0;
int last;
for (; i < n; i++) {
scanf("%d", &x);
if (i == 0) {
a[j]++;
last = x;
} else {
if (x == last) {
a[j]++;
} else {
last = x;
j++;
a[j]++;
}
}
}
int g, s = 0, b = 0;
g = a[0];
int k = 1;
for (; k <= j;) {
if (s > g)
break;
else {
s += a[k];
k++;
}
}
for (; k <= j;) {
if (b > g)
break;
else {
b += a[k];
k++;
}
}
if (g + s + b > n / 2) {
cout << "0 0 0" << endl;
} else {
for (; k <= j; k++) {
if (g + s + b + a[k] <= n / 2) {
b += a[k];
} else {
break;
}
}
printf("%d %d %d\n", g, s, b);
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int t, i, j, ii, k, n, m, g, s, b;
cin >> t;
for (ii = 0; ii < t; ii++) {
cin >> n;
int a[n];
for (i = 0; i < n; i++) cin >> a[i];
g = 0;
s = 0;
b = 0;
i = 1;
while (i < n && a[i - 1] == a[i]) i++;
if (i > n / 2) {
cout << "0 0 0" << endl;
continue;
}
g = i;
while (i <= n / 2 && s <= g) {
j = i;
i++;
while (i <= n / 2 && a[i - 1] == a[i]) i++;
if (i > n / 2) break;
s += i - j;
}
if (i > n / 2) {
cout << "0 0 0" << endl;
continue;
}
while (i <= n / 2) {
j = i;
i++;
while (i <= n / 2 && a[i - 1] == a[i]) i++;
if (i > n / 2) break;
b += i - j;
}
if (b <= g) {
cout << "0 0 0" << endl;
continue;
}
cout << g << " " << s << " " << b << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int T;
cin >> T;
while (T--) {
long long int n, t = -1, g = 0, s = 0, b = 0, co = 0, i;
vector<long long int> vv, v2;
cin >> n;
long long int arr[n + 1];
for (i = 0; i < n; i++) {
cin >> arr[i];
if (i == 0) t = arr[i];
if (arr[i] == t)
co++;
else {
vv.push_back(co);
co = 1;
}
t = arr[i];
}
vv.push_back(co);
co = 0;
for (i = 0; i < vv.size(); i++) {
if ((vv[i] + co) <= (n / 2)) {
v2.push_back(vv[i]);
} else
break;
co += vv[i];
}
t = 0;
co = 0;
for (i = 1; i < v2.size(); i++) {
if ((v2[0] < v2[i] + t)) {
co++;
if (co == 1) s = t + v2[i];
if (co < 2)
t = 0;
else
t += v2[i];
} else
t += v2[i];
}
b = t;
if (v2.size() != 0) g = v2[0];
if (co < 2)
cout << "0 0 0" << endl;
else {
cout << g << " " << s << " " << b << endl;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
long long max(long long a, long long b) { return a > b ? a : b; }
long long min(long long a, long long b) { return a < b ? a : b; }
double max(double a, double b) { return a > b ? a : b; }
double min(double a, double b) { return a < b ? a : b; }
long long modd(long long a) {
if (a < 0LL) return a * -1LL;
return a;
}
long double modd(long double a) {
if (a < 0.0) return a * -1.0;
return a;
}
long long modulo(long long a) { return a % 1000000007LL; }
long long power(long long k, long long p) {
if (p == 0) return 1LL;
long long P = power(k, p / 2LL);
P = (P * P) % 1000000007LL;
if (p % 2 == 1) P = (P * k) % 1000000007LL;
return P;
}
struct p_str {
long long a, b;
};
void solve() {
long long n;
cin >> n;
long long a[n];
for (long long i = 0; i < n; i++) {
cin >> a[i];
}
vector<long long> v;
long long i = 0;
while (i < n) {
long long c = 1;
while (i + 1 < n && a[i] == a[i + 1]) {
c++;
i++;
}
v.push_back(c);
i++;
}
long long k = v.size();
long long h = n / 2;
long long sum = 0;
i = 0;
while (i < k && sum + v[i] <= h) {
sum += v[i];
i++;
}
long long lim = i - 1;
if (lim < 2) {
cout << "0 0 0\n";
return;
}
long long g = v[0];
long long s = 0;
i = 1;
while (i <= lim && s <= g) {
s += v[i++];
}
long long b = 0;
while (i <= lim) {
b += v[i++];
}
if (g >= b || g >= s || g == 0 || b == 0 || s == 0) {
cout << "0 0 0\n";
return;
}
cout << g << " " << s << " " << b << endl;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long t = 1;
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;
int a[n];
long long int temp = 1;
bool g = 0, s = 0, b = 0;
long long int g1 = 0, s1 = 0, b1 = 0;
for (int i = 0; i < n; i++) cin >> a[i];
for (int i = 1; i < n; i++) {
if (a[i] == a[i - 1])
temp++;
else {
if (!g) {
if (temp > n / 2) {
break;
}
g1 = temp;
temp = 1;
g = 1;
} else {
if (!s) {
if (g1 + temp > n / 2) break;
s1 += temp;
temp = 1;
if (s1 > g1) s = 1;
} else {
if (g1 + s1 + b1 + temp > n / 2) break;
b1 += temp;
temp = 1;
if (b1 > g1) b = 1;
}
}
}
}
if (g && s && b) {
cout << g1 << " " << s1 << " " << b1 << endl;
} else
cout << 0 << " " << 0 << " " << 0 << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long T;
cin >> T;
while (T--) {
long long N;
cin >> N;
long long arr[N], g = 1;
for (long long i = 0; i < N; i++) cin >> arr[i];
while (g < N && arr[g] == arr[g - 1]) g++;
long long s = 2 * g + 1;
while (s < N && arr[s] == arr[s - 1]) s++;
long long b = N / 2;
while (arr[b] == arr[b - 1] && b > 0) b--;
if (b - s > g)
cout << g << " " << s - g << " " << b - s << endl;
else
cout << "0 0 0" << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 4e5 + 5;
int arr[MAXN], num[MAXN];
int main() {
std::ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
int T, n;
cin >> T;
while (T--) {
int g = 0, s = 0, b = 0;
cin >> n;
for (int i = 0; i < n; i++) cin >> arr[i];
int len = n / 2, cnt = 0;
if (len >= 3) {
int i;
num[cnt++] = arr[0];
map<int, int> m;
m[arr[0]]++;
for (i = 1; i < len; i++) {
if (arr[i] != arr[i - 1]) num[cnt++] = arr[i];
m[arr[i]]++;
}
while (i < n && arr[i] == arr[i - 1]) m[arr[i]]++, i++;
g = m[num[0]];
for (i = 1; i < cnt && s <= g; i++) s += m[num[i]];
for (; i < cnt; i++) b += m[num[i]];
int x = cnt;
while (g + s + b > len) b -= m[num[--x]];
if (g > 0 && s > 0 && g < b)
cout << g << " " << s << " " << b << '\n';
else
cout << "0 0 0" << '\n';
} else
cout << "0 0 0" << '\n';
}
return 0;
}
|
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) cin >> a[i];
int g, s, b, i, cc = 1, in = 0, j = 0;
g = s = b = 0;
vector<int> c(n, 0);
for (i = n / 2 - 1; i >= 0; i--) {
if (a[i] != a[i + 1]) break;
}
j = i;
for (i = i - 1; i >= 0; i--) {
if (a[i] == a[i + 1]) {
cc++;
continue;
} else {
c[in] = cc;
in++;
cc = 1;
}
}
c[in++] = cc;
g = cc;
if (in >= 3) {
int k = 0;
for (; k < in - 1; k++) {
b += c[k];
if (b > g) break;
}
for (k = k + 1; k < in - 1; k++) s += c[k];
if (b > g && s > g)
cout << g << " " << s << " " << b << "\n";
else
cout << "0 0 0\n";
} else
cout << "0 0 0\n";
}
return 0;
}
|
#include <bits/stdc++.h>
#pragma optimizitaion_level 3
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("fast-math")
using namespace std;
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
vector<int> kek, cnt;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
if (kek.empty() || kek.back() != a) {
kek.push_back(a);
cnt.push_back(1);
} else {
cnt.back()++;
}
}
int k = cnt.size();
int g = cnt[0], s = 0, b = 0, i = 1;
for (; i < k && s <= g; i++) {
s += cnt[i];
}
for (; i < k && b <= g; i++) {
b += cnt[i];
}
if (s <= g || b <= g) {
cout << "0 0 0\n";
continue;
}
if (s + b + g <= n / 2) {
for (; i < k; i++) {
if (g + s + b + cnt[i] <= n / 2) {
b += cnt[i];
} else
break;
}
cout << g << " " << s << " " << b << '\n';
} else
cout << "0 0 0\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
long long t;
cin >> t;
while (t--) {
long long n, i;
cin >> n;
vector<long long> v, p, a;
for (i = 0; i < n; i++) {
long long temp;
cin >> temp;
v.push_back(temp);
}
long long cur = v[0];
long long cnt = 1;
for (i = 1; i < n; i++) {
if (v[i] == cur)
cnt++;
else {
p.push_back(cnt);
cnt = 1;
cur = v[i];
}
}
if (cur > 0) p.push_back(cnt);
long long sum = 0;
for (i = 0; i < int(p.size()); i++) {
if (sum + p[i] <= (n / 2)) {
a.push_back(p[i]);
sum += p[i];
} else
break;
}
if (a.size() < 3)
cout << 0 << " " << 0 << " " << 0 << endl;
else {
long long g = a[0];
long long n1 = a.size();
long long b = 0;
long long ind;
for (i = n1 - 1; i >= 1; i--) {
if (b + a[i] <= g)
b += a[i];
else {
b += a[i];
ind = i - 1;
break;
}
}
if (b <= g)
cout << 0 << " " << 0 << " " << 0 << endl;
else {
long long s = 0;
for (i = 1; i <= ind; i++) s += a[i];
if (s <= g)
cout << 0 << " " << 0 << " " << 0 << endl;
else
cout << g << " " << s << " " << b << endl;
}
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 5;
const int mod = 1e9 + 7;
const int inf = 1e9;
int n, p[N], pre[N], suc[N];
int main() {
int t;
cin >> t;
while (t--) {
scanf("%d", &n);
for (int i = 1; i <= n; ++i) scanf("%d", p + i);
sort(p + 1, p + 1 + n);
reverse(p + 1, p + 1 + n);
for (int i = 1; i <= n; ++i) {
pre[i] = pre[i - 1];
if (i == n || p[i] != p[i + 1]) {
pre[i] = i;
}
}
for (int i = n; i >= 1; --i) {
suc[i] = suc[i + 1];
if (i == n || p[i] != p[i + 1]) {
suc[i] = i;
}
}
int ans = 0, g = 0, s = 0, b = 0;
for (int i = 1; i + i + i + 2 <= n; ++i) {
if (p[i] != p[i + 1]) {
int pos1 = suc[i + i + 1];
int pos2 = pre[n / 2];
if (pos2 - pos1 > i) {
if (pos2 > ans) {
ans = pos2;
g = i;
s = pos1 - i;
b = pos2 - pos1;
}
}
}
}
printf("%d %d %d\n", g, s, b);
}
}
|
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4.1,sse4.2,popcnt,tune=native")
#pragma GCC target("avx,avx2")
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
long long t;
cin >> t;
for (long long tt = 0; tt < t; tt++) {
long long n;
cin >> n;
vector<long long> p(n);
map<long long, long long> all;
for (long long i = 0; i < n; i++) {
cin >> p[i];
all[p[i]]++;
}
if (n < 10) {
cout << "0 0 0" << '\n';
continue;
}
long long g = 0, s = 0, b = 0;
if (all.size() == 0) {
cout << "0 0 0" << '\n';
continue;
}
g += (*all.rbegin()).second;
all.erase((*all.rbegin()).first);
if (all.size() == 0) {
cout << "0 0 0" << '\n';
continue;
}
bool f = false;
while (s <= g) {
s += (*all.rbegin()).second;
all.erase((*all.rbegin()).first);
if (all.size() == 0) {
cout << "0 0 0" << '\n';
f = true;
break;
}
}
if (f) continue;
bool fl = false;
while ((g + s + b) * 2 < n) {
if (all.size() == 0) {
cout << "0 0 0" << '\n';
fl = true;
break;
}
long long pl = (*all.rbegin()).second;
if ((g + s + b + pl) * 2 <= n)
b += pl;
else
break;
all.erase((*all.rbegin()).first);
}
if (fl) continue;
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;
string ch = "abcabc";
int t, n, v[400002], mx, mn, p[200002];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> t;
while (t--) {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> v[i];
}
vector<int> seg;
int i = 1;
int last = 0;
while (i <= n) {
int j = i;
while (j <= n && v[j] == v[i]) j++;
j--;
if (j > n / 2) break;
last = j;
seg.push_back(j - i + 1);
i = j + 1;
}
int g = 0, s = 0, b = 0;
if (seg.size() == 0) {
cout << "0 0 0\n";
continue;
} else {
int sum1, sum2;
sum1 = seg[0];
sum2 = seg[0];
int j = 0;
int ans = 0;
for (int i = 0; i < seg.size(); i++) {
sum2 -= seg[i];
if (i == j) j++;
while (j < seg.size() && sum2 <= sum1) {
sum2 += seg[j];
j++;
}
if (sum2 <= sum1) break;
if (last - sum2 - sum1 <= sum1) break;
g = sum1;
s = sum2;
b = last - sum1 - sum2;
if (i + 1 < seg.size()) sum1 += seg[i + 1];
}
}
cout << g << " " << s << " " << b << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long N = 1e9 + 7;
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;
long long arr[n + 1];
map<long long, long long> mp;
map<long long, long long> fi;
for (long long i = 1; i <= n; i++) {
cin >> arr[i];
mp[arr[i]]++;
if (fi.count(arr[i]) == 0) fi[arr[i]] = i;
}
long long lim = n / 2;
long long g = 0, s = 0;
g = mp[arr[1]];
if (g == n) {
cout << "0 0 0\n";
continue;
}
long long xx = 2 * (g + 1);
if (xx > n) {
cout << "0 0 0\n";
continue;
}
if (arr[xx] == arr[xx - 1])
s = g + 1 + mp[arr[xx]] - (xx - fi[arr[xx]]);
else
s = g + 1;
long long b = 0;
long long i = 1 + g + s;
for (; i <= lim;) {
long long temp = i + mp[arr[i]] - 1;
if (temp > lim)
break;
else {
b = b + mp[arr[i]];
i = i + mp[arr[i]];
}
}
if (g == 0 || s == 0 || b == 0 || g >= b || g >= s)
cout << "0 0 0\n";
else
cout << g << " " << s << " " << b << "\n";
}
}
|
#include <bits/stdc++.h>
using namespace std;
string alpha_upper = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
string alpha_lower = "abcdefghijklmnopqrstuvwxyz";
double eps = 1e-12;
template <class Tm1, class Tm2>
void print_map(map<Tm1, Tm2> m) {
for (auto it = m.begin(); it != m.end(); it++) {
cout << (*it).first << " : " << (*it).second << "\n";
}
}
const int maxn = 4e5 + 5;
int arr[maxn];
map<int, int, greater<int> > m;
void solve() {
int n;
cin >> n;
m.clear();
for (int i = 1; i <= n; i++) cin >> arr[i], m[arr[i]]++;
int g = 0, s = 0, b = 0;
for (auto itr : m) {
int cnt = itr.second;
if (!g) {
g += cnt;
continue;
}
if (s <= g) {
s += cnt;
continue;
}
if (g + s + b + cnt > n / 2) break;
b += cnt;
}
if (g >= s || g >= b)
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;
cin >> t;
for (long long i = 0; i < t; i++) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long n, m, i, j, a[400005];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long t;
cin >> t;
while (t--) {
cin >> n;
for (i = 0; i < n; i++) {
cin >> a[i];
}
long long ptr = n / 2 - 1;
bool S = true;
long long g = 0, s = 0, b = 0, cur = -1, elem = 0;
for (i = 0; i <= ptr; i++) {
if (a[i] == a[0])
g++;
else {
if (cur == -1) cur = a[i];
if (a[i] == cur) {
elem++;
if (S)
s++;
else
b++;
} else {
if (s > g) S = false;
cur = a[i];
if (S)
s++;
else
b++;
elem = 1;
}
}
}
if (a[ptr] == a[ptr + 1]) b -= elem;
if (g >= s || g >= b)
cout << "0 0 0" << endl;
else
cout << g << " " << s << " " << b << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
const long long int mod = 1000000007;
const long long int limit = 1000000;
void fc(long long int &x) {
bool neg = false;
register char c;
x = 0;
c = getchar();
if (c == '-') {
neg = true;
c = getchar();
}
for (; (c > 47 && c < 58); c = getchar()) x = (x << 1) + (x << 3) + c - 48;
if (neg) x *= -1;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long int n, q, t;
long long int temp, temp1, temp2, temp3;
long long int i, j, k, a, b, c;
cin >> q;
while (q--) {
cin >> n;
long long int arr[n];
vector<long long int> ans;
for (i = 0; i < n; i++) cin >> arr[i];
if (n < 10) {
cout << 0 << " " << 0 << " " << 0 << "\n";
continue;
}
temp = 1;
for (i = 1; i < n; i++) {
if (arr[i] == arr[i - 1])
temp++;
else {
ans.push_back(temp);
temp = 1;
}
}
ans.push_back(temp);
temp = n / 2;
temp1 = 0;
for (i = 0; i < ans.size(); i++) {
temp1 += ans[i];
if (temp1 > temp) {
temp1 -= ans[i];
break;
}
}
temp2 = i;
a = 0;
b = 0;
c = 0;
bool flag = 0;
a = ans[0];
j = 1;
while (b <= a && j < i) {
b += ans[j];
j++;
}
while (c <= a && j < i) {
c += ans[j];
j++;
}
if (c > a) c = temp1 - a - b;
if (a + b + c != temp1 || a == 0 || b <= a || c <= a) flag = 1;
if (flag) {
cout << 0 << " " << 0 << " " << 0 << "\n";
} else {
if (a + b + c != temp1) c = temp1 - a - b;
cout << a << " " << b << " " << c << "\n";
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
int t;
cin >> t;
while (t--) {
int n, last, cnt = 0, g = 0, s = 0, b = 0;
cin >> n;
vector<int> v;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
if (v.size() != (n / 2 + 1)) v.push_back(a);
}
cnt = 1;
int i = 0;
while (i < v.size() - 1) {
if (v[i + 1] != v[i]) {
g = cnt;
i++;
break;
} else
cnt++;
i++;
}
cnt = 1;
while (i < v.size() - 1) {
if (v[i + 1] != v[i]) {
s += cnt;
cnt = 1;
if (s > g) {
i++;
break;
}
} else
cnt++;
i++;
}
cnt = 1;
while (i < v.size() - 1) {
if (v[i + 1] != v[i]) {
b += cnt;
cnt = 1;
} else
cnt++;
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;
long long int power(long long int x, long long int y) {
if (y == 0) return 1;
long long int p = power(x, y / 2) % 1000000007;
p = (p * p) % 1000000007;
return (y % 2 == 0) ? p : (x * p) % 1000000007;
}
long long int factorial[100007] = {0};
long long int fact(long long int n) {
memset(factorial, 0, sizeof(factorial));
factorial[0] = 1;
factorial[1] = 1;
for (int i = 1; i < n; i++) {
factorial[i] = (factorial[i - 1] * i) % 1000000007;
}
}
long long int ncr(long long int n, long long int r) {
long long int ans = 1;
long long int i;
for (i = r + 1; i <= n; i++) {
ans = (ans * i) % 1000000007;
}
for (i = 2; i <= n - r; i++) {
ans = (ans * power(i, 1000000007 - 2)) % 1000000007;
}
return ans;
}
long long int gcd(long long int a, long long int b) {
if (b == 0) return a;
return gcd(b, a % b);
}
bool prime[100000006];
void sieve(long long int n) {
memset(prime, true, sizeof(prime));
prime[1] = false;
for (long long int p = 2; p * p <= n; p++) {
if (prime[p]) {
for (long long int i = p * p; i <= n; i += p) prime[i] = false;
}
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long int t;
cin >> t;
while (t--) {
long long int n;
cin >> n;
long long int a[n];
long long int i;
for (i = 0; i < n; i++) {
cin >> a[i];
}
vector<long long int> v;
long long int count = 1;
for (i = 0; i < n / 2; i++) {
if (a[i] == a[i + 1]) {
count++;
} else {
v.push_back(count);
count = 1;
}
}
if (v.size() < 3)
cout << 0 << " " << 0 << " " << 0 << '\n';
else {
long long int g = v[0], s, b;
i = 1;
long long int sum = 0;
int bol = 0;
while (i < v.size()) {
sum += v[i];
i++;
if (sum > v[0]) break;
}
if (sum <= v[0]) {
bol = 1;
} else {
s = sum;
}
if (bol == 0) {
sum = 0;
while (i < v.size()) {
sum += v[i];
i++;
}
if (sum <= v[0])
bol = 1;
else
b = sum;
}
if (bol == 1)
cout << 0 << " " << 0 << " " << 0 << '\n';
else
cout << g << " " << s << " " << b << '\n';
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using int64 = long long;
int64 max(int64 a, int64 b) {
if (b > a)
return b;
else
return a;
}
int64 min(int64 a, int64 b) {
if (b < a)
return b;
else
return a;
}
signed main() {
int64 t;
cin >> t;
for (int64 j = 0; j < t; j++) {
int64 n;
cin >> n;
vector<int64> nums(n);
map<int64, int64> mp;
for (int64 i = 0; i < n; i++) {
cin >> nums[i];
mp[nums[i]]++;
}
int64 g = 0, s = 0, b = 0;
g = mp[nums[0]];
int64 i = mp[nums[0]];
while (s <= g && i < n) {
s += mp[nums[i]];
i += mp[nums[i]];
}
if (i < n) {
while (g + s + b + mp[nums[i]] <= n / 2) {
b += mp[nums[i]];
i += mp[nums[i]];
if (i >= n) break;
}
}
if (g < s && g < b)
cout << g << " " << s << " " << b;
else
cout << "0 0 0";
cout << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 4e5;
int N, P[MAXN];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int T;
cin >> T;
while (T--) {
cin >> N;
for (int i = 0; i < N; ++i) cin >> P[i];
int g = 0, s = 0, b = 0;
int i = 0, j = 0;
while (j < N && P[j] == P[i]) {
++g;
++j;
}
i = j;
while (j < N && s < g) {
++s;
++j;
}
i = j;
while (j < N && P[i] == P[j]) {
++s;
++j;
}
i = j;
while (j < N && b < g) {
++b;
++j;
}
i = j;
while (j < N && P[j] > P[N / 2]) {
++b;
++j;
}
i = j;
if (g < s && g < b && s + b + g <= N / 2) {
cout << g << ' ' << s << ' ' << b << '\n';
} else
cout << "0 0 0\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
bool comp(pair<long long, long long> A, pair<long long, long long> B) {
return A.first < B.first;
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long t = 1;
cin >> t;
while (t--) {
long long n;
cin >> n;
map<long long, long long> mp;
for (long long insert = 0; insert < n; insert++) {
long long p;
cin >> p;
mp[p]++;
}
vector<pair<long long, long long> > v;
for (auto it : mp) {
v.push_back({it.first, it.second});
}
sort(v.begin(), v.end(), comp);
if (v.size() < 3) {
cout << "0 0 0\n";
continue;
}
long long f1 = v[v.size() - 1].second;
v.pop_back();
long long f2 = 0;
while (!v.empty() && f2 <= f1) {
f2 += v.back().second;
v.pop_back();
}
long long rem = (n / 2) - f1 - f2;
long long f3 = 0;
while (!v.empty()) {
if ((f3 + v.back().second) <= rem)
f3 += v.back().second;
else {
break;
}
v.pop_back();
}
if (f1 >= f2 || f1 >= f3) {
cout << "0 0 0\n";
} else {
cout << f1 << ' ' << f2 << " " << f3 << '\n';
}
}
}
|
#include <bits/stdc++.h>
int main() {
int T;
std::cin >> T;
while (T--) {
std::vector<int> pai;
int n;
std::cin >> n;
pai.resize(n);
int g = 0, s = 0, b = 0;
int now = 0;
for (int i = 0; i < n; ++i) {
std::cin >> pai[i];
if (now == 0) {
if (g == 0) {
g++;
} else if (pai[i] == pai[i - 1]) {
g++;
} else {
s++;
now++;
}
} else if (now == 1) {
if (s == 0) {
s++;
} else if (pai[i] == pai[i - 1]) {
s++;
} else if (s <= g) {
s++;
} else {
now++;
}
}
}
int count = 0;
for (int i = g + s; i <= (n) / 2; ++i) {
if (count == 0) {
++count;
} else {
if (pai[i] == pai[i - 1]) {
count++;
} else {
b += count;
count = 1;
}
}
}
if (g < s && g < b) {
std::cout << g << " " << s << " " << b << std::endl;
} else {
std::cout << 0 << " " << 0 << " " << 0 << std::endl;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 4e5 + 5;
template <class T>
inline void read(T &x) {
x = 0;
char c = getchar();
T flag = 1;
while (c < '0' || c > '9') {
if (c == '-') flag = -1;
c = getchar();
}
while (c >= '0' && c <= '9') {
x = (x << 1) + (x << 3) + c - 48;
c = getchar();
}
x *= flag;
}
int t;
int a[maxn], sum[maxn];
int main() {
int t, n;
read(t);
while (t--) {
read(n);
int pre, sm = 0;
for (int i = 1; i <= n; i++) {
int x;
read(x);
a[i] = x;
}
pre = a[1];
int cnt = 0, id = 0;
for (int i = 1; i <= n; i++) {
if (a[i] == pre) {
cnt++;
} else {
id++;
sum[id] = cnt;
cnt = 1;
pre = a[i];
}
}
if (cnt == 1) {
id++;
sum[id] = cnt;
} else {
id++;
sum[id] = cnt;
}
int s1 = 0, f = 0;
while (s1 * 2 < n) {
s1 += sum[id--];
}
int g = 0, s = 0, b = 0, t1 = 0, t2 = 0;
if (id < 3)
f = 1;
else {
s1 = n - s1;
for (int i = 1; i <= id; i++) {
t1 += sum[i];
if (t1 * 3 >= s1) break;
t2 = 0;
for (int j = i + 1; j < id; j++) {
t2 += sum[j];
if (s1 - t1 - t2 <= t1) break;
if (t2 > t1) {
g = t1, s = t2, b = s1 - t1 - t2;
break;
}
}
if (g) break;
}
}
if (f == 1)
printf("0 0 0\n");
else
printf("%d %d %d\n", g, s, b);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int arr[1000005];
int main() {
int n, a, brr[5];
scanf("%d", &n);
while (n--) {
scanf("%d", &a);
int ass = 0;
for (int i = 0; i < a; i++) {
scanf("%d", &arr[i]);
}
if (a >= 10) {
int sum1 = arr[a / 2], sum3 = a / 2;
for (int i = a / 2 - 1; i >= 0; i--) {
if (arr[i] == sum1) {
sum3--;
} else if (arr[i] != sum1) {
break;
}
}
int sum = 0, sum2 = 0, ass = 0;
sum1 = arr[0];
for (int i = 0; i < a; i++) {
sum2++;
if (arr[i] != sum1 && sum == 0) {
sum1 = arr[i];
brr[sum] = sum2 - 1;
sum++;
sum2 = 1;
} else if (arr[i] != sum1 && sum2 - 1 > brr[0] && sum != 0) {
sum1 = arr[i];
brr[sum] = sum2 - 1;
sum++;
sum2 = 1;
} else if (arr[i] != sum1) {
sum1 = arr[i];
}
if (sum == 3 && i > sum3) {
ass = 1;
printf("0 0 0\n");
break;
}
if (sum == 3) {
ass = 1;
printf("%d %d %d\n", brr[0], brr[1], sum3 - brr[0] - brr[1]);
break;
}
}
if (ass == 0) {
printf("0 0 0\n");
}
} else {
printf("0 0 0\n");
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[400005], cnt[1000005], b[400005];
int main() {
int T = 1;
cin >> T;
while (T--) {
int n;
cin >> n;
for (int i = 1; i <= n; i++) cnt[i] = 0;
for (int i = 1; i <= n; i++) scanf("%d", &a[i]), b[i] = a[i];
sort(b + 1, b + n + 1);
for (int i = 1; i <= n; i++)
a[i] = lower_bound(b + 1, b + n + 1, a[i]) - b, cnt[a[i]]++;
int sum = 0, c = 0, p, t1 = 0, t2 = 0, t3 = 0;
for (int i = n; i >= 1; i--) {
if (cnt[i]) {
p = i;
t1 = cnt[p];
break;
}
}
for (int i = p - 1; i >= 1; i--) {
if (t2 > t1) {
p = i + 1;
break;
}
t2 += cnt[i];
}
for (int i = p - 1; i >= 1; i--) {
if (t3 > t1 && t1 + t2 + t3 + cnt[i] > n / 2) break;
t3 += cnt[i];
}
if (t2 <= t1 || t3 <= t1 || t1 + t2 + t3 > n / 2)
puts("0 0 0");
else
printf("%d %d %d\n", t1, t2, t3);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int tt;
cin >> tt;
while (tt--) {
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++) cin >> v[i];
int g = 0, s = 0, b = 0;
int i = 0;
int x = 0, y = 0, z = 0;
map<int, int> m;
for (int i = 0; i < n / 2; i++) {
m[v[i]]++;
}
if (v[n / 2 - 1] == v[n / 2]) {
m.erase(v[n / 2]);
}
if (m.size() < 3) {
cout << 0 << " " << 0 << " " << 0 << endl;
} else {
x = m.rbegin()->second;
auto it = m.rbegin();
it++;
while (y <= x && it != m.rend()) {
y += it->second;
it++;
}
while (it != m.rend()) {
z += it->second;
it++;
}
if (y <= x || z <= x) {
cout << 0 << " " << 0 << " " << 0 << endl;
} else {
cout << x << " " << y << " " << z << endl;
}
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int T;
int N;
int A[400401];
int main() {
scanf("%d", &T);
while (T--) {
scanf("%d", &N);
for (int i = 1; i <= N; i++) scanf("%d", &A[i]);
int i = 1, j = 1, k = 1;
while (i < N && A[i + 1] == A[i]) i++;
j = max(j, i + i + 1);
while (j < N && A[j + 1] == A[j]) j++;
k = max(k, j + i + 1);
while (k < N && A[k + 1] == A[k]) k++;
if (k > N / 2) {
printf("%d %d %d\n", 0, 0, 0);
continue;
}
for (int p = 1; p <= N / 2; p++)
if (p == N || A[p] != A[p + 1]) k = max(k, p);
printf("%d %d %d\n", i, j - i, k - j);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; i++) {
cin >> p[i];
}
if (n / 2 <= 3)
cout << 0 << " " << 0 << " " << 0 << "\n";
else {
int cnt = n / 2;
while (p[cnt - 1] == p[cnt] && cnt >= 5) cnt--;
if (cnt < 5)
cout << 0 << " " << 0 << " " << 0 << "\n";
else {
int g = 1, s, b;
while (p[g - 1] == p[g] && g < cnt) g++;
s = g + 1;
while (p[s + g - 1] == p[s + g] && s + g < cnt) s++;
b = cnt - s - g;
if (b > g)
cout << g << " " << s << " " << b << "\n";
else
cout << 0 << " " << 0 << " " << 0 << "\n";
}
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n;
int a[500005], b[500005], c[500005];
void solve() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
b[i] = a[i];
}
sort(b + 1, b + n + 1);
int len = unique(b + 1, b + n + 1) - b - 1, mx = 0;
for (int i = 1; i <= n; i++) {
a[i] = lower_bound(b + 1, b + len + 1, a[i]) - b;
mx = max(mx, a[i]);
c[a[i]]++;
}
int s1 = c[mx], s2 = 0, s3 = 0, i;
for (i = mx - 1; i >= 1; i--) {
s2 += c[i];
if (s2 > s1) break;
}
for (int j = i - 1; j >= 1; j--) {
s3 += c[j];
if (s3 > s1) {
i = j - 1;
break;
}
}
if (s1 + s2 + s3 > n / 2)
puts("0 0 0");
else {
for (int j = i; j >= 1; j--) {
if (s1 + s2 + s3 + c[j] > n / 2) break;
s3 += c[j];
}
printf("%d %d %d\n", s1, s2, s3);
}
for (int i = 1; i <= mx; i++) {
c[i] = 0;
}
}
int main() {
int T;
cin >> T;
while (T--) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 400005;
int n;
int a[N];
int p[N];
void solv() {
scanf("%d", &n);
for (int i = 1; i <= n; ++i) scanf("%d", &a[i]);
vector<int> v;
v.push_back(0);
int q = 1;
for (int i = 2; i <= n; ++i) {
if (a[i] == a[i - 1]) {
++q;
} else {
v.push_back(q);
q = 1;
}
}
v.push_back(q);
for (int i = 1; i < v.size(); ++i) p[i] = p[i - 1] + v[i];
int ansg = 0, anss = 0, ansb = 0;
for (int i = 1; i < v.size(); ++i) {
int g = p[i];
int j;
int s = -1;
int l = i + 1, r = v.size() - 1;
while (l <= r) {
int m = (l + r) / 2;
if (p[m] - p[i] > g) {
s = p[m] - p[i];
j = m;
r = m - 1;
} else
l = m + 1;
}
if (s == -1) continue;
int k = -1;
int b = -1;
l = j + 1, r = v.size() - 1;
while (l <= r) {
int m = (l + r) / 2;
if (p[m] - p[j] > g) {
b = p[m] - p[j];
k = m;
r = m - 1;
} else
l = m + 1;
}
if (b == -1) continue;
int bb = -1;
l = k, r = v.size() - 1;
while (l <= r) {
int m = (l + r) / 2;
if (g + s + b + p[m] - p[k] <= n / 2) {
bb = p[m] - p[k];
l = m + 1;
} else
r = m - 1;
}
if (bb == -1) continue;
b += bb;
if (g + s + b > ansg + anss + ansb) {
ansg = g;
anss = s;
ansb = b;
}
}
printf("%d %d %d\n", ansg, anss, ansb);
}
int main() {
int tt;
scanf("%d", &tt);
while (tt--) {
solv();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void Fastio() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
long long fact[1000006], inv[1000006];
long long fp(long long base, long long exp) {
if (exp == 0) return 1;
long long ans = fp(base, exp / 2);
ans = (ans * ans) % 998244353;
if (exp % 2 != 0) ans = (ans * (base % 998244353)) % 998244353;
return ans;
}
void calcFacAndInv(long long n) {
fact[0] = inv[0] = 1;
for (long long i = 1; i <= n; i++) {
fact[i] = (i * fact[i - 1]);
inv[i] = fp(fact[i], 998244353 - 2);
}
}
long long ncr(long long n, long long r) {
return ((fact[n] * inv[r]) % 998244353 * inv[n - r]) % 998244353;
}
long long npr(long long n, long long r) {
return (fact[n] * inv[n - r]) % 998244353;
}
long double NCR(int n, int m) {
long double res = 1;
m = min(m, n - m);
for (int i = 0; i < m; i++) {
res = res * (n - i) / (i + 1);
}
return res;
}
long long tol(string a) {
long long res = 0;
while (a[0] == '0') {
a.erase(a.begin());
}
if (a == "") a = "0";
for (int i = 0; i < a.size(); i++) {
res *= 10;
res += a[i] - '0';
}
return res;
}
int check(string a, string b) {
for (int i = 0; i < a.size(); i++) {
if (a[i] > b[i]) return 1;
if (b[i] > a[i]) return -1;
}
return 0;
}
int main() {
Fastio();
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
map<int, int> mp;
set<int> s;
int arr[n];
for (int i = 0; i < n; i++) {
int x;
cin >> x;
arr[i] = x;
if (i < n / 2) s.insert(x);
mp[x]++;
}
if (s.empty()) {
cout << "0 0 0\n";
continue;
}
set<int>::iterator it = s.begin();
if (arr[n / 2] == *it) s.erase(it);
if (s.size() < 3) {
cout << "0 0 0\n";
continue;
}
it = s.end();
it--;
int g = mp[*it], si = 0;
long long sum = 0;
s.erase(it);
for (it = s.begin(); it != s.end(); it++) {
sum += mp[*it];
}
it = s.end();
it--;
while (!s.empty()) {
it = s.end();
it--;
si += mp[*it];
if (g < si && g < sum - si) {
cout << g << " " << si << " " << sum - si << '\n';
goto finish;
}
s.erase(*it);
}
cout << "0 0 0\n";
finish:;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[404040];
inline void solve() {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; i++) scanf("%d", a + i);
int N = 0;
for (int i = 1, j = 1; i <= n; i = j) {
for (; j <= n && a[i] == a[j]; j++)
;
a[++N] = j - i;
}
int s2 = 0, i2 = 2;
for (; i2 <= N && s2 <= a[1]; i2++) s2 += a[i2];
i2--;
int sum = a[1] + s2;
int s3 = 0, i3 = i2 + 1;
for (; i3 <= N && (sum + a[i3]) * 2 <= n; i3++) sum += a[i3], s3 += a[i3];
i3--;
if (a[1] < s3)
printf("%d %d %d\n", a[1], s2, s3);
else
puts("0 0 0");
}
int main() {
int t;
scanf("%d", &t);
while (t--) solve();
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
long long t;
cin >> t;
while (t--) {
int n;
cin >> n;
int a[n];
set<int> s;
map<int, int> b;
for (int i = 0; i < n; i++) {
cin >> a[i];
b[a[i]]++;
s.insert(a[i]);
}
int h = n / 2;
if (h < 3 || s.size() < 3) {
cout << 0 << " " << 0 << " " << 0;
} else {
vector<int> v;
int r = 0;
for (int i = 0; i < n; i++) {
v.push_back(b[a[i]]);
int u = i + b[a[i]] - 1;
i = u;
}
int l = v[0];
int i = 1;
int s = 0;
int p = 0;
int q = 0;
while (i <= v.size() - 2) {
s += v[i];
if (s > l) {
int j = i + 1;
int b = 0;
while (j <= v.size() - 1) {
b += v[j];
j++;
if (b > l && ((l + s + b) <= h)) {
p = l;
q = s;
r = b;
}
}
break;
}
i++;
}
cout << p << " " << q << " " << r;
}
cout << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
const long long N = 1e5 + 33;
void solve() {
int n, x;
cin >> n;
vector<int> v, pref;
map<int, int> mp;
for (int i = 0; i < n; i++) {
cin >> x;
if (mp[x] == 0) v.push_back(x);
mp[x]++;
}
pref = vector<int>(v.size());
pref[0] = mp[v[0]];
for (int i = 1; i < v.size(); i++) {
pref[i] = pref[i - 1] + mp[v[i]];
}
int opt = n / 2;
int id = upper_bound(pref.begin(), pref.end(), opt) - pref.begin() - 1;
int g = mp[v[0]];
int pos_s = lower_bound(pref.begin(), pref.end(), g + g + 1) - pref.begin();
if (pos_s >= id || id < 2) {
cout << 0 << " " << 0 << " " << 0;
} else {
int s = pref[pos_s] - g, b = pref[id] - pref[pos_s];
if (g >= s || g >= b)
cout << 0 << " " << 0 << " " << 0;
else
cout << g << " " << s << " " << b;
}
}
int main() {
int t;
cin >> t;
while (t--) {
solve();
cout << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int b[400010], a[400010], T, n, m;
int main() {
scanf("%d", &T);
while (T--) {
scanf("%d", &n);
for (register int i = 1; i <= n; ++i) scanf("%d", &a[i]);
b[m = 1] = 1;
for (register int i = 2; i <= n; ++i)
if (a[i] == a[i - 1])
++b[m];
else
b[++m] = 1;
int g = b[1], s = 0, t = 0;
int i = 2;
while (g >= s && i <= m) s += b[i++];
while (g >= t && i <= m) t += b[i++];
if (i > m || (g + s + t) > (n >> 1))
printf("0 0 0\n");
else {
while ((g + s + t + b[i]) <= (n >> 1)) t += b[i++];
printf("%d %d %d\n", g, s, t);
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base ::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long t, n;
cin >> t;
while (t--) {
cin >> n;
vector<long long> v(n);
long long sum = 1;
for (long long i = 0; i < n; i++) cin >> v[i];
vector<long long> t;
for (long long i = 1; i < n; i++) {
if (v[i] == v[i - 1])
sum++;
else {
t.push_back(sum);
sum = 1;
}
}
t.push_back(sum);
long long g = t[0];
long long s = 0, b = 0, i = 1;
while (s <= g && i < t.size()) s += t[i++];
if (g >= s) {
cout << "0 0 0\n";
continue;
}
while (b <= g && i < t.size()) b += t[i++];
if (g >= b) {
cout << "0 0 0\n";
continue;
}
if (g + s + b > n / 2) {
cout << "0 0 0\n";
continue;
}
while ((g + s + b + t[i]) <= n / 2 && i < t.size()) {
b += t[i++];
}
cout << g << " " << s << " " << b << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
int n, i;
cin >> n;
map<int, int> mp;
for (i = 0; i < n; ++i) {
int num;
cin >> num;
mp[-num]++;
}
vector<int> vp;
map<int, int>::iterator it;
for (it = mp.begin(); it != mp.end(); ++it) {
vp.push_back(it->second);
}
int g = 0, b = 0, s = 0;
g += vp[0];
i = 1;
while (s <= g && i < vp.size()) s += vp[i], ++i;
while (b <= g && i < vp.size()) b += vp[i], ++i;
while (i < vp.size() && g + b + s + vp[i] <= n / 2) b += vp[i], ++i;
if (s + b + g <= n / 2 && g < b && g < s && g > 0 && b > 0 && s > 0)
cout << g << " " << s << " " << b << "\n";
else
cout << 0 << " " << 0 << " " << 0 << "\n";
}
}
|
#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
const int INF = 0x3f3f3f3f;
const long long LINF = 0x3f3f3f3f3f3f3f3f;
int n;
int arr[400100];
int main() {
int t;
scanf("%d", &t);
while (t--) {
scanf("%d", &n);
for (int i = 0; i < n; i++) scanf("%d", &arr[i]);
if (n == 1) {
puts("0 0 0");
continue;
}
int p = 0;
vector<int> vec;
int asum = 0;
for (int i = 0; i < n / 2; i++) {
if (arr[i] != arr[i + 1]) {
vec.push_back(i - p + 1);
asum += i - p + 1;
p = i + 1;
}
}
if (vec.size() < 3) {
puts("0 0 0");
continue;
}
int s = 1, sum = 0;
for (; s < vec.size(); s++) {
sum += vec[s];
if (sum > vec[0]) break;
}
if (s == vec.size()) {
puts("0 0 0");
continue;
}
int e = (int)vec.size() - 1;
sum = 0;
for (; e > 0; e--) {
sum += vec[e];
if (sum > vec[0]) break;
}
if (e == 0 || e <= s) {
puts("0 0 0");
continue;
}
printf("%d %d %d\n", vec[0], asum - vec[0] - sum, sum);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void solve() {
int n;
cin >> n;
vector<int> v;
int prev = -1;
for (int i = 1; i <= n; i++) {
int curr;
cin >> curr;
if (prev != -1 && prev != curr) v.emplace_back(i - 1);
prev = curr;
}
v.emplace_back(n + 1);
int sz = upper_bound(v.begin(), v.end(), n / 2) - v.begin();
sz--;
int g = v[0];
for (int i = sz; i > 0; i--) {
int b = v[i];
int s = *upper_bound(v.begin(), v.end(), g * 2);
if (g < s - g && g < b - s) {
cout << g << " " << s - g << " " << b - s << "\n";
return;
}
}
cout << "0 0 0\n";
return;
}
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int t;
cin >> t;
while (t--) solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long int mo = 1000000007;
long long int MO = 998244353;
long long int modpower(long long int a, long long int b) {
long long int ans = 1;
if (b == 0) {
return 1;
}
if (b % 2 == 1) {
ans = a;
}
long long int x = modpower(a, b / 2) % mo;
ans *= (x * x) % mo;
ans %= mo;
return ans;
}
int main() {
int k;
cin >> k;
while (k--) {
int n;
cin >> n;
int x, y;
cin >> x;
vector<long long int> cat;
long long int cum = 1, count = 1;
for (int i = 1; i < n; i++) {
cin >> y;
if (cum > n / 2) continue;
if (y != x) {
if (cum) cat.push_back(count);
count = 0;
}
x = y;
count++;
cum++;
}
cum = 0;
for (auto i : cat) {
cum += i;
}
if (cum < 5 || cat[0] * 3 + 2 > cum) {
cout << "0 0 0" << endl;
continue;
}
int g = 0, s = 0, b = 0;
g = cat[0];
int i = 1;
while (s <= g && i < cat.size()) {
s += cat[i];
i++;
}
while (i < cat.size()) {
b += cat[i];
i++;
}
if (s <= g || b <= g) {
cout << "0 0 0" << endl;
continue;
}
cout << g << " " << s << " " << b << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
stringstream output;
inline void eOP();
inline void solve() {
int n;
cin >> n;
int a, b, c;
vector<int> p(n);
for (int& e : p) {
cin >> e;
}
a = 1;
b = 0;
c = 0;
int i = 1;
for (; i < n; ++i) {
if (p[i] == p[i - 1]) {
++a;
} else {
break;
}
}
for (; i < n; ++i) {
if (b <= a) {
++b;
continue;
}
if (p[i] == p[i - 1]) {
++b;
} else {
break;
}
}
for (i = n / 2; i >= 0; --i) {
if (p[i] == p[i - 1]) {
} else {
break;
}
}
c = i - a - b;
if (a >= c) {
a = b = c = 0;
}
cout << a << " " << b << " " << c << "\n";
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
size_t t = 1;
cin >> t;
for (int i = 0; i < t; ++i) {
solve();
}
eOP();
}
inline void eOP() {
cout << output.str();
output.str(string());
exit(0);
}
|
#include <bits/stdc++.h>
using namespace std;
const long long inf = 0x3f3f3f3f3f3f3f3f;
int32_t main() {
long long t = 1;
cin >> t;
while (t--) {
long long n;
cin >> n;
map<long long, long long, greater<long long>> mp;
for (long long i = 0; i < n; i++) {
long long x;
cin >> x;
mp[x]++;
}
long long g = 0, s = 0, b = 0;
g = mp.begin()->second;
mp.erase(mp.begin()->first);
while (!mp.empty() && s <= g) {
s += mp.begin()->second;
mp.erase(mp.begin()->first);
}
while (!mp.empty() && b <= g) {
b += mp.begin()->second;
mp.erase(mp.begin()->first);
}
if (g < s && g < b && (g + s + b) <= n / 2) {
for (auto c : mp) {
if (g + s + b + c.second <= n / 2) {
b += c.second;
} else
break;
}
cout << g << ' ' << s << ' ' << b << '\n';
} else
cout << 0 << ' ' << 0 << ' ' << 0 << '\n';
}
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.