text stringlengths 49 983k |
|---|
#include <bits/stdc++.h>
using namespace std;
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int TC, i, j;
TC = 1;
cin >> TC;
while (TC--) {
long long int n, k, m;
cin >> n;
vector<int> a(n);
for (i = 0; i < n; i++) cin >> a[i];
map<int, int, greater<int>> mp;
for (i = 0; i < n / 2; i++) {
mp[a[i]]++;
}
if (a[n / 2 - 1] == a[n / 2]) mp.erase(a[n / 2]);
if ((long long int)mp.size() <= 2) {
cout << "0 0 0\n";
} else {
int g = 0, s = 0, b = 0, cnt = 0;
for (auto x : mp) {
if (cnt == 0)
g = x.second;
else if (g >= s)
s += x.second;
else
b += x.second;
cnt++;
}
if (g < s && g < b) {
cout << g << ' ' << s << ' ' << b << '\n';
} else
cout << "0 0 0\n";
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int INF = 2147483647;
const int N = 400005;
int z, n, tab[N], ind, ind2, i;
bool f;
int main() {
scanf("%d", &z);
while (z--) {
scanf("%d", &n);
for (i = 0; i < n; i++) scanf("%d", &tab[i]);
ind = -1;
for (i = 0; i < n / 2; i++)
if (tab[i] != tab[i + 1]) ind = i;
if (ind == -1) {
printf("0 0 0\n");
continue;
}
for (i = 0; i < n / 2; i++)
if (tab[i] != tab[i + 1]) {
ind2 = i;
break;
}
if (ind2 == ind) {
printf("0 0 0\n");
continue;
}
f = false;
for (i = ind2 + 1; i < n / 2; i++)
if (tab[i] != tab[i + 1] && i != ind && ind2 + 1 < i - ind2 &&
ind2 + 1 < ind - i) {
f = true;
printf("%d %d %d\n", ind2 + 1, i - ind2, ind - i);
break;
}
if (!f) printf("0 0 0\n");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int Max = 2e6 + 5;
int lst[Max];
int main() {
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
map<int, int, greater<int>> ma;
for (int i = 1; i <= n; i++) {
cin >> lst[i];
ma[lst[i]]++;
}
int s1 = ma[lst[1]], s2 = 0, s3 = 0;
for (auto i = ma.begin(); i != ma.end(); i++) {
if (ma.size() <= 3) break;
if (i == ma.begin()) i++;
if (s2 <= s1)
s2 += i->second;
else {
if (s1 + s2 + s3 + i->second > n / 2) break;
s3 += i->second;
}
}
if (s2 <= s1 || s3 <= s1)
cout << "0 0 0" << endl;
else
cout << s1 << " " << s2 << " " << s3 << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
const long long BINF = 9e8, LINF = 2e9, mod = 1e9 + 7, P = 179, Q = 1791791791;
const long long MAXN = 1e6;
long long a[MAXN];
long long pr[MAXN];
void solve() {
long long n;
cin >> n;
long long last = -1;
vector<long long> cnt;
for (long long i = 0; i < n; ++i) {
cin >> a[i];
if (last == a[i])
++cnt.back();
else
cnt.push_back(1), last = a[i];
}
if (cnt.size() < 3) {
cout << "0 0 0\n";
return;
}
long long g = cnt[0], s = 0, b = 0;
long long ptr = 1;
while (ptr < cnt.size() && s <= g) s += cnt[ptr++];
while (ptr < cnt.size() && 2 * (g + s + b + cnt[ptr]) <= n) b += cnt[ptr++];
if ((g + s + b) * 2 <= n && g && s && b && g < s && g < b)
cout << g << " " << s << " " << b << "\n";
else
cout << "0 0 0\n";
return;
}
signed main() {
ios_base::sync_with_stdio(false);
long long t;
cin >> t;
for (long long i = 0; i < t; ++i) solve();
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 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;
int a[MAX_N]{};
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::sync_with_stdio(false);
cin.tie(0);
int tt;
cin >> tt;
while (tt--) {
int n;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; ++i) {
cin >> p[i];
}
int T = n / 2 - 1;
if (p[T] == p[T + 1]) {
for (; T >= 0; --T) {
if (p[T] > p[T + 1]) break;
}
}
vector<int> res(3, 0);
int idx = 0;
for (int i = 0; i <= T; ++i) {
if (i > 0 && p[i] < p[i - 1]) {
if (idx == 0)
idx++;
else if (idx == 1) {
if (res[1] > res[0]) idx++;
}
}
res[idx]++;
}
int g = res[0], s = res[1], b = res[2];
if (g >= b || g >= s || b == 0) {
cout << "0 0 0\n";
} else {
cout << g << " " << s << " " << b << "\n";
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long a[400100];
signed main() {
;
cin.tie(0);
cout.tie(0);
ios_base::sync_with_stdio(0);
cout << fixed << setprecision(10);
long long t = 1;
cin >> t;
while (t--) {
long long n;
cin >> n;
for (long long i = 0; i < n; i++) {
cin >> a[i];
}
long long g = 0, s = 0, b = 0;
if (n < 10) {
cout << "0 0 0\n";
continue;
}
long long tmp = a[n / 2];
long long br = 0;
for (long long i = (n / 2 - 1); i >= 0; i--) {
if (a[i] != tmp) {
br = i;
break;
}
}
br++;
long long i;
for (i = 0; i < br; i++) {
g++;
if (a[i] != a[i + 1]) break;
}
i++;
i += g;
s = g;
for (; i < br; i++) {
s++;
if (a[i] != a[i + 1]) break;
}
i++;
i += g;
b = g;
for (; i < br; i++) {
b++;
};
if (s <= g || b <= g) {
cout << "0 0 0\n";
continue;
}
cout << g << " " << s << " " << b << "\n";
};
}
|
#include <bits/stdc++.h>
using namespace std;
signed 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 ar[n];
for (long long i = 0; i < n; i++) {
cin >> ar[i];
}
long long cnt = 1;
for (long long i = 1; i < n; i++) {
if (ar[i] == ar[0]) {
cnt++;
} else
break;
}
if (cnt + 2 > n / 2) {
cout << "0 0 0"
<< "\n";
continue;
}
long long cnt2 = 1;
for (long long i = cnt + 1; i < n; i++) {
if (ar[i] == ar[cnt]) {
cnt2++;
} else
break;
}
if (cnt2 <= cnt) {
for (long long i = cnt + cnt2; i < n; i++) {
cnt2++;
while (ar[i + 1] == ar[i] && i < n - 1) {
cnt2++;
i++;
}
if (cnt2 > cnt) {
break;
}
}
}
if (cnt2 + cnt + 1 > n / 2 || cnt2 <= cnt) {
cout << "0 0 0"
<< "\n";
continue;
}
long long cnt3 = 1;
for (long long i = cnt + cnt2 + 1; i < n; i++) {
if (ar[i] == ar[cnt + cnt2]) {
cnt3++;
} else
break;
}
if (cnt + cnt2 + cnt3 > n / 2) {
cout << "0 0 0"
<< "\n";
continue;
}
long long y = ar[n / 2];
long long x = cnt3;
for (long long i = n / 2 - 1; i >= cnt + cnt2 + x; i--) {
if (ar[i] != y) {
cnt3++;
}
}
if (cnt >= cnt2 || cnt >= cnt3) {
cout << "0 0 0"
<< "\n";
continue;
}
cout << cnt << " " << cnt2 << " " << cnt3 << "\n";
}
}
|
#include <bits/stdc++.h>
const int N = 100005;
const long double pi = 3.141592653;
const long long MOD = 1000000007;
using namespace std;
int dx[9] = {1, -1, 0, 0, 1, 1, -1, -1, 0};
int dy[9] = {0, 0, 1, -1, 1, -1, 1, -1, 0};
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int T;
cin >> T;
while (T--) {
int n, i, x, g = 0, s = 0, b = 0;
cin >> n;
vector<int> p(n);
for (i = 0; i < n; i++) cin >> p[i];
if (n < 10)
cout << 0 << " " << 0 << " " << 0;
else {
x = p[n / 2];
while (p.size() != n / 2) p.pop_back();
while (p.back() == x && p.size() > 0) p.pop_back();
if (p.size() < 5)
cout << 0 << " " << 0 << " " << 0;
else {
map<int, int, greater<int> > m;
for (i = 0; i < p.size(); i++) {
if (m.find(p[i]) != m.end())
m[p[i]]++;
else
m.insert({p[i], 1});
}
if (m.size() < 3)
cout << 0 << " " << 0 << " " << 0;
else {
if (m.begin()->second > (p.size() - 2) / 3)
cout << 0 << " " << 0 << " " << 0;
else {
g = m.begin()->second;
auto o = m.begin();
o++;
while (s <= g && o != m.end()) {
s = s + o->second;
o++;
}
b = p.size() - g - s;
if (b <= g)
cout << 0 << " " << 0 << " " << 0;
else
cout << g << " " << s << " " << b;
}
}
}
}
cout << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 400005;
int n, a[N];
int main() {
int t;
scanf("%d", &t);
while (t--) {
scanf("%d", &n);
for (int i = 1; i <= n; i++) scanf("%d", a + i);
int lim = n / 2;
while (lim > 0 and a[lim] == a[lim + 1]) lim--;
if (lim <= 0) {
printf("0 0 0\n");
continue;
}
int g = 1;
while (g < lim and a[g] == a[g + 1]) g++;
if (g + g + g + 1 >= lim) {
printf("0 0 0\n");
continue;
}
int s = g + 1;
while (s + g < lim and a[s + g] == a[s + g + 1]) s++;
int b = lim - s - g;
if (b <= g) {
printf("0 0 0\n");
continue;
}
printf("%d %d %d\n", g, s, b);
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
scanf("%d", &t);
for (int i = 0; i < t; ++i) {
int n, p, g = 0, s = 0, b = 0;
bool pos = true;
scanf("%d", &n);
map<int, int> mp;
for (int j = 0; j < n; ++j) {
scanf("%d", &p);
++mp[p];
}
g = (--mp.end())->second;
mp.erase(--mp.end());
while (s <= g) {
if (mp.empty()) {
pos = false;
break;
}
s += (--mp.end())->second;
mp.erase(--mp.end());
}
if (!pos) {
printf("0 0 0\n");
continue;
}
while (b <= g) {
if (mp.empty()) {
pos = false;
break;
}
b += (--mp.end())->second;
mp.erase(--mp.end());
}
if (!pos) {
printf("0 0 0\n");
continue;
}
if (2 * (g + s + b) > n) {
printf("0 0 0\n");
continue;
}
while (2 * (g + s + b + (--mp.end())->second) <= n) {
b += (--mp.end())->second;
mp.erase(--mp.end());
}
printf("%d %d %d\n", g, s, b);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
template <typename T>
void DEBUG(string label, T value) {
cerr << "[" << label << " = " << value << "]\n";
}
void solve() {
int n;
cin >> n;
vector<int> arr(n);
for (int i = 0; i < n; ++i) {
cin >> arr[i];
}
int mid = n / 2 - 1;
if (mid <= 2) {
cout << "0 0 0" << endl;
return;
}
int up = mid;
while (up >= 0 && arr[mid + 1] == arr[up]) {
up--;
}
int j = 1;
while (j <= up && arr[j] == arr[0]) {
j++;
}
if (j == up + 1) {
cout << "0 0 0" << endl;
return;
}
int gold = j;
int i = j;
int silver = 0;
while (i <= up) {
j = i + 1;
while (j <= up && arr[j] == arr[i]) {
j++;
}
int cnt = j - i;
silver += cnt;
i = j;
if (silver > gold) break;
}
if (silver <= gold || i == up + 1 || up - i + 1 <= gold) {
cout << "0 0 0" << endl;
return;
}
cout << gold << " " << silver << " " << up - i + 1 << endl;
}
int main(int argv, char **argc) {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t;
cin >> t;
while (t--) {
solve();
}
}
|
#include <bits/stdc++.h>
using namespace std;
int N, T, p[400100];
vector<int> v;
int main() {
cin.sync_with_stdio(false);
cin >> T;
while (T--) {
cin >> N;
v.clear();
int g = 0, s = 0, b = 0, cnt = 0;
for (int i = 1; i <= N; ++i) {
cin >> p[i];
if (p[i] != p[i - 1]) {
if (cnt) v.push_back(cnt);
cnt = 1;
} else {
++cnt;
}
}
if (cnt) v.push_back(cnt);
for (auto x : v) {
if (g == 0) {
g = x;
} else if (s <= g) {
s += x;
} else if (s + g + b + x <= N / 2) {
b += x;
} else {
break;
}
}
if (s + b + g > N / 2 || b <= g) {
g = s = b = 0;
}
cout << g << " " << s << " " << b << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 4E5 + 5, MX = 1E6 + 5;
int t, n, a[N], cnt[MX];
vector<int> ve;
void solve() {
int g = 0, b = 0, s = 0, cur = 0;
int le = 0, ri = 0, haf = 0, pt = 0;
ve.clear();
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
cnt[a[i]]++;
ve.push_back(a[i]);
}
ve.erase(unique(ve.begin(), ve.end()), ve.end());
for (int &v : ve) {
cur += cnt[v];
if (cur <= n / 2) {
haf = cur;
}
}
for (int i = 0; i < ve.size(); i++) {
le += cnt[ve[i]];
ri -= cnt[ve[i]];
while (ri <= le && le + ri < haf && pt < ve.size()) {
ri += cnt[ve[pt++]];
}
if (ri <= le) {
break;
}
g = le;
s = ri;
b = haf - le - ri;
break;
}
for (int i = 1; i <= n; i++) {
cnt[a[i]]--;
}
if (s > g && b > g && g > 0) {
cout << g << " " << s << " " << b << '\n';
} else {
cout << "0 0 0\n";
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cin >> t;
while (t--) {
solve();
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 4e5 + 314;
const int INF = 1e9;
const double PI = acos(-1);
const int MOD = 1e9 + 7;
const double eps = 1e-9;
int a[N];
void solve() {
int n;
cin >> n;
for (int i = 1; i <= n; ++i) {
cin >> a[i];
}
if (n < 6) {
cout << "0 0 0\n";
return;
}
int g, s, b;
g = s = b = 0;
int c = 0;
for (int i = n / 2; i >= 1; --i) {
if (a[i] != a[i + 1]) {
c = i;
break;
}
}
int it = 1;
int pt = a[it];
if (c < 3) {
cout << "0 0 0\n";
return;
}
while (a[it] == pt && it <= c) {
g++;
it++;
}
int lst = 0;
while (s <= g && it <= c) {
s++;
lst = a[it];
it++;
}
while (a[it] == lst && it <= c) {
s++;
it++;
}
while (it <= c) {
it++;
b++;
}
if (g >= b || g >= s || s == 0 || g == 0 || b == 0) {
cout << "0 0 0\n";
return;
}
cout << g << ' ' << s << " " << b << "\n";
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t = 1;
cin >> t;
while (t--) solve();
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int t, n, a, b, c, I = 0, p, k, M;
cin >> t;
for (int i = 0; i < t; i++) {
cin >> n;
int A[n];
for (int y = 0; y < n; y++) {
cin >> A[y];
}
a = 0;
b = 0;
c = 0;
p = 2000000000;
k = -1;
I = 0;
M = 0;
while (a + b + c <= n / 2) {
if (a + b + c == n / 2) {
if (k == 2 && p != A[I]) {
M = a + b + c;
}
break;
}
if (A[I] == p) {
if (k == 0) {
a++;
} else if (k == 1) {
b++;
} else {
c++;
}
} else {
if (k <= 1) {
if (k == 1 && b > a) {
k++;
} else if (k != 1) {
k++;
}
} else {
M = a + b + c;
}
if (k == 0) {
a++;
} else if (k == 1) {
b++;
} else {
c++;
}
p = A[I];
}
I++;
}
if (M == 0 || M - a - b <= a) {
cout << "0 0 0"
<< "\n";
} else {
cout << a << " " << b << " " << M - a - b << "\n";
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <class T>
T max(T a, T b, T c) {
return max(a, max(b, c));
}
void solve() {
long long n;
cin >> n;
long long p[400005];
for (auto(i) = 1; i < n + 1; i++) cin >> p[i];
if (n <= 5) {
cout << "0 0 0\n";
return;
}
long long mx = n / 2;
const long long element = p[mx];
if (p[mx + 1] == element) {
for (auto(i) = 1; i < n + 1; i++) {
if (p[i] == element)
break;
else
mx = i;
}
}
long long idx = 1;
const long long goldGroup = p[1];
long long g = 0;
while (p[idx] == goldGroup) {
++idx;
++g;
}
if (idx >= mx) {
cout << "0 0 0\n";
return;
}
long long silverGroup = p[idx];
long long s = 0;
while (g >= s or p[idx] == silverGroup) {
silverGroup = p[idx];
++idx;
s++;
}
if (idx >= mx) {
cout << "0 0 0\n";
return;
}
long long b = mx - s - g;
if (g >= b) {
cout << "0 0 0\n";
return;
}
cout << g << ' ' << s << ' ' << b << '\n';
}
int32_t main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
long long t;
cin >> t;
while (t--) solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
int all[n], cont = 1, g = 0, s = 0, b = 0;
vector<int> num;
cin >> all[0];
for (int i = 1; i < n; i++) {
cin >> all[i];
if (all[i] == all[i - 1])
cont++;
else {
num.push_back(cont);
cont = 1;
}
}
num.push_back(cont);
if (n >= 10) {
int siz = num.size(), best = n / 2;
g = num[0];
best -= g;
int cur = 1;
if (cur < siz)
while (best - num[cur] > 0 && cur + 1 < siz) {
if (s > g)
break;
else {
s += num[cur];
best -= num[cur];
cur++;
}
}
if (cur < siz)
while (best - num[cur] >= 0 && cur + 1 < siz) {
b += num[cur];
best -= num[cur];
cur++;
}
if (b == 0 || s == 0 || b <= g || s <= g) {
cout << 0 << ' ' << 0 << ' ' << 0 << '\n';
continue;
}
}
cout << g << ' ' << s << ' ' << b << '\n';
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
long long n;
cin >> n;
long long ans = 0;
long long a[n];
set<long long, greater<long long>> st;
map<long long, long long> mp;
for (int i = 0; i < n; i++) {
cin >> a[i];
mp[a[i]]++;
st.insert(a[i]);
}
long long g = 0, s = 0, b = 0;
long long z = n / 2;
long long y = 0;
long long j = 0;
for (auto x : st) {
if (j == 0) {
g = mp[x];
y = y + mp[x];
} else if (s <= g) {
s = s + mp[x];
y = y + mp[x];
} else {
if (y + mp[x] <= z) {
b = b + mp[x];
y = y + mp[x];
} else
break;
}
if (y > z) {
ans = -1;
break;
}
j++;
}
if (b <= g) ans = -1;
if (ans == -1)
cout << "0 0 0";
else
cout << g << " " << s << " " << b;
cout << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <typename T>
void __read(T& a) {
cin >> a;
}
template <typename T, typename... Args>
void __read(T& a, Args&... args) {
cin >> a;
__read(args...);
}
constexpr long long M7 = 1000000007ll;
constexpr long long M9 = 1000000009ll;
constexpr long long MFFT = 998244353ll;
template <class T>
void outv(T& a) {
for (auto& x : a) cout << x << ' ';
}
mt19937 rnd(static_cast<unsigned>(
chrono::steady_clock::now().time_since_epoch().count()));
template <class T>
void random_shuffle(T s, T e) {
shuffle(s, e, rnd);
};
static auto __super_speed__ = (ios_base::sync_with_stdio(0), cin.tie(0));
int32_t main() {
long long t;
__read(t);
while (t--) {
long long n;
__read(n);
map<long long, long long> cnt;
for (signed i = 0; i < (n); i++) {
long long q;
__read(q);
cnt[q]++;
}
long long g = cnt.rbegin()->second;
long long s = 0;
auto it = ++cnt.rbegin();
while (it != cnt.rend() && s <= g) {
s += it->second;
it++;
}
long long b = 0;
while (it != cnt.rend() && (g + s + b + it->second) * 2 <= n) {
b += it->second;
it++;
}
if (s <= g || b <= g || (s + b + g) * 2 > n) {
cout << "0 0 0\n";
} else {
cout << g << ' ' << s << ' ' << b << '\n';
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int Data[400100];
int T, N;
int main() {
scanf("%d", &T);
while (T--) {
int G = 1, S = 0, B = 0;
scanf("%d", &N);
for (register int i = 1; i <= N; ++i) scanf("%d", &Data[i]);
if (N < 10) {
printf("0 0 0\n");
continue;
}
int pos = 2;
while (pos <= N / 2 && Data[pos] == Data[pos - 1]) {
++G;
++pos;
}
if (Data[pos] == Data[pos - 1]) {
printf("0 0 0\n");
continue;
}
while (pos <= N / 2 && S <= G) {
++S;
++pos;
}
while (pos <= N / 2 && Data[pos] == Data[pos - 1]) {
++S;
++pos;
}
if (S <= G) {
printf("0 0 0\n");
continue;
}
while (pos <= N / 2 && B <= G) {
++B;
++pos;
}
while (pos <= N / 2 && Data[pos] != Data[N / 2 + 1]) {
++B;
++pos;
}
if (B <= G) {
printf("0 0 0\n");
continue;
}
if (G + S + B > N / 2) {
printf("0 0 0\n");
continue;
}
if (Data[G] == Data[G + 1]) {
printf("0 0 0\n");
continue;
}
if (Data[G + S] == Data[G + S + 1]) {
printf("0 0 0\n");
continue;
}
if (Data[G + S + B] == Data[G + S + B + 1]) {
printf("0 0 0\n");
continue;
}
if (G == 0 || S == 0 || B == 0) {
printf("0 0 0\n");
continue;
}
printf("%d %d %d\n", G, S, B);
}
return 0;
}
|
#include <bits/stdc++.h>
const int N = 4e5 + 54;
int n, m, l, c, x, a[N], a1, a2, a3, f, sum;
int main() {
for (scanf("%*d"); ~scanf("%d", &m);) {
n = -1, l = c = a1 = a2 = a3 = 0, f = 1;
for (int i = 1; i <= m; i++, c++) {
scanf("%d", &x);
if (x != l) a[++n] = c, l = x, c = 0;
}
a[++n] = c;
sum = a[1];
a1 = a[1];
for (int i = 2; i <= n; i++) {
if ((sum += a[i]) > m / 2) break;
(f ? a2 : a3) += a[i];
if (f && a2 > a1) f = 0;
}
if (a1 && a2 && a3 && a1 < a2 && a1 < a3)
printf("%d %d %d\n", a1, a2, a3);
else
puts("0 0 0");
}
}
|
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
int n, nm[1000006];
vector<int> v;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int t;
cin >> t;
while (t--) {
cin >> n;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
if (nm[x] == 0) v.push_back(x);
nm[x]++;
}
int ans[3] = {0, 0, 0}, md = 0, num = 0, gl = 0, tt = 1;
for (int i = 0; i < v.size(); i++) {
int x = v[i];
if (num + nm[x] <= n / 2 && tt) {
ans[md] += nm[x];
num += nm[x];
if (md == 0) {
gl += nm[x];
md++;
} else {
if (ans[md] > gl && md < 2) md++;
}
nm[x] = 0;
} else {
tt = false;
nm[x] = 0;
}
}
if (ans[0] == 0 || ans[1] == 0 || ans[2] == 0 || ans[0] >= ans[1] ||
ans[0] >= ans[2])
cout << 0 << ' ' << 0 << ' ' << 0 << endl;
else
cout << ans[0] << ' ' << ans[1] << ' ' << ans[2] << endl;
v.clear();
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
srand(time(0));
;
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) cin >> a[i];
if (n < 10)
cout << "0 0 0\n";
else {
int g = 0, s = 0, b = 0;
int x = n / 2;
while (x > 0 && a[x] == a[x - 1]) x--;
if (x == 0)
cout << "0 0 0\n";
else {
vector<int> v;
for (int i = 0; i < x; i++) {
int f = 1;
while (i < (x - 1) && a[i] == a[i + 1]) {
i++;
f++;
}
v.push_back(f);
}
int d = v.size();
int s[d];
s[0] = v[0];
for (int i = 1; i < d; i++) s[i] = s[i - 1] + v[i];
int g = 0, si = 0, b = 0;
for (int i = 0; i < d; i++) {
int r = s[i];
if (lower_bound(s + i, s + d, (2 * r) + 1) == s + d) break;
x = lower_bound(s + i, s + d, (2 * r) + 1) - s;
int q = s[x] - s[i];
int p = s[d - 1] - s[x];
if (p < r + 1) break;
if (r + q + p > g + si + b) {
g = r;
si = q;
b = p;
}
}
cout << g << " " << si << " " << b << endl;
}
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
long long t, n, i, a[404040], x[404004];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> t;
while (t--) {
cin >> n;
long long te = 1;
x[1] = -1;
x[2] = -1;
x[3] = -1;
long long ban = 0;
for (long long i = 1; i <= n; i++) cin >> a[i];
for (long long i = 1; (i * 2) <= n; i++) {
ban++;
if (a[i] != a[i + 1] && te == 1) {
x[te] = ban;
te++;
ban = 0;
} else if ((a[i] != a[i + 1]) && (ban > x[1])) {
x[te] = ban;
if (te == 2) {
te++;
ban = 0;
}
}
}
if ((x[3] == -1) || ((x[1] + x[2] + x[3]) * 2 > n)) {
x[1] = 0;
x[2] = 0;
x[3] = 0;
}
cout << x[1] << " " << x[2] << " " << x[3] << "\n";
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int tcc;
scanf("%d", &tcc);
while (tcc--) {
int n;
scanf("%d", &n);
int ln = 0x3f3f3f3f;
vector<int> v;
for (int i = 0; i < n; i++) {
int x;
scanf("%d", &x);
if (x == ln)
v[v.size() - 1]++;
else
v.push_back(1), ln = x;
}
int g = v[0], s = 0, b = 0;
int i;
for (i = 1; i < v.size() && s <= g; i++) s += v[i];
for (; i < v.size(); i++) {
if ((g + s + b + v[i]) * 2 > n) break;
b += v[i];
}
if (s <= g || b <= g || (g + s + b) * 2 > n) g = s = b = 0;
printf("%d %d %d\n", g, s, b);
}
}
|
#include <bits/stdc++.h>
using namespace std;
int dp[2][100000];
int main() {
int t;
cin >> t;
while (t--) {
int g = 0, s = 0, b = 0;
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int cnt = 1, id = 0;
for (int i = 0; i < n - 1; i++) {
id++;
if (a[i] == a[i + 1]) {
cnt++;
} else {
g = cnt;
break;
}
}
vector<int> res1;
int seg2 = 1;
for (int i = id; i < n - 1; i++) {
if (a[i] == a[i + 1]) {
seg2++;
} else {
res1.push_back(seg2);
seg2 = 1;
}
}
res1.push_back(seg2);
cnt = 1;
for (int i = 0; i < res1.size(); i++) {
if (s + res1[i] <= n / 2) {
s += res1[i];
}
if (s > g) {
break;
}
}
id += s;
cnt = 1;
vector<int> res;
int seg = 1;
for (int i = id; i < n - 1; i++) {
if (a[i] == a[i + 1]) {
seg++;
} else {
res.push_back(seg);
seg = 1;
}
}
res.push_back(seg);
for (int i = 0; i < res.size(); i++) {
if (g + s + b + res[i] <= n / 2) {
b += res[i];
} else {
break;
}
}
if (s == 0 || g == 0 || b == 0) {
cout << 0 << " " << 0 << " " << 0 << endl;
continue;
}
if (s <= g || b <= g) {
cout << 0 << " " << 0 << " " << 0 << endl;
continue;
;
}
if (s + g + b <= n / 2) {
cout << g << " " << s << " " << b << endl;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
void solve() {
long long n;
cin >> n;
vector<long long> q(n, 0);
for (long long i = 0; i < n; i++) {
cin >> q[i];
}
long long g = 1, s = 1, b = 0;
for (long long i = 1; i < n && q[i - 1] == q[i]; i++) {
g++;
}
for (long long i = g + 1; i < n && (s <= g || q[i - 1] == q[i]); i++) {
s++;
}
long long l = 10000000;
for (long long i = g + s; g + s + b <= n / 2 && i < n; i++) {
if (q[i] == q[i - 1]) {
l++;
} else {
l = 1;
}
b++;
}
b -= l;
if (b > g)
cout << g << ' ' << s << ' ' << b << "\n";
else {
cout << "0 0 0\n";
}
}
signed main() {
ios::sync_with_stdio(0);
cin.tie(0);
long long test = 0;
cin >> test;
while (test--) {
solve();
}
}
|
#include <bits/stdc++.h>
using namespace std;
ostream &operator<<(ostream &out, string str) {
for (char c : str) out << c;
return out;
}
template <class L, class R>
ostream &operator<<(ostream &out, pair<L, R> p) {
return out << "(" << p.first << ", " << p.second << ")";
}
template <class T>
auto operator<<(ostream &out, T a) -> decltype(a.begin(), out) {
out << "{";
for (auto it = a.begin(); it != a.end(); it = next(it))
out << (it != a.begin() ? ", " : "") << *it;
return out << "}";
}
void dump() { cerr << "\n"; }
template <class T, class... Ts>
void dump(T a, Ts... x) {
cerr << a << ", ";
dump(x...);
}
template <class T>
int size(T &&a) {
return a.size();
}
using LL = long long;
using PII = pair<int, int>;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int t;
cin >> t;
for (int it = 0; it < t; it++) {
int n;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; i++) cin >> p[i];
int g = 0, s = 0, b = 0;
while (g < n && p[g] == p[0]) g++;
while (g >= s) {
int l = g + s;
while (g + s < n && p[s + g] == p[l]) s++;
if (g + s == n) break;
}
while (g + s + b < n && p[s + g + b] == p[s + g]) b++;
if ((g + s + b) * 2 > n) {
cout << "0 0 0\n";
continue;
}
while (true) {
int pos = g + s + b;
int q = 0;
while (pos + q < n && p[pos + q] == p[pos]) q++;
if ((g + s + b + q) * 2 > n)
break;
else
b += q;
}
if (g < s && g < b && g && b && s)
cout << g << " " << s << " " << b << "\n";
else
cout << "0 0 0 \n";
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e6 + 10;
const long long INF = 1e17;
const long long p_pow = 257;
const int MAXX = 1e9;
const int modo = 1e9 + 7;
int t;
int n;
int a[maxn];
int last[maxn];
int main() {
cin >> t;
while (t--) {
int g, s, b;
g = s = b = 0;
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
last[a[i]] = i;
}
int l = 1;
while (last[a[l]] != l && l < n / 2) l++;
g += l;
l++;
int r = n / 2;
while (last[a[r]] != r && r > 0) r--;
while (b <= g) {
b++;
r--;
}
while (last[a[r]] != r && r > 0) {
b++;
r--;
}
if (r - l + 1 > g) {
s = r - l + 1;
} else {
g = s = b = 0;
}
printf("%d %d %d\n", g, s, b);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 4e5 + 10;
int p[N];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int T, n, i, k1, k2, k3;
cin >> T;
while (T--) {
cin >> n;
for (i = 1; i <= n; ++i) cin >> p[i];
for (k1 = 1; k1 <= n / 2; ++k1)
if (p[k1] > p[k1 + 1]) break;
if (k1 >= n / 2) {
cout << "0 0 0" << endl;
continue;
}
for (i = 2 * k1 + 1; i <= n / 2; ++i)
if (p[i] > p[i + 1]) break;
if (i >= n / 2) {
cout << "0 0 0" << endl;
continue;
}
k2 = i - k1;
for (i = n / 2; i >= 1; --i)
if (p[i] > p[i + 1]) break;
k3 = i - k1 - k2;
if (k1 > 0 && k1 < k2 && k1 < k3)
cout << k1 << " " << k2 << " " << k3 << endl;
else
cout << "0 0 0" << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAX = 4e5 + 5;
void swap(int &x, int &y) {
int tmp = x;
x = y;
y = tmp;
}
int p[MAX];
int counts[MAX];
int num, awardNum;
int current = -1;
void outputCount() {
for (int i = 0; i < num - 1; ++i) cout << counts[i] << " + ";
cout << counts[num - 1] << " = " << awardNum << endl;
}
void store(int storeNum) {
if (storeNum == current)
counts[num]++;
else
counts[++num] = 1;
awardNum++;
current = storeNum;
}
int main(int argc, char const *argv[]) {
int t;
int n;
int g, s, b;
cin >> t;
while (t--) {
cin >> n;
for (int i = 0; i < n; ++i) cin >> p[i];
num = awardNum = 0;
counts[0] = 0;
current = p[0];
int limit = p[n / 2];
for (int i = 0; p[i] > limit; ++i) store(p[i]);
if (num < 2)
cout << "0 0 0" << endl;
else {
g = counts[0];
s = 0;
b = awardNum - g;
for (int i = 1; i < num; ++i) {
s += counts[i];
b -= counts[i];
if (g < s && g < b) break;
}
if (g < s && g < b)
printf("%d %d %d\n", g, s, b);
else
cout << "0 0 0" << endl;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 400005, M = 1005;
const long long MOD = 1e9 + 7;
const double eps = 1e-9;
const double PI = acos(-1.0);
int tc, n, m, p[N], G, S, B;
int main() {
cin >> tc;
while (tc--) {
cin >> n;
for (int i = 0; i < n; i++) cin >> p[i];
G = 0, S = 0, B = 0;
G = 1;
while (G < n && p[G] == p[0]) G++;
if (G > n / 2) {
puts("0 0 0");
continue;
}
m = n / 2 - 1;
if (p[m] == p[m + 1]) {
while (m >= G && p[m] == p[m + 1]) m--;
}
if (m < G) {
puts("0 0 0");
continue;
}
bool f = 0;
for (int i = G; i <= m; i++) {
if (i - G > G && m - i + 1 > G && p[i - 1] > p[i]) {
S = i - G;
B = m - i + 1;
f = 1;
}
}
if (!f) G = S = B = 0;
cout << G << " " << S << " " << B << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
map<int, int> mp;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t, n;
cin >> t;
while (t--) {
cin >> n;
int *arr = new int[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
if (n < 5) {
cout << "0 0 0" << endl;
continue;
}
vector<int> v;
v.push_back(1);
int id = 0;
for (int i = 1; i < n; i++) {
if (arr[i] != arr[i - 1]) {
v.push_back(1);
id++;
} else {
v[id]++;
}
}
int m = v.size();
for (int i = 1; i < m; i++) {
v[i] += v[i - 1];
}
int answer = 0;
int ans[3] = {0, 0, 0};
for (int i = 0; i < m; i++) {
int g = v[i], s = 0, b = 0;
if (g > n / 2) {
continue;
}
int start = i + 1;
int end = m - 1;
int si;
while (start <= end) {
int mid = (start + end) / 2;
if (v[mid] - g <= g) {
start = mid + 1;
} else {
end = mid - 1;
si = mid - 1;
s = v[mid];
}
}
if (s > n / 2) {
continue;
}
start = si + 1;
end = m - 1;
while (start <= end) {
int mid = (start + end) / 2;
if (v[mid] <= n / 2) {
b = v[mid];
start = mid + 1;
} else {
end = mid - 1;
}
}
if (answer < b && b - s > g) {
answer = b;
ans[0] = g;
ans[1] = s - g;
ans[2] = b - s;
}
}
cout << ans[0] << " " << ans[1] << " " << ans[2] << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int T;
cin >> T;
for (int t = 0; t < T; t++) {
int n;
cin >> n;
int p[n];
for (int i = 0; i < n; ++i) {
cin >> p[i];
}
int g, s, b;
g = s = b = 0;
int m = n / 2;
int i = 0;
while (i < m) {
if (p[i] == p[0]) {
++g;
} else {
break;
}
++i;
}
while (i < m) {
if (s <= g || p[i] == p[i - 1]) {
++s;
} else {
break;
}
++i;
}
while (i < m) {
if (b <= g || p[i] == p[i - 1]) {
++b;
} else {
break;
}
++i;
}
if (g < s && g < b && p[i] != p[i - 1]) {
int count = 0;
int safe = 0;
while (i < m) {
++count;
++i;
if (p[i] != p[i - 1]) {
safe = count;
}
}
b += safe;
} else {
g = s = b = 0;
}
cout << g << " " << s << " " << b << endl;
}
}
|
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse2")
using namespace std;
bool isPowerOfTwo(long long int x) { return x && (!(x & (x - 1))); }
long long int Modular_Exponentiation(long long int x, long long int n,
long long int M) {
if (n == 0) return 1;
if (n % 2)
return (x * Modular_Exponentiation((x * x) % M, n / 2, M)) % M;
else
return (Modular_Exponentiation((x * x) % M, n / 2, M)) % M;
}
void solve() {
long long int n;
cin >> n;
long long int arr[n];
for (long long int i = 0; i < n; ++i) cin >> arr[i];
if (n < 10) {
cout << "0 0 0\n";
return;
}
long long int i = 0;
while (i < (n / 2) and arr[i] == arr[0]) i++;
long long int g = i;
if (g > (n - 4) / 6) {
cout << "0 0 0\n";
return;
}
long long int j = 2 * i;
while (j < (n / 2) and arr[j] == arr[2 * i]) j++;
long long int second = (j - i);
long long int b = 0;
long long int k = (n / 2) - 1;
if (arr[k] == arr[k + 1]) {
i = k;
while (i >= j and arr[i] == arr[k]) i--;
b = (i - j + 1);
} else
b = (n / 2 - j);
if (b <= g) {
cout << "0 0 0\n";
return;
}
cout << g << " " << second << " " << b << "\n";
}
int32_t main() {
std::ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int T = 1;
cin >> T;
while (T--) solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 4e5 + 10;
template <class T>
inline void read(T &res) {
char c;
T flag = 1;
while ((c = getchar()) < '0' || c > '9')
if (c == '-') flag = -1;
res = c - '0';
while ((c = getchar()) >= '0' && c <= '9') res = res * 10 + c - '0';
res *= flag;
}
long long min(long long x, long long y) { return x < y ? x : y; }
long long max(long long x, long long y) { return x > y ? x : y; }
const int N = 20;
void foid(int a[N]) {
int i = 0, j = N - 1, t = a[0];
while (i < j) {
while (i < j && a[i] % 2 == 1) i++;
while (i < j && a[j] % 2 == 0) j--;
if (i < j) swap(a[i], a[j]);
}
for (int i = 0; i < N; i++) {
printf("%d ", a[i]);
}
}
int a[maxn], pos[maxn], ans[maxn];
int main() {
int t, n;
cin >> t;
while (t--) {
cin >> n;
for (int i = 1; i <= n; i++) cin >> a[i];
int mid = n >> 1;
int g = 1, s = 1, b = 0;
for (int i = 2; i <= mid; i++) {
if (a[i] == a[i - 1])
g++;
else
break;
}
for (int i = g + 2; i <= mid; i++) {
if (a[i] == a[i - 1] || s <= g)
s++;
else
break;
}
b = mid - g - s;
if (a[mid] != a[mid + 1]) {
if (g < s && g < b)
cout << g << ' ' << s << ' ' << b << endl;
else
cout << "0 0 0" << endl;
} else {
for (int i = mid + 1; i >= g + s + 1; i--) {
if (a[i] == a[i - 1])
b--;
else
break;
}
if (g < s && g < b)
cout << g << ' ' << s << ' ' << b << endl;
else
cout << "0 0 0" << endl;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int t, n;
cin >> t;
while (t--) {
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; ++i) cin >> a[i];
int g = n, s = -1, b = -1;
int l = 0, r = n / 2 - 1;
while (l <= r) {
int m = l + (r - l) / 2;
if (a[m] >= a[0])
l = m + 1;
else
g = m, r = m - 1;
}
l = 0, r = n / 2 - 1;
while (l <= r) {
int m = l + (r - l) / 2;
if (a[m] > a[n / 2])
b = m, l = m + 1;
else
r = m - 1;
}
if (g >= b) {
cout << "0 0 0" << endl;
continue;
}
for (s = g * 2; s < b - g; s++) {
if (a[s] > a[s + 1]) break;
}
if (s >= b - g) {
cout << "0 0 0" << endl;
continue;
}
cout << g << " " << s - g + 1 << " " << b - s << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace ::std;
map<long long int, long long int> endmap;
long long int a[1000000];
vector<pair<long long int, long long int> > v;
int main() {
long long int i, j, k, t, n, m, x, y, siz, l;
cin >> t;
while (t--) {
cin >> n;
for (i = 0; i < n; i++) {
cin >> a[i];
}
v.clear();
for (i = 0; i < n;) {
long long int val = a[i];
j = i + 1;
while (j < n && a[j] == a[i]) {
j++;
}
v.push_back(make_pair(val, j - i));
i = j;
}
long long int maxMedals = n / 2;
long long int goldMedals = v[0].second;
long long int silverMedals = 0, bronzeMedals = 0;
j = 1;
siz = v.size();
while (j < siz) {
silverMedals += v[j].second;
if (silverMedals > goldMedals) break;
j++;
}
k = j + 1;
while (k < siz) {
bronzeMedals += v[k].second;
if (bronzeMedals > goldMedals) break;
k++;
}
long long int totalMedals = goldMedals + silverMedals + bronzeMedals;
l = k + 1;
while (l < siz) {
if (totalMedals + v[l].second > n / 2) {
break;
}
bronzeMedals += v[l].second;
totalMedals += v[l].second;
l++;
}
if (totalMedals <= n / 2 && goldMedals != 0 && silverMedals != 0 &&
bronzeMedals != 0)
cout << goldMedals << " " << silverMedals << " " << bronzeMedals << endl;
else
cout << "0 0 0\n";
}
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 i, j;
for (i = 1; i <= n; i++) scanf("%d", a + i);
int g = 0, s = 0, b = 0;
for (i = 1; i <= n / 2; i++) {
g++;
if (a[i] != a[i + 1]) break;
}
for (i = i + 1; i <= n / 2; i++) {
s++;
if (a[i] != a[i + 1] && s > g) break;
}
j = i;
for (i = n / 2; i >= 1; i--)
if (a[i] != a[i + 1]) break;
b = i - j;
if (b <= g || g == 0 || s == 0 || b == 0)
printf("0 0 0\n");
else
printf("%d %d %d\n", g, s, b);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 4e5 + 10;
int a[N];
int sum[N];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
vector<int> b;
for (int i = 0, j = 0; i < n; i = j) {
while (j < n && a[j] == a[i]) ++j;
b.push_back(j - i);
}
int m = b.size();
for (int i = 0; i < m; ++i) {
sum[i + 1] = b[i] + sum[i];
}
bool f = 0;
for (int i = m; i >= 3; --i) {
if (sum[i] <= n / 2) {
int p = upper_bound(sum + 2, sum + i, sum[1] * 2) - sum;
if (p != i) {
int g = sum[1], s = sum[p] - sum[1], b = sum[i] - sum[p];
if (g < b) {
f = 1;
cout << g << ' ' << s << ' ' << b << '\n';
}
break;
}
}
}
if (!f) cout << "0 0 0\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
const double pi = acos(-1.0);
int32_t main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long tt;
cin >> tt;
while (tt--) {
long long n;
cin >> n;
vector<long long> v;
map<long long, long long> f;
set<long long> st;
map<long long, long long> mp;
for (long long i = 0; i < n; i += 1) {
long long p;
cin >> p;
if (i < n / 2) {
st.insert(p);
f[p]++;
} else {
mp[p]++;
}
}
if (st.size() < 3) {
cout << "0 0 0\n";
} else {
for (auto& x : st) {
v.push_back(x);
}
sort(v.begin(), v.end(), greater<long long>());
long long g = 0, s = 0, b = 0;
g = f[v[0]];
for (long long i = 1; i < v.size(); i++) {
if (g + s + b + f[v[i]] <= n / 2 && s <= g && mp[v[i]] == 0) {
s += f[v[i]];
} else if (g + s + b + f[v[i]] <= n / 2 && mp[v[i]] == 0) {
b += f[v[i]];
}
}
if (g > 0 && s > 0 && b > 0 && g < s && g < b) {
cout << g << " " << s << " " << b << "\n";
} else {
cout << "0 0 0\n";
}
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long oo = 1e8;
const double pi = 3.1415926535897;
const double EPS = (1e-7);
int dcmp(double x, double y) { return fabs(x - y) <= EPS ? 0 : x < y ? -1 : 1; }
struct edge {
int from, to, w;
edge() {}
edge(int x, int y, int we) : from(x), to(y), w(we) {}
bool operator<(const edge &rhs) const { return w > rhs.w; }
};
const int N = 4e5 + 5;
int A[N];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
int lim = n / 2;
for (int i = 0; i < n; i++) {
cin >> A[i];
}
if (lim < 3) {
cout << "0 0 0\n";
continue;
}
vector<int> team;
for (int i = 0; i < lim; i++) {
team.push_back(A[i]);
}
int idx = lim - 1;
while (idx >= 0 && team[idx] == A[lim]) {
team.pop_back();
idx--;
}
int gold = 1;
idx = 1;
while (idx < ((int)((team).size())) && team[idx] == team[idx - 1]) {
gold++;
idx++;
}
int idx2 = ((int)((team).size())) - 2;
int bronz = 1;
while (idx2 >= 0 && team[idx2] == team[idx2 + 1] || bronz <= gold) {
bronz++;
idx2--;
}
int silv = idx2 - idx + 1;
if (gold + silv + bronz <= lim && gold > 0 && silv > 0 && bronz > 0 &&
gold < silv && gold < bronz)
cout << gold << " " << silv << " " << bronz << "\n";
else
cout << "0 0 0\n";
}
}
|
#include <bits/stdc++.h>
using namespace std;
long long int mul(long long int x, long long int y) {
long long int ans = 1;
while (y > 0) {
if (y & 1) ans = (ans * x) % 1000000007;
y /= 2;
x = (x * x) % 1000000007;
}
return ans;
};
long long int a[400005];
int main() {
long long int t;
scanf("%lld", &t);
while (t--) {
long long int n, i, g = 1, s = 0, b = 0;
scanf("%lld", &n);
for (i = 1; i <= n; i++) scanf("%lld", &a[i]);
for (i = 2; i <= n; i++)
if (a[i - 1] != a[i])
break;
else
++g;
if (g + 1 <= n) {
++s;
for (i = g + 2; i <= n; i++)
if (a[i - 1] == a[i] || s <= g)
++s;
else
break;
}
if (g + s + 1 <= n) {
++b;
for (i = g + s + 2; i <= n; i++)
if (a[i - 1] == a[i] || b <= g)
++b;
else
break;
}
if (g + s + b <= (n / 2) && g < s && g < b) {
long long int last = g + s + b;
for (i = g + s + b + 1; i <= (n / 2); i++)
if (i + 1 <= n && a[i] > a[i + 1]) last = i;
b += (last - (g + s + b));
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(NULL);
cout.tie(NULL);
;
long long int t;
cin >> t;
while (t--) {
long long int n;
cin >> n;
long long int p[n + 1], i, j, k;
for (i = 1; i <= n; i++) cin >> p[i];
i = n / 2;
if (p[n / 2] == p[n / 2 + 1]) {
while (i >= 1 && p[i] == p[i + 1]) i--;
}
k = i;
if (k == 0) {
cout << "0 0 0\n";
continue;
}
long long int gold = 0, sil = 0, brz = 0;
for (i = 1; i <= k - 1; i++) {
gold++;
if (p[i] != p[i + 1]) break;
}
for (i = i + 1; i <= k - 1; i++) {
sil++;
if (sil > gold && p[i] != p[i + 1]) break;
}
for (i = i + 1; i <= k; i++) brz++;
if (brz > 0 && gold < sil && gold < brz)
cout << gold << " " << sil << " " << brz << 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;
const int N = 400010;
int n;
int p[N];
int a[N], sa[N], hx[N], hy[N];
int findf(int x) {
int l = 1, r = hy[0];
while (l <= r) {
int mid = l + r >> 1;
if (hy[mid] > x)
r = mid - 1;
else if (hy[mid] < x)
l = mid + 1;
else
return mid;
}
}
int main() {
int T;
scanf("%d", &T);
while (T--) {
scanf("%d", &n);
for (int i = 1; i <= n; i++) scanf("%d", &p[i]);
for (int i = 1; i <= n; i++) a[i] = 0;
int m = 0;
for (int i = 1; i <= n; i++) {
a[m + 1]++;
if (i == n || p[i] != p[i + 1]) {
m++;
}
}
for (int i = 1; i <= m; i++) sa[i] = sa[i - 1] + a[i];
int g = 1, s = 1, b = 1, ans1 = 0, ans2 = 0, ans3 = 0;
while (sa[b] * 2 <= n) {
while (s <= m && sa[s] - sa[g] <= sa[g]) {
s++;
}
if (s > m) break;
b = s;
while (b <= m && sa[b] - sa[s] <= sa[g]) {
b++;
}
if (b > m || sa[b] * 2 > n) break;
while (b + 1 < m && sa[b + 1] * 2 <= n) b++;
ans1 = sa[g];
ans2 = sa[s] - sa[g];
ans3 = sa[b] - sa[s];
break;
}
printf("%d %d %d\n", ans1, ans2, ans3);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long pw(long long a, long long b) {
if (b == 0) return 1;
if (b % 2 == 1)
return (a * pw((a * a) % 1000000007, b / 2)) % 1000000007;
else
return (1 * pw((a * a) % 1000000007, b / 2)) % 1000000007;
}
void solve() {
int n;
cin >> n;
long long a[n];
for (int i = 0; i < n; i++) cin >> a[i];
int g = 0, s = 0, b = 0;
int f = 0;
int c = 1;
for (int i = 1; i < n; i++) {
if (a[i] == a[i - 1]) {
c++;
} else {
if (f == 0) {
g = c;
f = 1;
} else if (f == 1) {
s += c;
if (s > g) f = 2;
} else {
b += c;
}
if (g + s + b > (n / 2)) {
b -= c;
break;
}
c = 1;
}
}
if (g > 0 && b > 0 && s > 0 && g < b && g < s) {
cout << g << " " << s << " " << b << endl;
} else {
cout << "0 0 0" << endl;
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long t = 1;
cin >> t;
while (t--) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long t, n;
cin >> t;
while (t--) {
cin >> n;
long long a[n + 1];
unordered_map<long long, long long> m;
for (int i = 0; i < n; i++) {
cin >> a[i];
m[a[i]]++;
}
long long x[n + 1], k = 0;
for (auto i = m.begin(); i != m.end(); i++) {
x[k] = i->first;
k++;
}
sort(x, x + k);
if (n < 5)
cout << "0 0 0\n";
else {
long long g = 0, s = 0, b = 0, r = n / 2, h = 0;
g = m[x[k - 1]];
r = r - g;
long long flag = 0;
if (r <= 0) flag = 1;
for (int i = k - 2; i >= 0; i--) {
if (s <= g) {
s = s + m[x[i]];
r = r - m[x[i]];
if (r < 0) {
flag = 1;
break;
}
} else {
b = b + m[x[i]];
r = r - m[x[i]];
if (r < 0) {
if (b - m[x[i]] > g) {
b = b - m[x[i]];
break;
} else {
flag = 1;
break;
}
}
}
}
if (flag == 0) {
cout << g << " " << s << " " << b << "\n";
} else
cout << "0 0 0\n";
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long t;
cin >> t;
while (t--) {
long long n;
cin >> n;
vector<long long> a(n);
unordered_map<long long, long long> freq;
for (long long i = 0; i < n; i++) {
cin >> a[i];
freq[a[i]]++;
}
if (n < 4) {
cout << "0 0 0\n";
continue;
}
long long g = freq[a[0]], s = 0, b = 0;
long long i = freq[a[0]];
while (i < n - 2 && s <= g) {
s += freq[a[i]];
i += freq[a[i]];
}
while (i < n - 1 && g + s + b <= n / 2) {
b += freq[a[i]];
i += freq[a[i]];
}
if (g + s + b > n / 2) {
b -= freq[a[i - 1]];
}
if (g + s + b <= n / 2 && g < s && g < b && g > 0 && s > 0 && b > 0) {
cout << g << " " << s << " " << b << "\n";
} else {
cout << "0 0 0\n";
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 4e5 + 5;
int n;
int p[maxn];
int main() {
ios::sync_with_stdio(false);
int T;
cin >> T;
while (T--) {
cin >> n;
for (int i = 1; i <= n; ++i) cin >> p[i];
p[n + 1] = -1;
p[0] = -1;
int g = 0, s = 0, b = 0;
for (int i = 1; i <= n; ++i) {
if (p[i] != p[i + 1]) {
g = i;
break;
}
}
for (int i = g + 1; i <= n; ++i)
if (i - g > g) {
if (p[i] != p[i + 1]) {
s = i;
break;
}
}
for (int i = s + 1; i <= n; ++i) {
if (p[i] != p[i + 1]) {
b = i;
break;
}
}
if (g > n / 2 || s > n / 2 || b > n / 2) {
puts("0 0 0");
continue;
}
b = n / 2 - s;
for (int i = n / 2 + 1; i; --i) {
if (p[i] != p[i - 1]) {
break;
}
--b;
}
s -= g;
if (g >= s || g >= b) {
puts("0 0 0");
continue;
}
printf("%d %d %d\n", g, s, b);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 400005;
int n, p[N], s1, s2, s3;
void solve() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) scanf("%d", &p[i]), s1 = (p[i] == p[1] ? i : s1);
int pos = s1 * 2 + 1;
s2 = pos;
for (int i = pos; i <= n; i++) s2 = (p[i] == p[pos] ? i : s2);
pos = s2 + s1 + 1;
s3 = pos;
for (int i = pos; i <= n; i++) s3 = (p[i] == p[pos] ? i : s3);
if (s3 > n / 2) return puts("0 0 0"), void();
pos = s3 + 1;
int q = p[n / 2 + 1];
for (int i = s3; i <= n; i++)
if (p[i] > q) s3 = i;
printf("%d %d %d\n", s1, s2 - s1, s3 - s2);
}
int main() {
int T;
scanf("%d", &T);
while (T--) solve();
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int T;
cin >> T;
for (int d = 0; d < T; d++) {
int n;
cin >> n;
if (n < 6) {
int k;
for (int i = 0; i < n; i++) {
cin >> k;
}
cout << "0 0 0" << endl;
} else {
vector<int> a(n);
map<int, int> m;
for (int i = 0; i < n; i++) {
cin >> a[i];
m[a[i]]++;
}
int k1 = m[a[0]], k2 = 0, k3 = 0;
int k = m[a[0]];
bool flag = true;
for (int i = 1; i < n; i++) {
if (a[i] == a[i - 1])
continue;
else {
if (flag) {
k2 += m[a[i]];
if (k1 < k2) flag = false;
}
k += m[a[i]];
if (k > n / 2) {
k3 = k - m[a[i]] - m[a[0]] - k2;
break;
}
}
}
if (k1 >= k2 || k1 >= k3)
cout << "0 0 0" << endl;
else
cout << k1 << " " << k2 << " " << k3 << endl;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 4e5 + 5;
int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); }
int n, m;
int a[N];
int main() {
std::ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
int flag;
for (int i = 1; i <= n; i++) {
cin >> a[i];
if (i == (n / 2) + 1) flag = a[i];
}
int g = 1, s = 0, b = 0;
int f = n / 2;
for (int i = 2; i <= f; i++) {
if (a[i] == a[i - 1])
g++;
else
break;
}
for (int i = g + 1; i <= f; i++) {
if (a[i] == flag)
break;
else if (a[i] == a[i - 1] || i - g - 1 <= g)
s++;
else
break;
}
for (int i = g + s + 1; i <= f; i++) {
if (a[i] == flag)
break;
else
b++;
}
if (!g || !s || !b || g >= s || g >= b)
cout << "0 0 0" << endl;
else
cout << g << ' ' << s << ' ' << b << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long N = 4e5 + 5;
long long n, t, p[N], g, s, b;
signed main() {
cin >> t;
while (t--) {
g = 0, s = 0, b = 0;
cin >> n;
for (long long i = 1; i <= n; i++) {
cin >> p[i];
}
g = 1;
long long ptr = 2;
for (; ptr <= n / 2; ptr++) {
if (p[ptr] != p[ptr - 1]) {
break;
}
g++;
}
for (; ptr <= n / 2; ptr++) {
if (s > g && p[ptr] != p[ptr - 1]) {
break;
}
s++;
}
if (s <= g) {
cout << 0 << " " << 0 << " " << 0 << endl;
continue;
}
long long incr = 0;
for (; ptr <= n / 2; ptr++) {
if (p[ptr] != p[ptr - 1]) {
b += incr;
incr = 0;
}
incr++;
}
if (p[n / 2 + 1] != p[n / 2]) {
b += incr;
}
if (b <= g) {
cout << 0 << " " << 0 << " " << 0 << endl;
continue;
}
cout << g << " " << s << " " << b << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
template <class T>
void dbs(string str, T t) {
cerr << str << " : " << t << "\n";
}
template <class T, class... S>
void dbs(string str, T t, S... s) {
int idx = str.find(',');
cerr << str.substr(0, idx) << " : " << t << ",";
dbs(str.substr(idx + 1), s...);
}
template <class S, class T>
ostream& operator<<(ostream& os, const pair<S, T>& p) {
return os << "(" << p.first << ", " << p.second << ")";
}
template <class T>
void debug(T a, T b) {
cerr << "[";
for (T i = a; i != b; ++i) {
if (i != a) cerr << ", ";
cerr << *i;
}
cerr << "]\n";
}
void solve() {
int n;
cin >> n;
vector<pair<int, int>> problemsSolved;
for (int i = 0; i < n; ++i) {
int p;
cin >> p;
if (problemsSolved.empty() or problemsSolved.back().first != p) {
problemsSolved.push_back({p, 0});
}
++problemsSolved.back().second;
}
int g = problemsSolved[0].second;
int s = 0;
int b = 0;
int silverIdx = -1;
for (int i = 1; i < problemsSolved.size(); ++i) {
s += problemsSolved[i].second;
if (s > g) {
silverIdx = i;
break;
}
}
for (int i = silverIdx + 1; i < problemsSolved.size(); ++i) {
int extra = problemsSolved[i].second;
if (2 * (g + s + b + extra) <= n) {
b += extra;
} else {
break;
}
}
if (g >= s or g >= b or (g + s + b) * 2 > n) {
g = s = b = 0;
}
cout << g << " " << s << " " << b << "\n";
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int T;
cin >> T;
while (T--) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Pii = pair<int, int>;
using Vi = vector<int>;
void run();
int main() {
cin.sync_with_stdio(0);
cin.tie(0);
cout << fixed << setprecision(18);
run();
return 0;
}
int uplg(int n) { return 32 - __builtin_clz(n); }
int uplg(ll n) { return 64 - __builtin_clzll(n); }
void run() {
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
Vi cnt;
int last = -1;
for (int i = (0); i < (n); i++) {
int p;
cin >> p;
if (last != p) cnt.push_back(0);
cnt.back()++;
last = p;
}
int pref = 0;
for (int i = (0); i < (int((cnt).size())); i++) {
pref += cnt[i];
if (pref > n / 2) {
cnt.resize(i);
break;
}
}
if (int((cnt).size()) < 3) {
cout << "0 0 0\n";
continue;
}
int g = cnt[0], s = 0, b = 0;
int i = 1;
for (; i < int((cnt).size()) && s <= g; i++) {
s += cnt[i];
}
for (; i < int((cnt).size()); i++) {
b += cnt[i];
}
if (g <= 0 || s <= 0 || b <= 0 || g >= s || g >= b) {
cout << "0 0 0\n";
continue;
}
cout << g << ' ' << s << ' ' << b << '\n';
}
}
|
#include <bits/stdc++.h>
using namespace std;
void logf(istream_iterator<string> it) {}
template <typename T, typename... Args>
void logf(istream_iterator<string> it, T a, Args... args) {
cout << *it << " = " << a << endl;
logf(++it, args...);
}
const double PI = acos(-1);
void solve() {
int n;
cin >> n;
;
vector<int> p(n);
for (long long i = 0; i < (n); i++) {
cin >> p[i];
};
vector<int> pp;
for (int i = 0; i < n; i++) {
pp.push_back(1);
while (i < n - 1 && p[i] == p[i + 1]) {
pp.back()++;
i++;
}
}
int g = pp[0];
int s = 0;
int i = 1;
while (i < pp.size() && s <= g) {
s += pp[i];
i++;
}
int b = 0;
while (i < pp.size()) {
b += pp[i];
i++;
if (i < pp.size() && b + pp[i] + g + s > n / 2) break;
}
if (s <= g || b <= g || g + s + b > n / 2)
cout << "0 0 0" << endl;
else
cout << g << " " << s << " " << b << endl;
}
int main() {
cin.tie(nullptr);
std::ios::sync_with_stdio(false);
int t;
cin >> t;
;
while (t--) solve();
}
|
#include <bits/stdc++.h>
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("O3")
using namespace std;
const double eps = 1e-9;
const double pi = acos(-1.0);
const long long inf = (2e9 + 7);
const long long mod = 1e9 + 7;
const long long MAXN = 1e5 + 5;
int32_t main() {
ios_base::sync_with_stdio(0);
cout << fixed << setprecision(10);
cin.tie(0);
long long t;
cin >> t;
while (t--) {
long long n;
cin >> n;
vector<long long> p(n);
for (long long i = 0; i < n; ++i) cin >> p[i];
long long g = 0, s = 0, b = 0;
long long q = p[n / 2];
long long idx = 0;
long long i = 0;
n /= 2;
while (i < n && p[i] == p[0]) {
++g;
++i;
}
idx = i;
while (i < n && s <= g) {
while (i < n && p[i] == p[idx]) {
++s;
++i;
}
idx = i;
}
while (i < n && p[i] != q) {
++i;
++b;
}
if (g >= s || g >= b || b == 0 || s == 0 || g == 0) {
cout << "0 0 0" << endl;
} else
cout << g << ' ' << s << ' ' << b << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
string to_string(const string& s) { return '"' + s + '"'; }
string to_string(const bool b) { return (b ? "true" : "false"); }
string to_string(const char* s) { return to_string((string)s); }
string to_string(const char c) {
string s = "'";
s += c;
s += "'";
return s;
}
template <class T, class U>
string to_string(const pair<T, U>& p) {
string s = "(";
s += to_string(p.first);
s += ", ";
s += to_string(p.second);
s += ")";
return s;
}
template <class T>
string to_string(const T& a) {
bool first = true;
string s = "{";
for (const auto& x : a) {
if (!first) {
s += ", ";
}
first = false;
s += to_string(x);
}
s += "}";
return s;
}
void debug_out() { cerr << '\n'; }
template <class Head, class... Tail>
void debug_out(Head head, Tail... tail) {
cerr << ' ' << to_string(head);
debug_out(tail...);
}
using ll = long long;
using ld = long double;
const int inf = 1e9 + 100;
const ll inf64 = 7e18l;
void solve() {
int n;
cin >> n;
map<int, int> mp;
for (int i = 0; i < n; ++i) {
int t;
cin >> t;
++mp[t];
}
if ((int)mp.size() < 3) {
cout << "0 0 0\n";
return;
}
auto it = mp.end();
int gold = (*(--it)).second;
int silver = 0;
while (silver <= gold) {
if (it == mp.begin()) {
cout << "0 0 0\n";
return;
}
silver += (*(--it)).second;
}
int bronze = 0;
while (bronze <= gold) {
if (it == mp.begin()) {
cout << "0 0 0\n";
return;
}
bronze += (*(--it)).second;
}
int sum = gold + silver + bronze;
while (sum <= n / 2) {
if (it == mp.begin()) {
break;
}
int val = (*(--it)).second;
if (sum + val > n / 2) {
break;
}
bronze += val;
sum += min(n / 2 - sum, val);
;
}
if (sum > n / 2) {
cout << "0 0 0\n";
return;
} else {
cout << gold << ' ' << silver << ' ' << bronze << '\n';
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(20);
int t;
cin >> t;
while (t--) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int T, n, p[400005], sum, ans1, ans2, i;
int main() {
cin >> T;
while (T--) {
cin >> n;
for (i = 1; i <= n; ++i) {
cin >> p[i];
}
ans1 = ans2 = sum = 0;
for (i = n / 2; i; --i) {
if (p[i] != p[i + 1]) {
sum = i;
break;
}
}
for (i = 1; i < (sum + 1) / 3; ++i) {
if (p[i] != p[i + 1]) {
ans1 = i;
break;
}
}
for (i = ans1 * 2 + 1; i < sum - ans1; ++i) {
if (p[i] != p[i + 1]) {
ans2 = i;
break;
}
}
sum -= ans2;
ans2 -= ans1;
if (ans1 > 0 && ans2 > 0 && sum > 0 && ans1 < ans2 && ans1 < sum &&
ans1 + ans2 + sum <= n / 2 && p[ans1] > p[ans1 + 1] &&
p[ans2 + ans1] > p[ans2 + ans1 + 1])
cout << ans1 << " " << ans2 << " " << sum << "\n";
else
cout << 0 << " " << 0 << " " << 0 << "\n";
}
}
|
#include <bits/stdc++.h>
using namespace std;
int cnt(vector<int>& a, int& i) {
int curr = a[i];
int ret = 0;
while (i < a.size() && a[i] == curr) {
++ret;
++i;
}
return ret;
}
int f() {
int n;
cin >> n;
vector<int> a(n);
for (int& i : a) cin >> i;
vector<int> ret(3, 0);
int i = 0;
ret[0] += cnt(a, i);
if (i > n / 2) return -1;
while (i < n / 2 && ret[1] <= ret[0]) {
int t = cnt(a, i);
if (i <= n / 2) {
ret[1] += t;
}
}
if (ret[1] <= ret[0]) return -1;
while (i < n / 2) {
int t = cnt(a, i);
if (i <= n / 2) {
ret[2] += t;
}
}
if (ret[2] <= ret[0]) return -1;
for (int i : ret) {
cout << i << " ";
}
cout << '\n';
return 0;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int T;
cin >> T;
while (T--) {
if (f()) {
cout << "0 0 0\n";
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int v[400010];
int main() {
FILE *fin = stdin;
FILE *fout = stdout;
int t, n, i, g, s, b, start, poz;
fscanf(fin, "%d", &t);
for (; t; t--) {
fscanf(fin, "%d", &n);
for (i = 1; i <= n; i++) fscanf(fin, "%d", &v[n - i + 1]);
g = 1;
i = n - 1;
while (i) {
if (v[i] == v[i + 1])
g++;
else
break;
i--;
}
if (i == 0 || g > n / 2) {
fprintf(fout, "0 0 0\n");
continue;
}
start = n / 2 + n % 2;
while (v[start] == v[start + 1]) start++;
poz = n - g;
s = 0;
while ((s <= g || v[poz] == v[poz + 1]) && poz > start) {
s++;
poz--;
}
b = poz - start;
if (poz <= start || g >= b) {
fprintf(fout, "0 0 0\n");
continue;
}
fprintf(fout, "%d %d %d\n", g, s, b);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, k, c, g, s, b, i, t, si, j;
cin >> t;
while (t--) {
cin >> n;
long long int a[n];
for (i = 0; i < n; i++) cin >> a[i];
g = s = b = 0;
vector<pair<long long int, long long int> > v;
k = a[0];
c = 1;
for (i = 1; i < n; i++) {
if (a[i] == k)
c++;
else {
v.push_back(make_pair(k, c));
k = a[i];
c = 1;
}
}
v.push_back(make_pair(k, c));
si = v.size();
g = v[0].second;
s = b = 0;
for (i = 1; i < si; i++) {
s = s + v[i].second;
if (s > g) break;
}
for (j = i + 1; j < si; j++) {
if (g + s + b + v[j].second <= n / 2)
b = b + v[j].second;
else
break;
}
if (g < s && g < b && (g + s + b) <= n / 2)
cout << g << " " << s << " " << b << "\n";
else
cout << "0 0 0\n";
}
return 0;
}
|
#include <bits/stdc++.h>
template <class T>
inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T>
inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
using namespace std;
void solve() {
int n;
cin >> n;
vector<int> p(n);
vector<int> v;
for (int i = 0; i < n; i++) cin >> p[i];
for (int i = 0; i < n - 1; i++) {
if (p[i] > p[i + 1]) v.push_back(i + 1);
}
v.push_back(n);
int a = 0, b = 0, c = 0;
for (int x : v) {
auto pt1 = lower_bound(v.begin(), v.end(), x * 2 + 1);
if (pt1 == v.end()) continue;
auto pt2 = lower_bound(v.begin(), v.end(), n / 2 + 1);
if (pt2 == v.begin()) continue;
pt2--;
if ((*pt2) - (*pt1) <= x) continue;
int a_ = x;
int b_ = (*pt1) - x;
int c_ = (*pt2) - (*pt1);
if (a_ + b_ + c_ > n / 2) continue;
if (a + b + c < a_ + b_ + c_) {
a = a_;
b = b_;
c = c_;
}
}
cout << a << ' ' << b << ' ' << c << endl;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << setprecision(10) << fixed;
int t;
cin >> t;
while (t--) solve();
}
|
#include <bits/stdc++.h>
using namespace std;
int a[400400], b[400400];
int main() {
int t;
scanf("%d", &t);
while (t--) {
int n;
scanf("%d", &n);
int G, S, B;
for (int i = 1; i <= n; i++) scanf("%d", a + i), b[i] = a[i];
reverse(b + 1, b + n + 1);
G = n - (lower_bound(b + 1, b + n + 1, b[n]) - b) + 1;
if (G * 2 >= n) {
puts("0 0 0");
continue;
}
S = n - (lower_bound(b + 1, b + n + 1, b[n - 2 * G]) - b) + 1 - G;
if (2 * G + S >= n) {
puts("0 0 0");
continue;
}
B = n - (lower_bound(b + 1, b + n + 1, b[n - 2 * G - S]) - b) + 1 - G - S;
if (G + S + B > n / 2 or G >= S or G >= B) {
puts("0 0 0");
continue;
}
int r = (n + 1) / 2;
int it = upper_bound(b + 1, b + n + 1, b[r]) - b;
B = n - it + 1 - S - G;
printf("%d %d %d\n", G, S, B);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int32_t mod = 1e9 + 7;
void solveCase() {
long long n = 0;
cin >> n;
priority_queue<long long> pq;
for (long long i = 0; i < n; i++) {
long long x = 0;
cin >> x;
pq.push(x);
}
long long medals[3], i = 0, last = -1, total = 0, rollback = 0;
memset(medals, 0, sizeof(medals));
while (!pq.empty() && total < n / 2) {
long long tp = pq.top();
pq.pop();
if ((i == 0 || (i == 1 && medals[i] > medals[0])) && last > tp) i++;
if (i == 2) {
if (last > tp) rollback = 1;
if (last == tp) rollback++;
}
medals[i]++, total++, last = tp;
}
if (pq.top() == last) medals[2] -= rollback, total -= rollback;
if (medals[0] <= 0 || medals[1] <= 0 || medals[2] <= 0 ||
medals[2] <= medals[0]) {
cout << "0 0 0\n";
return;
}
for (long long x : medals) cout << x << ' ';
cout << '\n';
}
int32_t main() {
ios::sync_with_stdio(false), cin.tie(NULL);
long long t = 0;
cin >> t;
while (t--) solveCase();
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int q;
cin >> q;
for (int loop = 0; loop < (q); ++loop) {
int n;
cin >> n;
int a[n];
for (int i = 0; i < (n); ++i) cin >> a[i];
vector<pair<int, int> > v;
for (int i = 0; i < (n); ++i) {
if (i == 0) {
v.push_back(pair<int, int>(a[i], 1));
} else {
if (v[v.size() - 1].first == a[i]) {
v[v.size() - 1].second++;
} else {
v.push_back(pair<int, int>(a[i], 1));
}
}
}
int cnt = 0;
int now = 0;
while (cnt + v[now].second <= n / 2) {
cnt += v[now].second;
now++;
}
if (now < 3) {
cout << "0 0 0" << endl;
} else {
int x = v[0].second;
cnt -= x;
int sum = 0;
int flag = 0;
for (int i = 1; i < now; ++i) {
sum += v[i].second;
if (x < sum && x < cnt - sum) {
cout << x << ' ' << sum << ' ' << cnt - sum << endl;
flag = 1;
break;
}
}
if (flag == 0) {
cout << "0 0 0" << endl;
}
}
}
return 0;
}
|
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
int add(int a, int b) {
long long x = a + b;
if (x >= 1000000007) x -= 1000000007;
if (x < 0) x += 1000000007;
return x;
}
long long mul(long long a, long long b) { return (a * b) % 1000000007; }
long long pw(long long a, long long b) {
long long ans = 1;
while (b) {
if (b & 1) ans = (ans * a) % 1000000007;
a = (a * a) % 1000000007;
b >>= 1;
}
return ans;
}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
long long rand_seed() {
long long a = rng();
return a;
}
int t, n, v[500002], va[5];
int chk(int mid) {
int pa = 1;
while (pa <= mid && v[pa] == v[1]) ++pa;
int gg = pa - 1;
int npa = 2 * gg + 1;
pa = npa;
while (pa <= mid && v[npa] == v[pa]) ++pa;
int ss = (pa - 1) - gg;
npa = pa + gg;
pa = npa;
int bb = 0;
while (pa <= mid) {
while (v[npa] == v[pa]) ++pa;
if ((pa - 1) <= mid) bb = (pa - 1) - (gg + ss);
npa = pa;
}
if (gg >= ss || gg >= bb) return 0;
if (gg + ss + bb > mid) return 0;
va[1] = gg;
va[2] = ss;
va[3] = bb;
return 1;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> t;
for (; t; --t) {
cin >> n;
for (int i = 1; i <= n; ++i) cin >> v[i];
chk(n / 2);
cout << va[1] << " " << va[2] << " " << va[3] << '\n';
va[1] = va[2] = va[3] = 0;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
string beautiful_regional_contest() {
int size;
string result;
cin >> size;
int input[size];
int mid = size / 2;
for (int i = 0; i < size; i++) {
cin >> input[i];
}
if (size < 10 || input[0] == input[mid]) return "0 0 0";
unsigned int gold, silver, bronze;
int gold_c = 0, silver_c = 0, bronze_c = 0;
int mid_b = mid;
while (input[mid_b] == input[mid - 1]) {
mid--;
}
int max_num = input[0];
for (int i = 0; i < mid; i++) {
if (input[i] == max_num) {
gold_c++;
gold = input[i];
}
}
for (int i = gold_c; i < (mid - (gold_c + 1)); i++) {
if (input[i] == input[mid]) return "0 0 0";
if (gold_c > 0 && input[i] <= gold && input[i] > input[mid - gold_c - 1]) {
silver_c++;
silver = input[i];
}
}
for (int i = gold_c + silver_c; i < mid; i++) {
if (input[i] == input[mid]) return "0 0 0";
if (silver_c > 0 && input[i] <= silver) {
bronze_c++;
}
}
if (gold_c < silver_c && gold_c < bronze_c)
result.append(to_string(gold_c) + " " + to_string(silver_c) + " " +
to_string(bronze_c));
else
result = "0 0 0";
return result;
}
int main() {
int size;
cin >> size;
for (int i = 0; i < size; i++) {
cout << beautiful_regional_contest() << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
void oor(int size, int iter) {
if (iter >= size) {
throw 5;
}
}
void print(int* scores, int ppl) {
int i = 0;
int gold = scores[i];
int golds = 0, silvers = 0;
while (scores[i] == gold) {
golds++;
i++;
oor(ppl, i);
}
int silver = scores[i];
while (scores[i++] == silver) {
silvers++;
oor(ppl, i);
}
int bronzes = (ppl / 2) - (golds + silvers);
while (golds >= silvers) {
silvers++;
bronzes--;
}
i = golds + silvers - 1;
oor(ppl, i + 1);
while (scores[i] == scores[i + 1]) {
silvers++;
bronzes--;
i++;
oor(ppl, i + 1);
}
i = (ppl / 2);
while (scores[i] == scores[i - 1]) {
bronzes--;
i--;
}
if (golds + silvers + bronzes > ppl / 2) {
throw 3;
} else if (golds >= silvers || golds >= bronzes) {
throw 1;
} else if (golds > 0 && silvers > 0 && bronzes > 0) {
std::cout << golds << " " << silvers << " " << bronzes << std::endl;
} else {
throw 2;
}
}
int main() {
int tests, ppl;
cin >> tests;
for (int x = 0; x < tests; ++x) {
cin >> ppl;
int* scores = new int[ppl];
for (int y = 0; y < ppl; ++y) {
cin >> scores[y];
}
try {
print(scores, ppl);
} catch (int i) {
std::cout << "0 0 0" << std::endl;
}
delete[] scores;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = int(5e5) + 12, mod = int(1e9) + 7;
int t, n, a[N];
void solve() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
if (n == 1) {
printf("0 0 0\n");
return;
}
int last = 0;
for (int i = 1; i < n; i++) {
if (2 * i > n) break;
if (a[i] > a[i + 1]) {
last = i;
}
}
int g = 0, b = 0, second = 0;
for (int i = 1; i <= last; i++) {
g++;
if (a[i] > a[i + 1]) {
for (int j = i + 1; j <= last; j++) {
second++;
if (a[j] > a[j + 1] && second > g) break;
}
b = last - g - second;
break;
}
}
if (g > 0 && b > 0 && second > 0 && g < second && g < b)
printf("%d %d %d\n", g, second, b);
else
printf("0 0 0\n");
}
int main() {
scanf("%d", &t);
while (t--) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
int main(void) {
int n;
int p[400005];
scanf("%d", &n);
int g = 0;
int s = 0;
int b = 0;
int m;
int j;
for (int i = 0; i < n; i++) {
g = 0;
s = 0;
b = 0;
scanf("%d", &m);
for (int j = 1; j <= m; j++) {
scanf("%d", &p[j]);
}
for (j = 1; j < m / 2; j++) {
g++;
if (p[j] != p[j + 1]) {
break;
}
}
for (j = j + 1; j < m / 2; j++) {
s++;
if (p[j] != p[j + 1] && s > g) {
break;
}
}
int k = j;
for (j = m / 2; j > 1; j--) {
if (p[j] != p[j + 1]) {
break;
}
}
b = j - k;
if (g >= b || g == 0 || s == 0 || b == 0) {
printf("0 0 0\n");
} else {
printf("%d %d %d\n", g, s, b);
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int tt;
scanf("%d", &tt);
while (tt--) {
int n;
scanf("%d", &n);
vector<int> a;
int pr = -1, cnt = 0;
for (int i = 0; i < n; ++i) {
int x;
scanf("%d", &x);
if (x == pr) {
++cnt;
} else {
if (cnt != 0) {
a.push_back(cnt);
}
cnt = 1;
}
pr = x;
}
a.push_back(cnt);
int sum = 0;
int j = 0;
while (j < (int)a.size() && 2 * (sum + a[j]) <= n) {
sum += a[j];
++j;
}
if (j == 0) {
puts("0 0 0");
continue;
}
int g = a[0];
int k = 1;
int s = 0;
while (k < j && s <= g) {
s += a[k];
++k;
}
int b = 0;
while (k < j) {
b += a[k];
++k;
}
if (g >= s || g >= b) {
puts("0 0 0");
continue;
}
printf("%d %d %d\n", g, s, b);
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
cerr.tie(nullptr);
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
int last = -1;
vector<int> a;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
if (x == last)
a.back()++;
else
a.push_back(1);
last = x;
}
int ostalo = n;
while (2 * ostalo > n) {
ostalo -= a.back();
a.pop_back();
}
bool no = false;
int g = 0, s = 0, b = 0;
if (a.size() == 0) {
no = true;
} else {
g = a[0];
int l = 1;
while (l < (int)a.size() && g >= s) s += a[l++];
while (l < (int)a.size()) b += a[l++];
if (g < s && g < b && g && s && b)
;
else
no = true;
}
if (no)
cout << "0 0 0\n";
else
cout << g << ' ' << s << ' ' << b << '\n';
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int i, t;
cin >> t;
while (t--) {
int n;
cin >> n;
int p[n];
for (i = 0; i < n; i++) cin >> p[i];
int max = n / 2;
int g, s, b;
vector<int> count1;
int count = 1;
for (i = 0; i < n - 1; i++) {
if (p[i] == p[i + 1])
count++;
else {
count1.push_back(count);
count = 1;
}
}
count1.push_back(count);
vector<int>::iterator itr;
int sum = 0;
int flag = 0;
for (itr = count1.begin(); itr != count1.end(); itr++) {
sum = sum + *itr;
flag++;
if (sum > max) break;
}
flag--;
sum = sum - *itr;
g = s = b = 0;
if (flag < 3) {
g = s = b = 0;
} else {
int a[flag];
i = 0;
for (itr = count1.begin(); itr != count1.begin() + flag; itr++) {
a[i++] = *itr;
}
g = a[0];
i = 1;
while ((i < flag) && (s <= g)) {
s = s + a[i++];
}
if (i >= flag) {
g = s = b = 0;
cout << g << " " << s << " " << b << endl;
continue;
}
while (i < flag) {
b = b + a[i++];
}
if (b <= g) {
g = s = b = 0;
cout << g << " " << s << " " << b << endl;
continue;
}
}
cout << g << " " << s << " " << b << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
const int MXN = 4e5 + 200;
const long long MNN = 4e2 + 200;
const long long MOD = 1e9 + 7;
const long long INF = 1e18;
const int OO = 1e9 + 500;
using namespace std;
int p[MXN];
long long G, second, B;
int ans = 0;
long long pr[MXN];
void solve() {
int n;
cin >> n;
ans = -1;
G = second = B = 0;
vector<int> v;
int cnt = 1;
for (int i = 1; i <= n; i++) {
cin >> p[i];
if (i == 1) continue;
if (p[i] == p[i - 1]) {
cnt++;
} else {
v.push_back(cnt);
cnt = 1;
}
}
v.push_back(cnt);
for (int i = 1; i < v.size(); i++) {
pr[i] = pr[i - 1] + v[i];
}
long long g = v[0];
long long s = 0;
for (int i = 1; i < v.size(); i++) {
s += v[i];
if (g + s > n - g - s) break;
int l = i + 1, r = v.size() - 1;
while (r - l > 1) {
int m = (l + r) / 2;
if (pr[m] - pr[i] + g + s <= n - (pr[m] - pr[i]) - g - s) {
l = m;
} else {
r = m - 1;
}
}
if (pr[r] - pr[i] + g + s <= n - (pr[r] - pr[i]) - g - s && g < s &&
g < pr[r] - pr[i]) {
if (pr[r] - pr[i] + g + s > ans) {
ans = pr[r] - pr[i] + g + s;
G = g, second = s, B = pr[r] - pr[i];
}
}
if (pr[l] - pr[i] + g + s <= n - (pr[l] - pr[i]) - g - s && g < s &&
g < pr[l] - pr[i]) {
if (pr[l] - pr[i] + g + s > ans) {
ans = pr[l] - pr[i] + g + s;
G = g, second = s, B = pr[l] - pr[i];
}
}
}
cout << G << ' ' << second << ' ' << B << '\n';
}
int main() {
ios_base::sync_with_stdio(0), cout.tie(0), cin.tie(0);
;
int t;
cin >> t;
while (t--) {
solve();
}
}
|
#include <bits/stdc++.h>
using namespace std;
namespace zyt {
const int N = 4e5 + 10;
int p[N], tmp[N], n, num[N];
int work() {
int T;
scanf("%d", &T);
while (T--) {
int n;
memset(num, 0, sizeof(num));
scanf("%d", &n);
for (int i = 1; i <= n; i++) scanf("%d", p + i), tmp[i] = p[i];
sort(tmp + 1, tmp + n + 1);
int cnt = unique(tmp + 1, tmp + n + 1) - tmp - 1;
for (int i = 1; i <= n; i++)
++num[tmp + cnt + 1 - lower_bound(tmp + 1, tmp + cnt + 1, p[i])];
for (int i = 1; i <= cnt; i++) num[i] += num[i - 1];
int ans[3] = {0, 0, 0};
for (int i = 1; i <= cnt; i++) {
int p1 = upper_bound(num + 1, num + cnt + 1, num[i] * 2) - num;
int p2 = upper_bound(num + 1, num + cnt + 1, n / 2) - num - 1;
if (p1 < p2 && num[p2] - num[p1] > num[i] &&
num[p2] > ans[0] + ans[1] + ans[2])
ans[0] = num[i], ans[1] = num[p1] - num[i], ans[2] = num[p2] - num[p1];
}
if (ans[0] && ans[1] && ans[2])
printf("%d %d %d\n", ans[0], ans[1], ans[2]);
else
puts("0 0 0");
}
return 0;
}
} // namespace zyt
int main() { return zyt::work(); }
|
#include <bits/stdc++.h>
using namespace std;
map<int, int> num;
set<int> score;
int main() {
int tc, n, g, s, b, solve[400005];
cin >> tc;
while (tc--) {
cin >> n;
g = s = b = 0;
for (int i = 1; i <= n; i++)
cin >> solve[i], num[solve[i]]++, score.insert(-1 * solve[i]);
for (auto i = score.begin(); i != score.end(); i++) {
if (g == 0) {
g += num[-1 * *i];
} else if (s <= g) {
s += num[-1 * *i];
} else if (b <= g || 2 * (g + s + b) <= n) {
b += num[-1 * *i];
if ((g + s + b) > (n / 2)) {
b -= num[-1 * *i];
break;
}
}
}
if (g + s + b > n / 2)
cout << "0 0 0" << endl;
else if (g >= s || g >= b)
cout << "0 0 0" << endl;
else
cout << g << " " << s << " " << b << endl;
score.clear();
num.clear();
}
}
|
#include <bits/stdc++.h>
using namespace std;
long long ar[3000000 + 9];
int main() {
long long i, j, k, l, n, m, tot, temp, curr, val, prev, a, b, c, t, ans, cnt,
x, y, siz, ii, jj, xx, yy, root, ind, len, q, xxx, yyy, d, r, no_per_blk;
cin >> t;
while (t--) {
cin >> n;
for (i = 1; i <= n; i++) scanf("%lld", &ar[i]);
sort(ar + 1, ar + 1 + n);
reverse(ar + 1, ar + 1 + n);
ar[n + 1] = 0;
for (i = 1; i <= n / 2; i++)
if (ar[i] != ar[i + 1]) len = i;
ans = 0;
a = 0;
b = 0;
c = 0;
x = 0;
for (i = 1; i <= n; i++) {
if (ar[i] == ar[i + 1]) continue;
x = max(x, i + 1);
for (j = x; j <= n; j++) {
x = j;
if (ar[j] == ar[j + 1]) continue;
xx = j - i;
yy = len - j;
if (xx <= i) continue;
if (yy <= i) continue;
if (i + xx + yy > ans) {
ans = i + xx + yy;
a = i;
b = xx;
c = yy;
}
break;
}
}
cout << a << " " << b << " " << c << endl;
}
}
|
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast,unroll-loops,no-stack-protector,fast-math")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
using db = double;
using ll = long long;
using ull = unsigned long long;
using pII = pair<int, int>;
using pLL = pair<ll, ll>;
constexpr int mod = 1e9 + 7;
template <class T1, class T2>
inline void chadd(T1 &x, T2 y) {
x += y;
while (x >= mod) x -= mod;
while (x < 0) x += mod;
}
template <class T1, class T2>
inline void chmax(T1 &x, T2 y) {
if (x < y) x = y;
}
template <class T1, class T2>
inline void chmin(T1 &x, T2 y) {
if (x > y) x = y;
}
inline int rd() {
int x;
cin >> x;
return x;
}
template <class T>
inline void rd(T &x) {
cin >> x;
}
template <class T>
inline void rd(vector<T> &vec) {
for (auto &it : vec) cin >> it;
}
void err() {
cout << "\033[39;0m"
<< "\n";
}
template <class T, class... Ts>
void err(const T &arg, const Ts &...args) {
cout << arg << ' ';
err(args...);
}
template <template <typename...> class T, typename t, typename... A>
void err(const T<t> &arg, const A &...args) {
for (auto &v : arg) cout << v << ' ';
err(args...);
}
void ptt() { cout << "\n"; }
template <class T, class... Ts>
void ptt(const T &arg, const Ts &...args) {
cout << ' ' << arg;
ptt(args...);
}
template <class T, class... Ts>
void pt(const T &arg, const Ts &...args) {
cout << arg;
ptt(args...);
}
void pt() {}
template <template <typename...> class T, typename t, typename... A>
void pt(const T<t> &arg, const A &...args) {
for (int i = 0, sze = arg.size(); i < sze; ++i)
cout << arg[i] << " \n"[i == sze - 1];
pt(args...);
}
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
inline ll qpow(ll base, ll n) {
ll res = 1;
while (n) {
if (n & 1) res = res * base % mod;
base = base * base % mod;
n >>= 1;
}
return res;
}
constexpr int N = 4e5 + 10;
int n, a[N];
void run() {
n = rd();
int limit = n / 2, Max = 0, g = 0, s = 0, b = 0;
for (int i = 1; i <= n; ++i) a[i] = rd();
int l = 1, l1 = 1, l2 = 1;
while (l < n) {
while (l < n && a[l + 1] == a[l]) ++l;
while (l1 < n && (a[l1 + 1] == a[l1] || l1 - l <= l)) ++l1;
while (l2 < n && (a[l2 + 1] == a[l2] || l2 - l1 <= l)) ++l2;
if (l2 <= limit) {
while (l2 < limit) {
int nx = upper_bound(a + 1, a + 1 + n, a[l2 + 1],
[&](int x, int y) { return x > y; }) -
a - 1;
if (nx <= limit) {
l2 = nx;
} else {
break;
}
}
if (l2 > Max) {
Max = l2;
g = l;
s = l1 - l;
b = l2 - l1;
}
}
++l;
}
pt(g, s, b);
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
cout << fixed << setprecision(20);
int _T = rd();
while (_T--) run();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<long long> factors;
void trial(long long n) {
int count;
long long ini = n;
for (long long d = 2; d * d <= n; d++) {
if (n % d == 0) {
ini = n;
while (n % d == 0) {
n /= d;
}
long long s = ini / n;
factors.push_back(s);
}
}
if (n > 1) {
factors.push_back(n);
}
}
int main() {
long long n;
cin >> n;
trial(n);
int siz = factors.size();
long long a = 1;
long long b = 1;
long long ra = 1, rb = 1;
long long mini = 1000000000000;
for (int i = 1; i < (1 << siz); i++) {
a = 1;
b = 1;
for (int j = 1; j <= siz; j++) {
if (i & (1 << (j - 1)))
a *= factors[siz - j];
else
b *= factors[siz - j];
}
if (mini > max(a, b)) {
ra = a;
rb = b;
mini = max(a, b);
}
}
cout << ra << ' ' << rb << endl;
}
|
#include <bits/stdc++.h>
long long z = 1000000007;
using namespace std;
vector<bool> vec(1000003, 1);
bool sortinrev(const pair<int, int> &a, const pair<int, int> &b) {
return (a.first > b.first);
}
bool sortbysecdesc(const pair<int, int> &a, const pair<int, int> &b) {
return a.second > b.second;
}
long long egcd(long long a, long long b) {
if (b == 0)
return a;
else
return egcd(b, a % b);
}
double logn(double a, double base) { return log2(a) / log2(base); }
bool isprime(long long n) {
if (n == 1) return false;
bool b = true;
for (long long i = 2; i * i <= n; i++) {
if (n % i == 0) {
b = false;
break;
}
}
return b;
}
void sieve(vector<long long> &res, long long n) {
for (long long i = 2; (i * i) <= n; i++) {
if (vec[i]) {
res.push_back(i);
for (long long j = i * i; (j <= n && j <= 1000000); j += i)
vec[j] = false;
}
}
}
struct node {
int p, cf, cb;
node *next;
};
bool compare(double a, double b) {
double eps = 0.000001;
return fabs(a - b) <= eps;
}
long long count_Divisors(long long n) {
long long cnt = 0, ans = 1;
if (n == 1) {
return 1;
}
for (long long i = 2; (i * i * i) <= n; i++) {
if (n % i == 0) {
int cnt = 1;
while (n > 1 && n % i == 0) {
n /= i;
cnt++;
}
ans *= cnt;
}
}
if (isprime(n))
ans *= 2;
else if ((floor(sqrt(n)) == ceil(sqrt(n))) && isprime((int)sqrt(n)))
ans *= 3;
else if (n != 1)
ans *= 4;
return ans;
}
void solve() {
bool b = false;
long long n, k;
long long ans = (long long)1e12 + 1;
pair<long long, long long> p;
cin >> n;
if (n == 1) {
cout << "1 1";
return;
}
for (long long i = 1; i * i <= n; i++) {
if (n % i == 0 && (n / i != i)) {
if ((egcd(i, n / i) == 1) && (max(i, n / i) < ans)) {
ans = max(i, n / i);
p.first = i;
p.second = n / i;
}
}
}
cout << p.first << ' ' << p.second << '\n';
return;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int T = 1;
while (T--) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1000000007;
long long gcd(long long a, long long b) {
while (a && b) a > b ? a %= b : b %= a;
return a + b;
}
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0),
cin.exceptions(cin.failbit);
long long x, a, b;
cin >> x;
if (x == 1) {
cout << 1 << " " << 1 << '\n';
return 0;
}
vector<long long> v;
for (int i = 1; i <= sqrt(x) + 1; i++) {
if (x % i == 0) {
v.push_back(i);
v.push_back(x / i);
}
}
long long ans = 10000000000000000;
for (int i = 0; i < v.size() - 1; i++) {
long long x1 = v[i];
long long x2 = v[i + 1];
if (((x1 * 1ll * x2) / gcd(x1, x2)) == x) {
long long mx = max(v[i], v[i + 1]);
if (mx < ans) {
a = v[i];
b = v[i + 1];
ans = mx;
}
}
}
cout << a << " " << b << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) {
if (a == 0) return b;
return gcd(b % a, a);
}
long long isLcm(long long a, long long b) { return ((a * b) / gcd(a, b)); }
int main() {
cin.tie(0);
ios_base::sync_with_stdio(0);
long long n, count = 1, mini = 1e13;
cin >> n;
if (n == 1) {
cout << 1 << " " << 1 << endl;
return 0;
}
while (count * count <= n) {
if (n % count == 0 && isLcm(count, n / count) == n) {
long long maxi = max(count, n / count);
mini = min(mini, maxi);
}
count++;
}
cout << mini << " " << n / mini << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
long long n;
cin >> n;
long long nn = n;
vector<long long> p;
for (long long i = 2; i * i <= n; i++) {
long long v = 1;
while (n % i == 0) {
n /= i;
v *= i;
}
if (v != 1) {
p.push_back(v);
}
}
if (n != 1) p.push_back(n);
sort((p).begin(), (p).end());
long long a = 1, b = nn;
int h = p.size();
for (int i = 0; i < (1 << h); i++) {
long long x = 1, y = 1;
for (int k = 0; k < h; k++) {
if ((i >> k) & 1) {
x *= p[k];
} else
y *= p[k];
}
if (max(x, y) < max(a, b)) {
a = x;
b = y;
}
}
cout << a << ' ' << b << '\n';
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10;
long long gcd(long long a, long long b) {
if (b > a) return gcd(b, a);
if (b == 0) return a;
return gcd(b, a % b);
}
int main() {
ios::sync_with_stdio(false);
long long x;
cin >> x;
if (x == 1) {
cout << "1 1" << endl;
return 0;
}
long long a, b, c;
for (long long i = 1; i * i < x; i++) {
if (x % i == 0) {
a = x / i;
if (gcd(a, i) == 1) {
b = a;
c = i;
}
}
}
cout << c << ' ' << b << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) {
if (b == 0) return a;
return gcd(b, a % b);
}
long long lcm(long long a, long long b) { return a * (b / gcd(a, b)); }
long long X, k = 1;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> X;
for (long long i = 1; i * i <= X; ++i) {
if (X % i == 0 && lcm(i, X / i) == X) k = i;
}
cout << k << " " << X / k;
}
|
#include <bits/stdc++.h>
using namespace std;
long long int prime[1000010];
long long int test[1000010];
long long int soin[20][2];
long long int mul[20];
int bit[20];
long long int pof2(long long int n) {
if (n == 0)
return 1;
else
return 2 * pof2(n - 1);
}
int main() {
long long int T, tc, n, a, b, c, d, i, j, pos, st, ed, pv, l, r, flg, cnt,
sum, p, e, rn, p2, ans;
scanf("%lld", &n);
rn = n;
ans = n;
if (n == 1) {
printf("%d %d\n", 1, 1);
return 0;
}
a = (long long int)sqrt(n);
p = 0;
test[0] = test[1] = 0;
for (i = 2; i <= a; i++) test[i] = 1;
for (i = 2; i <= a; i++) {
if (test[i]) {
prime[p++] = i;
j = i;
while (j <= a) {
test[j] = 0;
j += i;
}
}
}
cnt = 0;
for (i = 0; i < p; i++) {
e = 0;
while (n % prime[i] == 0) {
n /= prime[i];
e++;
}
if (e > 0) {
soin[cnt][0] = prime[i];
soin[cnt][1] = e;
cnt++;
}
}
if (n > 1) {
soin[cnt][0] = n;
soin[cnt][1] = 1;
cnt++;
}
for (i = 0; i < cnt; i++) {
mul[i] = 1;
for (j = 0; j < soin[i][1]; j++) mul[i] *= soin[i][0];
}
p2 = pof2(cnt);
for (i = 0; i < p2; i++) {
b = i;
pos = 1;
for (j = 0; j < cnt; j++) {
if (b % 2 == 1) pos *= mul[j];
b /= 2;
}
pos = (((pos) > (rn / pos)) ? (pos) : (rn / pos));
ans = (((ans) < (pos)) ? (ans) : (pos));
}
printf("%lld %lld\n", (((ans) < (rn / ans)) ? (ans) : (rn / ans)),
(((ans) > (rn / ans)) ? (ans) : (rn / ans)));
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAXM = 1e2 + 5;
inline void chk_min(long long &a, long long b) {
if (a > b) a = b;
}
inline void chk_max(long long &a, long long b) {
if (a < b) a = b;
}
int p[MAXM], m = 0;
long long q[MAXM];
int main(void) {
long long n;
scanf("%lld", &n);
long long sn = sqrt(n), t = n;
for (int i = 2; i <= sn && t > 1; ++i)
if (t % i == 0) {
p[m] = i;
q[m] = 1;
while (t % i == 0) t /= i, q[m] *= (long long)i;
++m;
}
if (t > 1) q[m++] = t;
long long ans = n;
int all = (1 << m) - 1;
for (int s = 0; s <= all; ++s) {
long long tmp = 1;
for (int i = 0; i < m; ++i)
if ((((s) >> (i)) & 1)) tmp *= q[i];
chk_min(ans, max(tmp, n / tmp));
}
printf("%lld %lld", ans, n / ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9 + 10;
const long long int LINF = 1LL * INF * INF;
const int MAXN = 2e5 + 10;
const int MAXM = 5e3 + 10;
priority_queue<int> pq;
vector<vector<int> > graph;
queue<int> que;
long long int mygcd(long long int a, long long int b) {
return a ? mygcd(b % a, a) : b;
}
int main() {
long long int n, m, k, a, b, x, y, q;
int sum = 0;
int cnt = 0;
int mx = 0;
int mn = INF;
int cur = 0, idx = -1;
int tc;
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n;
long long int res = n;
for (long long int i = 1; i * i <= n; i++) {
if (n % i) continue;
a = mygcd(i, n / i);
if (a == 1) {
res = min(n / i, res);
}
}
cout << n / res << " " << res << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) {
if (a < b) swap(a, b);
long long r = a % b;
while (r) {
a = b;
b = r;
r = a % b;
}
return b;
}
int main() {
long long X;
cin >> X;
long long a = 1;
long long b = X;
for (long long i = 1; i * i <= X; i++) {
long long j = X / i;
if (i * j != X || gcd(i, j) != 1) continue;
if (max(a, b) > max(i, j)) {
a = i;
b = j;
}
}
cout << a << ' ' << b << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
const unsigned long long inf = 1e9;
unsigned long long gcd(unsigned long long a, unsigned long long b) {
while (a) {
b %= a;
swap(a, b);
}
return b;
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
unsigned long long N;
cin >> N;
unsigned long long ans = -1;
for (unsigned long long i = 1; i * i <= N; i++) {
if (N % i == 0 && gcd(i, N / i) == 1) {
ans = i;
}
}
cout << ans << ' ' << N / ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) {
if (a == 0) {
return b;
}
return gcd(b % a, a);
}
int main() {
long long n;
cin >> n;
for (long long i = ceil(sqrt(n)); i >= 1; i--) {
if (n % i == 0) {
if (gcd(n / i, i) == 1) {
cout << i << " " << n / i << endl;
break;
}
}
}
}
|
#include <bits/stdc++.h>
#pragma GCC optimize("O2")
using namespace std;
int main() {
cin.tie(NULL);
cout.tie(NULL);
{
long long int n;
cin >> n;
long long int a = 1, b = 1;
while (n % 2 == 0) {
a *= 2;
n /= 2;
}
vector<long long int> v;
for (long long int i = 3; i * i <= n; i += 2) {
long long int cur = 1;
while (n % i == 0) {
cur *= i;
n /= i;
}
b *= cur;
if (cur > 1) v.push_back(cur);
}
if (n > 1) {
v.push_back(n);
b *= n;
}
long long int x = 0;
for (int i = 0; i < v.size(); i++) x = (x << 1) | 1;
long long int ans = LONG_LONG_MAX, fa = a, fb = b;
for (int i = 0; i < x; i++) {
long long int temp = 1;
for (int j = 0; j < v.size(); j++) {
if ((i & (1 << j)) != 0) temp *= v[j];
}
if (ans > fabs(temp * a - (b / temp))) {
ans = fabs(temp * a - (b / temp));
fa = temp * a;
fb = b / temp;
}
}
cout << fa << " " << fb << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
long long int MOD = 1000000007;
long long int lcm(long long int a, long long int b) {
long long int p = a, q = b;
while (b > 0) {
long long int temp = b;
b = a % b;
a = temp;
}
return (p * q) / a;
}
void solve() {
long long int n;
cin >> n;
for (long long int i = sqrt(n); i > 0; i--) {
if (n % i == 0 && lcm(i, n / i) == n) {
cout << i << " " << n / i << '\n';
break;
}
}
}
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
solve();
}
|
#include <bits/stdc++.h>
using namespace std;
const double PI = acos(-1);
struct myHash {
template <class T1, class T2>
size_t operator()(const pair<T1, T2>& p) const {
auto hash1 = hash<T1>{}(p.first);
auto hash2 = hash<T2>{}(p.second);
return hash1 ^ hash2;
}
};
class segTree {
vector<long long int> a;
vector<long long int> tree;
vector<long long int> lazy;
long long int sel;
long long int minRange(long long int left, long long int right) {
return min(left, right);
}
long long int maxRange(long long int left, long long int right) {
return max(left, right);
}
long long int rangeSum(long long int left, long long int right) {
return left + right;
}
void build(long long int index, long long int start, long long int end) {
if (start > end) {
return;
}
if (start == end) {
tree[index] = a[start];
return;
}
long long int mid = (start + end) / 2;
build(2 * index, start, mid);
build(2 * index + 1, mid + 1, end);
long long int left = tree[2 * index];
long long int right = tree[2 * index + 1];
if (sel == 0) {
tree[index] = minRange(tree[2 * index], tree[2 * index + 1]);
} else if (sel == 1) {
tree[index] = maxRange(tree[2 * index], tree[2 * index + 1]);
} else if (sel == 2) {
tree[index] = rangeSum(tree[2 * index], tree[2 * index + 1]);
}
}
long long int query(long long int index, long long int start,
long long int end, long long int l, long long int r) {
if (lazy[index] != 0) {
if (sel == 0) {
tree[index] += lazy[index];
} else if (sel == 1) {
tree[index] += lazy[index];
} else if (sel == 2) {
tree[index] += (end - start + 1) * lazy[index];
}
if (start != end) {
lazy[2 * index] += lazy[index];
lazy[2 * index + 1] += lazy[index];
}
lazy[index] = 0;
}
if (l > end || r < start) {
if (sel == 0) {
return LLONG_MAX;
} else if (sel == 1) {
return LLONG_MIN;
} else if (sel == 2) {
return 0;
}
}
if (start >= l && end <= r) {
return tree[index];
}
long long int mid = (start + end) / 2;
long long int left = query(2 * index, start, mid, l, r);
long long int right = query(2 * index + 1, mid + 1, end, l, r);
if (sel == 0) {
return minRange(left, right);
} else if (sel == 1) {
return maxRange(left, right);
} else if (sel == 2) {
return rangeSum(left, right);
}
}
void update(long long int index, long long int start, long long int end,
long long int l, long long int r, long long int inc) {
if (lazy[index] != 0) {
if (sel == 0) {
tree[index] += lazy[index];
} else if (sel == 1) {
tree[index] += lazy[index];
} else if (sel == 2) {
tree[index] += (r - l + 1) * lazy[index];
}
if (start != end) {
lazy[2 * index] += lazy[index];
lazy[2 * index + 1] += lazy[index];
}
lazy[index] = 0;
}
if (l <= start and end <= r) {
if (sel == 0) {
tree[index] += inc;
} else if (sel == 1) {
tree[index] += inc;
} else {
tree[index] += (end - start + 1) * inc;
}
if (start != end) {
lazy[2 * index] += inc;
lazy[2 * index + 1] += inc;
}
return;
}
if (r < start || l > end) {
return;
}
if (start == end) {
tree[index] += inc;
return;
}
long long int mid = (start + end) / 2;
update(2 * index, start, mid, l, r, inc);
update(2 * index + 1, mid + 1, end, l, r, inc);
if (sel == 0) {
tree[index] = minRange(tree[2 * index], tree[2 * index + 1]);
} else if (sel == 1) {
tree[index] = maxRange(tree[2 * index], tree[2 * index + 1]);
} else if (sel == 2) {
tree[index] = rangeSum(tree[2 * index], tree[2 * index + 1]);
}
}
public:
segTree(vector<long long int> a, long long int sel) {
this->a = a;
tree.reserve(4 * a.size() + 1);
lazy.reserve(4 * a.size() + 1);
for (int i = 0; i < 4 * a.size() + 1; i++) {
lazy[i] = 0;
}
this->sel = sel;
}
void build() { build(1, 0, a.size() - 1); }
long long int query(long long int l, long long int r) {
return query(1, 0, a.size() - 1, l, r);
}
void update(long long int l, long long int r, long long int inc) {
update(1, 0, a.size() - 1, l, r, inc);
}
void update(long long int pos, long long int inc) { update(pos, pos, inc); }
};
long long int power(long long int b, long long int p,
long long int m = 1000000007) {
long long int res = 1;
while (p > 0) {
if (p & 1) {
res = (res * b) % m;
}
b = (b * b) % m;
p = p >> 1;
}
return res;
}
long long int modInverse(long long int n, long long int m = 1000000007) {
return power(n, m - 2, m);
}
bool mySort(pair<int, int> p1, pair<int, int> p2) {
if (p1.first < p2.first) {
return true;
} else if (p1.first == p2.first and p1.second < p2.second) {
return true;
}
return false;
}
long long int lis(vector<long long int>& v) {
long long int n = v.size();
vector<long long int> dp(n);
dp[0] = 1;
long long int ans = 1;
for (int i = 1; i < n; i++) {
long long int m = 0;
for (int j = i - 1; j >= 0; j--) {
if (v[j] < v[i]) {
m = max(m, dp[j]);
}
}
dp[i] = 1 + m;
if (ans < dp[i]) {
ans = dp[i];
}
}
return ans;
}
vector<long long int> sieve(long long int n) {
vector<bool> v(n + 1, false);
v[2] = true;
for (int i = 3; i <= n; i += 2) {
v[i] = true;
}
for (size_t i = 3; i <= n; i += 2) {
if (v[i]) {
for (size_t j = i * i; j <= n; j += 2 * i) {
v[j] = false;
}
}
}
v[1] = false;
v[0] = false;
vector<long long int> primes;
for (int i = 0; i < v.size(); i++) {
if (v[i]) {
primes.push_back(i);
}
}
return primes;
}
long long int gcd(long long int a, long long int b) {
while (b > 0) {
long long int r = a % b;
a = b;
b = r;
}
return a;
}
long long int lcm(long long int a, long long int b) {
long long int g = gcd(a, b);
return (a * b) / g;
}
vector<long long int> segSieve(long long int l, long long int r) {
long long int lim = sqrt(r);
if (l < 2) {
l = 2;
}
vector<long long int> s = sieve(lim);
vector<bool> v(r - l + 1, true);
for (long long int i = 0; i < s.size(); i++) {
for (long long int j = 0; j < v.size(); j++) {
if ((j + l) % s[i] == 0 && (j + l) != s[i]) {
v[j] = false;
}
}
}
vector<long long int> primes;
for (int i = 0; i < v.size(); i++) {
if (v[i]) {
primes.push_back(i + l);
}
}
return primes;
}
vector<pair<long long int, long long int>> primeFactors(long long int n) {
vector<long long int> primes = sieve(sqrt(n) + 2);
long long int p;
if (primes.size() > 0) {
p = primes[0];
} else {
p = n + 1;
}
vector<pair<long long int, long long int>> f;
int i = 0;
while (i < primes.size() && p * p <= n) {
long long int count = 0;
while (p > 0 and n % p == 0) {
count++;
n /= p;
}
if (count > 0) {
f.push_back(make_pair(p, count));
}
i++;
p = primes[i];
}
if (n > 1) {
f.push_back(make_pair(n, 1));
}
return f;
}
vector<long long int> factors(long long int n) {
long long int lim = sqrt(n);
vector<long long int> f;
for (int i = 2; i <= lim; i++) {
if (n % i == 0) {
f.push_back(i);
f.push_back(n / i);
}
}
return f;
}
long long int ceilAB(long long int a, long long int b) {
return (a + b - 1) / b;
}
long long int low_bound(vector<long long int>& v, long long int start,
long long int end, long long int n) {
if (start > end) {
return -1;
}
long long int mid = (start + end) / 2;
if (v[mid] == n) {
return mid;
} else if (v[mid] > n) {
long long int index = low_bound(v, start, mid - 1, n);
return index;
} else {
long long int index = low_bound(v, mid + 1, end, n);
if (index == -1) {
return mid;
}
return index;
}
}
void fastIO() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
}
unordered_map<pair<long long int, long long int>,
pair<long long int, long long int>, myHash>
dp;
pair<long long int, long long int> solve(vector<long long int>& v,
long long int start, long long int n,
long long int cur) {
if (start == v.size()) {
long long int x = -1;
if (cur > n) {
x = 1;
}
return make_pair(abs(n - cur), x);
}
if (dp.count(make_pair(start, cur)) > 0) {
return dp[make_pair(start, cur)];
}
pair<long long int, long long int> op1 =
solve(v, start + 1, n, cur * v[start]);
pair<long long int, long long int> op2 = solve(v, start + 1, n, cur);
pair<long long int, long long int> ans;
if (op1.first < op2.first) {
ans = op1;
} else {
ans = op2;
}
return dp[make_pair(start, cur)] = ans;
}
int main(void) {
long long int n;
cin >> n;
vector<pair<long long int, long long int>> p = primeFactors(n);
vector<long long int> v;
for (int i = 0; i < p.size(); i++) {
v.push_back(power(p[i].first, p[i].second));
}
pair<long long int, long long int> g = solve(v, 0, sqrt(n), 1);
long long int a = sqrt(n) + g.first * g.second;
long long int b = n / a;
cout << min(a, b) << " " << max(a, b) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long inf = 1ll << 60;
long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }
int main() {
long long x;
scanf("%lld", &x);
long long cnm = (long long)sqrt(x);
long long ansy = x;
for (long long i = 2; i <= cnm; i++) {
if (x % i == 0 && gcd(x / i, i) == 1) {
ansy = min(ansy, x / i);
}
}
printf("%lld %lld\n", x / ansy, ansy);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxx = 100009;
long long gcd(long long a, long long b) {
if (a == 0) {
return b;
}
return gcd(b % a, a);
}
long long _lcm(long long a, long long b) { return (a * b) / gcd(a, b); }
void solve() {
long long x;
cin >> x;
vector<long long> ans(2);
ans[0] = 1;
ans[1] = x;
long long maxm = x;
for (long long i = 2; i * i <= x; i++) {
if (x % i == 0) {
if (i * i == x or _lcm(i, x / i) != x) {
continue;
}
long long a = i;
long long b = x / i;
if (a < b) {
swap(a, b);
}
if (a < maxm) {
maxm = a;
ans[0] = a;
ans[1] = b;
}
}
}
cout << ans[0] << " " << ans[1] << "\n";
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
;
int t = 1;
while (t-- > 0) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long x;
long long a, b;
long long mn = 1e12;
int solve(long long d, long long f, long long s) {
long long d1 = d, f1 = f;
long long e = d % f;
d = f;
f = e;
while (e) {
e = d % f;
d = f;
f = e;
}
if (f1 * d1 / d == s) {
return 1;
} else {
return 0;
}
}
int main() {
cin >> x;
for (long long i = 1; i <= sqrt(x); i++) {
if (x % i == 0) {
if (max(i, x / i) < mn && solve(x / i, i, x) == 1) {
a = i;
b = x / i;
mn = max(i, x / i);
}
}
}
cout << a << ' ' << b;
return 0;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.