text stringlengths 49 983k |
|---|
#include <bits/stdc++.h>
using namespace std;
char a[100010];
char b[100010];
char c[100010];
int main() {
scanf("%s", a);
scanf("%s", b);
scanf("%s", c);
int fa[26] = {0}, fb[26] = {0}, fc[26] = {0};
int la = strlen(a);
int lb = strlen(b);
int lc = strlen(c);
for (int i = 0; i < la; i++) fa[a[i] - 'a']++;
for (int i = 0; i < lb; i++) fb[b[i] - 'a']++;
for (int i = 0; i < lc; i++) fc[c[i] - 'a']++;
int maxb = -1;
for (int i = 0; i < 26; i++) {
if (fb[i] && (maxb == -1 || maxb > fa[i] / fb[i])) maxb = fa[i] / fb[i];
}
int max = -1;
int muchb = 0, muchc = 0;
for (int i = 0; i < maxb + 1; i++) {
int maxc = -1;
for (int j = 0; j < 26; j++) {
if (fc[j] && (maxc == -1 || maxc > (fa[j] - i * fb[j]) / fc[j]))
maxc = (fa[j] - i * fb[j]) / fc[j];
}
if (max == -1 || max < maxc + i) {
max = maxc + i;
muchb = i;
muchc = maxc;
}
}
for (int i = 0; i < muchb; i++) printf("%s", b);
for (int i = 0; i < muchc; i++) printf("%s", c);
for (int i = 0; i < 26; i++) {
int r = fa[i] - muchb * fb[i] - muchc * fc[i];
while (r--) printf("%c", i + 'a');
}
printf("\n");
}
|
#include <bits/stdc++.h>
using namespace std;
int main(void) {
int mb = 0, mc = 0;
string a, b, c;
map<char, int> ca, cb, cc;
cin >> a;
cin >> b;
cin >> c;
for (char i = 'a'; i <= 'z'; i++) {
ca[i] = 0;
cb[i] = 0;
cc[i] = 0;
}
for (int i = 0; i < (int)(a.length()); ++i) ca[a[i]]++;
for (int i = 0; i < (int)(b.length()); ++i) cb[b[i]]++;
for (int i = 0; i < (int)(c.length()); ++i) cc[c[i]]++;
int ab = 1000000, answer = 0, ansb = 0, ansc = 0;
for (char i = 'a'; i <= 'z'; i++) {
if (cb[i] > 0) {
ab = min(ab, ca[i] / cb[i]);
}
}
for (int bs = ab; bs >= 0; bs--) {
int ac = 1000000;
for (char i = 'a'; i <= 'z'; i++) {
if (cc[i] > 0) {
ac = min(ac, (ca[i] - bs * cb[i]) / cc[i]);
}
}
if (bs + ac > answer) {
answer = bs + ac;
ansb = bs;
ansc = ac;
}
}
for (int i = 0; i < (int)(ansb); ++i) {
for (char c = 'a'; c <= 'z'; c++) {
ca[c] -= cb[c];
}
cout << b;
}
for (int i = 0; i < (int)(ansc); ++i) {
for (char c = 'a'; c <= 'z'; c++) {
ca[c] -= cc[c];
}
cout << c;
}
for (char i = 'a'; i <= 'z'; i++) {
for (int j = 0; j < (int)(ca[i]); ++j) cout << i;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int t[30], ta[30], tb[30], ansa = 0, ansb = 0;
int main() {
string s, a, b;
cin >> s >> a >> b;
for (int i = 0; i < s.size(); i++) t[s[i] - 'a']++;
for (int i = 0; i < a.size(); i++) ta[a[i] - 'a']++;
for (int i = 0; i < b.size(); i++) tb[b[i] - 'a']++;
int sum = 1000000;
for (int i = 0; i < 26; i++)
if (ta[i]) sum = min(sum, t[i] / ta[i]);
for (int i = 0; i <= sum; i++) {
int res = 1000000;
for (int j = 0; j < 26; j++)
if (tb[j]) res = min(res, (t[j] - ta[j] * i) / tb[j]);
if (i + res > ansa + ansb) ansa = i, ansb = res;
}
for (int i = 0; i < ansa; i++) cout << a;
for (int i = 0; i < ansb; i++) cout << b;
for (int i = 0; i < 26; i++)
for (int j = 0; j < t[i] - ta[i] * ansa - tb[i] * ansb; j++)
cout << char(i + 'a');
}
|
#include <bits/stdc++.h>
using namespace std;
string a, b, c;
int cnta[26], bkp[26], cntb[26], cntc[26];
int calc(int cnt[]) {
int ans = int(1e5) + 10;
for (int i = 0; i < 26; i++)
if (cnt[i]) ans = min(ans, cnta[i] / cnt[i]);
for (int i = 0; i < 26; i++) cnta[i] -= ans * cnt[i];
return ans;
}
void reset() {
for (int i = 0; i < 26; i++) cnta[i] = bkp[i];
}
int main(void) {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> a >> b >> c;
for (int i = 0; i < a.size(); i++) cnta[a[i] - 'a']++, bkp[a[i] - 'a']++;
for (int i = 0; i < b.size(); i++) cntb[b[i] - 'a']++;
for (int i = 0; i < c.size(); i++) cntc[c[i] - 'a']++;
int pb, maxb = calc(cntb), pc, ocb = 0, occ = 0;
for (pb = 0; pb <= maxb; pb++) {
reset();
for (int i = 0; i < 26; i++) cnta[i] -= pb * cntb[i];
pc = calc(cntc);
if (pb + pc > ocb + occ) ocb = pb, occ = pc;
}
pb = ocb, pc = occ;
reset();
for (int i = 0; i < pb; i++) cout << b;
for (int i = 0; i < pc; i++) cout << c;
for (int i = 0; i < 26; i++)
for (; (cnta[i] - (pb * cntb[i] + pc * cntc[i])); cnta[i]--)
cout << char(i + 'a');
return (0);
}
|
#include <bits/stdc++.h>
using namespace std;
string a, b, c;
int na, nb, nc, pa[100001], pb[100001], pc[100001], t1[100001], t2[100001],
t3[100001], ans = 0, p1, p2;
void create() {
for (int i = 0; i < na; i++) {
int x = a[i] - 97;
pa[x]++;
}
for (int i = 0; i < nb; i++) {
int x = b[i] - 97;
pb[x]++;
}
for (int i = 0; i < nc; i++) {
int x = c[i] - 97;
pc[x]++;
}
}
void solve() {
int q = -1, tmp = -1;
for (int i = 0; i < 26; i++)
if (pb[i] != 0) {
t1[i] = pa[i] / pb[i];
if (t1[i] == 0) tmp = 0;
}
if (tmp == -1) {
tmp = 100001;
for (int i = 0; i < 26; i++)
if (t1[i] != 0) tmp = min(tmp, t1[i]);
}
for (int j = tmp; j >= 0; j--) {
q = -1;
for (int i = 0; i < 26; i++) {
int e3 = pb[i] * j;
t2[i] = pa[i] - e3;
}
for (int i = 0; i < 26; i++)
if (pc[i] != 0) {
t3[i] = t2[i] / pc[i];
if (t3[i] == 0) q = 0;
}
if (q == -1) {
q = 100001;
for (int i = 0; i < 26; i++)
if (t3[i] != 0) q = min(q, t3[i]);
}
if (j + q > ans) {
p1 = j;
p2 = q;
ans = j + q;
}
}
}
void writedata() {
for (int i = 0; i < 26; i++) {
int e1 = pb[i] * p1, e2 = pc[i] * p2;
pa[i] -= e1;
pa[i] -= e2;
}
for (int i = 0; i < 26; i++) {
while (pa[i] > 0) {
char z = i + 97;
cout << z;
pa[i]--;
}
}
for (int i = 1; i <= p1; i++) cout << b;
for (int i = 1; i <= p2; i++) cout << c;
}
int main() {
cin >> a >> b >> c;
na = a.length();
nb = b.length();
nc = c.length();
create();
solve();
writedata();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long a[100], b[100], c[100];
int main() {
string s1, s2, s3;
cin >> s1;
cin >> s2;
cin >> s3;
for (int i = 0; i < s1.size(); ++i) {
++a[s1[i] - 'a'];
}
for (int i = 0; i < s2.size(); ++i) {
++b[s2[i] - 'a'];
}
for (int i = 0; i < s3.size(); ++i) {
++c[s3[i] - 'a'];
}
long long ans = 0, ansn = 0, ansm = 0;
for (long long i = 0; i <= s1.size(); ++i) {
bool f = true;
long long m = s1.size();
for (int j = 0; j < 26; ++j) {
if (b[j] * i > a[j]) {
f = false;
} else {
if (c[j] > 0) {
m = min(m, (long long)(a[j] - b[j] * i) / c[j]);
}
}
}
if (f) {
if (ans < i + m) {
ansn = i;
ansm = m;
ans = i + m;
}
}
}
for (long long i = 0; i < ansn; ++i) {
cout << s2;
}
for (long long i = 0; i < ansm; ++i) {
cout << s3;
}
for (int i = 0; i < 26; ++i) {
for (long long j = 0; j < a[i] - b[i] * ansn - c[i] * ansm; ++j) {
cout << ((char)(i + 'a'));
}
}
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<int> get(string str) {
vector<int> res(26, 0);
for (int i = 0; i < str.length(); i++) {
res[str[i] - 'a']++;
}
return res;
}
int main() {
string a, b, c;
vector<int> A, B, C;
while (cin >> a >> b >> c) {
A = get(a);
B = get(b);
C = get(c);
int mx = 0, c0 = 0, c1 = 0;
int x = 0, y;
int flag = 0;
while (1) {
y = -1;
for (int i = 0; i < 26; i++) {
if (B[i] * x > A[i]) {
flag = 1;
break;
}
if (!C[i]) continue;
int delta = (A[i] - B[i] * x) / C[i];
if (y == -1 || y > delta) y = delta;
}
if (flag) break;
if (x + y > mx) {
mx = x + y;
c0 = x, c1 = y;
}
x++;
}
string ans = "";
for (int i = 0; i < c0; i++) ans += b;
for (int i = 0; i < c1; i++) ans += c;
for (int i = 0; i < 26; i++) {
int last = A[i] - B[i] * c0 - C[i] * c1;
for (int j = 0; j < last; j++) ans += 'a' + i;
}
cout << ans << '\n';
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
const int INF = 0x7f7f7f7f;
int a[30], b[30], c[30], bc[30];
int main() {
std::ios_base::sync_with_stdio(false);
string aa, bb, cc;
cin >> aa >> bb >> cc;
for (int i = 0; aa[i]; i++) a[aa[i] - 'a']++;
for (int i = 0; bb[i]; i++) b[bb[i] - 'a']++;
for (int i = 0; cc[i]; i++) c[cc[i] - 'a']++;
int fr, sec;
fr = sec = 0;
int res = 0;
for (int i = 0;; i++) {
int xc = (int)(aa.size());
for (int j = 0; j < 26; j++)
if (c[j]) xc = min(xc, a[j] / c[j]);
if (xc + i > res) {
res = xc + i;
fr = i;
sec = xc;
}
bool flag = false;
for (int j = 0; j < 26; j++) {
if (b[j] > a[j]) {
flag = true;
break;
} else
a[j] -= b[j];
}
if (flag) {
break;
}
}
string ans = "";
for (int i = 0; i < fr; i++) ans += bb;
for (int i = 0; i < sec; i++) ans += cc;
for (int i = 0; i < 26; i++) a[i] = -b[i] * fr - c[i] * sec;
for (int i = 0; i < (int)(aa.size()); i++) a[aa[i] - 'a']++;
cout << ans;
for (int i = 0; i < 26; i++)
if (a[i] > 0)
while (a[i]--) cout << (char)('a' + i);
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 30;
int A[N], B[N], C[N];
int main() {
string a, b, c;
cin >> a >> b >> c;
int la = a.length(), lb = b.length(), lc = c.length();
for (int i = 0; i < la; i++) A[a[i] - 'a']++;
for (int i = 0; i < lb; i++) B[b[i] - 'a']++;
for (int i = 0; i < lc; i++) C[c[i] - 'a']++;
int best = 0, mx = 0;
for (int i = 0; i * lb <= la; i++) {
bool p = true;
for (int j = 0; j < 26; j++) {
if (A[j] < i * B[j]) {
p = false;
break;
}
}
if (!p) break;
int x = la;
for (int j = 0; j < 26; j++) {
if (C[j] > 0) {
x = min(x, (A[j] - i * B[j]) / C[j]);
}
}
if (i + x > mx) {
best = i;
mx = i + x;
}
}
for (int i = 0; i < best; i++) printf("%s", b.c_str());
for (int i = 0; i < mx - best; i++) printf("%s", c.c_str());
for (int i = 0; i < 26; i++) {
A[i] -= best * B[i] + (mx - best) * C[i];
while (A[i] > 0) {
printf("%c", i + 'a');
A[i]--;
}
}
printf("\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const double PI = 2.0 * acos(0.0);
const double EPS = 1e-9;
int cases = 1;
double getdist(pair<int, int> a, pair<int, int> b) {
return sqrt(pow((double)a.first - b.first, 2) +
pow((double)a.second - b.second, 2));
}
void Read() { return; }
const int MAX = 100000 + 5;
int bb[30], cc[30], aa[30], lenA, lenB, lenC, q[26];
char a[MAX], b[MAX], c[MAX];
int finA, finB;
void solve() {
lenA = strlen(a);
lenB = strlen(b);
lenC = strlen(c);
for (int i = 0; i < lenB; i++) bb[b[i] - 'a']++;
for (int i = 0; i < lenC; i++) cc[c[i] - 'a']++;
for (int i = 0; i < lenA; i++) aa[a[i] - 'a']++;
int cnt = 0, cnt_ = 0;
bool flag = true;
while (true) {
for (int i = 0; i < 26; i++) q[i] = aa[i];
for (int i = 0; i < 26; i++) {
if (bb[i] > 0) {
if (q[i] < bb[i] * cnt) {
flag = false;
break;
}
q[i] -= bb[i] * cnt;
}
}
if (flag == false) break;
cnt_ = 1000000000;
for (int i = 0; i < 26; i++) {
if (cc[i] > 0) {
cnt_ = min(cnt_, q[i] / cc[i]);
}
}
if (cnt + cnt_ > finA + finB) {
finA = cnt;
finB = cnt_;
}
cnt++;
}
return;
}
int main() {
int test;
scanf("%s %s %s", a, b, c);
solve();
for (int i = 0; i < finA; ++i) {
printf("%s", b);
for (int j = 0; j < 26; ++j) aa[j] -= bb[j];
}
for (int i = 0; i < finB; ++i) {
printf("%s", c);
for (int j = 0; j < 26; ++j) aa[j] -= cc[j];
}
for (int i = 0; i < 26; ++i) {
while (aa[i] > 0) printf("%c", i + 'a'), aa[i]--;
}
printf("\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
string a, b, c;
int arr[26];
int sub1[26];
int sub2[26];
void makestr(string &ans, string s, int num) {
for (int i = 0; i < num; i++) ans += s;
for (int i = 0; i < s.size(); i++) arr[s[i] - 'a'] -= num;
}
int main() {
cin >> a >> b >> c;
for (int i = 0; i < a.size(); i++) arr[a[i] - 'a']++;
for (int i = 0; i < b.size(); i++) sub1[b[i] - 'a']++;
for (int i = 0; i < c.size(); i++) sub2[c[i] - 'a']++;
int mx1 = 1000000000;
for (int i = 0; i < 26; i++) {
if (sub1[i]) mx1 = min(mx1, arr[i] / sub1[i]);
}
int f = 0;
int s = 0;
for (int i = 0; i <= mx1; i++) {
int num = i;
int m = 1000000000;
for (int j = 0; j < 26; j++)
if (sub2[j]) m = min(m, (arr[j] - i * sub1[j]) / sub2[j]);
m = max(0, m);
num += m;
if (num > f + s) f = i, s = m;
}
string ans = "";
makestr(ans, b, f);
makestr(ans, c, s);
for (int i = 0; i < 26; i++)
if (arr[i])
for (int j = 0; j < arr[i]; j++) ans += char(i + 'a');
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int subCount(int wc[256], int sc[256]) {
int c = 10000000;
for (int i = 0; i < 256; i++) {
if (sc[i] > wc[i]) {
return 0;
}
if (sc[i] != 0) {
int cc = wc[i] / sc[i];
if (cc < c) c = cc;
}
}
return c;
}
int main() {
string a, b, c;
cin >> a >> b >> c;
int cc[256], ccb[256], ccc[256], n = a.size(), nb = b.size(), nc = c.size();
fill(cc, cc + 256, 0);
fill(ccb, ccb + 256, 0);
fill(ccc, ccc + 256, 0);
for (int i = 0; i < n; i++) {
cc[a[i]]++;
}
for (int i = 0; i < nb; i++) {
ccb[b[i]]++;
}
for (int i = 0; i < nc; i++) {
ccc[c[i]]++;
}
int maxit = 0, maxid = -1, maxidd = -1;
int nn = min(nb, nc);
for (int i = 0; i <= n / nn; i++) {
int sc = subCount(cc, ccb);
if (i > sc) break;
int cccc[256];
for (int j = 0; j < 256; j++) {
cccc[j] = cc[j] - i * ccb[j];
}
int scc = subCount(cccc, ccc);
int t = i + scc;
if (t > maxit) {
maxit = t;
maxid = i;
maxidd = scc;
}
}
if (maxid != -1) {
for (int i = 0; i < maxid; i++) {
cout << b;
}
for (int i = 0; i < maxidd; i++) {
cout << c;
}
for (int i = 0; i < 256; i++) {
cc[i] -= maxid * ccb[i] + maxidd * ccc[i];
}
}
for (int i = 0; i < 256; i++) {
for (int j = 0; j < cc[i]; j++) {
cout << char(i);
}
}
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int ca[26], cb[26], cc[26];
int cd[26];
int main() {
string a, b, c;
cin >> a >> b >> c;
int al = a.size(), bl = b.size(), cl = c.size();
for (int i = 0; i < 26; ++i) ca[i] = cb[i] = cc[i] = 0;
for (int i = 0; i < al; ++i) ca[a[i] - 'a']++;
for (int i = 0; i < bl; ++i) cb[b[i] - 'a']++;
for (int i = 0; i < cl; ++i) cc[c[i] - 'a']++;
int maxb = cb[0] != 0 ? ca[0] / cb[0] : 1000000;
for (int i = 1; i < 26; ++i)
maxb = min(maxb, cb[i] != 0 ? ca[i] / cb[i] : 1000000);
int k = maxb;
int l = maxb, m = 0;
for (int i = maxb; i >= 0; --i) {
for (int j = 0; j < 26; ++j) cd[j] = ca[j] - i * cb[j];
int maxc = cc[0] != 0 ? cd[0] / cc[0] : 1000000;
for (int j = 1; j < 26; ++j)
maxc = min(maxc, cc[j] != 0 ? cd[j] / cc[j] : 1000000);
if (i + maxc > k) {
k = i + maxc;
l = i;
m = maxc;
}
}
for (int j = 0; j < 26; ++j) cd[j] = ca[j] - l * cb[j] - m * cc[j];
for (int i = 0; i < l; ++i) cout << b;
for (int i = 0; i < m; ++i) cout << c;
for (int i = 0; i < 26; ++i)
for (int j = 0; j < cd[i]; ++j) cout << (char)('a' + i);
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char a[100005], b[100005], c[100005];
int a1[26], b1[26], c1[26], a2[26], a3[26];
int main() {
int i, n;
scanf("%s", a);
scanf("%s", b);
scanf("%s", c);
n = strlen(a);
for (i = 0; i < n; i++) {
a1[a[i] - 'a']++;
a2[a[i] - 'a']++;
}
n = strlen(b);
for (i = 0; i < n; i++) {
b1[b[i] - 'a']++;
}
b[n] = '\0';
n = strlen(c);
for (i = 0; i < n; i++) {
c1[c[i] - 'a']++;
}
c[n] = '\0';
int x1 = 0;
while (1) {
int f = 0;
for (i = 0; i < 26; i++) {
if (a1[i] < b1[i]) {
f = 1;
break;
}
}
if (f) break;
x1++;
for (i = 0; i < 26; i++) {
a1[i] -= b1[i];
}
}
int q = -1, qq = 0;
;
for (i = 0; i <= x1; i++) {
int w = 1000000;
for (int j = 0; j < 26; j++) {
a3[j] = a2[j];
a3[j] -= i * b1[j];
if (c1[j] == 0) continue;
w = min(w, a3[j] / c1[j]);
}
if (q < i + w) {
q = i + w;
qq = i;
}
}
for (i = 0; i < qq; i++) printf("%s", b);
for (i = 0; i < q - qq; i++) printf("%s", c);
for (i = 0; i < 26; i++) {
a3[i] = a2[i];
a3[i] -= qq * b1[i] + (q - qq) * c1[i];
while (a3[i] > 0) {
printf("%c", i + 'a');
a3[i]--;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
string a, b, c;
long long int d[400] = {0};
long long int e[400] = {0};
long long int f[400] = {0};
long long int solve(long long int x) {
long long int lo = 0;
long long int hi = a.size() - 1;
long long int t = 80;
while (t-- && hi - lo > 1) {
long long int mi = lo + ((hi - lo) / 2);
long long int i;
long long int flag = 0;
for (i = 0; i < 200; i++) {
if (d[i] < (x * e[i]) + (mi * f[i])) {
flag = 1;
break;
}
}
if (flag == 0) {
lo = mi;
} else {
hi = mi;
}
}
long long int mi = hi;
long long int flag = 0;
for (long long int i = 0; i < 200; i++) {
if (d[i] < (x * e[i]) + (mi * f[i])) {
flag = 1;
break;
}
}
if (flag == 0) return hi;
return lo;
}
int main() {
cin >> a;
cin >> b;
long long int i;
cin >> c;
for (i = 0; i < a.size(); i++) {
d[a[i]]++;
}
for (i = 0; i < b.size(); i++) {
e[b[i]]++;
}
for (i = 0; i < c.size(); i++) {
f[c[i]]++;
}
long long int ma1 = INT_MAX;
for (i = 0; i < 300; i++) {
if (e[i] > 0) {
ma1 = min(ma1, d[i] / e[i]);
}
}
long long int p = 0, q = 0, r = 0;
for (i = 0; i <= ma1; i++) {
long long int y = solve(i);
if (y + i > p) {
p = y + i;
q = i;
r = y;
}
}
long long int j;
string s1;
for (j = 0; j < q; j++) {
s1 = s1 + b;
for (i = 0; i < 200; i++) {
d[i] = d[i] - e[i];
}
}
for (j = 0; j < r; j++) {
s1 = s1 + c;
for (i = 0; i < 200; i++) {
d[i] = d[i] - f[i];
}
}
for (i = 0; i < 200; i++) {
while (d[i]--) {
char ch = i;
s1 = s1 + ch;
}
}
cout << s1 << "\n";
}
|
#include <bits/stdc++.h>
using namespace std;
const int INF = 1000000000;
vector<int> p;
map<char, int> ka, kb, kc;
int main() {
string a, b, c;
cin >> a >> b >> c;
for (int i = 0; i < (int)a.size(); i++) {
ka[a[i]]++;
}
for (int i = 0; i < (int)b.size(); i++) {
kb[b[i]]++;
}
for (int i = 0; i < (int)c.size(); i++) {
kc[c[i]]++;
}
int mxb = 2 * (int)a.size(), mxc = 2 * a.size();
for (map<char, int>::iterator it = kb.begin(); it != kb.end(); it++) {
mxb = min(mxb, ka[it->first] / it->second);
}
int ansb = mxb, ansc = 0;
int ans = mxb;
for (int i = 0; i <= mxb; i++) {
int mxxc = INF;
for (map<char, int>::iterator it = kc.begin(); it != kc.end(); it++) {
mxxc = min(mxxc, (ka[it->first] - kb[it->first] * i) / it->second);
}
if (i + mxxc > ans) {
ans = i + mxxc;
ansb = i;
ansc = mxxc;
}
}
for (int i = 0; i < ansb; i++) {
cout << b;
}
for (int i = 0; i < ansc; i++) {
cout << c;
}
for (char i = 'a'; i <= 'z'; i++) {
for (int j = 0; j < ka[i] - kb[i] * ansb - kc[i] * ansc; j++) {
cout << i;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
struct __s {
__s() {
if (1) {
ios_base::Init i;
cin.sync_with_stdio(0);
cin.tie(0);
}
}
~__s() {
if (!1)
fprintf(stderr, "Execution time: %.3lf s.\n",
(double)clock() / CLOCKS_PER_SEC);
long long n;
cin >> n;
}
} __S;
vector<long long> aa, bb, cc;
vector<long long> f(string x) {
vector<long long> res(26);
for (long long i = 0; i < (long long)(x.size()); i++) {
res[x[i] - 'a']++;
}
return res;
}
long long check(long long x) {
long long res = 100000;
for (long long i = 0; i < (long long)(26); i++) {
if (aa[i] < bb[i] * x) return 0;
if (cc[i] != 0) res = min(res, x + (aa[i] - bb[i] * x) / cc[i]);
}
return res;
}
int main(void) {
string a, b, c;
cin >> a >> b >> c;
aa = f(a);
bb = f(b);
cc = f(c);
long long res = 0;
long long ans = 0;
for (long long i = 0; i <= 100000; i++) {
long long r = check(i);
if (ans < r) {
ans = r;
res = i;
}
}
for (long long i = 0; i < (long long)(res); i++) {
cout << b;
}
ans -= res;
for (long long i = 0; i < (long long)(ans); i++) {
cout << c;
}
for (long long i = 0; i < (long long)(26); i++) {
long long n = aa[i] - res * bb[i] - ans * cc[i];
for (long long j = 0; j < (long long)(n); j++) cout << (char)(i + 'a');
}
cout << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
string a, b, c, k;
int alp1[30], alp2[30], alp3[30];
int cntb, cntc;
int main() {
cin >> a >> b >> c;
for (int i = 0; i < a.size(); i++) alp1[a[i] - 'a']++;
for (int i = 0; i < b.size(); i++) alp2[b[i] - 'a']++;
for (int i = 0; i < c.size(); i++) alp3[c[i] - 'a']++;
int temp = 0;
while (1) {
int num[30];
int cc = 1000000;
memset(num, 0, sizeof(num));
for (int i = 0; i < 26; i++) num[i] = temp * alp2[i];
for (int i = 0; i < 26; i++) {
if (alp1[i] - num[i] < 0) {
cc = -1;
break;
}
if (alp3[i] == 0) continue;
int tempNum = (alp1[i] - num[i]) / alp3[i];
cc = min(cc, tempNum);
}
if (cc == -1) break;
if (temp + cc > cntc + cntb) {
cntc = cc;
cntb = temp;
}
temp++;
}
int ttb = cntb, ttc = cntc;
while (ttb--) cout << b;
while (ttc--) cout << c;
for (int i = 0; i < 26; i++) {
int temp = alp1[i] - alp2[i] * cntb - alp3[i] * cntc;
if (temp > 0) {
while (temp--) {
printf("%c", 'a' + i);
}
}
}
puts("");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int s[30];
int a[30];
int b[30];
int k[30];
char as[100005];
char bs[100005];
char res[100005];
int idx(char c) { return c - 'a'; }
int main() {
char ss[100005];
res[0] = '\0';
scanf("%s", ss);
int len = strlen(ss);
for (int i = 0; i < len; i++) s[idx(ss[i])]++;
scanf("%s", as);
len = strlen(as);
for (int i = 0; i < len; i++) a[idx(as[i])]++;
scanf("%s", bs);
len = strlen(bs);
for (int i = 0; i < len; i++) b[idx(bs[i])]++;
int ma = 10000000, mb = 10000000;
for (int i = 0; i < 26; i++) {
if (!a[i]) continue;
if (!s[i]) {
ma = 0;
break;
} else {
ma = min(ma, s[i] / a[i]);
}
}
int resn = 0;
int resa = 0, resb = 0;
for (int i = 0; i <= ma; i++) {
for (int j = 0; j < 26; j++) {
k[j] = s[j];
k[j] -= i * a[j];
}
mb = 10000000;
for (int j = 0; j < 26; j++) {
if (!b[j]) continue;
if (!k[j]) {
mb = 0;
break;
} else {
mb = min(mb, k[j] / b[j]);
}
}
if (i + mb > resn) {
resa = i;
resb = mb;
resn = i + mb;
}
}
res[0] = '\0';
for (int i = 0; i < resa; i++) {
for (int j = 0; j < 26; j++) s[j] -= a[j];
strcat(res, as);
}
for (int i = 0; i < resb; i++) {
strcat(res, bs);
for (int j = 0; j < 26; j++) s[j] -= b[j];
}
len = strlen(res);
for (int i = 0; i < 26; i++) {
for (int j = 0; j < s[i]; j++) {
res[len++] = 'a' + i;
}
}
res[len] = '\0';
printf("%s\n", res);
}
|
#include <bits/stdc++.h>
using namespace std;
int f[30], f1[30], f2[30], mlc[30];
string s, a, b;
int main() {
cin.sync_with_stdio(false);
cin >> s >> a >> b;
for (int i = 0; i < (int)s.size(); i++) f[s[i] - 'a']++;
for (int i = 0; i < (int)a.size(); i++) f1[a[i] - 'a']++;
for (int i = 0; i < (int)b.size(); i++) f2[b[i] - 'a']++;
int A = 0, B = 0, sol = 0;
for (int i = 0;; i++) {
bool ok = 1;
for (int j = 0; j < 26; j++) {
mlc[j] = f[j] - i * f1[j];
if (mlc[j] < 0) {
ok = 0;
break;
}
}
if (!ok) break;
int k = 1 << 30;
for (int j = 0; j < 26; j++)
if (f2[j]) {
int x = mlc[j] / f2[j];
k = min(k, x);
}
if (i + k > sol) {
sol = i + k;
A = i;
B = k;
}
}
for (int i = 1; i <= A; i++) cout << a;
for (int i = 1; i <= B; i++) cout << b;
for (int i = 0; i < 26; i++) {
int x = f[i] - A * f1[i] - B * f2[i];
for (int j = 1; j <= x; j++) cout << (char)(i + 'a');
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
string a, b, c;
int reqb[26], reqc[26], have[26], temp[26];
int makeb[26], makec[26];
void calhave(string& s, int* a) {
for (int i = 0; i < s.size(); i++) {
a[s[i] - 'a'] += 1;
}
}
int main() {
cin >> a >> b >> c;
calhave(a, have);
calhave(b, reqb);
calhave(c, reqc);
int overlap = 0;
int nb = -1, nc = -1, ob = -1, oc = -1;
for (int i = 0; i < 26; i++) {
if (reqb[i] != 0) {
makeb[i] = have[i] / reqb[i];
nb = nb == -1 ? makeb[i] : nb;
}
}
for (int i = 0; i < 26; i++) {
if (reqb[i] != 0) {
nb = min(makeb[i], nb);
}
}
int mb = 0, mc = 0;
for (int i = 0; i <= nb; i++) {
oc = -1;
for (int j = 0; j < 26; j++) {
if (reqc[j] != 0) {
temp[j] = (have[j] - i * reqb[j]) / reqc[j];
oc = oc == -1 ? temp[j] : oc;
}
}
for (int j = 0; j < 26; j++)
if (reqc[j] != 0) oc = min(oc, temp[j]);
if (i + oc > mb + mc) {
mb = i;
mc = oc;
}
}
for (int i = 0; i < mb; i++) {
cout << b;
}
for (int i = 0; i < 26; i++) {
have[i] -= mb * reqb[i];
}
for (int i = 0; i < mc; i++) {
cout << c;
}
for (int i = 0; i < 26; i++) {
have[i] -= mc * reqc[i];
}
for (int i = 0; i < 26; i++) {
while (have[i]--) {
cout << char('a' + i);
}
}
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
const int INF = 0x7f7f7f7f;
int a[30], b[30], c[30], tempa[30];
int main() {
std::ios_base::sync_with_stdio(false);
string aa, bb, cc;
cin >> aa >> bb >> cc;
for (int i = 0; aa[i]; i++) a[aa[i] - 'a']++, tempa[aa[i] - 'a']++;
for (int i = 0; bb[i]; i++) b[bb[i] - 'a']++;
for (int i = 0; cc[i]; i++) c[cc[i] - 'a']++;
int fr, sec;
fr = sec = 0;
int res = 0;
for (int i = 0;; i++) {
int xc = (int)(aa.size());
for (int j = 0; j < 26; j++)
if (c[j]) xc = min(xc, a[j] / c[j]);
if (xc + i > res) {
res = xc + i;
fr = i;
sec = xc;
}
bool flag = false;
for (int j = 0; j < 26; j++) {
if (b[j] > a[j]) {
flag = true;
break;
} else
a[j] -= b[j];
}
if (flag) {
break;
}
}
string ans = "";
for (int i = 0; i < fr; i++) ans += bb;
for (int i = 0; i < sec; i++) ans += cc;
for (int i = 0; i < 26; i++) tempa[i] -= (b[i] * fr + c[i] * sec);
cout << ans;
for (int i = 0; i < 26; i++)
if (tempa[i] > 0)
while (tempa[i]--) cout << (char)('a' + i);
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10;
char a[maxn], b[maxn], c[maxn];
long long cnt[4][30];
int main() {
scanf("%s%s%s", a, b, c);
memset(cnt, 0, sizeof(cnt));
int len = strlen(a);
int i;
for (i = 0; i <= len - 1; i++) {
cnt[0][a[i] - 'a' + 1]++;
}
len = strlen(b);
for (i = 0; i <= len - 1; i++) {
cnt[1][b[i] - 'a' + 1]++;
}
len = strlen(c);
for (i = 0; i <= len - 1; i++) {
cnt[2][c[i] - 'a' + 1]++;
}
int ans1 = 0, ans2 = 0, ans = 0;
for (i = 0; i <= maxn; i++) {
int flag = 0;
for (int j = 1; j <= 26; j++) {
cnt[3][j] = cnt[0][j] - i * (cnt[1][j]);
if (cnt[3][j] < 0) {
flag = 1;
break;
}
}
if (flag) break;
int temp = maxn;
for (int j = 1; j <= 26; j++) {
int cc;
if ((cnt[3][j] == 0) && (cnt[2][j] == 0)) continue;
if ((cnt[3][j] != 0) && (cnt[2][j] == 0)) continue;
if ((cnt[3][j] != 0) && (cnt[2][j] != 0)) {
cc = (cnt[3][j]) / cnt[2][j];
} else {
cc = 0;
}
temp = min(cc, temp);
}
if (temp + i > ans) {
ans = temp + i;
ans1 = i;
ans2 = temp;
}
}
for (i = 1; i <= ans1; i++) cout << b;
for (i = 1; i <= ans2; i++) cout << c;
for (i = 1; i <= 26; i++) {
cnt[3][i] = cnt[0][i] - ans1 * cnt[1][i] - ans2 * cnt[2][i];
for (int j = 1; j <= cnt[3][i]; j++) cout << (char)('a' + i - 1);
}
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int inf = 999999999;
const int mod = 1000000007;
inline int Getint() {
char ch = getchar();
while (ch < '0' || ch > '9') ch = getchar();
int ret = 0;
while (ch >= '0' && ch <= '9') ret = ret * 10 + ch - '0', ch = getchar();
return ret;
}
char c0[100010], c1[100010], c2[100010];
int a[30], b[30], c[30];
int main() {
scanf("%s", c0 + 1);
scanf("%s", c1 + 1);
scanf("%s", c2 + 1);
int len0 = strlen(c0 + 1), len1 = strlen(c1 + 1), len2 = strlen(c2 + 1);
for (int i = 1; i <= len0; i++) a[c0[i] - 96]++;
for (int i = 1; i <= len1; i++) b[c1[i] - 96]++;
for (int i = 1; i <= len2; i++) c[c2[i] - 96]++;
int p = 0, q = 0;
for (int i = 0;; i++) {
int ls = inf;
bool flag = true;
for (int j = 1; j <= 26; j++) {
if (a[j] - b[j] * i < 0) {
flag = false;
break;
}
if (c[j]) ls = min(ls, (a[j] - b[j] * i) / c[j]);
}
if (!flag) break;
if (i + ls > p + q) p = i, q = ls;
}
for (int i = 1; i <= p; i++)
for (int j = 1; j <= len1; j++) printf("%c", c1[j]);
for (int i = 1; i <= q; i++)
for (int j = 1; j <= len2; j++) printf("%c", c2[j]);
for (int i = 1; i <= 26; i++)
for (int j = 1; j <= a[i] - b[i] * p - c[i] * q; j++) printf("%c", i + 96);
return 0;
}
|
#include <bits/stdc++.h>
int x[26], y[26], z[26];
int main() {
int i, j, na = 0, nb = 0, nc = 0, maxb, maxc, c1, c2, total = 0;
char a[100001], b[100001], c[100001];
scanf("%s", a);
scanf("%s", b);
scanf("%s", c);
for (i = 0; a[i] != '\0'; i++) {
x[a[i] - 'a']++;
na++;
}
for (i = 0; b[i] != '\0'; i++) {
y[b[i] - 'a']++;
nb++;
}
for (i = 0; c[i] != '\0'; i++) {
z[c[i] - 'a']++;
nc++;
}
maxb = 1000000;
for (i = 0; i < 26; i++) {
if (y[i] != 0) maxb = maxb < (x[i] / y[i]) ? maxb : (x[i] / y[i]);
}
for (i = 0; i <= maxb; i++) {
maxc = 1000000;
for (j = 0; j < 26; j++) {
if (z[j] != 0)
maxc = (maxc < ((x[j] - i * y[j]) / z[j])) ? maxc
: ((x[j] - i * y[j]) / z[j]);
}
if (i + maxc > total) {
total = i + maxc;
c1 = i;
c2 = maxc;
}
}
for (i = 1; i <= c1; i++) {
printf("%s", b);
for (j = 0; j < nb; j++) x[b[j] - 'a']--;
}
for (i = 1; i <= c2; i++) {
printf("%s", c);
for (j = 0; j < nc; j++) x[c[j] - 'a']--;
}
for (i = 0; i < 26; i++) {
while (x[i]) {
putchar('a' + i);
x[i]--;
}
}
printf("\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
string a, b, c;
int words[3][30];
int fuck[3][30];
void cal(string x, int y) {
int len = x.length();
for (int i = 0; i < len; i++) {
int tmp = int(x[i] - 'a');
words[y][tmp]++;
fuck[y][tmp]++;
}
}
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
cin >> a >> b >> c;
memset(words, 0, sizeof(words));
cal(a, 0);
cal(b, 1);
cal(c, 2);
int tmp, numb = 0x3f3f3f3f;
for (int i = 0; i < 26; i++) {
if (words[0][i] < words[1][i]) {
numb = 0;
break;
} else if (words[1][i] > 0) {
tmp = words[0][i] / words[1][i];
numb = min(tmp, numb);
}
}
int ansa = 0, ansb = 0;
for (int i = 0; i <= numb; i++) {
int numc = 0x3f3f3f3f;
for (int j = 0; j < 26; j++) {
if (words[0][j] - words[1][j] * i < words[2][j]) {
numc = 0;
break;
} else if (words[2][j] > 0) {
tmp = (words[0][j] - i * words[1][j]) / words[2][j];
numc = min(tmp, numc);
}
}
if ((i + numc) > ansa + ansb) ansa = i, ansb = numc;
}
for (int i = 0; i < ansa; i++) cout << b;
for (int i = 0; i < ansb; i++) cout << c;
for (int i = 0; i < 26; i++) {
for (int j = 0; j < words[0][i] - words[1][i] * ansa - words[2][i] * ansb;
j++)
cout << char(i + 'a');
}
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
const int N = (int)1e6 + 228;
const int inf = (int)1e9;
const long long INF = (long long)1e18;
const int MOD = (int)1e9 + 7;
string a, b, c, s;
int ans, ansc;
int cnt1, cnt2;
int cnt[50], c1[50], c2[50];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL), cout.tie(NULL);
cin >> a >> b >> c;
for (int i = 0; i < (a).size(); ++i) cnt[a[i] - 'a']++;
for (int i = 0; i < (b).size(); ++i) c1[b[i] - 'a']++;
for (int i = 0; i < (c).size(); ++i) c2[c[i] - 'a']++;
for (int i = 1; i <= 1e5; ++i) {
cnt1 = i, cnt2 = inf;
for (int j = 0; j < 26; ++j)
if (c1[j] * i > cnt[j]) cnt1 = 0;
for (int j = 0; j < 26; ++j) {
if (c2[j] == 0) continue;
cnt2 = min(cnt2, (cnt[j] - c1[j] * cnt1) / c2[j]);
}
if (cnt1 + cnt2 > ans) {
ans = cnt1 + cnt2;
ansc = cnt1;
}
if (cnt1 == 0) break;
}
s = "";
cnt1 = ansc, cnt2 = ans - ansc;
for (int j = 1; j <= cnt1; ++j) cout << b;
for (int j = 1; j <= cnt2; ++j) cout << c;
for (int j = 0; j < 26; ++j) {
for (int k = 1; k <= cnt[j] - c1[j] * cnt1 - c2[j] * cnt2; ++k)
cout << (char)(j + 'a');
}
cout << s;
}
|
#include <bits/stdc++.h>
using namespace std;
char a[100005] = {}, b[100005] = {}, c[100005] = {};
int main() {
ios::sync_with_stdio(false);
cin >> a >> b >> c;
int la(strlen(a)), lb(strlen(b)), lc(strlen(c)), ia[30]{}, ib[30]{}, ic[30]{};
for (int i = 0; i < la; ++i) ++ia[a[i] - 'a'];
for (int i = 0; i < lb; ++i) ++ib[b[i] - 'a'];
for (int i = 0; i < lc; ++i) ++ic[c[i] - 'a'];
int maxNb(INT_MAX);
for (int i = 0; i < 26; ++i)
if (ib[i] != 0) maxNb = min(maxNb, ia[i] / ib[i]);
int nia[30], maxData[2] = {};
for (int i = 0; i <= maxNb; ++i) {
memcpy(nia, ia, 26 * sizeof(int));
for (int j = 0; j < 26; ++j) nia[j] -= ib[j] * i;
int maxNc(INT_MAX);
for (int j = 0; j < 26; ++j)
if (ic[j] != 0) maxNc = min(maxNc, nia[j] / ic[j]);
if (i + maxNc > maxData[0] + maxData[1]) {
maxData[0] = i;
maxData[1] = maxNc;
}
}
for (int i = 0; i < 26; ++i) ia[i] -= ib[i] * maxData[0] + ic[i] * maxData[1];
for (int i = 0; i < maxData[0]; ++i) cout << b;
for (int i = 0; i < maxData[1]; ++i) cout << c;
for (int i = 0; i < 26; ++i) {
for (int j = 0; j < ia[i]; ++j) cout << (char)(i + 'a');
}
cout << endl;
}
|
#include <bits/stdc++.h>
#pragma warning(disable : 4996)
using namespace std;
long long int ma[26], mb[26], mc[26], t[26];
char a[100007], b[100007], c[100007];
string s;
void sol() {
long long int i, x, j, mx = -1, flag, mn, e;
gets(b);
gets(c);
for (i = 0; i < 26; i++) {
ma[i] = 0;
mb[i] = 0;
mc[i] = 0;
}
x = strlen(a);
for (i = 0; i < x; i++) {
ma[a[i] - 'a']++;
}
x = strlen(b);
for (i = 0; i < x; i++) {
mb[b[i] - 'a']++;
}
x = strlen(c);
for (i = 0; i < x; i++) {
mc[c[i] - 'a']++;
}
for (i = 0; i < 100007; i++) {
for (j = 0; j < 26; j++) {
t[j] = ma[j];
t[j] -= mb[j] * i;
}
flag = 0;
mn = 1e18;
for (j = 0; flag == 0 && j < 26; j++) {
if (t[j] < 0) {
flag = -1;
} else {
if (mc[j] > 0) mn = min(mn, t[j] / mc[j]);
}
}
if (flag != -1) {
if (mn + i > mx) {
mx = mn + i;
e = i;
}
}
}
s = b;
for (i = 0; i < e; i++) {
printf("%s", s.c_str());
}
for (j = 0; j < 26; j++) {
t[j] = ma[j];
t[j] -= mb[j] * i;
}
mn = 1e9;
for (j = 0; j < 26; j++) {
if (mc[j] > 0) {
mn = min(mn, t[j] / mc[j]);
}
}
s = c;
for (j = 0; j < 26; j++) {
t[j] -= mn * mc[j];
}
for (j = 0; j < mn; j++) {
printf("%s", s.c_str());
}
for (j = 0; j < 26; j++) {
for (i = 0; i < t[j]; i++) printf("%c", j + 'a');
}
printf("\n");
}
int main() {
#pragma comment(linker, "/STACK:268435456")
while (gets(a)) sol();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[26], b[26], c[26];
int main() {
string s, s1, s2;
int m1 = INT_MAX, m2 = INT_MAX;
int m = 0, n = 0;
cin >> s >> s1 >> s2;
for (int i = 0; i < s.length(); i++) a[s[i] - 'a']++;
for (int i = 0; i < s1.length(); i++) b[s1[i] - 'a']++;
for (int i = 0; i < s2.length(); i++) c[s2[i] - 'a']++;
for (int i = 0; i < 26; i++)
if (b[i]) m1 = min(a[i] / b[i], m1);
for (int i = 0; i <= m1; i++) {
for (int j = 0; j < 26; j++) {
if (c[j]) m2 = min(m2, (a[j] - b[j] * i) / c[j]);
}
if (i + m2 > m + n) m = i, n = m2;
}
for (int i = 0; i < m; i++) cout << s1;
for (int i = 0; i < n; i++) cout << s2;
for (int i = 0; i < 26; i++)
if (a[i] - b[i] * m - c[i] * n > 0) cout << (char)(i + 'a'), a[i]--, i--;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 100500;
int n, m, k, A[30], B[30], AB[30];
int d, res, fst, sec;
char s[N], a[N], b[N], ans[N];
int main() {
scanf("%s %s %s", s + 1, a + 1, b + 1);
n = strlen(s + 1);
m = strlen(a + 1);
k = strlen(b + 1);
for (int i = 1; i <= n; i++) AB[s[i] - 'a']++;
for (int i = 1; i <= m; i++) A[a[i] - 'a']++;
for (int i = 1; i <= k; i++) B[b[i] - 'a']++;
for (int i = 0;; i++) {
int x = n;
for (int j = 0; j < 26; j++)
if (B[j]) x = min(x, AB[j] / B[j]);
if (x + i > res) {
res = x + i;
fst = i;
sec = x;
}
bool f = false;
for (int j = 0; j < 26; j++)
if (AB[j] < A[j]) {
f = true;
break;
} else
AB[j] -= A[j];
if (f) break;
}
for (int i = 1; i <= fst; i++)
for (int j = 1; j <= m; j++) d++, ans[d] = a[j];
for (int i = 1; i <= sec; i++)
for (int j = 1; j <= k; j++) d++, ans[d] = b[j];
for (int i = 0; i < 26; i++) AB[i] = -A[i] * fst - B[i] * sec;
for (int i = 1; i <= n; i++) AB[s[i] - 'a']++;
for (int i = 0; i < 26; i++)
for (int j = 1; j <= AB[i]; j++) ans[++d] = 'a' + i;
for (int i = 1; i <= n; i++) printf("%c", ans[i]);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long gcd(long long u, long long v) { return (v != 0) ? gcd(v, u % v) : u; }
int freqA[30], freqB[30], freqC[30];
int A[30];
int MaxC() {
int Min = 1e9;
for (int i = 0; i < 26; i++) {
if (freqC[i]) Min = min(Min, freqA[i] / freqC[i]);
}
return Min;
}
int main() {
string a, b, c;
cin >> a >> b >> c;
for (int i = 0; i < a.length(); i++) freqA[a[i] - 'a']++, A[a[i] - 'a']++;
for (int i = 0; i < b.length(); i++) freqB[b[i] - 'a']++;
for (int i = 0; i < c.length(); i++) freqC[c[i] - 'a']++;
int resB = 0, resC = MaxC();
for (int i = 1; i <= a.length(); i++) {
bool ok1 = 1;
for (int j = 0; j < 26; j++)
if (freqA[j] < freqB[j]) ok1 = 0;
if (!ok1) break;
for (int j = 0; j < 26; j++) freqA[j] -= freqB[j];
int tempC = MaxC();
if (tempC + i > resB + resC) resB = i, resC = tempC;
}
for (int i = 0; i < 26; i++) {
A[i] -= freqB[i] * resB;
A[i] -= freqC[i] * resC;
}
for (int i = 0; i < resB; i++) cout << b;
for (int i = 0; i < resC; i++) cout << c;
for (int i = 0; i < 26; i++)
while (A[i]--) cout << char(i + 'a');
cout << "\n";
}
|
#include <bits/stdc++.h>
using namespace std;
char a[100050], b[100050], c[100050];
int a1[30], b1[30], c1[30], Temp[30];
int main() {
scanf("%s%s%s", a, b, c);
int i, j, k, s1 = 100050, s2 = 100050, sum = 0, temp = 0, m = 0, n = 0;
for (i = 0; i < strlen(a); i++) a1[a[i] - 'a' + 1]++;
for (i = 0; i < strlen(b); i++) b1[b[i] - 'a' + 1]++;
for (i = 0; i < strlen(c); i++) c1[c[i] - 'a' + 1]++;
for (i = 1; i <= 26; i++) {
if (b1[i] == 0) continue;
temp = a1[i] / b1[i];
s1 = s1 < temp ? s1 : temp;
}
for (i = 1; i <= 26; i++) {
if (c1[i] == 0) continue;
temp = a1[i] / c1[i];
s2 = s2 < temp ? s2 : temp;
}
if (s1 > s2) {
for (i = 1; i <= s1; i++) {
for (j = 1; j <= 26; j++) Temp[j] = a1[j];
for (j = 0; j < strlen(b); j++) Temp[b[j] - 'a' + 1] -= i;
s2 = 100050;
for (k = 1; k <= 26; k++) {
if (c1[k] == 0) continue;
temp = Temp[k] / c1[k];
s2 = s2 < temp ? s2 : temp;
}
if (s2 + i > sum) {
sum = s2 + i;
m = i;
n = s2;
}
}
} else {
for (i = 1; i <= s2; i++) {
for (j = 1; j <= 26; j++) Temp[j] = a1[j];
for (j = 0; j < strlen(c); j++) Temp[c[j] - 'a' + 1] -= i;
s1 = 100050;
for (k = 1; k <= 26; k++) {
if (b1[k] == 0) continue;
temp = Temp[k] / b1[k];
s1 = s1 < temp ? s1 : temp;
}
if (s1 + i > sum) {
sum = s1 + i;
m = s1;
n = i;
}
}
}
for (i = 1; i <= m; i++) cout << b;
for (i = 0; i < strlen(b); i++) a1[b[i] - 'a' + 1] -= m;
for (i = 1; i <= n; i++) cout << c;
for (i = 0; i < strlen(c); i++) a1[c[i] - 'a' + 1] -= n;
for (i = 1; i <= 26; i++) {
for (j = 1; j <= a1[i]; j++) {
cout << (char)(i + 'a' - 1);
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 5 + 1e5, MOD = 7 + 1e9;
char a[maxn], b[maxn], c[maxn];
int c1[26], c2[maxn], c3[maxn];
int main() {
scanf("%s%s%s", a, b, c);
int len1 = strlen(a);
for (int i = 0; i < len1; i++) c1[a[i] - 'a']++;
int len2 = strlen(b);
for (int i = 0; i < len2; i++) c2[b[i] - 'a']++;
int len3 = strlen(c);
for (int i = 0; i < len3; i++) c3[c[i] - 'a']++;
int tmp[26];
int ansx = 0, ansy = 0;
bool ok = 1;
for (int x = 0; x < len1; x++) {
for (int i = 0; i < 26; i++) {
if (c1[i] >= x * c2[i]) {
tmp[i] = c1[i] - x * c2[i];
} else {
ok = 0;
break;
}
}
if (!ok)
break;
else {
int y = (0x3f3f3f3f) * 2;
for (int i = 0; i < 26; i++) {
if (c3[i] > 0) y = min(y, tmp[i] / c3[i]);
}
if (y + x > ansx + ansy) ansx = x, ansy = y;
}
}
for (int i = 0; i < ansx; i++) printf("%s", b);
for (int i = 0; i < ansy; i++) printf("%s", c);
for (int i = 0; i < 26; i++) tmp[i] = c1[i] - ansx * c2[i] - ansy * c3[i];
for (int i = 0; i < 26; i++)
for (int j = 0; j < tmp[i]; j++) printf("%c", 'a' + i);
puts("");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char a[100005], b[100005], c[100005];
int ca[26], cb[26], cc[26];
int cha[26], ma, mb;
int ans, ta, tb;
int coub, couc;
int min(int a, int b) { return a > b ? b : a; }
int main() {
scanf("%s%s%s", a, b, c);
for (int i = 0; a[i]; i++) ca[a[i] - 'a']++;
for (int i = 0; b[i]; i++) cb[b[i] - 'a']++;
for (int i = 0; c[i]; i++) cc[c[i] - 'a']++;
int flag = 1;
for (int i = 0; i < 26; i++)
if (cb[i]) {
if (flag) {
flag = 0;
ma = ca[i] / cb[i];
} else
ma = min(ma, ca[i] / cb[i]);
}
for (; ma >= 0; ma--) {
for (int i = 0; i < 26; i++) cha[i] = ca[i] - cb[i] * ma;
mb = 0;
flag = 1;
for (int i = 0; i < 26; i++)
if (cc[i]) {
if (flag) {
flag = 0;
mb = cha[i] / cc[i];
} else
mb = min(mb, cha[i] / cc[i]);
}
if (ma + mb > ans) {
ans = ma + mb;
ta = ma, tb = mb;
}
}
for (int i = 0; i < ta; i++) printf("%s", b);
for (int i = 0; i < tb; i++) printf("%s", c);
for (int i = 0; i < 26; i++) cha[i] = ca[i] - ta * cb[i] - tb * cc[i];
for (int i = 0; i < 26; i++) {
for (int j = 0; j < cha[i]; j++) printf("%c", 'a' + i);
}
return 0;
}
|
#include <bits/stdc++.h>
const int MAXN = 35;
using namespace std;
int fa[MAXN], fb[MAXN], fc[MAXN];
int main() {
ios::sync_with_stdio(false);
string a, b, c;
int ab, ac, max_b, max_c;
cin >> a >> b >> c;
for (int i = 0; i < (int)a.size(); i++) fa[a[i] - 'a']++;
for (int i = 0; i < (int)b.size(); i++) fb[b[i] - 'a']++;
for (int i = 0; i < (int)c.size(); i++) fc[c[i] - 'a']++;
ab = INT_MAX;
for (int i = 0; i < 26; i++) {
if (fb[i]) {
ab = min(ab, fa[i] / fb[i]);
}
}
max_b = max_c = 0;
for (int i = 0; i <= ab; i++) {
ac = INT_MAX;
for (int j = 0; j < 26; j++) {
if (fc[j]) {
ac = min(ac, (fa[j] - fb[j] * i) / fc[j]);
}
}
if (max_b + max_c < i + ac) {
max_b = i;
max_c = ac;
}
}
for (int i = 0; i < max_b; i++) cout << b;
for (int i = 0; i < max_c; i++) cout << c;
for (int i = 0; i < 26; i++) {
int aux = fa[i] - fb[i] * max_b - fc[i] * max_c;
for (int j = 0; j < aux; j++) {
cout << char(i + 'a');
}
}
cout << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> a(26), a2(26), a3(26);
string s1, s2, s3;
char ss1[100001], ss2[100001], ss3[100001];
scanf("%s%s%s", ss1, ss2, ss3);
s1 = ss1;
s2 = ss2;
s3 = ss3;
for (int i = 0; i < s1.size(); i++) a[s1[i] - 'a']++;
for (int i = 0; i < s2.size(); i++) a2[s2[i] - 'a']++;
for (int i = 0; i < s3.size(); i++) a3[s3[i] - 'a']++;
int max1 = 0, max2 = 0;
int ma2 = 100000;
for (int i = 0; i < 26; i++)
if (a2[i]) ma2 = min(ma2, a[i] / a2[i]);
for (int i = 0; i <= ma2; i++) {
int r = 100000;
for (int j = 0; j < 26; j++)
if (a3[j]) r = min(r, (a[j] - i * a2[j]) / a3[j]);
if (r + i > max1 + max2) max1 = i, max2 = r;
}
for (int i = 0; i < max1; i++) printf("%s", ss2);
for (int i = 0; i < max2; i++) printf("%s", ss3);
for (int i = 0; i < 26; i++) a[i] -= (a2[i] * max1 + a3[i] * max2);
for (int i = 0; i < 26; i++) {
while (a[i] > 0) {
printf("%c", i + 'a');
a[i]--;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int inf = 2e9;
const int N = 201010;
string a, b, c;
int cnta[N], cntb[N], cntc[N];
int main() {
cin >> a;
cin >> b;
cin >> c;
int na = a.length();
int nb = b.length();
int nc = c.length();
for (int i = 0; i < na; i++) cnta[a[i] - 'a']++;
for (int i = 0; i < nb; i++) cntb[b[i] - 'a']++;
for (int i = 0; i < nc; i++) cntc[c[i] - 'a']++;
int ans = 0, val1 = -1, val2 = -1;
for (int i = 0; i < na / nb; i++) {
bool f = true;
int j = inf;
for (int k = 0; k < 26; k++)
if (i * cntb[k] > cnta[k])
f = false;
else {
if (cntc[k] != 0) j = min(j, (cnta[k] - i * cntb[k]) / cntc[k]);
}
if (!f) break;
if (i + j > ans) {
ans = i + j;
val1 = i;
val2 = j;
}
}
string t = "";
for (int i = 0; i < val1; i++)
for (int j = 0; j < nb; j++) {
cnta[b[j] - 'a']--;
t += b[j];
}
for (int i = 0; i < val2; i++)
for (int j = 0; j < nc; j++) {
cnta[c[j] - 'a']--;
t += c[j];
}
for (char c1 = 'a'; c1 <= 'z'; c1++)
for (int i = 0; i < cnta[c1 - 'a']; i++) t += c1;
cout << t;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long MAXN = 200001;
long long arr[MAXN];
string s[3];
long long cnt[3][26];
void calc(long long idx, string &s) {
for (long long i = 0; i < s.length(); i++) {
cnt[idx][s[i] - 'a']++;
}
}
bool isCan(long long mid) {
for (long long j = 0; j < 26; j++) {
if (cnt[0][j] - cnt[2][j] * mid < 0) return false;
}
return true;
}
int main() {
ios::sync_with_stdio(false);
cin >> s[0] >> s[1] >> s[2];
calc(0, s[0]), calc(1, s[1]), calc(2, s[2]);
long long ans = 0;
long long L = 0, R = 0;
for (long long i = 0; i <= s[0].length(); i++) {
long long low = 0, high = s[0].length();
for (long long j = 0; j < 26; j++) {
if (cnt[0][j] < 0) break;
}
while (low <= high) {
long long mid = (low + high) / 2;
if (isCan(mid)) {
low = mid + 1;
if (mid + i > ans) {
ans = mid + i;
L = i, R = mid;
}
} else
high = mid - 1;
}
for (long long j = 0; j < 26; j++) {
cnt[0][j] -= cnt[1][j];
}
}
for (long long i = 0; i < 26; i++) cnt[0][i] = 0;
calc(0, s[0]);
string ret;
for (long long i = 0; i < L; i++) {
cout << s[1];
for (long long j = 0; j < 26; j++) cnt[0][j] -= cnt[1][j];
}
for (long long i = 0; i < R; i++) {
cout << s[2];
for (long long j = 0; j < 26; j++) cnt[0][j] -= cnt[2][j];
}
cout << ret;
for (long long i = 0; i < 26; i++) {
for (long long j = 0; j < cnt[0][i]; j++) {
cout << char('a' + i);
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int get_count(string str, string a, string b) {
int ans = 0;
int cans = 0;
vector<int> strv(30), stra(30), strb(30);
for (int i = 0; i < str.size(); i++) strv[str[i] - 'a']++;
for (int i = 0; i < a.size(); i++) stra[a[i] - 'a']++;
for (int i = 0; i < b.size(); i++) strb[b[i] - 'a']++;
vector<int> temp = strv, temp2 = strv;
int cnt = 0;
while (1) {
int ansb = INT_MAX;
bool isPossible = true;
for (int i = 0; i < 26; i++) {
if (strb[i] != 0) {
ansb = min(ansb, temp[i] / strb[i]);
}
}
if (ans < ansb + cnt) {
cans = cnt;
ans = ansb + cnt;
}
for (int i = 0; i < 26; i++) {
if (temp[i] < stra[i]) {
isPossible = false;
}
}
if (!isPossible)
break;
else {
cnt++;
for (int i = 0; i < 26; i++) temp[i] -= stra[i];
}
}
return cans;
}
int main() {
string str, a, b;
cin >> str >> a >> b;
vector<int> strv(30), stra(30), strb(30);
for (int i = 0; i < str.size(); i++) strv[str[i] - 'a']++;
for (int i = 0; i < a.size(); i++) stra[a[i] - 'a']++;
for (int i = 0; i < b.size(); i++) strb[b[i] - 'a']++;
int ansa = get_count(str, a, b);
for (int i = 0; i < ansa; i++) {
cout << a;
for (int j = 0; j < 26; j++) strv[j] -= stra[j];
}
while (1) {
bool isPossible = true;
for (int j = 0; j < 26; j++) {
if (strv[j] < strb[j]) {
isPossible = false;
}
}
if (!isPossible)
break;
else {
cout << b;
for (int i = 0; i < 26; i++) strv[i] -= strb[i];
}
}
for (int i = 0; i < 26; i++) {
for (int j = 0; j < strv[i]; j++) {
printf("%c", i + 'a');
}
}
puts("");
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string a, b, c, k = "", ss, s1;
cin >> a >> b >> c;
bool b1 = true, b2 = true;
ss = a;
s1 = ss;
int bcount = 0, ccount = 0;
int max = 0, t = 0;
while (b1 == true) {
for (int i = 0; i < b.length(); i++) {
int f = ss.find(b[i]);
if (f == string::npos) {
b1 = false;
break;
} else
ss.erase(f, 1);
}
if (b1 == true) {
bcount++;
s1 = ss;
} else
ss = s1;
}
while (b2 == true) {
for (int i = 0; i < c.length(); i++) {
int f = ss.find(c[i]);
if (f == string::npos) {
b2 = false;
break;
} else
ss.erase(f, 1);
}
if (b2 == true) {
ccount++;
s1 = ss;
} else
ss = s1;
}
t = bcount + ccount;
max = t;
a = ss;
int t1 = bcount, t2 = ccount;
while (t1 != 0) {
b2 = true;
s1 += b;
ss += b;
while (b2 == true) {
for (int i = 0; i < c.length(); i++) {
int f = ss.find(c[i]);
if (f == string::npos) {
b2 = false;
break;
} else
ss.erase(f, 1);
}
if (b2 == true) {
t2++;
s1 = ss;
} else
ss = s1;
}
t1--;
t = t1 + t2;
if (t > max) {
max = t;
bcount = t1;
ccount = t2;
a = ss;
}
}
for (int i = 0; i < bcount; i++) k += b;
for (int i = 0; i < ccount; i++) k += c;
sort(a.begin(), a.end());
k += a;
cout << k << endl;
return 0;
}
|
#include <bits/stdc++.h>
using std::cin;
using std::cout;
using std::deque;
using std::endl;
using std::map;
using std::max;
using std::min;
using std::multiset;
using std::pair;
using std::queue;
using std::set;
using std::sort;
using std::stack;
using std::string;
using std::vector;
int main() {
string a, b, c;
cin >> a >> b >> c;
int dataA[26] = {
0,
};
int dataB[26] = {
0,
};
int dataC[26] = {
0,
};
for (int i = 0; i < a.size(); i++) {
dataA[a[i] - 'a']++;
}
for (int i = 0; i < b.size(); i++) {
dataB[b[i] - 'a']++;
}
for (int i = 0; i < c.size(); i++) {
dataC[c[i] - 'a']++;
}
int cntB = 0;
int cntC = 0;
for (int cnt = 0; cnt <= 100000; cnt++) {
int tempA[26];
for (int i = 0; i < 26; i++) {
tempA[i] = dataA[i];
}
int flag = 1;
for (int i = 0; i < 26; i++) {
long long t = (long long)tempA[i] - (long long)cnt * dataB[i];
tempA[i] -= cnt * dataB[i];
if (t < 0) {
flag = 0;
}
}
if (flag == 0) {
break;
}
int x = 1000000;
for (int i = 0; i < 26; i++) {
if (dataC[i] == 0) continue;
x = max(0, min(x, tempA[i] / dataC[i]));
}
if (cnt + x > cntB + cntC) {
cntB = cnt;
cntC = x;
}
}
for (int i = 0; i < 26; i++) {
dataA[i] -= cntB * dataB[i];
dataA[i] -= cntC * dataC[i];
}
for (int i = 0; i < cntB; i++) {
cout << b;
}
for (int i = 0; i < cntC; i++) {
cout << c;
}
for (int i = 0; i < 26; i++) {
for (int j = 0; j < dataA[i]; j++) printf("%c", i + 'a');
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 100000 + 10;
const int maxp = 30;
char a[maxn], b[maxn], c[maxn];
int cnt_a[maxp], cnt_b[maxp], cnt_c[maxp], cnt_d[maxn];
int ans = 0;
int main() {
scanf("%s", a);
scanf("%s", b);
scanf("%s", c);
int len_a = strlen(a);
int len_b = strlen(b);
int len_c = strlen(c);
for (int i = 0; i < len_a; i++) {
cnt_a[a[i] - 'a']++;
cnt_d[a[i] - 'a']++;
}
for (int i = 0; i < len_b; i++) {
cnt_b[b[i] - 'a']++;
}
for (int i = 0; i < len_c; i++) {
cnt_c[c[i] - 'a']++;
}
int max_b = 10000000, max_c = 10000000;
ans = 0;
for (int i = 0; i < 26; i++) {
if (cnt_b[i]) max_b = min(max_b, cnt_a[i] / cnt_b[i]);
if (cnt_c[i]) max_c = min(max_c, cnt_a[i] / cnt_c[i]);
}
int ans_i = -1, ans_j = -1;
for (int i = 0; i <= max_b; i++) {
int cnt = 1000000;
for (int j = 0; j < 26; j++) {
cnt_d[j] = cnt_a[j] - i * cnt_b[j];
}
for (int j = 0; j < 26; j++) {
if (cnt_c[j]) cnt = min(cnt, cnt_d[j] / cnt_c[j]);
}
if (cnt + i > ans) {
ans_i = i;
ans_j = cnt;
ans = cnt + i;
}
}
if (ans_i == -1 || ans_j == -1) {
printf("%s\n", a);
} else {
for (int i = 0; i < 26; i++) {
cnt_a[i] -= cnt_b[i] * ans_i;
cnt_a[i] -= cnt_c[i] * ans_j;
}
for (int i = 1; i <= ans_i; i++) {
printf("%s", b);
}
for (int j = 1; j <= ans_j; j++) {
printf("%s", c);
}
for (int i = 0; i < 26; i++) {
for (int j = 0; j < cnt_a[i]; j++) {
printf("%c", 'a' + i);
}
}
printf("\n");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 3e5 + 4;
int a1[27], a2[27], a3[27];
int main() {
ios::sync_with_stdio(0);
string s1, s2, s3;
cin >> s1 >> s2 >> s3;
for (int i = 0; i < s1.size(); i++) {
a1[s1[i] - 'a']++;
}
for (int i = 0; i < s2.size(); i++) {
a2[s2[i] - 'a']++;
}
for (int i = 0; i < s3.size(); i++) {
a3[s3[i] - 'a']++;
}
int k1 = 0, k2 = 0, sum = 0;
for (int i = 0; i <= 100001; i++) {
int k = 0;
for (int j = 0; j < 26; j++) {
if (a1[j] - a2[j] * i < 0) {
k = 1;
break;
}
}
int kk;
if (k == 0) {
kk = 100002;
for (int j = 0; j < 26; j++) {
if (a3[j] != 0) kk = min(kk, (a1[j] - a2[j] * i) / a3[j]);
}
if (i + kk > sum) {
sum = i + kk;
k1 = i;
k2 = kk;
}
} else
break;
}
for (int i = 0; i < k1; i++) cout << s2;
for (int i = 0; i < k2; i++) cout << s3;
for (int i = 0; i < 26; i++) a1[i] = a1[i] - a2[i] * k1 - a3[i] * k2;
for (int i = 0; i < 26; i++)
for (int j = 0; j < a1[i]; j++) {
char x = 'a' + i;
cout << x;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int cnt[3][26], tmp[26];
int main() {
string str[3];
cin >> str[0] >> str[1] >> str[2];
for (int i = 0; i < 3; i++)
for (int j = 0; j < str[i].length(); j++) cnt[i][str[i][j] - 'a']++;
int c1 = 0, c2 = 0;
bool flag = true;
for (int k = 0;; k++) {
for (int i = 0; i < 26; i++) tmp[i] = cnt[0][i];
for (int i = 0; i < 26; i++)
if (cnt[1][i] != 0) {
tmp[i] -= k * cnt[1][i];
if (tmp[i] < 0) flag = false;
}
if (!flag) break;
int mn = 100000;
for (int i = 0; i < 26; i++)
if (cnt[2][i] != 0) mn = min(mn, tmp[i] / cnt[2][i]);
if (mn == 100000) mn = 0;
if (k + mn > c1 + c2) c1 = k, c2 = mn;
}
for (int i = 0; i < c1; i++) cout << str[1];
for (int i = 0; i < c2; i++) cout << str[2];
for (int i = 0; i < 26; i++) {
cnt[0][i] -= (cnt[1][i] * c1) + (cnt[2][i] * c2);
for (int j = 0; j < cnt[0][i]; j++) cout << (char)(i + 'a');
}
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char c[400005], b[400005], a[400005];
int num[7][400005];
void copy(int x, int y) {
for (int i = 1; i <= 26; i++) num[y][i] = num[x][i];
return;
}
int work(int x, int y, int k) {
int Min = 1000000;
for (int i = 1; i <= 26; i++)
if (num[y][i]) Min = min(Min, num[x][i] / num[y][i]);
for (int i = 1; i <= 26; i++) num[x][i] -= (num[y][i] * k);
return Min;
}
void print(int x, int y) {
if (x == 1) {
for (int i = 1; i <= 26; i++)
for (int j = 1; j <= num[1][i]; j++) printf("%c", i + 'a' - 1);
return;
}
if (x == 2)
for (int i = 1; i <= y; i++) printf("%s", b + 1);
if (x == 3)
for (int i = 1; i <= y; i++) printf("%s", c + 1);
return;
}
int main() {
scanf("%s", a + 1);
int len = strlen(a + 1);
for (int i = 1; i <= len; i++) num[1][a[i] - 'a' + 1]++;
scanf("%s", b + 1);
len = strlen(b + 1);
for (int i = 1; i <= len; i++) num[2][b[i] - 'a' + 1]++;
scanf("%s", c + 1);
len = strlen(c + 1);
for (int i = 1; i <= len; i++) num[3][c[i] - 'a' + 1]++;
copy(1, 4);
int t1 = work(1, 2, 0);
int Max = 0, Maxid = 0;
for (int i = 0; i <= t1; i++) {
copy(4, 1);
work(1, 2, i);
int t2 = work(1, 3, 0);
if (t2 + i > Max) Max = t2 + i, Maxid = i;
}
copy(4, 1);
int rat = work(1, 2, Maxid);
print(2, Maxid);
rat = work(1, 3, Max - Maxid);
print(3, Max - Maxid);
print(1, 1);
puts("");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#pragma comment(linker, "/STACK:64000000")
const int infi = 1e9 + 7;
const long long infl = 1e18 + 7;
int cnt[3][30];
int tmp[30];
string s[3];
int main() {
cin.sync_with_stdio(false);
cin.tie(0);
for (int i = 0; i < (3); ++i) {
cin >> s[i];
for (int j = 0; j < ((int)s[i].size()); ++j) ++cnt[i][s[i][j] - 'a'];
}
pair<int, int> ans = make_pair(0, 0);
for (int q = 0; q < (100500); ++q) {
int flag = 1;
int mn = infi;
for (int i = 0; i < (30); ++i) {
if (cnt[1][i] * q > cnt[0][i]) {
flag = 0;
}
if (cnt[2][i]) {
mn = min(mn, (cnt[0][i] - cnt[1][i] * q) / cnt[2][i]);
}
}
if (!flag) break;
if (ans.first + ans.second < q + mn) {
ans.first = q, ans.second = mn;
}
}
int mn1 = ans.first, mn2 = ans.second;
for (int i = 0; i < (mn1); ++i) cout << s[1];
for (int i = 0; i < (mn2); ++i) cout << s[2];
for (int i = 0; i < (30); ++i) {
cnt[0][i] -= cnt[1][i] * mn1 + cnt[2][i] * mn2;
for (int j = 0; j < (cnt[0][i]); ++j) cout << (char)('a' + i);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int t2[27], u2[27];
int s2[27];
int main() {
string s;
cin >> s;
for (char c : s) s2[c - 'a']++;
string t, u;
cin >> t >> u;
for (char c : t) t2[c - 'a']++;
for (char c : u) u2[c - 'a']++;
int min1 = (int)1e9;
int max1 = (int)-1e9;
for (int x = 0; x <= 27; x++)
if (t2[x]) min1 = min(min1, s2[x] / t2[x]);
int num1 = 0, num2 = 0;
for (int x = 0; x <= min1; x++) {
int min21 = (int)1e9;
for (int y = 0; y <= 26; y++)
if (u2[y]) min21 = min(min21, (s2[y] - t2[y] * x) / u2[y]);
int min2 = min21 + x;
if (max1 < min2) {
max1 = min2;
num1 = x;
num2 = min21;
}
}
for (int x = 0; x < num1; x++) {
cout << t;
for (char c : t) s2[c - 'a']--;
}
for (int x = 0; x < num2; x++) {
cout << u;
for (char c : u) s2[c - 'a']--;
}
for (int x = 0; x < 27; x++)
for (int y = 0; y < s2[x]; y++) cout << char('a' + x);
}
|
#include <bits/stdc++.h>
using namespace std;
char a[100005], b[100005], c[100005];
long letters[27][3];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
memset(letters, 0, sizeof(letters));
cin >> a >> b >> c;
long int lena = strlen(a), lenb = strlen(b), lenc = strlen(c);
for (long i = 0; i < lena; i++) letters[a[i] - 'a'][0]++;
for (long i = 0; i < lenb; i++) letters[b[i] - 'a'][1]++;
for (long i = 0; i < lenc; i++) letters[c[i] - 'a'][2]++;
long int ans = -1;
long int ansb = 0, ansc = 0;
long int mini = lena / lenc;
for (long int i = 0; i <= mini; i++) {
long minb = 999999;
bool posi = true;
for (int j = 0; j < 26; j++) {
long ava = letters[j][0] - i * letters[j][2];
if (ava < letters[j][1]) minb = 0;
if (ava < 0) posi = false;
if (letters[j][1] != 0) minb = min(minb, ava / letters[j][1]);
}
if (!posi) continue;
if (minb + i > ans) {
ans = minb + i;
ansb = minb;
ansc = i;
}
}
for (long int i = 0; i < ansb; i++) {
cout << b;
}
for (long int i = 0; i < ansc; i++) cout << c;
for (int j = 0; j < 26; j++) {
letters[j][0] -= (ansb * letters[j][1] + ansc * letters[j][2]);
for (long int i = 1; i <= letters[j][0]; i++) cout << (char)('a' + j);
}
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string a, b, c;
cin >> a >> b >> c;
int c1[26] = {}, c2[26] = {}, c3[26] = {};
for (int i = 0; i < a.size(); i++) c1[a[i] - 'a']++;
for (int i = 0; i < b.size(); i++) c2[b[i] - 'a']++;
for (int i = 0; i < c.size(); i++) c3[c[i] - 'a']++;
string result;
while (1) {
int MIN2 = 123456789, MIN3 = 123456789;
for (int i = 0; i < 26; i++) {
if (c2[i]) MIN2 = min(MIN2, c1[i] / c2[i]);
if (c3[i]) MIN3 = min(MIN3, c1[i] / c3[i]);
}
if (!MIN2 && !MIN3) break;
if (MIN2 >= MIN3) {
result += b;
for (int i = 0; i < 26; i++) c1[i] -= c2[i];
} else {
result += c;
for (int i = 0; i < 26; i++) c1[i] -= c3[i];
}
}
for (int i = 0; i < 26; i++) {
char tmp = 'a' + i;
for (int w = 0; w < c1[i]; w++) result += tmp;
}
cout << result;
}
|
#include <bits/stdc++.h>
using namespace std;
string a;
string b;
string c;
int ilea[550], ileb[550], ilec[550];
int wyn1, wyn2;
int ilez[550];
int aktu2;
int main() {
cin >> a;
cin >> b;
cin >> c;
for (int i = 0; i < a.size(); i++) {
ilea[a[i]]++;
}
for (int i = 0; i < b.size(); i++) {
ileb[b[i]]++;
}
for (int i = 0; i < c.size(); i++) {
ilec[c[i]]++;
}
for (int aktu1 = 0; aktu1 < (a.size() / b.size()); aktu1++) {
aktu2 = 0;
for (char i = 'a'; i <= 'z'; i++) {
ilez[i] = ilea[i] - aktu1 * ileb[i];
if (ilez[i] < 0) {
aktu2 = -1;
break;
}
}
if (aktu2 < 0) continue;
aktu2 = a.size() + 5;
for (char i = 'a'; i <= 'z'; i++) {
if (ilec[i]) aktu2 = min(aktu2, ilez[i] / ilec[i]);
}
if (aktu1 + aktu2 > wyn1 + wyn2) {
wyn1 = aktu1;
wyn2 = aktu2;
}
}
for (int i = 1; i <= wyn1; i++) {
for (int j = 0; j < b.size(); j++) {
printf("%c", b[j]);
ilea[b[j]]--;
}
}
for (int i = 1; i <= wyn2; i++) {
for (int j = 0; j < c.size(); j++) {
printf("%c", c[j]);
ilea[c[j]]--;
}
}
for (char i = 'a'; i <= 'z'; i++) {
for (int j = 0; j < ilea[i]; j++) printf("%c", i);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
string base;
string a, b;
cin >> base >> a >> b;
long long baseCnt[26];
long long aCnt[26];
long long bCnt[26];
fill(baseCnt, baseCnt + 26, 0);
fill(aCnt, aCnt + 26, 0);
fill(bCnt, bCnt + 26, 0);
for (char c : base) ++baseCnt[c - 'a'];
for (char c : a) ++aCnt[c - 'a'];
for (char c : b) ++bCnt[c - 'a'];
long long aNeed = 0;
long long bNeed = 0;
for (long long i = 0; i <= 100000; ++i) {
bool possible = true;
long long left = 1000000000;
for (int j = 0; j < 26; ++j) {
if (aCnt[j] * i > baseCnt[j]) possible = false;
if (bCnt[j]) left = min(left, (baseCnt[j] - aCnt[j] * i) / bCnt[j]);
}
if (!possible) continue;
if (i + left > aNeed + bNeed) {
aNeed = i;
bNeed = left;
}
}
for (int i = 0; i < aNeed; ++i) cout << a;
for (int i = 0; i < bNeed; ++i) cout << b;
for (int i = 0; i < 26; ++i) {
for (int j = 0; j < baseCnt[i] - aNeed * aCnt[i] - bNeed * bCnt[i]; ++j) {
cout << (char)('a' + i);
}
}
cout << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int A[500], B[500], C[500];
int _A[500];
void build_temp() {
for (int i = 'a'; i <= 'z'; i++) _A[i] = A[i];
}
void remover_b(int k) {
build_temp();
for (int i = 'a'; i <= 'z'; i++) _A[i] -= k * B[i];
}
void remover_c(int k) {
for (int i = 'a'; i <= 'z'; i++) _A[i] -= k * C[i];
}
bool can_b(int k) {
remover_b(k);
for (int i = 'a'; i <= 'z'; i++)
if (_A[i] < 0) return false;
return true;
}
int cont_c() {
int mn = 1000000010;
for (int i = 'a'; i <= 'z'; i++)
if (C[i] != 0) mn = min(mn, _A[i] / C[i]);
return mn;
}
int main() {
string a, b, c;
cin >> a >> b >> c;
for (int i = 0; i < a.size(); i++) A[a[i]]++;
for (int i = 0; i < b.size(); i++) B[b[i]]++;
for (int i = 0; i < c.size(); i++) C[c[i]]++;
int b_n = 0;
int mx_b_n = -1;
int mx_c_n = -1;
while (can_b(b_n)) {
int c_n = cont_c();
if (mx_b_n == -1 && mx_c_n == -1) {
mx_c_n = c_n;
mx_b_n = b_n;
} else if (mx_c_n + mx_b_n < c_n + b_n) {
mx_c_n = c_n;
mx_b_n = b_n;
}
b_n++;
}
for (int i = 0; i < mx_b_n; i++) cout << b;
for (int i = 0; i < mx_c_n; i++) cout << c;
remover_b(mx_b_n);
remover_c(mx_c_n);
for (int i = 'a'; i <= 'z'; i++)
if (_A[i] > 0)
for (int j = 0; j < _A[i]; j++) cout << ((char)i);
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void f(map<char, int>& m, string& s) {
for (int i = 0; i < s.size(); i++) m[s[i]]++;
}
int main() {
ios::sync_with_stdio(false);
string a, b, c;
cin >> a >> b >> c;
map<char, int> x, y, z;
f(x, a);
f(y, b);
f(z, c);
int total = a.size();
for (auto p : y) total = min(total, x[p.first] / p.second);
int ans1 = total, ans2 = 0;
for (int i = total; i >= 0; i--) {
int tmp = a.size();
for (auto p : z) tmp = min(tmp, (x[p.first] - y[p.first] * i) / p.second);
if (i + tmp > ans1 + ans2) {
ans1 = i;
ans2 = tmp;
}
}
for (int i = 0; i < ans1; i++) cout << b;
for (int i = 0; i < ans2; i++) cout << c;
for (auto p : x)
for (int j = ans1 * y[p.first] + ans2 * z[p.first]; j < p.second; j++)
cout << p.first;
cout << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <typename Arg1>
void __f(const char* name, Arg1&& arg1) {
cout << name << " : " << arg1 << '\n';
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args) {
const char* comma = strchr(names + 1, ',');
cout.write(names, comma - names) << " : " << arg1 << " | ";
__f(comma + 1, args...);
}
int inf = 0x3f3f3f3f;
long long infl = 0x3f3f3f3f3f3f3f3fLL;
long double infd = 1.0 / 0.0;
const long long MOD = 1e9 + 7;
const long double pi = 2 * acos(0.0);
vector<int> cntA(130), cntB(130), cntC(130);
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
;
string a, b, c;
cin >> a >> b >> c;
for (int i = 0; i < (int)a.size(); i++) cntA[a[i]]++;
for (int i = 0; i < (int)b.size(); i++) cntB[b[i]]++;
for (int i = 0; i < (int)c.size(); i++) cntC[c[i]]++;
int mn = inf;
for (char j = 'a'; j <= 'z'; j++)
if (cntB[j]) mn = min(mn, cntA[j] / cntB[j]);
int as = 0, posb = 0, posc = 0;
for (int i = 0; i < mn + 1; i++) {
int mn2 = inf;
for (char j = 'a'; j <= 'z'; j++)
if (cntC[j]) mn2 = min(mn2, (cntA[j] - i * cntB[j]) / cntC[j]);
if (i + mn2 > as) {
as = i + mn2;
posb = i;
posc = mn2;
}
}
for (int i = 0; i < posb; i++) {
cout << b;
for (int j = 0; j < (int)b.size(); j++) cntA[b[j]]--;
}
for (int i = 0; i < posc; i++) {
cout << c;
for (int j = 0; j < (int)c.size(); j++) cntA[c[j]]--;
}
for (char j = 'a'; j <= 'z'; j++)
for (int i = 0; i < cntA[j]; i++) cout << j;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long INF = 1e5 + 1;
string a, b, c;
int n, mxa, mxb;
int ac[27], bc[27], cc[27], ec[27];
int main() {
ios_base::sync_with_stdio(false);
cin >> a >> b >> c;
for (long long i = 0; i <= (long long)a.size() - 1; i++) ac[a[i] - 'a']++;
for (long long i = 0; i <= (long long)b.size() - 1; i++) bc[b[i] - 'a']++;
for (long long i = 0; i <= (long long)c.size() - 1; i++) cc[c[i] - 'a']++;
mxa = 0, mxb = 0;
for (long long i = 0; i <= INF; i++) {
bool f = false;
for (long long j = 0; j <= 26; j++) {
ec[j] = ac[j] - i * bc[j];
if (ec[j] < 0) {
f = true;
break;
}
}
if (f) break;
int k = INF;
for (long long j = 0; j <= 26; j++) {
if (cc[j] == 0) continue;
k = min(k, ec[j] / cc[j]);
}
if (i + k > mxa + mxb) mxa = i, mxb = k;
}
for (long long j = 0; j <= 26; j++) {
ec[j] = ac[j] - mxa * bc[j] - mxb * cc[j];
}
for (long long i = 1; i <= mxa; i++) {
cout << b;
}
for (long long i = 1; i <= mxb; i++) {
cout << c;
}
for (long long j = 0; j <= 26; j++) {
while (ec[j] > 0) {
cout << char('a' + j);
ec[j]--;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int fa[100005], fb[100005], fc[100005];
int main() {
string a, b, c, ans = "";
cin >> a >> b >> c;
int i, j, k, l;
for (i = 0; i < int((a).size()); i++) {
fa[a[i] - 'a']++;
}
for (i = 0; i < int((b).size()); i++) {
fb[b[i] - 'a']++;
}
for (i = 0; i < int((c).size()); i++) {
fc[c[i] - 'a']++;
}
int times1 = INT_MAX, flag1 = 0, flag2 = 0, times2 = INT_MAX;
for (i = 0; i < 26; i++) {
if (fb[i]) {
times1 = min(times1, fa[i] / fb[i]);
flag1 = 1;
}
}
for (i = 0; i < 26; i++) {
if (fc[i]) {
flag2 = 1;
times2 = min(times2, fa[i] / fc[i]);
}
}
int maxtimes1 = 0, maxtimes2 = 0, maxtotal = 0, curtimes2, curtimes1;
for (i = 0; i <= times1 + times2 + 5; i++) {
curtimes1 = INT_MAX;
for (k = 0; k < 26; k++) {
if (fb[k]) {
curtimes1 = min(curtimes1, fa[k] / fb[k]);
flag1 = 1;
}
}
int t = min(i, times1);
for (k = 0; k < 26; k++) {
if (fb[k]) {
fa[k] -= (t * fb[k]);
}
}
curtimes2 = INT_MAX;
for (l = 0; l < 26; l++) {
if (fc[l]) {
flag2 = 1;
curtimes2 = min(curtimes2, fa[l] / fc[l]);
}
}
if (curtimes2 + t > maxtotal) {
maxtimes1 = t;
maxtimes2 = curtimes2;
maxtotal = curtimes2 + i;
}
for (k = 0; k < 26; k++) {
if (fb[k]) {
fa[k] += (t * fb[k]);
}
}
}
if (flag2) {
for (i = 0; i < maxtimes2; i++) ans += c;
for (i = 0; i < 26; i++) {
if (fc[i]) {
fa[i] -= maxtimes2 * fc[i];
}
}
}
if (flag1) {
for (i = 0; i < maxtimes1; i++) ans += b;
for (i = 0; i < 26; i++) {
if (fb[i]) {
fa[i] -= (maxtimes1 * fb[i]);
}
}
}
for (i = 0; i < 26; i++) {
while (fa[i] > 0) {
--fa[i];
ans += i + 'a';
}
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
char A[N], B[N], C[N];
int cnt_A[30], cnt_B[30], cnt_C[30];
int main() {
scanf("%s", A);
scanf("%s", B);
scanf("%s", C);
int len_A = strlen(A);
for (int i = 0; i < len_A; ++i) {
++cnt_A[A[i] - 'a'];
}
int len_B = strlen(B);
for (int i = 0; i < len_B; ++i) {
++cnt_B[B[i] - 'a'];
}
int len_C = strlen(C);
for (int i = 0; i < len_C; ++i) {
++cnt_C[C[i] - 'a'];
}
int x = 0, y;
int maxx = -1, max_x, max_y;
while (1) {
int flag = 1;
for (int i = 0; i < 30; ++i) {
if (cnt_A[i] < cnt_B[i] * x) {
flag = 0;
break;
}
}
if (flag == 0) break;
for (int i = 0; i < 30; ++i) {
cnt_A[i] -= cnt_B[i] * x;
}
y = N;
for (int i = 0; i < 30; ++i) {
if (cnt_C[i] == 0) continue;
y = min(y, cnt_A[i] / cnt_C[i]);
}
if (x + y > maxx) {
maxx = x + y;
max_x = x;
max_y = y;
}
for (int i = 0; i < 30; ++i) {
cnt_A[i] += cnt_B[i] * x;
}
++x;
}
string ans = "";
for (int i = 0; i < 30; ++i) {
cnt_A[i] -= max_x * cnt_B[i] + max_y * cnt_C[i];
}
for (int i = 0; i < max_x; ++i) {
ans += string(B);
}
for (int i = 0; i < max_y; ++i) {
ans += string(C);
}
for (int i = 0; i < 30; ++i) {
for (int j = 0; j < cnt_A[i]; ++j) {
ans += char(i + 'a');
}
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
std::string a, b, c, ans("");
int cntA[30], cntB[30], cntC[30];
int CountMax(int arrA[30], int arrB[30]) {
int cnt = 100000 + 10;
for (int i = 0; i < 26; ++i) {
if (arrB[i] != 0) {
if (arrA[i] != 0)
cnt = std::min(cnt, arrA[i] / arrB[i]);
else {
cnt = 0;
break;
}
}
}
return cnt;
}
void Increase(int arrA[30], int arrB[30], int cnt) {
for (int i = 0; i < 26; ++i) arrA[i] += (cnt * arrB[i]);
}
void Decrease(int arrA[30], int arrB[30], int cnt) {
for (int i = 0; i < 26; ++i) arrA[i] -= (cnt * arrB[i]);
}
int main() {
std::cin >> a >> b >> c;
int len = a.length();
for (int i = 0; i < len; ++i) ++cntA[a[i] - 'a'];
len = b.length();
for (int i = 0; i < len; ++i) ++cntB[b[i] - 'a'];
len = c.length();
for (int i = 0; i < len; ++i) ++cntC[c[i] - 'a'];
int maxB = CountMax(cntA, cntB);
int cntMax = 0, iMax = 0, tmp;
for (int i = 0; i <= maxB; ++i) {
Decrease(cntA, cntB, i);
tmp = i + CountMax(cntA, cntC);
if (tmp > cntMax) cntMax = tmp, iMax = i;
Increase(cntA, cntB, i);
}
for (int i = 1; i <= iMax; ++i) ans += b;
Decrease(cntA, cntB, iMax);
iMax = CountMax(cntA, cntC);
for (int i = 1; i <= iMax; ++i) ans += c;
Decrease(cntA, cntC, iMax);
for (int i = 0; i < 26; ++i)
if (cntA[i] != 0) ans += std::string(cntA[i], char('a' + i));
std::cout << ans;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
const int mod = 1e9 + 7;
const double inf = 1e18;
int n, a[N];
double l, r, b[N];
double first(double vl) {
for (int i = 1; i <= n; i++) b[i] = 1.0 * a[i] - vl;
double sum, minsum, ans = -inf;
sum = minsum = 0;
for (int i = 1; i <= n; i++) {
sum += b[i];
ans = max(ans, fabs(sum - minsum));
minsum = min(minsum, sum);
}
double maxsum = 0;
sum = 0;
for (int i = 1; i <= n; i++) {
sum += b[i];
ans = max(ans, fabs(sum - maxsum));
maxsum = max(maxsum, sum);
}
return ans;
}
int main() {
ios_base ::sync_with_stdio(false);
cin >> n;
for (int i = 1; i <= n; i++) cin >> a[i];
l = -N, r = N;
for (int i = 0; i < 100; i++) {
double m1 = l + (r - l) / 3.0;
double m2 = r - (r - l) / 3.0;
if (first(m1) >= first(m2))
l = m1;
else
r = m2;
}
printf("%.12f", min(first(l), first(r)));
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 2000000;
const double esp = 3e-12;
int n;
double a[N + 5], b[N + 5];
double get_max() {
double tmp = 0, ans = 0;
for (int i = 1; i <= n; i++) {
tmp += b[i];
if (tmp < 0) {
tmp = 0;
}
ans = max(ans, tmp);
}
return ans;
}
double get_ans(double x) {
double ans1, ans2;
for (int i = 1; i <= n; i++) b[i] = a[i] - x;
ans1 = get_max();
for (int i = 1; i <= n; i++) b[i] = -b[i];
ans2 = get_max();
return max(ans1, ans2);
}
double solve() {
double l = -1e4, r = 1e4;
while (l + esp < r) {
double midl = (2 * l + r) / 3.0;
double midr = (r * 2 + l) / 3.0;
double w1 = get_ans(midl);
double w2 = get_ans(midr);
if (w1 < w2)
r = midr;
else
l = midl;
}
return get_ans(l);
}
int main() {
while (scanf("%d", &n) != EOF) {
for (int i = 1; i <= n; i++) scanf("%lf", &a[i]);
printf("%.15f\n", solve());
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
double a[int(1e6)];
int n;
double sum(double x) {
double res = -1e15, max_sum = 0, min_sum = 0, s = 0;
for (int i = 1; i <= n; i++) {
s += a[i] - x;
res = max(res, fabs(s - min_sum));
res = max(res, fabs(s - max_sum));
max_sum = max(max_sum, s);
min_sum = min(min_sum, s);
}
return res;
}
void sinus() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
double l = -1e5, r = 1e5;
for (int i = 1; i <= 100; i++) {
double m1 = l + (r - l) / 3;
double m2 = r - (r - l) / 3;
if (sum(m1) < sum(m2))
r = m2;
else
l = m1;
}
printf("%.6f", sum(l));
}
int main() {
ios::sync_with_stdio(false);
sinus();
}
|
#include <bits/stdc++.h>
using namespace std;
int ar[200050];
double v[200050], ma[200050], mi[200050];
double fun(double x, int n) {
int i;
for (i = 0; i < n; i++) v[i] = ar[i] - x;
for (i = 1; i < n; i++) v[i] += v[i - 1];
double a = INT_MIN, b = INT_MAX;
for (i = 0; i < n; i++) a = max(a, v[i]), b = min(b, v[i]);
ma[0] = v[0], mi[0] = v[0];
for (i = 0; i < n; i++)
ma[i] = max(ma[i - 1], v[i]), mi[i] = min(mi[i - 1], v[i]);
double c = INT_MIN, d = INT_MAX;
for (i = n - 1; i >= 0; i--) {
c = max(c, v[i]);
a = max(a, c - mi[i]);
d = min(d, v[i]);
b = min(b, d - ma[i]);
}
a = max(abs(a), abs(b));
return a;
}
double cal(int n) {
int i;
int p = 100000, q = -100000;
for (i = 0; i < n; i++) p = min(p, ar[i]), q = max(q, ar[i]);
double l = p, h = q;
double x, y;
for (i = 0; i < 71; i++) {
x = 2 * l + h, y = l + 2 * h;
x /= 3, y /= 3;
if (fun(x, n) > fun(y, n))
l = x;
else
h = y;
}
return fun(l, n);
}
int main() {
int i, n;
scanf("%d", &n);
for (i = 0; i < n; i++) scanf("%d", &ar[i]);
cout << setprecision(12) << fixed;
cout << cal(n) << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int a1[200000];
int main() {
int n;
double l = -10000, r = 10000, md, a, b, c, d;
scanf("%d", &n);
for (int i = 0; i < n; ++i) scanf("%d", a1 + i);
while (r - l > 1e-12) {
md = (l + r) / 2;
a = -10001;
b = 10001;
c = d = 0;
for (int i = 0; i < n; ++i) {
c += a1[i] - md;
if (c < 0) c = 0;
if (c > a) a = c;
d += a1[i] - md;
if (d > 0) d = 0;
if (d < b) b = d;
}
if (a + b > 0)
l = md;
else
r = md;
}
printf("%.9f\n", a);
}
|
#include <bits/stdc++.h>
using namespace std;
int n, a[200010];
double getf(long double x) {
double s = 0, Min = 0, Max = 0;
for (int i = 1; i <= n; i++) {
s += (double)a[i] - x;
Min = min(Min, s);
Max = max(Max, s);
}
return Max - Min;
}
int main() {
scanf("%d", &n);
int Min = 1000000, Max = -1000000;
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
Min = min(Min, a[i]);
Max = max(Max, a[i]);
}
long double l = Min, r = Max, mid, ma, ml, mr, mb;
ml = getf(l);
mr = getf(r);
while (r - l > 3e-12) {
mid = (r - l) / 3.0;
ma = getf(l + mid);
mb = getf(l + 2 * mid);
if (ma > mb) {
ml = ma;
l = l + mid;
} else {
mr = mb;
r = l + mid + mid;
}
if (r - l <= 3e-12) break;
}
printf("%.6lf\n", getf(l));
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
double a[500008];
long long int n, m, k;
double b[500008];
double f(double mid) {
double sum = 0.0;
double arr[n + 7];
for (int i = 1; i <= n; i++) {
arr[i] = a[i] - mid;
}
double mn = 0;
double maax = 0;
for (int i = 1; i <= n; i++) {
mn += arr[i];
maax += arr[i];
mn = min(mn, arr[i]);
maax = max(maax, arr[i]);
sum = max(sum, abs(mn));
sum = max(sum, abs(maax));
}
return sum;
}
int main() {
long long int t = 1;
while (t--) {
cin >> n;
for (int i = 1; i <= n; i++) cin >> a[i];
double lo = -1e9;
double hi = 1e9;
double midl, midr;
double ans = 1234567891234;
for (int i = 1; i <= 200; i++) {
midl = lo + (hi - lo) / 3;
midr = hi - (hi - lo) / 3;
if (f(midl) > f(midr)) {
lo = midl;
} else
hi = midr;
ans = min(ans, f(midl));
ans = min(ans, f(midr));
}
cout << setprecision(15) << fixed;
cout << ans << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
template <class T>
void rd(T &res) {
res = 0;
char c;
int k = 1;
while (c = getchar(), c < '0')
if (c == '-') k = -k;
do {
res = (res << 1) + (res << 3) + (c ^ 48);
} while (c = getchar(), c >= '0');
res *= k;
}
template <class T>
void pt(T k) {
if (k == 0) return;
pt(k / 10);
putchar((k % 10) ^ 48);
}
template <class T>
void sc(T k) {
pt(k);
if (k == 0) putchar('0');
putchar('\n');
}
template <class T>
void MIN(T &a, T b) {
if (b == -1) return;
if (a == -1 || a > b) a = b;
}
template <class T>
void MAX(T &a, T b) {
if (a < b) a = b;
}
const int M = 2e5 + 5;
int A[M];
int n;
double ans = 2e9;
inline void input() {
int i, j, k;
rd(n);
for (int i = 1, i_END_ = n; i <= i_END_; ++i) rd(A[i]);
}
inline bool check(double x) {
int i, j, k;
double a[2], b[2];
memset(a, 0, sizeof(a));
memset(b, -0x3f, sizeof(b));
for (int i = 1, i_END_ = n; i <= i_END_; ++i) {
a[0] += A[i] - x;
a[1] += x - A[i];
b[0] = max(b[0], a[0]);
b[1] = max(b[1], a[1]);
if (a[0] < 0) a[0] = 0;
if (a[1] < 0) a[1] = 0;
}
ans = min(ans, max(b[0], b[1]));
return b[0] > b[1];
}
inline void solve() {
int i, j, k;
double l = -1e9, r = 1e9, mid;
for (int i = 1, i_END_ = 100; i <= i_END_; ++i) {
mid = 1.0 * (l + r) / 2;
if (check(mid))
l = mid;
else
r = mid;
}
printf("%.15lf\n", ans);
}
int main() {
input();
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
const double eps = 1e-7;
int a[N];
int main() {
int n;
scanf("%d", &n);
for (int i = 0; i < n; i++) scanf("%d", &a[i]);
double Max = 0, Min = 1, now;
double l = -1e4, r = 1e4;
while (fabs(Max + Min) > eps) {
double m = (l + r) / 2;
now = 0;
Max = -1e9;
for (int i = 0; i < n; i++) {
now += a[i] - m;
if (now > Max) Max = now;
if (now < 0) now = 0;
}
now = 0;
Min = 1e9;
for (int i = 0; i < n; i++) {
now += a[i] - m;
if (now < Min) Min = now;
if (now > 0) now = 0;
}
if (Max + Min > 0)
l = m;
else
r = m;
}
printf("%.10f", Max);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long n;
vector<double> a, p;
double poor(double x) {
p[1] = a[1] - x;
for (long long i = 2; i <= n; i++) p[i] = p[i - 1] + a[i] - x;
long long m1 = 0;
long long m2 = 0;
double mn = p[1];
double mx = p[1];
for (long long i = 1; i <= n; i++) {
mx = max(mx, p[i] - p[m1]);
mn = min(mn, p[i] - p[m2]);
if (p[i] < p[m1]) m1 = i;
if (p[i] > p[m2]) m2 = i;
}
return max(abs(mx), abs(mn));
}
signed main() {
cin >> n;
a.resize(n + 1);
p.resize(n + 1);
for (long long i = 1; i <= n; i++) cin >> a[i];
double l = -10000, r = 10000;
for (long long i = 0; i < 300; i++) {
double left = l + (r - l) / 3;
double right = l + 2 * (r - l) / 3;
if (poor(left) < poor(right))
r = right;
else
l = left;
}
cout << fixed << setprecision(10) << poor(l);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int X = 100000 + 5;
long double foo1(vector<long double> &v) {
long double s = 0, mx = 0;
for (int i = 0; i < (int)v.size(); i++) {
s += v[i];
mx = max(mx, s);
if (s < 1e-10) s = 0;
}
return mx;
}
long double foo(long double x, vector<long double> v) {
for (int i = 0; i < (int)v.size(); i++) v[i] = v[i] - x;
long double s = foo1(v);
for (int i = 0; i < (int)v.size(); i++) v[i] *= -1;
s = max(s, foo1(v));
return s;
}
long double calc(vector<long double> &v) {
long double lo = -1e5, hi = 1e5;
for (int it = 1; it < 100; it++) {
long double ml = lo + (hi - lo) / 3.0, mr = hi - (hi - lo) / 3.0;
if (foo(ml, v) <= foo(mr, v))
hi = mr;
else
lo = ml;
}
return foo(lo, v);
}
void MAIN() {
int n;
long double x;
cin >> n;
vector<long double> v;
for (int i = 0; i < n; i++) {
cin >> x;
v.push_back(x);
}
cout << calc(v);
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout << setprecision(12);
MAIN();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 200010;
int a[N];
long double d[N];
long double val[N];
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++) cin >> a[i];
long double l = 1e12, r = 1e12;
l = -l;
for (int z = 1; z <= 400; z++) {
long double mid = (l + r) / 2;
for (int i = 1; i <= n; i++) d[i] = a[i] - mid;
val[0] = 0;
long double res1 = 0;
for (int i = 1; i <= n; i++) {
val[i] = max(d[i], d[i] + val[i - 1]);
res1 = max(res1, val[i]);
}
for (int i = 1; i <= n; i++) d[i] = mid - a[i];
long double res2 = 0;
for (int i = 1; i <= n; i++) {
val[i] = max(d[i], d[i] + val[i - 1]);
res2 = max(res2, val[i]);
}
if (res2 > res1)
r = mid;
else
l = mid;
}
l = (l + r) / 2;
for (int i = 1; i <= n; i++) d[i] = a[i] - l;
long double mini = 0, maxi = 0;
for (int i = 1; i <= n; i++) {
d[i] += d[i - 1];
maxi = max(maxi, d[i]);
mini = min(mini, d[i]);
}
double res = maxi - mini;
printf("%.13f\n", res);
}
|
#include <bits/stdc++.h>
using namespace std;
double a[1234567], b[200030];
int n;
double fun() {
int i;
double maxend = 0.0000, maxsofar = 0.000000;
for (i = 0; i < n; i++) {
maxend = max(b[i], maxend + b[i]);
maxsofar = max(maxsofar, maxend);
}
return maxsofar;
}
int main() {
cin >> n;
int i;
for (i = 0; i < n; i++) cin >> a[i];
double lo = -1e9, hi = 1e9, m1, m2;
int t = 100;
while (t--) {
double mid = (lo + hi) / 2;
for (i = 0; i < n; i++) b[i] = a[i] - mid;
m1 = fun();
for (i = 0; i < n; i++) b[i] = b[i] * (-1);
m2 = fun();
if (m1 > m2)
lo = mid;
else
hi = mid;
}
printf("%.12lf\n", max(m1, m2));
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int INF = 1000000000;
const long long INFll = 1000000000000000000ll;
const int MOD = 1000000007;
const long double EPS = 0.0000000000001;
int n, m;
int a[200500];
long double s;
inline long double getMin(long double x) {
long double ret = 0, t = 0;
long double mn, mx;
s = 0;
mn = 0;
mx = -INFll;
for (int i = 0; i < n; ++i) {
s += a[i] - x;
mx = max(mx, s - mn);
mn = min(s, mn);
}
mx = abs(mx);
return mx;
}
inline long double getMax(long double x) {
long double ret = 0, t = 0;
long double mn, mx;
s = 0;
mn = INFll;
mx = 0;
for (int i = 0; i < n; ++i) {
s += a[i] - x;
mn = min(mn, s - mx);
mx = max(mx, s);
}
mn = abs(mn);
return mn;
}
inline long double get(long double x) { return max(getMin(x), getMax(x)); }
int main() {
ios_base::sync_with_stdio(0);
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
long double l = -10000;
long double r = 10000;
while (r - l > 5 * EPS) {
long double m1 = l + (r - l) / 3.;
long double m2 = r - (r - l) / 3.;
long double f1 = get(m1);
long double f2 = get(m2);
if (f1 > f2) {
l = m1;
} else {
r = m2;
}
}
long double ans = INFll;
while (l <= r) {
ans = min(ans, get(l));
l += EPS;
}
cout << fixed << setprecision(6) << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
double ar[200009], pr[200009];
int N;
double solve(double x) {
int i;
double ans, temp;
for (i = 1; i <= N; i++) {
pr[i] = ar[i] - x;
}
ans = 0.0;
temp = 0.0;
for (i = 1; i <= N; i++) {
temp += pr[i];
ans = max(ans, temp);
if (temp < 0) {
temp = 0.0;
}
}
for (i = 1; i <= N; i++) {
pr[i] = -pr[i];
}
temp = 0.0;
for (i = 1; i <= N; i++) {
temp += pr[i];
ans = max(ans, temp);
if (temp < 0) {
temp = 0.0;
}
}
return ans;
}
int main() {
int cnt, i;
double templeft, tempright, z, x, left, right;
cin >> N;
for (i = 1; i <= N; i++) cin >> ar[i];
left = -30000;
right = 30000;
cnt = 0;
while (cnt <= 150) {
cnt++;
templeft = left * 2.0 / 3.0 + right / 3.0;
tempright = right * 2.0 / 3.0 + left / 3.0;
z = solve(templeft);
x = solve(tempright);
if (z > x) {
left = templeft;
} else {
right = tempright;
}
}
printf("%.10lf\n", z);
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 10;
int n;
long long a[maxn];
double f(double x) {
double mx, mi;
for (int i = 1; i <= n; i++) {
if (i == 1)
mx = mi = a[i] - x * i;
else {
mx = max(mx, a[i] - x * i);
mi = min(mi, a[i] - x * i);
}
}
mx = max(0., mx), mi = min(0., mi);
return mx - mi;
}
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%I64d", &a[i]);
a[i] += a[i - 1];
}
double l = -1e10, r = 1e10;
for (int i = 1; i <= 200; i++) {
double l1 = (2 * l + r) / 3, r1 = (l + 2 * r) / 3;
if (f(l1) < f(r1))
r = r1;
else
l = l1;
}
printf("%.10f\n", f(l));
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long A[200050];
double L = -1e6, R = 1e6;
double ans = (1e9);
int N;
double f(double x) {
double maxm = 0;
double minm = 0;
double pre = 0;
double ans = -1000000009;
for (int i = 1; i <= N; i++) {
pre += A[i] - x;
ans = max(ans, abs(pre - maxm));
ans = max(ans, abs(pre - minm));
maxm = max(maxm, pre);
minm = min(minm, pre);
}
return ans;
}
int main() {
cin.tie(0), ios::sync_with_stdio(false);
cin >> N;
for (int i = 1; i <= N; i++) cin >> A[i];
for (int i = 1; i <= 100; i++) {
double mid1 = L + (R - L) / (3.0);
double mid2 = R - (R - L) / (3.0);
double x = f(mid1), y = f(mid2);
ans = min(ans, min(x, y));
if (x < y)
R = mid2;
else
L = mid1;
}
cout << fixed << setprecision(15) << ans << endl;
}
|
#include <bits/stdc++.h>
const int N = 200002;
const double eps = 1e-7;
int n, i, a[N];
double l, r, lm, rm, u, v, b[N], s[N];
double fabs(double x) { return x > 0 ? x : -x; }
double max(double x, double y) { return x > y ? x : y; }
double f(double x) {
for (i = 1; i <= n; i++) b[i] = a[i] - x, s[i] = s[i - 1] + b[i];
double Max = 0, Min = 0, ans = 0;
for (i = 1; i <= n; i++) {
ans = max(max(Max - s[i], s[i] - Min), ans);
if (s[i] > Max) Max = s[i];
if (s[i] < Min) Min = s[i];
}
return ans;
}
int main() {
scanf("%d", &n);
for (i = 1; i <= n; i++) scanf("%d", a + i);
l = -10000;
r = 10000;
while (1) {
lm = (l * 2 + r) / 3;
rm = (l + r * 2) / 3;
u = f(lm);
v = f(rm);
if (fabs(u - v) < eps && r - l < eps) break;
if (u < v)
r = rm;
else
l = lm;
}
printf("%.10lf", u < v ? u : v);
}
|
#include <bits/stdc++.h>
double a[2000005];
double f(double x, int n) {
int i;
double sum[200005] = {0}, maxl = 0, minl = 0;
for (i = 1; i <= n; i++) {
sum[i] = sum[i - 1] + a[i - 1] - x;
if (maxl < sum[i]) maxl = sum[i];
if (minl > sum[i]) minl = sum[i];
}
return maxl - minl;
}
double solve(double l, double r, int n) {
double mid, mid2;
int t = 200;
while (t--) {
mid = (l + r) / 2.0;
mid2 = (mid + r) / 2.0;
if (f(mid, n) < f(mid2, n))
r = mid2;
else
l = mid;
}
return l;
}
int main() {
int n, i;
double hzb;
while (~scanf("%d", &n)) {
for (i = 0; i < n; i++) scanf("%lf", &a[i]);
hzb = solve(-1e9, 1e9, n);
printf("%.15lf\n", f(hzb, n));
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long N = 2e5 + 10, inf = 1e3 + 5, mod = 1e9 + 7, NN = 1e5 + 10;
int n;
long double a[N];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n;
for (int i = 0; i < n; i++) cin >> a[i];
long double low = *min_element(a, a + n), high = *max_element(a, a + n), mid,
pos = 0, neg = 0;
for (int temp = 0; temp < 200; temp++) {
mid = (high + low) / 2;
long double c = 0;
pos = neg = 0;
for (int i = 0; i < n; i++) {
c += a[i] - mid;
if (c < 0.0) c = 0;
pos = max(c, pos);
}
c = 0;
for (int i = 0; i < n; i++) {
c += mid - a[i];
if (c < 0.0) c = 0;
neg = max(neg, c);
}
if (pos > neg)
low = mid;
else
high = mid;
}
cout << fixed << setprecision(8) << max(pos, neg);
}
|
#include <bits/stdc++.h>
using namespace std;
int n;
int arr[200000];
long double sum(long double x) {
long double maxF = 0, maxE = 0;
long double minF = 0, minE = 0;
for (int i = int(0); i < int(n); i++) {
maxE = max(arr[i] - x, maxE + arr[i] - x);
maxF = max(maxF, maxE);
minE = min(arr[i] - x, minE + arr[i] - x);
minF = min(minF, minE);
}
return max(abs(maxF), abs(minF));
}
long double binSearch() {
long double lo = -10000, hi = 10000;
long double x1, x2, s1, s2;
while (abs(hi - lo) > 1e-12) {
x1 = (lo + lo + hi) / 3;
x2 = (lo + hi + hi) / 3;
s1 = sum(x1);
s2 = sum(x2);
if (s1 < s2)
hi = x2;
else
lo = x1;
}
return s1;
}
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cin.tie(0), cout.tie(0),
cout.precision(7);
while (cin >> n) {
for (int i = int(0); i < int(n); i++) cin >> arr[i];
cout << binSearch() << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
double a[200005];
int n;
double maxi(double x) {
double min1 = 0, ans = -1000000007;
a[1] -= x;
ans = a[1];
min1 = min(min1, ans);
for (int i = 2; i <= n; i++) {
a[i] -= i * x;
ans = max(ans, a[i] - min1);
if (a[i] < min1) min1 = a[i];
}
return ans;
}
double mini(double x) {
double max1 = 0, ans = 1000000007;
ans = a[1];
max1 = max(max1, ans);
a[1] += x;
for (int i = 2; i <= n; i++) {
ans = min(ans, a[i] - max1);
if (a[i] > max1) max1 = a[i];
a[i] += i * x;
}
return ans;
}
int main() {
int i, j, k, t;
double l, r, m, tol = 0.0000001, x = 1, y = 100;
scanf("%d", &n);
for (i = 1; i <= n; i++) {
scanf("%lf", &a[i]);
a[i] += a[i - 1];
}
l = -10000, r = 10000;
t = 100;
while (t--) {
m = (l + r) / 2;
y = maxi(m);
x = mini(m);
if (x > 0)
l = m + tol;
else if (y < 0)
r = m - tol;
else if (abs(x) == abs(y)) {
printf("%lf\n", abs(x));
return 0;
} else if (abs(x) > abs(y))
r = m - tol;
else
l = m + tol;
}
printf("%lf\n", abs(y));
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, seq[200000];
double eval(double x) {
double csum = 0, cmin = 0, cmax = 0, ans = 0;
for (int i = 0; i < n; i++) {
csum += (seq[i] - x);
cmin = min(cmin, csum), cmax = max(cmax, csum);
ans = max(ans, max(csum - cmin, cmax - csum));
}
return ans;
}
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++) scanf("%d", &seq[i]);
double l = -10000, r = 10000, E = 0.00000000001;
while (r - l > 0.00000000001) {
double m1 = l + (r - l) / 3, m2 = r - (r - l) / 3;
if (eval(m1) < eval(m2))
r = m2;
else
l = m1;
}
cout << fixed << setprecision(10) << eval((l + r) / 2);
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10, INF = 0x3f3f3f3f, MOD = 1e9 + 7;
const double eps = 1e-8;
int n;
double a[N], b[N];
double check(double x) {
for (int i = 1; i <= n; ++i) b[i] = a[i] - x;
double sum = 0, ans1 = 0, ans2 = 0;
for (int i = 1; i <= n; ++i) {
sum += b[i];
if (sum > ans1) ans1 = sum;
if (sum < 1e-10) sum = 0;
}
sum = 0;
for (int i = 1; i <= n; ++i) {
sum += b[i];
if (sum < ans2) ans2 = sum;
if (sum > 1e-10) sum = 0;
}
return max(ans1, -ans2);
}
int main() {
ios_base::sync_with_stdio(0);
while (scanf("%d", &n) == 1) {
for (int i = 1; i <= n; ++i) scanf("%lf", a + i);
double l = -1e10, r = 1e10;
for (int i = 1; i <= 300; ++i) {
double ll = (l + r) / 2, rr = (ll + r) / 2;
if (check(ll) < check(rr))
r = rr;
else
l = ll;
}
printf("%.10f\n", check(l));
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
double max1, sum, a[200001], b[200001], n;
double f(double y) {
max1 = 0;
long long i;
double sum1 = 0, sum2 = 0;
for (i = 1; i <= n; i++) a[i] = b[i];
for (i = 1; i <= n; i++) a[i] -= y;
for (i = 1; i <= n; i++) {
sum1 += a[i];
sum2 += a[i];
max1 = max(max1, max(abs(sum1), abs(sum2)));
if (sum2 < 0) sum2 = 0;
if (sum1 > 0) sum1 = 0;
}
return max1;
}
int main() {
double ri, le, ri1, le1;
long long i, j;
cin >> n;
for (i = 1; i <= n; i++) cin >> b[i];
le = -10000;
ri = 10000;
le1 = le + (ri - le) / 3;
ri1 = ri - (ri - le) / 3;
while (1) {
if (ri - le < 0.00000000001) {
max1 = f((ri + le) / 2);
;
break;
} else {
le1 = le + (ri - le) / 3;
ri1 = ri - (ri - le) / 3;
if (f(le1) > f(ri1)) {
le = le1;
} else {
ri = ri1;
}
}
}
cout.precision(15);
cout << fixed << max1;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n;
long double a[200005], b[200005];
long double fun(long double x) {
for (int i = 0; i < n; i++) {
b[i] = a[i] - x;
}
long double msum = b[0];
long double ans = b[0];
int i;
for (i = 1; i < n; i++) {
msum = max(b[i], msum + b[i]);
ans = max(ans, msum);
}
long double msum1 = b[0];
long double ans1 = b[0];
for (i = 1; i < n; i++) {
msum1 = min(msum1 + b[i], b[i]);
ans1 = min(ans1, msum1);
}
return max(abs(ans), abs(ans1));
}
int main() {
cin >> n;
int i;
for (i = 0; i < n; i++) {
cin >> a[i];
}
long double lo = -2000000200, hi = 2000000200;
long double m1, m2, ans;
long double eps = 1e-13;
while (hi - lo > eps) {
m1 = lo + (hi - lo) / 3;
m2 = hi - (hi - lo) / 3;
long double val1 = fun(m1);
long double val2 = fun(m2);
if (val1 < val2) {
hi = m2;
} else {
lo = m1;
}
}
ans = fun(lo);
cout << fixed << setprecision(10) << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
double f(double m, vector<int> &v) {
int n = v.size();
vector<long double> v2(n);
for (int i = 0; i < (n); i++) v2[i] = v[i] - m;
long double mx_otr = 0;
long double mn_otr = 0;
long double cur = 0;
for (int i = 0; i < (n); i++) {
cur += v2[i];
if (cur < 0) cur = 0;
mx_otr = max(mx_otr, cur);
}
cur = 0;
for (int i = 0; i < (n); i++) {
cur += v2[i];
if (cur >= 0) cur = 0;
mn_otr = min(mn_otr, cur);
}
return max(mx_otr, abs(mn_otr));
}
inline void solve() {
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < (n); i++) cin >> v[i];
long double l = -10000, r = 10000;
while (abs(r - l) > 1e-12) {
long double m1 = l + (r - l) / 3;
long double m2 = r - (r - l) / 3;
if (f(m1, v) <= f(m2, v))
r = m2;
else
l = m1;
}
cout << fixed << setprecision(10) << f(l + (r - l) / 2.0, v);
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int q = 1;
while (q--) {
solve();
cout << '\n';
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int inf = 1e9;
const int MOD = 1e9 + 7;
const int N = 2e5 + 10;
const double eps = 1e-9;
int n, a[N];
double cal(double x) {
double ans = 0, cur = 0;
for (auto i = 1; i <= n; i++) {
cur = max(.0, cur + a[i] - x);
ans = max(ans, cur);
}
cur = 0;
for (auto i = 1; i <= n; i++) {
cur = max(.0, cur + x - a[i]);
ans = max(ans, cur);
}
return ans;
}
int main() {
scanf("%d", &n);
for (auto i = 1; i <= n; i++) scanf("%d", a + i);
double L = -1e4, R = 1e4;
for (auto phase = 1; phase <= 300; phase++) {
double L1 = L + (R - L) / 3, R1 = R - (R - L) / 3;
if (cal(L1) > cal(R1))
L = L1;
else
R = R1;
}
printf("%.9f", cal(L));
}
|
#include <bits/stdc++.h>
const double f1 = (double)1 / 3, f2 = (double)2 / 3;
const double INF = 1e9;
int a[200005], n;
inline double max(double a, double b) { return a > b ? a : b; }
double poor(double x) {
double m = 0, M = 0, sum = INF, suM = -INF;
double ret;
for (int i = 0; i < n; i++) {
double num = a[i] - x;
if (sum > 0)
sum = num;
else
sum += num;
if (suM < 0)
suM = num;
else
suM += num;
ret = max(ret, max(fabs(sum), fabs(suM)));
}
return ret;
}
double solve() {
double r[2] = {-1e4 - 1, 1e4 + 1};
for (int t = 0; t < 100 && r[0] < r[1]; t++) {
double v[2], diff = r[1] - r[0];
v[0] = poor(r[0] + f1 * diff);
v[1] = poor(r[0] + f2 * diff);
if (v[0] < v[1])
r[1] = r[0] + f2 * diff;
else
r[0] = r[0] + f1 * diff;
}
return poor(r[0]);
}
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
printf("%f\n", solve());
}
|
#include <bits/stdc++.h>
using namespace std;
template <typename T>
inline void mn(T& x, const T& y) {
if (y < x) x = y;
}
template <typename T>
inline void mx(T& x, const T& y) {
if (x < y) x = y;
}
template <typename T>
inline int sz(const T& x) {
return x.size();
}
const int N = 200000;
int a[N];
double p[N + 1];
double f(const int n, const double x) {
p[0] = 0;
for (int i = 0; i < (n); ++i) {
p[i + 1] = p[i] + (a[i] - x);
}
double min_prev = 0;
double max_prev = 0;
double min_total = numeric_limits<double>::max();
double max_total = numeric_limits<double>::min();
for (int i = 1; i <= n; ++i) {
mn(min_total, p[i] - max_prev);
mx(max_total, p[i] - min_prev);
mn(min_prev, p[i]);
mx(max_prev, p[i]);
}
return max(abs(min_total), abs(max_total));
}
int main() {
int n;
scanf("%d", &n);
for (int i = 0; i < (n); ++i) {
scanf("%d", &a[i]);
}
double l = -1e9;
double r = +1e9;
for (int iter = 0; iter < (200); ++iter) {
double ll = l + (r - l) / 3;
double rr = r - (r - l) / 3;
if (f(n, ll) < f(n, rr)) {
r = rr;
} else {
l = ll;
}
}
printf("%.12lf\n", f(n, l));
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 11;
long long a[N];
int n;
double maxpoor(double x) {
double min_sum = 0.0;
double max_sum = 0.0;
double cur_sum = 0.0;
double ans = 0.0;
for (int i = 1; i <= n; i++) {
cur_sum += a[i] - x;
ans = max(ans, fabs(cur_sum - min_sum));
ans = max(ans, fabs(cur_sum - max_sum));
min_sum = min(min_sum, cur_sum);
max_sum = max(max_sum, cur_sum);
}
return ans;
}
int main() {
while (1 == scanf("%d", &n)) {
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
double lo = -1e5, hi = 1e5;
for (int i = 0; i < 200; i++) {
double left = lo + (hi - lo) / 3.0;
double right = hi - (hi - lo) / 3.0;
if (maxpoor(left) < maxpoor(right))
hi = right;
else
lo = left;
}
printf("%.8f\n", maxpoor(lo));
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int MAXN = 200000;
using namespace std;
void RI() {}
template <typename... T>
void RI(int& head, T&... tail) {
scanf("%d", &head);
RI(tail...);
}
int a[200000];
vector<pair<double, double> > lines;
double intersection(pair<double, double> a, pair<double, double> b) {
double x = (a.second - b.second) / (a.first - b.first);
double y = (a.first * x) - a.second;
return x;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
RI(n);
for (int i = 0; i < int(n); i++) RI(a[i]);
double c = 0;
lines.push_back(make_pair(0, 0));
for (int i = 0; i < int(n); i++) {
c = c + a[i];
lines.push_back(make_pair(i + 1, c));
}
vector<int> s1;
vector<int> s2;
s1.push_back(n);
s1.push_back(n - 1);
for (int j = n - 2; j >= 0; j--) {
while (1) {
if (s1.size() == 1) {
break;
}
if (intersection(lines[s1[s1.size() - 2]], lines[j]) >=
intersection(lines[s1[s1.size() - 2]], lines[s1[s1.size() - 1]])) {
s1.pop_back();
} else {
break;
}
}
s1.push_back(j);
}
s2.push_back(0);
s2.push_back(1);
for (int j = 2; j <= n; j++) {
while (1) {
if (s2.size() == 1) {
break;
}
if (intersection(lines[s2[s2.size() - 2]], lines[j]) >=
intersection(lines[s2[s2.size() - 2]], lines[s2[s2.size() - 1]])) {
s2.pop_back();
} else {
break;
}
}
s2.push_back(j);
}
int curr_line = 0;
double ans = 1000000000.0;
for (int j = 0; j < s2.size() - 1; j++) {
double inter1 = intersection(lines[s2[j]], lines[s2[j + 1]]);
while (1) {
if (curr_line >= s1.size() - 1) {
break;
}
double inter =
intersection(lines[s1[curr_line]], lines[s1[curr_line + 1]]);
if (inter <= inter1) {
break;
} else {
curr_line++;
}
}
double y1 = (lines[s2[j]].first * inter1) - lines[s2[j]].second;
double y2 =
(lines[s1[curr_line]].first * inter1) - lines[s1[curr_line]].second;
ans = min(abs(y2 - y1), ans);
}
curr_line = 0;
for (int j = 0; j < s1.size() - 1; j++) {
double inter1 = intersection(lines[s1[j]], lines[s1[j + 1]]);
while (1) {
if (curr_line >= s2.size() - 1) {
break;
}
double inter =
intersection(lines[s2[curr_line]], lines[s2[curr_line + 1]]);
if (inter <= inter1) {
break;
} else {
curr_line++;
}
}
double y1 = (lines[s1[j]].first * inter1) - lines[s1[j]].second;
double y2 =
(lines[s2[curr_line]].first * inter1) - lines[s2[curr_line]].second;
ans = min(abs(y2 - y1), ans);
}
printf("%.12f\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int s[204800], n;
double f(double x) {
double l = 0, h = 0;
for (int i = 1; i <= n; ++i) {
l = min(l, i * x - s[i]);
h = max(h, i * x - s[i]);
}
return h - l;
}
int main() {
scanf("%d", &n);
double L = 9e9, R = -9e9, t;
for (int i = 1; i <= n; ++i) {
scanf("%d", s + i);
s[i] += s[i - 1];
t = s[i];
t /= i;
L = min(t, L);
R = max(t, R);
}
for (int tm = 70; tm--;) {
double M1 = (L * 2 + R) / 3, M2 = (L + R * 2) / 3;
if (f(M1) < f(M2))
R = M2;
else
L = M1;
}
printf("%.9lf\n", f(ldexp(L + R, -1)));
}
|
#include <bits/stdc++.h>
using namespace std;
const long double eps = 1e-12;
const long long MOD = 1e9 + 7;
int dx[4] = {1, 0, 0, -1};
int dy[4] = {0, 1, -1, 0};
void fail() {
cout << "-1";
exit(0);
}
void win() {
cout << "YES";
exit(0);
}
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
long double p[300300], a[300300];
int n;
long double f(long double x) {
p[0] = a[0] - x;
for (int i = 1; i < n; i++) p[i] = p[i - 1] + a[i] - x;
long double ans1 = -2e12, ans2 = 2e12;
long double mn = 2e9 + 41;
for (int i = 0; i < n; i++) {
ans1 = max(p[i] - mn, max(p[i], ans1));
mn = min(mn, p[i]);
}
mn = -2e9 - 41;
for (int i = 0; i < n; i++) {
ans2 = min(p[i] - mn, min(p[i], ans2));
mn = max(mn, p[i]);
}
return max(fabs(ans1), fabs(ans2));
}
int main() {
cin >> n;
for (int i = 0; i < n; i++) cin >> a[i];
long double l = -1e5, r = 1e5;
for (int q = 0; q < 100; q++) {
long double m1 = l + (r - l) / 3, m2 = r - (r - l) / 3;
if (f(m1) < f(m2))
r = m2;
else
l = m1;
}
cout.precision(10);
cout << fixed << f(l);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
double a[200009];
int n;
long double calc(long double x) {
long double ans = 0;
long double cur = 0;
for (int i = 0; i < n; i++) {
cur += a[i] - x;
if (cur < 0) cur = 0;
ans = max(cur, ans);
}
cur = 0;
for (int i = 0; i < n; i++) {
cur += a[i] - x;
if (cur > 0) cur = 0;
ans = max(-cur, ans);
}
return ans;
}
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%lf", a + i);
}
long double lo = -10001, hi = 10001;
for (int i = 0; i < 100; i++) {
auto m1 = lo + (hi - lo) / 3.0;
auto m2 = hi - (hi - lo) / 3.0;
auto f1 = calc(m1);
auto f2 = calc(m2);
if (f1 > f2)
lo = m1;
else
hi = m2;
}
long double ans = calc(lo);
printf("%f\n", (double)ans);
}
|
#include <bits/stdc++.h>
using namespace std;
int n;
vector<int> a(n);
double f(double x) {
double mx = 0, sum1 = 0, sum2 = 0;
for (int i = 0; i < n; ++i) {
sum1 = max(0., sum1 + a[i] - x);
sum2 = max(0., sum2 + x - a[i]);
mx = max({mx, sum1, sum2});
}
return mx;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n;
a.resize(n);
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
double l = -1e4, r = 1e4;
for (int rep = 0; rep < 200; ++rep) {
double mid1 = l + (r - l) / 3;
double mid2 = r - (r - l) / 3;
if (f(mid1) > f(mid2)) {
l = mid1;
} else {
r = mid2;
}
}
cout << fixed << setprecision(10) << f(l);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 5;
int a[maxn];
int p[maxn];
int n;
long double f(long double x) {
long double minx = 0;
long double maxx = 0;
for (int i = 0; i <= n; i++)
minx = min(minx, (long double)p[i] + (long double)i * x),
maxx = max(maxx, (long double)p[i] + (long double)i * x);
return maxx - minx;
}
int main() {
scanf("%d", &n);
p[0] = 0;
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
p[i + 1] = p[i] + a[i];
}
long double l = -3e9;
long double r = 3e9;
for (int it = 0; it < 150; it++) {
long double m1 = l + (r - l) / 3.;
long double m2 = r - (r - l) / 3.;
if (f(m1) < f(m2))
r = m2;
else
l = m1;
}
printf("%.30f", (double)(f(l)));
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 200005;
const double eps = 1e-12;
const double inf = 1e10;
int n, a[maxn];
double dp[2][maxn];
int main() {
int i, j;
scanf("%d", &n);
for (i = 0; i < n; i++) scanf("%d", &a[i]);
double t1, t2, mid, lb = -20000, rb = 20000;
while (rb - lb > eps) {
mid = (lb + rb) / 2;
for (i = 0; i < n; i++) dp[0][i] = t1 = -inf, dp[1][i] = t2 = inf;
for (i = 0; i < n; i++) {
dp[0][i] = i ? max(a[i] - mid, dp[0][i - 1] + a[i] - mid) : a[i] - mid;
dp[1][i] = i ? min(a[i] - mid, dp[1][i - 1] + a[i] - mid) : a[i] - mid;
t1 = max(t1, dp[0][i]);
t2 = min(t2, dp[1][i]);
}
if (t1 + t2 > 0)
lb = mid;
else
rb = mid;
}
printf("%.9f\n", t1);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int const MAXN = 2e5 + 5;
double arr[MAXN], tmp[MAXN];
int n;
double f(int x) {
double mx = 0, cur = 0;
for (int i = 0; i < n; i++) {
cur += tmp[i];
if (cur > mx) mx = cur;
if (cur < 0) cur = 0;
}
return mx;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n;
for (int i = 0; i < n; i++) cin >> arr[i];
double l = *min_element(arr, arr + n);
double r = *max_element(arr, arr + n);
double e = 1e-8, m, vp, vn;
for (int i = 0; i < 100; i++) {
m = (l + r) / 2;
for (int i = 0; i < n; i++) tmp[i] = arr[i] - m;
vp = f(m);
for (int i = 0; i < n; i++) tmp[i] *= -1;
vn = f(m);
if (vp > vn)
l = m;
else
r = m;
}
m = (l + r) / 2;
for (int i = 0; i < n; i++) tmp[i] = arr[i] - m;
vp = f(m);
for (int i = 0; i < n; i++) tmp[i] *= -1;
vn = f(m);
cout << fixed << setprecision(6) << max(vp, vn) << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1234567;
const double eps = 1e-11;
const int inf = (int)2e9;
const int mod = (int)1e9 + 7;
double a[200009];
double b[200009];
int n;
double get() {
double sum = 0;
double ans = 0;
for (int i = 0; i < n; ++i) {
if (b[i] + sum < 0)
sum = 0;
else
sum = sum + b[i];
ans = max(ans, sum);
}
return ans;
}
double f(double k) {
double ret = 0;
for (int i = 0; i < n; ++i) b[i] = a[i] - k;
ret = get();
for (int i = 0; i < n; ++i) b[i] = -b[i];
ret = max(ret, get());
return ret;
}
int main() {
scanf("%d", &n);
for (int i = 0; i < n; ++i) {
scanf("%lf", a + i);
}
int cnt = 400;
double l = -1e10, r = 1e10;
while (cnt--) {
double m1 = l + (r - l) / 3, m2 = r - (r - l) / 3;
if (f(m1) > f(m2))
l = m1;
else
r = m2;
}
cout << fixed << setprecision(16) << f(r) << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int OnlineJudge = 0;
const int maxn = 200000 + 1912;
const long long INF = 1000LL * 1000 * 1000 * 1000;
int n;
int a[maxn];
long long sum[maxn];
void ReadData() {
cin >> n;
for (int _a = 1, _b = n, i = _a; i <= n; i++) cin >> a[i];
for (int _a = 1, _b = n, i = _a; i <= n; i++) sum[i] = sum[i - 1] + a[i];
}
long double f(long double x) {
long double mn = 0, mx = 0;
for (int _a = 1, _b = n, i = _a; i <= n; i++) {
mn = min(mn, sum[i] - x * i);
mx = max(mx, sum[i] - x * i);
}
return abs(mx - mn);
}
void Process() {
long double low = (long double)*min_element(a + 1, a + 1 + n),
high = (long double)*max_element(a + 1, a + 1 + n);
for (int Try = 0, _a = 120; Try < _a; Try++) {
long double MidL = (high + low + low) / 3, MidR = (high + high + low) / 3;
if (f(MidL) < f(MidR))
high = MidR;
else
low = MidL;
}
cout << fixed << setprecision(9);
cout << min(f(low), f(high)) << "\n";
}
int main() {
std ::ios_base::sync_with_stdio(false);
cin.tie(0);
ReadData();
Process();
return 0;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.