text
stringlengths 49
983k
|
|---|
#include <cstdio>
#include <iostream>
#include <set>
using namespace std;
inline char nc() {
static char buf[100000], *l = buf, *r = buf;
return l==r&&(r=(l=buf)+fread(buf,1,100000,stdin),l==r)?EOF:*l++;
}
template<class T> void read(T &x) {
x = 0; int f = 1, ch = nc();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=nc();}
while(ch>='0'&&ch<='9'){x=x*10-'0'+ch;ch=nc();}
x *= f;
}
int X, Y, Z;
multiset<string> s;
int main() {
// freopen("testdata.in", "r", stdin);
read(X), read(Y), read(Z);
for(int i = 1; i <= X; ++i) {
s.insert("a");
}
for(int i = 1; i <= Y; ++i) {
s.insert("b");
}
for(int i = 1; i <= Z; ++i) {
s.insert("c");
}
set<string> :: iterator it;
while(s.size() > 1) {
string a, b;
it = s.begin(); a = *it; s.erase(it);
it = s.end(); b = *(--it); s.erase(it);
s.insert(a + b);
}
cout << *s.begin() << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(int i=0,_n=(int)(n);i<_n;++i)
template<class T>bool chmin(T&a,const T&b){return a>b?(a=b,true):false;}
template<class T>bool chmax(T&a,const T&b){return a<b?(a=b,true):false;}
int nextInt() { int x; scanf("%d", &x); return x;}
int main2() {
int X = nextInt();
int Y = nextInt();
int Z = nextInt();
vector<string> v;
REP(i, X) v.push_back("a");
REP(i, Y) v.push_back("b");
REP(i, Z) v.push_back("c");
while (v.size() > 1) {
sort(v.begin(), v.end());
v.front() += v.back();
v.erase(v.begin() + v.size() - 1);
}
cout << v.front() << endl;
return 0;
}
int main() {
for (;!cin.eof();cin>>ws) main2();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long lint;
typedef pair<int, int> pi;
const int mod = 1e9 + 7;
const int MAXN = 4005;
#define rend fuck
int x, y, z;
string s;
int dp[51][51][51][51];
int link[51][3]; // -1 if failure, otherwise follow it's next
int fail[51];
bool rend[MAXN];
bool f(int x, int y, int z, int m){
if(m == s.size()) m = fail[m];
if(x + y + z == 0) return rend[m];
if(~dp[x][y][z][m]) return dp[x][y][z][m];
int ret = 0;
if(link[m][0] != -1 && x && f(x-1, y, z, link[m][0])) ret = 1;
if(link[m][1] != -1 && y && f(x, y-1, z, link[m][1])) ret = 1;
if(link[m][2] != -1 && z && f(x, y, z-1, link[m][2])) ret = 1;
return dp[x][y][z][m] = ret;
}
bool trial(){
int p = 0;
for(int i=1; i<s.size(); i++){
while(p && s[i] != s[p]) p = fail[p];
if(s[i] == s[p]) p++;
fail[i+1] = p;
}
for(int i=0; i<s.size(); i++){
for(int j=0; j<3; j++){
int pos = i;
if(s[i] > j + 'a'){
link[i][j] = -1;
continue;
}
while(pos && s[pos] != j + 'a') pos = fail[pos];
if(s[pos] == j + 'a') pos++;
link[i][j] = pos;
}
}
for(int i=0; i<s.size(); i++){
int pos = i;
rend[i] = 1;
for(int j=0; j<s.size(); j++){
pos = link[pos][s[j] - 'a'];
if(pos == -1){
rend[i] = 0;
break;
}
}
}
memset(dp, -1, sizeof(dp));
return f(x, y, z, 0);
}
int main(){
cin >> x >> y >> z;
while(s.size() < x + y + z){
s.push_back('c');
if(trial()) continue;
s.back() = 'b';
if(trial()) continue;
s.back() = 'a';
}
cout << s << endl;
}
|
#include<stdio.h>
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<string.h>
#ifdef LOCAL
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
#define NDEBUG
#define eprintf(...) do {} while (0)
#endif
#include<cassert>
using namespace std;
typedef long long LL;
typedef vector<int> VI;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define EACH(i,c) for(__typeof((c).begin()) i=(c).begin(),i##_end=(c).end();i!=i##_end;++i)
template<class T> inline void amin(T &x, const T &y) { if (y<x) x=y; }
template<class T> inline void amax(T &x, const T &y) { if (x<y) x=y; }
template<class Iter> void rprintf(const char *fmt, Iter begin, Iter end) {
for (bool sp=0; begin!=end; ++begin) { if (sp) putchar(' '); else sp = true; printf(fmt, *begin); }
putchar('\n');
}
string dp[51][51][51];
int X, Y, Z;
int N;
string S;
// qUUUU >= UUUUU
bool ok() {
REP (x, X+1) REP (y, Y+1) REP (z, Z+1) dp[x][y][z].clear();
REP (x, X+1) REP (y, Y+1) REP (z, Z+1) if (x+y+z == (int)dp[x][y][z].size()) {
for (char c='c'; c>='a'; c--) {
string g = string(1, c) + dp[x][y][z];
string &t = (c=='c'? dp[x][y][z+1]:
(c=='b'? dp[x][y+1][z]: dp[x+1][y][z]));
if (t.empty() || t < g) if (g + S + S > S + S) {
t = g;
}
}
}
return !dp[X][Y][Z].empty();
}
void MAIN() {
scanf("%d%d%d", &X, &Y, &Z);
N = X + Y + Z;
S = string(N, 'a');
REP (i, N) {
S[i] = 'c';
if (!ok()) {
S[i] = 'b';
if (!ok()) S[i] = 'a';
}
}
puts(S.c_str());
}
int main() {
int TC = 1;
// scanf("%d", &TC);
REP (tc, TC) MAIN();
return 0;
}
|
#include <iostream>
#include <string>
#include <utility>
#define llint long long
using namespace std;
typedef pair<llint, llint> P;
int n;
int x, y, z;
string dp[55][55][55];
string ans;
bool check(string s)
{
while(s.size() < n) s += 'a';
for(int i = 0; i <= x; i++){
for(int j = 0; j <= y; j++){
for(int k = 0; k <= z; k++){
dp[i][j][k] = "";
}
}
}
dp[0][0][0] = s;
for(int i = 0; i <= x; i++){
for(int j = 0; j <= y; j++){
for(int k = 0; k <= z; k++){
if(dp[i][j][k] < s) continue;
if(i+1 <= x) dp[i+1][j][k] = max(dp[i+1][j][k], ('a' + dp[i][j][k]).substr(0, n));
if(j+1 <= y) dp[i][j+1][k] = max(dp[i][j+1][k], ('b' + dp[i][j][k]).substr(0, n));
if(k+1 <= z) dp[i][j][k+1] = max(dp[i][j][k+1], ('c' + dp[i][j][k]).substr(0, n));
}
}
}
return (dp[x][y][z] >= s);
}
int main(void)
{
cin >> x >> y >> z;
n = x + y + z;
for(int i = 0; i < n; i++){
for(int j = 2; j >= 0; j--){
string s = ans + ((char)('a'+j));
if(check(s)){
ans = s;
break;
}
}
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i = (a); i < (b); i++)
#define RFOR(i,b,a) for(int i = (b) - 1; i >= (a); i--)
#define ITER(it, a) for(typeof(a.begin()) it = a.begin(); it != a.end(); it++)
#define FILL(a, value) memset(a, value, sizeof(a))
#define SZ(a) (int) a.size()
#define ALL(a) a.begin(),a.end()
#define PB push_back
#define MP make_pair
typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
const double PI = acos(-1.0);
const int INF = 1000 * 1000 * 1000 + 7;
const LL LINF = INF * (LL)INF;
string minShift(string s)
{
string res = s;
FOR (it, 0, SZ(s))
{
s += s[0];
s.erase(s.begin());
res = min(res, s);
}
return res;
}
string getString(vector<string> v)
{
string res;
FOR (i, 0, SZ(v))
{
res += v[i];
}
return res;
}
string solveSmall(int a, int b, int c, string A, string B, string C)
{
vector<string> v;
FOR (i, 0, a)
{
v.PB(A);
}
FOR (i, 0, b)
{
v.PB(B);
}
FOR (i, 0, c)
{
v.PB(C);
}
sort(ALL(v));
string res = getString(v);
do
{
res = max(res, minShift(getString(v)));
}while(next_permutation(ALL(v)));
return res;
}
string getString(int cnt, string s)
{
string res;
FOR (i, 0, cnt)
{
res += s;
}
return res;
}
string solveLarge(int a, int b, int c, string A, string B, string C)
{
//if (a + b + c <= 3) return solveSmall(a, b, c, A, B, C);
if (a == 0)
{
a = b;
A = B;
b = c;
B = C;
c = 0;
C = "";
}
if (b == 0)
{
b = c;
B = C;
c = 0;
C = "";
}
if (b == 0 && c == 0)
{
return getString(a, A);
}
if (c >= a)
{
c -= a;
A += C;
return solveLarge(a, b, c, A, B, C);
}
C = A + C;
a -= c;
if (b >= a)
{
A += B;
b -= a;
swap(b, c);
swap(B, C);
}
else
{
a -= b;
B = A + B;
}
return solveLarge(a, b, c, A, B, C);
}
int main()
{
//freopen("in.txt", "r", stdin);
//ios::sync_with_stdio(false); cin.tie(0);
int x, y, z;
cin>>x>>y>>z;
string res = solveLarge(x, y, z, "a", "b", "c");
cout<<res<<endl;
// FOR (a, 0, 5)
// {
// FOR (b, 0, 5)
// {
// FOR (c, 0, 5)
// {
// string r = solveSmall(a, b, c, "a", "b", "c");
// string s = solveLarge(a, b, c, "a", "b", "c");
// cout<<r<<endl<<s<<endl;
// if (r != s)
// {
// cout<<"!! "<<endl;
// cout<<a<<' '<<b<<' '<<c<<endl;
// throw -1;
// }
// }
// }
// }
//
// cout<<"Done"<<endl;
}
|
#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
#define REP(i,n) for(int i=0;i<(n);i++)
#define fi first
#define se second
#define pb push_back
#define mp make_pair
using namespace std;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef long long ll;
template<class T> inline void read(T &x){
int f=0;x=0;char ch=getchar();
for(;!isdigit(ch);ch=getchar())f|=(ch=='-');
for(;isdigit(ch);ch=getchar())x=x*10+ch-'0';
if(f)x=-x;
}
string solve(string a,string b,int x,int y){
// assert(a.size()+b.size()<=20);
// cerr<<a<<" "<<b<<" "<<x<<" "<<y<<endl;
if(b+a<a+b) swap(a,b),swap(x,y);
if(!x||!y){
string res;
rep(i,1,x) res+=a;
rep(i,1,y) res+=b;
return res;
}
if(x<y){
int u=y/x,v=y%x;
string A=a,B;
while(u--) A+=b; B=A+b;
return solve(A,B,x-v,v);
}
int u=x/y,v=x%y;
string A,B;
while(u--) A+=a; A+=b; B=a+A;
return solve(A,B,y-v,v);
}
string solve(string a,string b,string c,int x,int y,int z){
if(b+a<a+b) swap(a,b),swap(x,y);
if(c+a<a+c) swap(a,c),swap(x,z);
if(c+b<b+c) swap(b,c),swap(y,z);
if(!x) return solve(b,c,y,z);
if(!y) return solve(a,c,x,z);
if(!z) return solve(a,b,x,y);
vector<string> s(x,a);
REP(i,z) s[i%x]+=c;
int cur=z%x;
REP(i,y){
s[cur++]+=b;
if(cur==x) cur=z%x;
}
map<string,int> t;
REP(i,x) t[s[i]]++;
string S[3]; int C[3]={0,0,0},k=0;
for(auto x:t) S[k]=x.fi,C[k++]=x.se;
return solve(S[0],S[1],S[2],C[0],C[1],C[2]);
}
int main(){
int x,y,z;
cin>>x>>y>>z;
cout<<solve("a","b","c",x,y,z)<<endl;
return 0;
}
|
#include<stdio.h>
#include<math.h>
#include<algorithm>
#include<queue>
#include<deque>
#include<string>
#include<string.h>
#include<vector>
#include<set>
#include<map>
#include<stdlib.h>
#include<cassert>
using namespace std;
const long long mod=1000000007;
const long long inf=mod*mod;
const long long d2=500000004;
const double EPS=1e-6;
const double PI=acos(-1.0);
int ABS(int a){return max(a,-a);}
long long ABS(long long a){return max(a,-a);}
int C[1100];
int B[1100];
int ad=0;
vector<string> str;
void f(string aa,string bb,string cc,int a,int b,int c){
//printf("%s %s %s %d %d %d\n",aa.c_str(),bb.c_str(),cc.c_str(),a,b,c);
if(a==0){
f(bb,cc,"",b,c,0);
return;
}
if(b+c==0){
for(int i=0;i<a;i++)printf("%s",aa.c_str());printf("\n");return;
}
ad=0;
for(int i=0;i<1100;i++)B[i]=C[i]=0;
while(a==0){
a=b;b=c;c=0;ad++;
}
for(int i=0;i<c;i++){
C[i%a]++;
}
if(C[0]!=C[a-1]){
int f=0;
for(int i=0;i<a;i++)if(C[a-1]==C[i])f++;
for(int i=0;i<b;i++){
B[a-f+i%f]++;
}
}else{
for(int i=0;i<b;i++){
B[i%a]++;
}
}
str.clear();
for(int i=a-1;i>=0;i--){
string tmp="";
tmp+=aa;
for(int j=0;j<C[i];j++)tmp+=cc;//printf("%c",'c'+ad);
for(int j=0;j<B[i];j++)tmp+=bb;//printf("%c",'b'+ad);
str.push_back(tmp);
}
std::sort(str.begin(),str.end());
// for(int i=0;i<str.size();i++)printf("%s\n",str[i].c_str());
string ta="",tb="",tc="";
int va=0;
int vb=0;
int vc=0;
int fi=0;
int ph=0;
for(int i=0;i<a;i++){
if(str[i]==str[fi]){
if(ph==0){va++;ta=str[i];}
if(ph==1){vb++;tb=str[i];}
if(ph==2){vc++;tc=str[i];}
}else{
// printf("%s %s\n",str[i].c_str(),str[fi].c_str());
if(ph==0){ph++;vb++;tb=str[i];fi=i;}
else if(ph==1){ph++;vc++;tc=str[i];fi=i;}
}
}
f(ta,tb,tc,va,vb,vc);
}
int main(){
int a,b,c;scanf("%d%d%d",&a,&b,&c);
f("a","b","c",a,b,c);
/*for(int i=0;i<100;i++){
int a=rand()%10;
int b=rand()%10;
int c=rand()%10;
if(a+b+c==0)continue;
printf("%d %d %d: ",a,b,c);
f("a","b","c",a,b,c);
}*/
}
|
#include<bits/stdc++.h>
using namespace std;
int a,b,c;
multiset<string> se;
int main(){
scanf("%d%d%d",&a,&b,&c);
for (int i=1;i<=a;++i) se.insert("a");
for (int i=1;i<=b;++i) se.insert("b");
for (int i=1;i<=c;++i) se.insert("c");
while (se.size()>1){
string x=*se.begin(),y=*se.rbegin();
se.erase(se.begin()); se.erase(--se.end());
se.insert(x+y);
}
puts(se.begin()->c_str());
return 0;
}
|
#include <bits/stdc++.h>
#define MOD 1000000007LL
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int x,y,z;
vector<string> ss;
int main(void){
scanf("%d%d%d",&x,&y,&z);
for(int i=0;i<x;i++){
ss.push_back("a");
}
for(int i=0;i<y;i++){
ss.push_back("b");
}
for(int i=0;i<z;i++){
ss.push_back("c");
}
while(ss.size()>1){
sort(ss.begin(),ss.end());
ss[0]+=ss[ss.size()-1];
ss.pop_back();
}
cout << ss[0] << endl;
return 0;
}
|
#include<iostream>
#include<set>
using namespace std;
multiset<string> s;
int main()
{
int x,y,z;
cin>>x>>y>>z;
while(x--)s.insert("a");
while(y--)s.insert("b");
while(z--)s.insert("c");
while(s.size()>1)
{
string x=*s.begin()+*--s.end();
s.erase(s.begin());
s.erase(--s.end());
s.insert(x);
}
cout<<*s.begin()<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int x, y, z;
scanf("%d %d %d", &x, &y, &z);
multiset<string> chars;
for (int i = 0; i < x; i++) chars.insert("a");
for (int i = 0; i < y; i++) chars.insert("b");
for (int i = 0; i < z; i++) chars.insert("c");
while (chars.size() > 1) {
string first = *chars.begin();
chars.erase(chars.begin());
string last = *prev(chars.end());
chars.erase(prev(chars.end()));
chars.insert(first + last);
}
printf("%s\n", chars.begin()->c_str());
return 0;
}
|
#include <cstring>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <string>
#include <iostream>
using namespace std;
int _w;
vector<string> v;
int main() {
int a, b, c;
_w = scanf( "%d%d%d", &a, &b, &c );
for( int i = 0; i < a; ++i ) v.push_back("a");
for( int i = 0; i < b; ++i ) v.push_back("b");
for( int i = 0; i < c; ++i ) v.push_back("c");
while( v.size() > 1 ) {
sort(v.begin(), v.end());
string s1 = v.front(), s2 = v.back();
v.pop_back();
reverse(v.begin(), v.end());
v.pop_back();
v.push_back(s1+s2);
}
cout << v.front() << endl;
return 0;
}
|
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
using namespace std;
#ifdef LOCAL
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
#define eprintf(...) 42
#endif
typedef long long ll;
typedef pair<int, int> pii;
#define mp make_pair
string solve(string A, int x, string B, int y, string C, int z) {
if (x == 0)
return solve(B, y, C, z, "", 0);
if (y == 0 && z == 0) {
string res = "";
while(x--) res += A;
return res;
}
if (y == 0)
return solve(A, x, C, z, "", 0);
int sum = y + z;
int p = x / sum;
int q = x % sum;
string As = "";
for (int i = 0; i < p; i++)
As += A;
string Ab = As + A;
if (q == 0) {
return solve(As + B, y, As + C, z, "", 0);
}
p = sum - q;
if (z < q) {
return solve(Ab + B, q - z, Ab + C, z, As + B, p);
}
if (z == q) {
return solve(Ab + C, q, As + B, p, "", 0);
}
return solve(Ab + C, q, As + B, y, As + C, z - q);
}
int main()
{
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
int x, y, z;
cin >> x >> y >> z;
cout << solve("a", x, "b", y, "c", z) << endl;
return 0;
}
|
#include<bits/stdc++.h>
#define gc getchar()
#define ll long long
#define pb push_back
#define mk make_pair
#define rint register int
using namespace std;
inline int read(){char ch=gc;int w=1,s=0;while(!isdigit(ch)){if(ch=='-') w=-1;ch=gc;};while(isdigit(ch)){s=s*10+ch-'0';ch=gc;} return w*s;}
multiset<string> q;
int main()
{
int a=read(),b=read(),c=read();
for(rint i=1;i<=a;++i) q.insert("a");
for(rint i=1;i<=b;++i) q.insert("b");
for(rint i=1;i<=c;++i) q.insert("c");
while(q.size()>=2)
{
string s=(*q.begin())+(*q.rbegin());
q.erase(q.begin());
q.erase(--q.end());
q.insert(s);
}
cout<<(*q.begin());
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
multiset <string> s;
int x,y,z;
int main(){
cin>>x>>y>>z;
while(x--)s.insert("a");
while(y--)s.insert("b");
while(z--)s.insert("c");
while(s.size()>1){
string a=*s.begin();
string b=*s.rbegin();
s.erase(s.lower_bound(a));
s.erase(s.lower_bound(b));
s.insert(a+b);
}
cout<<*s.begin()<<endl;
}
|
// #include {{{
#include <iostream>
#include <cassert>
#include <cstring>
#include <cstdlib>
#include <cstdio>
#include <cctype>
#include <cmath>
#include <ctime>
#include <queue>
#include <set>
#include <map>
#include <stack>
#include <string>
#include <bitset>
#include <vector>
#include <complex>
#include <algorithm>
using namespace std;
// }}}
// #define {{{
typedef long long ll;
typedef double db;
typedef pair<int,int> pii;
typedef vector<int> vi;
#define de(x) cout << #x << "=" << x << endl
#define rep(i,a,b) for(int i=a;i<(b);++i)
#define per(i,a,b) for(int i=(b)-1;i>=(a);--i)
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define fi first
#define se second
// }}}
int main(){
multiset<string> S;
rep(i,0,3){
int x;
cin >> x;
rep(j,0,x) S.insert(string(1 , i + 'a'));
}
while(sz(S) > 1){
auto it = S.end();
--it;
string a = *S.begin() + *it;
S.erase(it);
S.erase(S.begin());
S.insert(a);
}
cout << *S.begin() << endl;
return 0;
}
|
#include <stdio.h>
#include <set>
#include <string>
int main()
{
std::multiset<std::string> set;
for (int i = 0; i < 3; ++ i) {
int x;
scanf("%d", &x);
for (int j = 0; j < x; ++ j)
set.emplace(1, 'a' + i);
}
while (set.size() > 1) {
auto it = -- set.end();
std::string s = *set.begin() + *it;
set.erase(set.begin());
set.erase(it);
set.emplace(s);
}
printf("%s\n", set.begin()->c_str());
}
|
//by yjz
#include<bits/stdc++.h>
using namespace std;
#define FF first
#define SS second
#define PB push_back
#define MP make_pair
#define bged(v) (v).begin(),(v).end()
#define foreach(it,s) for(__typeof((s).begin()) it=(s).begin();it!=(s).end();it++)
typedef long long ll;
const int Imx=2147483647;
const ll Lbig=2e18;
const int mod=1e9+7;
//My i/o stream
struct fastio
{
char s[100000];
int it,len;
fastio(){it=len=0;}
inline char get()
{
if(it<len)return s[it++];it=0;
len=fread(s,1,100000,stdin);
if(len==0)return EOF;else return s[it++];
}
bool notend()
{
char c=get();
while(c==' '||c=='\n')c=get();
if(it>0)it--;
return c!=EOF;
}
}_buff;
#define geti(x) x=getnum()
#define getii(x,y) geti(x),geti(y)
#define getiii(x,y,z) getii(x,y),geti(z)
#define puti(x) putnum(x),putchar(' ')
#define putii(x,y) puti(x),puti(y)
#define putiii(x,y,z) putii(x,y),puti(z)
#define putsi(x) putnum(x),putchar('\n')
#define putsii(x,y) puti(x),putsi(y)
#define putsiii(x,y,z) putii(x,y),putsi(z)
inline ll getnum()
{
ll r=0;bool ng=0;char c;c=_buff.get();
while(c!='-'&&(c<'0'||c>'9'))c=_buff.get();
if(c=='-')ng=1,c=_buff.get();
while(c>='0'&&c<='9')r=r*10+c-'0',c=_buff.get();
return ng?-r:r;
}
template<class T> inline void putnum(T x)
{
if(x<0)putchar('-'),x=-x;
register short a[20]={},sz=0;
while(x)a[sz++]=x%10,x/=10;
if(sz==0)putchar('0');
for(int i=sz-1;i>=0;i--)putchar('0'+a[i]);
}
inline char getreal(){char c=_buff.get();while(c==' '||c=='\n')c=_buff.get();return c;}
string sA="a";
string sB="b";
string sC="c";
int n,A,B,C;
string S;
string dp[52][52][52];
void upd(string &cur,string s,int tlen)
{
if(s.size()==tlen&&s+S+S.substr(0,n-s.size())>=S+S)cur=max(cur,s);
}
bool check()
{
// cerr<<"check:"<<S<<endl;
for(int i=0;i<=A;i++)
{
for(int j=0;j<=B;j++)
{
for(int k=0;k<=C;k++)
{
string &cur=dp[i][j][k];
cur="";
if(i>0)upd(cur,sA+dp[i-1][j][k],i+j+k);
if(j>0)upd(cur,sB+dp[i][j-1][k],i+j+k);
if(k>0)upd(cur,sC+dp[i][j][k-1],i+j+k);
// cerr<<i<<" "<<j<<" "<<k<<":"<<cur<<endl;
}
}
}
return dp[A][B][C].size()==n;
}
int main()
{
cin>>A>>B>>C;
n=A+B+C;
S.resize(n);
for(int i=0;i<n;i++)S[i]='a';
for(int i=0;i<n;i++)
{
for(int j=1;j<3;j++)
{
S[i]='a'+j;
if(!check())
{
S[i]='a'+j-1;
break;
}
}
}
cout<<S<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
string solve(int a, int b, int c) {
bool flag = false;
if (a == 0) {
flag = true;
a = b;
b = c;
c = 0;
}
string res = "";
if (a == 0) {
res = string(b, 'b');
} else {
if (b == 0 && c == 0) {
res = string(a, 'a');
} else {
vector<string> put(a, "a");
for (int i = 0; i < c; i++) {
put[i % a] += 'c';
}
int ptr = c % a;
for (int i = 0; i < b; i++) {
put[ptr] += 'b';
ptr++;
if (ptr == a) {
ptr = c % a;
}
}
map<string, int> mp;
for (auto &s : put) {
mp[s]++;
}
vector< pair<string, int> > v;
for (auto &p : mp) {
v.push_back(p);
}
assert(v.size() <= 3);
while (v.size() < 3) {
v.emplace_back("", 0);
}
string aux = solve(v[0].second, v[1].second, v[2].second);
res = "";
for (int i = 0; i < (int) aux.size(); i++) {
res += v[aux[i] - 'a'].first;
}
}
}
if (flag) {
for (char &c : res) {
c++;
}
}
return res;
}
int main() {
int a, b, c;
scanf("%d %d %d", &a, &b, &c);
cout << solve(a, b, c) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
//-------------------------------------------------------
void solve() {
int i,j,k,l,r,x,y; string s;
int A,B,C;
cin>>A>>B>>C;
vector<string> V;
while(A--) V.push_back("a");
while(B--) V.push_back("b");
while(C--) V.push_back("c");
while(V.size()>1) {
sort(ALL(V));
V[0]+=V.back();
V.pop_back();
}
cout<<V[0]<<endl;
}
int main(int argc,char** argv){
string s;int i;
if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
cout.tie(0); solve(); return 0;
}
|
// start fold
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<vector>
#include<cstring>
#include<set>
#include<map>
#include<cmath>
#include<queue>
#include<bitset>
using namespace std;
#define ri register int
#define il inline
#define LL long long
#define ull unsigned long long
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define fi first
#define se second
#define enter putchar('\n')
#define size(x) ((int)x.size())
#define mem0(x) memset(x,0,sizeof(x))
template<class T>il void in(T &x)
{
x=0; short f=1; char c=getchar();
while(c<'0'||c>'9')
{
if(c=='-') f=-1;
c=getchar();
}
while(c>='0'&&c<='9') x=x*10+(c^'0'),c=getchar();
x*=f;
}
template <typename T,typename ...Args>il void in(T &x, Args &...args)
{
in(x); in(args...);
}
template<class T>il void out(T x,const char c='\n')
{
static short st[30];
short m=0;
if(x<0) putchar('-'),x=-x;
do st[++m]=x%10,x/=10; while(x);
while(m) putchar(st[m--]|'0');
putchar(c);
}
template <typename T,typename ...Args>il void out(const T &x,const Args &...args)
{
out(x,' '); out(args...);
}
template<class T>il void print(T a[],int n)
{
if(n<=0) return;
for(ri i=0; i<n; ++i) out(a[i],' ');
enter;
}
namespace i207M
{
// end fold
multiset<string>s;
signed main()
{
#ifdef M207
freopen("in.in","r",stdin);
// freopen("out.out","w",stdout);
#endif
int a,b,c;
in(a,b,c);
for(ri i=1; i<=a; ++i) s.insert("a");
for(ri i=1; i<=b; ++i) s.insert("b");
for(ri i=1; i<=c; ++i) s.insert("c");
while(size(s)>1)
{
string t=*s.begin()+*s.rbegin();
s.erase(s.begin()),s.erase(--s.end());
s.insert(t);
}
cout<<*s.begin();
return 0;
}
// start fold
}
signed main()
{
i207M::main();
return 0;
}
// end fold
|
#include<bits/stdc++.h>
#define mem(a,b) memset(a,b,sizeof(a))
#define For(i,a,b) for(int i=a,i##E=b;i<=i##E;++i)
#define rFor(i,a,b) for(int i=a,i##E=b;i>=i##E;--i)
typedef long long LL;
using namespace std;
template<typename T>inline bool chkmin(T &a,const T &b){return a>b?a=b,1:0;}
template<typename T>inline bool chkmax(T &a,const T &b){return a<b?a=b,1:0;}
template<typename T>inline void read(T &x)
{
x=0;int _f(0);char ch=getchar();
while(!isdigit(ch))_f|=(ch=='-'),ch=getchar();
while( isdigit(ch))x=x*10+ch-'0',ch=getchar();
x=_f?-x:x;
}
inline void file()
{
#ifdef ztzshiwo
freopen("in.txt","r",stdin);
freopen("out.txt","w",stdout);
#endif
}
int X,Y,Z;
multiset<string>S;
multiset<string>::iterator it;
string x,y;
int main()
{
file();
read(X),read(Y),read(Z);
For(i,1,X)S.insert("a");
For(i,1,Y)S.insert("b");
For(i,1,Z)S.insert("c");
while(S.size()>1)
{
it=S.begin();
x=*it;S.erase(it);
it=S.end();--it;
y=*it;S.erase(it);
S.insert(x+y);
}
cout<<*S.begin()<<endl;
return 0;
}
|
//minamoto
#include<bits/stdc++.h>
#define R register
#define fp(i,a,b) for(R int i=(a),I=(b)+1;i<I;++i)
#define fd(i,a,b) for(R int i=(a),I=(b)-1;i>I;--i)
#define go(u) for(int i=head[u],v=e[i].v;i;i=e[i].nx,v=e[i].v)
template<class T>inline bool cmax(T&a,const T&b){return a<b?a=b,1:0;}
template<class T>inline bool cmin(T&a,const T&b){return a>b?a=b,1:0;}
using namespace std;
struct node{
string s;int c;
inline node(R string ss,R int cc):s(ss),c(cc){}
inline bool operator <(const node &b)const{return s<b.s;}
};set<node>s;
int x,y,z;
int main(){
scanf("%d%d%d",&x,&y,&z);
if(x)s.insert(node("a",x));
if(y)s.insert(node("b",y));
if(z)s.insert(node("c",z));
while(2333){
if(s.size()==1){
node p=*s.begin();
fp(i,1,p.c)cout<<p.s;
puts("");
return 0;
}
R node p=*s.begin(),q=*--s.end();
s.erase(s.begin()),s.erase(--s.end());
R int k=min(p.c,q.c);s.insert(node(p.s+q.s,k));
if(p.c-k)s.insert(node(p.s,p.c-k));
if(q.c-k)s.insert(node(q.s,q.c-k));
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
scanf("%d%d%d", &a, &b, &c);
multiset<string> s;
while (a --) s.insert("a");
while (b --) s.insert("b");
while (c --) s.insert("c");
while ((int) s.size() > 1) {
string t = *s.begin() + *--s.end();
s.erase(s.begin());
s.erase(--s.end());
s.insert(t);
}
printf("%s\n", s.begin() -> c_str());
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<LL,LL> PII;
string solve(vector<string> data, vector<int> cnt) {
if(data.size() == 1) {
string s;
for(int i=0; i<cnt[0]; i++)
s += data[0];
return s;
}
vector<string> base;
for(int i=0; i<cnt[0]; i++) {
base.push_back(data[0]);
}
int pos = 0;
if(data.size() == 3) {
for(int i=0; i<cnt[2]; i++) {
base[i%cnt[0]] += data[2];
}
pos = cnt[2] % cnt[0];
}
for(int i=0; i<cnt[1]; i++) {
base[pos + i % (cnt[0] - pos)] += data[1];
}
vector<string> nextd;
vector<int> nextc;
for(int i=base.size()-1; i>=0; i--) {
if(nextd.size() == 0) {
nextd.push_back(base[i]);
nextc.push_back(1);
continue;
}
if(nextd.back() == base[i]) {
nextc[nextc.size()-1]++;
}
else {
nextd.push_back(base[i]);
nextc.push_back(1);
}
}
return solve(nextd, nextc);
}
int main() {
int a,b,c;
cin >> a >> b >> c;
vector<string> data;
vector<int> val;
if(a!=0) {
data.push_back("a");
val.push_back(a);
}
if(b!=0) {
data.push_back("b");
val.push_back(b);
}
if(c!=0) {
data.push_back("c");
val.push_back(c);
}
string ans = solve(data, val);
cout << ans << endl;
return 0;
}
|
#include<set>
#include<map>
#include<deque>
#include<queue>
#include<stack>
#include<cmath>
#include<ctime>
#include<bitset>
#include<string>
#include<vector>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<climits>
#include<complex>
#include<iostream>
#include<algorithm>
#define ll long long
using namespace std;
int x,y,z;
multiset<string>S;
multiset<string>::iterator it;
int main()
{
scanf("%d%d%d",&x,&y,&z);
for(int i=1;i<=x;i++) S.insert("a");
for(int i=1;i<=y;i++) S.insert("b");
for(int i=1;i<=z;i++) S.insert("c");
while(S.size()>1)
{
it=S.end(); it--;
string ss=(*S.begin())+(*it);
S.erase(S.begin());
S.erase(it);
S.insert(ss);
}
cout<<(*S.begin())<<endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
multiset<string> s;
int main(){
//freopen("beargguy.in","r",stdin);
//freopen("beargguy.out","w",stdout);
int r,b,g;
scanf("%d%d%d",&r,&b,&g);
for(int i=1;i<=r;i++){
string a="a";
s.insert(a);
}
for(int i=1;i<=b;i++){
string a="b";
s.insert(a);
}
for(int i=1;i<=g;i++){
string a="c";
s.insert(a);
}
string ans;
while(!s.empty()){
string fir=*s.begin();
s.erase(s.begin());
if(s.empty()){
ans=fir;
break;
}
string las=*(--s.end());
s.erase(--s.end());
if(s.empty()){
ans=fir+las;
break;
}
s.insert(fir+las);
}
cout<<ans<<endl;
return 0;
}
|
#include <bits/stdc++.h>
#define fi first
#define se second
#define pii pair<int,int>
#define mp make_pair
#define pb push_back
#define space putchar(' ')
#define enter putchar('\n')
#define MAXN 4005
#define eps 1e-10
//#define ivorysi
using namespace std;
typedef long long int64;
typedef unsigned int u32;
typedef double db;
template<class T>
void read(T &res) {
res = 0;T f = 1;char c = getchar();
while(c < '0' || c > '9') {
if(c == '-') f = -1;
c = getchar();
}
while(c >= '0' && c <= '9') {
res = res * 10 + c - '0';
c = getchar();
}
res *= f;
}
template<class T>
void out(T x) {
if(x < 0) {x = -x;putchar('-');}
if(x >= 10) {
out(x / 10);
}
putchar('0' + x % 10);
}
struct node {
string s;int num;
friend bool operator < (const node &a,const node &b) {
return a.s < b.s;
}
};
set<node> S;
int x,y,z;
void Solve() {
read(x);read(y);read(z);
if(x) S.insert((node){"a",x});
if(y) S.insert((node){"b",y});
if(z) S.insert((node){"c",z});
while(1) {
if(S.size() == 1) {
node p = *S.begin();
for(int i = 1 ; i <= p.num ; ++i) {
cout << p.s;
}
enter;
break;
}
node s0 = *S.begin(),t0 = *(--S.end());
S.erase(S.begin());S.erase(--S.end());
int k = min(s0.num,t0.num);
S.insert((node){s0.s + t0.s,k});
if(s0.num > k) S.insert((node){s0.s,s0.num - k});
if(t0.num > k) S.insert((node){t0.s,t0.num - k});
}
}
int main() {
#ifdef ivorysi
freopen("f1.in","r",stdin);
#endif
Solve();
}
|
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cstring>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <numeric>
#include <utility>
#include <iomanip>
#include <algorithm>
#include <functional>
#include <unordered_map>
using namespace std;
#define REP(i, s) for (int i = 0; i < s; ++i)
#define ALL(v) (v.begin(), v.end())
#define COUT(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl
#define EACH(i, s) for (__typeof__((s).begin()) i = (s).begin(); i != (s).end(); ++i)
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<class T1, class T2> ostream& operator << (ostream &s, pair<T1,T2> P)
{ return s << '<' << P.first << ", " << P.second << '>'; }
template<class T> ostream& operator << (ostream &s, vector<T> P)
{ for (int i = 0; i < P.size(); ++i) { if (i > 0) { s << " "; } s << P[i]; } return s; }
template<class T> ostream& operator << (ostream &s, vector<vector<T> > P)
{ for (int i = 0; i < P.size(); ++i) { s << endl << P[i]; } return s << endl; }
template<class T> ostream& operator << (ostream &s, set<T> P)
{ EACH(it, P) { s << "<" << *it << "> "; } return s << endl; }
template<class T1, class T2> ostream& operator << (ostream &s, map<T1,T2> P)
{ EACH(it, P) { s << "<" << it->first << "->" << it->second << "> "; } return s << endl; }
string solve(string a, string b, string c, int x, int y, int z) {
if (y + z == 0) {
string res = "";
for (int i = 0; i < x; ++i) res += a;
return res;
}
if (x == 0) return solve(b, c, "", y, z, 0);
int p = x / (y + z);
int r = x % (y + z);
string A = "";
for (int i = 0; i < p; ++i) A += a;
if (z >= r) {
string na = A + a + c;
string nb = A + b;
string nc = A + c;
return solve(na, nb, nc, r, y, z - r);
}
else {
string na = A + a + b;
string nb = A + a + c;
string nc = A + b;
return solve(na, nb, nc, r - z, z, y + z - r);
}
}
int main() {
int x, y, z;
while (cin >> x >> y >> z) {
cout << solve("a", "b", "c", x, y, z) << endl;
}
}
|
/**
* author: tourist
* created: 08.10.2017 15:50:42
**/
#include <bits/stdc++.h>
using namespace std;
string solve(int a, int b, int c) {
bool flag = false;
if (a == 0) {
flag = true;
a = b;
b = c;
c = 0;
}
string res = "";
if (a == 0) {
res = string(b, 'b');
} else {
if (b == 0 && c == 0) {
res = string(a, 'a');
} else {
vector<string> put(a, "a");
for (int i = 0; i < c; i++) {
put[i % a] += 'c';
}
int ptr = c % a;
for (int i = 0; i < b; i++) {
put[ptr] += 'b';
ptr++;
if (ptr == a) {
ptr = c % a;
}
}
map<string, int> mp;
for (auto &s : put) {
mp[s]++;
}
vector< pair<string, int> > v;
for (auto &p : mp) {
v.push_back(p);
}
assert(v.size() <= 3);
while (v.size() < 3) {
v.emplace_back("", 0);
}
string aux = solve(v[0].second, v[1].second, v[2].second);
res = "";
for (int i = 0; i < (int) aux.size(); i++) {
res += v[aux[i] - 'a'].first;
}
}
}
if (flag) {
for (char &c : res) {
c++;
}
}
return res;
}
int main() {
int a, b, c;
scanf("%d %d %d", &a, &b, &c);
cout << solve(a, b, c) << endl;
return 0;
}
|
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <cstring>
#include <queue>
#include <map>
#include <set>
#include <string>
#include <cmath>
using namespace std;
typedef long long int ll;
typedef pair <int,int> P;
string solve(int X,int Y,int Z)
{
//printf("%d %d %d\n",X,Y,Z);
if(Y==0&&Z==0)
{
string ret="";
for(int i=0;i<X;i++) ret+="A";
return ret;
}
if(X==0)
{
string ret=solve(Y,Z,0);
for(int i=0;i<ret.size();i++)
{
if(ret[i]=='A') ret[i]='B';
else ret[i]='C';
}
return ret;
}
else if(Y==0)
{
string ret=solve(X,Z,0);
for(int i=0;i<ret.size();i++) if(ret[i]=='B') ret[i]='C';
return ret;
}
if(Z==0)
{
if(X%Y==0)
{
string ret="";
for(int i=0;i<Y;i++)
{
for(int j=0;j<X/Y;j++) ret+="A";
ret+="B";
}
return ret;
}
string ret=solve(X%Y,Y-(X%Y),0);
string ans="";
for(int i=0;i<ret.size();i++)
{
if(ret[i]=='A')
{
for(int j=0;j<=X/Y;j++) ans+="A";
ans+="B";
}
else
{
for(int j=0;j<X/Y;j++) ans+="A";
ans+="B";
}
}
//printf("%d %d %d : %s\n",X,Y,Z,ans.c_str());
return ans;
}
int z=X%(Y+Z),k=(X+Y+Z-1)/(Y+Z);
if(z==0) z=Y+Z;
if(z<=Z)
{
string ret=solve(z,Y,Z-z);
string ans="";
for(int i=0;i<ret.size();i++)
{
if(ret[i]=='A')
{
for(int j=0;j<k;j++) ans+="A";
ans+="C";
}
else
{
for(int j=0;j<k-1;j++) ans+="A";
ans+=ret[i];
}
}
//printf("%d %d %d : %s\n",X,Y,Z,ans.c_str());
return ans;
}
else
{
string ret=solve(z-Z,Z,Y-(z-Z));
string ans="";
for(int i=0;i<ret.size();i++)
{
if(ret[i]=='C')
{
for(int j=0;j<k-1;j++) ans+="A";
ans+="B";
}
else
{
for(int j=0;j<k;j++) ans+="A";
if(ret[i]=='A') ans+="B";
else ans+="C";
}
}
return ans;
}
return "";
}
int main()
{
int X,Y,Z;
scanf("%d %d %d",&X,&Y,&Z);
string ret=solve(X,Y,Z);
for(int i=0;i<ret.size();i++)
{
if(ret[i]=='A') ret[i]='a';
if(ret[i]=='B') ret[i]='b';
if(ret[i]=='C') ret[i]='c';
}
printf("%s\n",ret.c_str());
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
string ans;
int x,y,z;
void dfs(int a,int b,int c,string x,string y,string z)
{
if (a==0) dfs(b,c,0,y,z,"");
else if (c==0&&b==0)
{
for (int i=1;i<=a;i++)
ans+=x;
} else
{
string ra=x,rb,rc;
for (int i=0;i<c/a;i++) ra+=z;
rc=ra+z;
int rrc=c%a;
a-=(c%a);
for (int i=0;i<b/a;i++) ra+=y;
rb=ra+y;
int rrb=b%a;
a-=rrb;
dfs(a,rrb,rrc,ra,rb,rc);
}
}
int main()
{
scanf("%d%d%d",&x,&y,&z);
ans.clear();
dfs(x,y,z,"a","b","c");
cout << ans << endl;
return 0;
}
|
#include<iostream>
#include<cstdio>
#include<cstring>
#include<set>
using namespace std;
multiset<string> s;
int main()
{
int A,B,C;
scanf("%d %d %d",&A,&B,&C);
for(int i=1;i<=A;i++) s.insert("a");
for(int i=1;i<=B;i++) s.insert("b");
for(int i=1;i<=C;i++) s.insert("c");
for(int i=1;i<=A+B+C-1;i++)
{
string s1,s2;
s1=*s.begin(); s.erase(s.begin());
s2=*(--s.end()); s.erase(--s.end());
s.insert(s1+s2);
}
cout<<*s.begin();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int x, y, z;
string doit(int d, int e, int f, string x, string y, string z) {
//you have d a's, e b's, and f c's
// cout << d << ' ' << e << ' ' << f << endl;
if (d == 0) {
if (e == 0) {
string t;
for (int i = 0; i < f; ++i)
t += 'c';
return t;
}
string s[e+5];
for (int i = 0; i < e+5; ++i)
s[i] = "";
for (int i = 0; i < e; ++i)
s[i] += 'b';
int ct = 0;
for (int i = 0; i < f; ++i) {
s[ct] += 'c';
ct++;
ct %= e;
}
int c1 = e;
for (int i = 1; i < e; ++i)
if (s[i] != s[i-1])
c1 = i;
string t;
t = doit(0, e-c1, c1, "", s[c1], s[0]);
string ans = "";
for (int i = 0; i < t.length(); ++i) {
if (t[i] == 'b')
ans += s[c1];
else
ans += s[0];
}
return ans;
} else {
string s[d+5];
for (int i = 0; i < d+5; ++i)
s[i] = "";
for (int i = 0; i < d; ++i)
s[i] += 'a';
int ct = 0;
for (int i = 0; i < f; ++i) {
s[ct] += 'c';
ct++;
ct %= d;
}
int ct1 = ct;
for (int i = 0; i < e; ++i) {
s[ct1] += 'b';
ct1++;
if (ct1 >= d)
ct1 = ct;
}
int c1 = d, c2 = d;
for (int i = 1; i < d; ++i) {
if (s[i] != s[i-1]) {
if (c1 == d)
c1 = i;
else
c2 = i;
}
}
string t = doit(d-c2, c2-c1, c1, s[c2], s[c1], s[0]);
string ans = "";
for (int i = 0; i < t.length(); ++i) {
if (t[i] == 'a')
ans += s[c2];
if (t[i] == 'b')
ans += s[c1];
if (t[i] == 'c')
ans += s[0];
}
return ans;
}
}
int main() {
cin >> x >> y >> z;
cout << doit(x, y, z, "a", "b", "c") << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
multiset<string> s;
int a, b, c;
int main() {
scanf("%d%d%d", &a, &b, &c);
for (int i = 0; i < a; i++) {
s.insert("a");
}
for (int i = 0; i < b; i++) {
s.insert("b");
}
for (int i = 0; i < c; i++) {
s.insert("c");
}
while (s.size() > 1) {
string t = *s.begin() + *--s.end();
s.erase(s.begin());
s.erase(--s.end());
s.insert(t);
}
cout << *s.begin() << endl;
}
|
#include <cstring>
#include <cstdio>
#include <iostream>
#include <set>
using namespace std;
int main() {
int x, y, z; cin >> x >> y >> z;
multiset<string> st;
for (int i = 1;i <= x; i++) st.insert("a");
for (int i = 1;i <= y; i++) st.insert("b");
for (int i = 1;i <= z; i++) st.insert("c");
while (st.size() != 1) {
auto be = st.begin(), ed = st.end(); ed--;
st.insert(*be + *ed);
st.erase(be), st.erase(ed);
}
cout << *st.begin() << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main() {
std::multiset <std::string> M;
int kase;
for (scanf("%d", &kase); kase; --kase) M.insert("a");
for (scanf("%d", &kase); kase; --kase) M.insert("b");
for (scanf("%d", &kase); kase; --kase) M.insert("c");
while (M.size()>1) {
std::string s = *M.begin(), t = *M.rbegin();
M.erase(M.lower_bound(s));
M.erase(M.lower_bound(t));
M.insert(s + t);
}
printf("%s\n", (*M.begin()).c_str());
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define pb push_back
#define rep(i, a, n) for(int i = (a); i < (n); i++)
#define dep(i, a, n) for(int i = (a); i >= (n); i--)
#define mod 1e9+7
__attribute__((constructor))
void initial() {
cin.tie(0);
ios::sync_with_stdio(false);
}
int x, y, z;
multiset<string> ms;
int main() {
cin >> x >> y >> z;
rep(i, 0, x) ms.insert("a");
rep(i, 0, y) ms.insert("b");
rep(i, 0, z) ms.insert("c");
while(ms.size() > 1) {
auto itr1 = ms.begin();
auto itr2 = ms.end();
itr2--;
ms.insert(*itr1 + *itr2);
ms.erase(itr1);
ms.erase(itr2);
}
cout << *ms.begin() << endl;
}
|
#include <iostream>
#include <string>
#include <cmath>
#include<algorithm>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<iomanip>
#define _USE_MATH_DEFINES
#include <math.h>
#include <functional>
#include<complex>
#include<cassert>
using namespace std;
#define rep(i,x) for(ll i=0;i<x;i++)
#define repn(i,x) for(ll i=1;i<=x;i++)
typedef long long ll;
const ll INF = 1e17;
const ll MOD = 1000000007;
const ll MAX = 4000001;
const long double eps = 1E-14;
ll max(ll a, ll b) {
if (a > b) { return a; }
return b;
}
ll min(ll a, ll b) {
if (a > b) { return b; }
return a;
}
ll gcd(ll a, ll b) {
if (b == 0) { return a; }
if (a < b) { return gcd(b, a); }
return gcd(b, a % b);
}
ll lcm(ll a, ll b) {
return a / gcd(a, b) * b;
}
struct edge {
ll ind;
ll fr;
ll to;
ll d;
};
class mint {
long long x;
public:
mint(long long x = 0) : x((x% MOD + MOD) % MOD) {}
mint operator-() const {
return mint(-x);
}
mint& operator+=(const mint& a) {
if ((x += a.x) >= MOD) x -= MOD;
return *this;
}
mint& operator-=(const mint& a) {
if ((x += MOD - a.x) >= MOD) x -= MOD;
return *this;
}
mint& operator*=(const mint& a) {
(x *= a.x) %= MOD;
return *this;
}
mint operator+(const mint& a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint& a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint& a) const {
mint res(*this);
return res *= a;
}
mint pow(ll t) const {
if (!t) return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1) a *= *this;
return a;
}
// for prime MOD
mint inv() const {
return pow(MOD - 2);
}
mint& operator/=(const mint& a) {
return (*this) *= a.inv();
}
mint operator/(const mint& a) const {
mint res(*this);
return res /= a;
}
friend ostream& operator<<(ostream& os, const mint& m) {
os << m.x;
return os;
}
};
mint pw(mint a, ll b) {
if (b == 0) { return 1; }
mint ret = pw(a, b >> 1);
ret *= ret;
if (b & 1) { ret *= a; }
return ret;
}
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<vector<vector<ll>>> vvvll;
typedef vector<mint> vmint;
typedef vector<vector<mint>> vvmint;
typedef vector<vector<vector<mint>>> vvvmint;
/////////////////////////////////////
ll X, Y, Z;
ll M;
bool ch(string s) {
//cout << s << endl;
ll N = s.size();
vvll lis(N+1);
rep(i, N+1) {
//cout << i << endl;
for (ll j = i; j <= N; j++) {
if (s.substr(0, i) > s.substr(j - i, i)) { return false; }
if (s.substr(0, i) == s.substr(j - i, i)) {
lis[j].push_back(i);
//cout << j << " ";
}
}
//cout << endl;
}
vector<vvvll> dp(M + 1, vvvll(N + 1, vvll(X + 1, vll(Y + 1, 0))));
ll xx = X; ll yy = Y;
rep(i, N) {
if (s[i] == 'a') { xx--; }
if (s[i] == 'b') { yy--; }
}
if (xx < 0 || yy < 0||xx+yy>M-N) { return false; }
dp[N][N][xx][yy] = 1;
for (ll i = N; i < M; i++)rep(j, N + 1)rep(x, X + 1)rep(y, Y + 1) {
if (dp[i][j][x][y] == 0) { continue; }
vll d(3,0);
for (ll w : lis[j]) {
if (w == N) { continue; }
rep(k, 3) {
if (s[w] - 'a' > k) { d[k] = -1; }
else if (s[w] - 'a' == k) { d[k] = w + 1; }
}
}
if (d[0] != -1 && x > 0)dp[i + 1][d[0]][x - 1][y] = 1;
if (d[1] != -1 && y > 0) { dp[i + 1][d[1]][x][y - 1] = 1; }
if (d[2] != -1 && i + x + y < M) { dp[i + 1][d[2]][x][y] = 1; }
}
//rep(i, M + 1)rep(j, N + 1)rep(x, X + 1)rep(y, Y + 1) {
// if (dp[i][j][x][y] == 1) { cout << i << j << x << y << endl; }
//}
rep(j, N + 1) {
if (dp[M][j][0][0] == 0) { continue; }
bool b = 1;
rep(k, j + 1) {
string t = s.substr(j - k, k) + s.substr(0, N - k);
if (t < s) { b = 0; }
}
if (b) { return true; }
}
return false;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cin >> X >> Y >> Z;
M = X + Y + Z;
string s = "";
rep(i, M) {
if (ch(s + 'c')) { s += 'c'; }
else if (ch(s + 'b')) { s += 'b'; }
else if (ch(s + 'a')) { s += 'a'; }
}
cout << s << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
string solve(int x, int y, int z) {
if (y + z == 0) return string(x, 'a');
if (z + x == 0) return string(y, 'b');
if (x + y == 0) return string(z, 'c');
if (x == 0) {
string nans = solve(y, z, 0);
for (char &c : nans) c += 1;
return nans;
}
if (z == 0) {
string nans = solve(x, 0, y);
for (char &c : nans) if (c == 'c') c = 'b';
return nans;
}
if (x >= z) {
string nans = solve(x - z, z, y);
string ans;
for (char c : nans) {
if (c == 'a') {
ans += 'a';
} else if (c == 'b') {
ans += "ac";
} else {
ans += 'b';
}
}
return ans;
} else {
string nans = solve(x, y, z - x);
string ans;
for (char c : nans) {
if (c == 'a') {
ans += "ac";
} else {
ans += c;
}
}
return ans;
}
}
int main() {
ios_base::sync_with_stdio(false);
int x, y, z;
cin >> x >> y >> z;
cout << solve(x, y, z) << "\n";
return 0;
}
|
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
using namespace std;
#define _int64 long long
int main()
{
int i,j,k,lim,x,y,z,now;
string s,ans;
vector<string> a[2];
scanf("%d%d%d",&x,&y,&z);
a[0].clear();
for (i=0;i<x;i++)
{
s="";
s.push_back('a');
a[0].push_back(s);
}
for (i=0;i<y;i++)
{
s="";
s.push_back('b');
a[0].push_back(s);
}
for (i=0;i<z;i++)
{
s="";
s.push_back('c');
a[0].push_back(s);
}
now=0;
while (a[now].size()>1)
{
sort(a[now].begin(),a[now].end());
s=a[now][0];
//for (i=0;i<a[now].size();i++)
// cout<<a[now][i]<<" ";
//cout<<endl;
for (i=0;i<a[now].size();i++)
if (a[now][i]!=s) break;
if (i==a[now].size()) break;
lim=i;
j=a[now].size()-1;
a[1-now].clear();
for (i=0;i<=j;i++)
{
if ((j>=lim)&&(i<lim))
{
a[1-now].push_back(a[now][i]+a[now][j]);
j--;
}
else
{
a[1-now].push_back(a[now][i]);
}
}
now=1-now;
}
ans="";
for (i=0;i<a[now].size();i++)
ans=ans+a[now][i];
printf("%s\n",ans.c_str());
return 0;
}
|
#include<bits/stdc++.h>
#define inf 0x7fffffff
#define maxn 10005
#define maxm 120005
typedef long long ll;
using namespace std;
int x, y, z;
multiset<string> Q;
inline int read(){
int x = 0, f = 1;char ch = getchar();
while(ch > '9' || ch < '0'){if(ch == '-') f = -1;ch = getchar();}
while(ch >= '0' && ch <= '9'){x = x * 10 + ch -'0';ch = getchar();}
return x * f;
}
int main(){
int i,j,u,v,f;
x = read(), y = read(), z = read();
for(i = 1;i <= x;i++) Q.insert("a");
for(i = 1;i <= y;i++) Q.insert("b");
for(i = 1;i <= z;i++) Q.insert("c");
while(Q.size() > 1){
string a = *Q.begin(), b = *Q.rbegin();
Q.erase(Q.begin()), Q.erase(Q.find(b));
Q.insert(a + b);
}
cout<<*Q.begin();
}
|
#include <bits/stdc++.h>
using namespace std;
#define ms(s, n) memset(s, n, sizeof(s))
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define FORd(i, a, b) for (int i = (a) - 1; i >= (b); i--)
#define FORall(it, a) for (__typeof((a).begin()) it = (a).begin(); it != (a).end(); it++)
#define sz(a) int((a).size())
#define present(t, x) (t.find(x) != t.end())
#define all(a) (a).begin(), (a).end()
#define uni(a) (a).erase(unique(all(a)), (a).end())
#define pb push_back
#define pf push_front
#define mp make_pair
#define fi first
#define se second
#define prec(n) fixed<<setprecision(n)
#define bit(n, i) (((n) >> (i)) & 1)
#define bitcount(n) __builtin_popcountll(n)
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pi;
typedef vector<int> vi;
typedef vector<pi> vii;
const int MOD = (int) 1e9 + 7;
const int FFTMOD = 1007681537;
const int INF = (int) 1e9;
const ll LINF = (ll) 1e18;
const ld PI = acos((ld) -1);
const ld EPS = 1e-12;
inline ll gcd(ll a, ll b) {ll r; while (b) {r = a % b; a = b; b = r;} return a;}
inline ll lcm(ll a, ll b) {return a / gcd(a, b) * b;}
inline ll fpow(ll n, ll k, int p = MOD) {ll r = 1; for (; k; k >>= 1) {if (k & 1) r = r * n % p; n = n * n % p;} return r;}
template<class T> inline int chkmin(T& a, const T& val) {return val < a ? a = val, 1 : 0;}
template<class T> inline int chkmax(T& a, const T& val) {return a < val ? a = val, 1 : 0;}
inline ll isqrt(ll k) {ll r = sqrt(k) + 1; while (r * r > k) r--; return r;}
inline ll icbrt(ll k) {ll r = cbrt(k) + 1; while (r * r * r > k) r--; return r;}
inline void addmod(int& a, int val, int p = MOD) {if ((a = (a + val)) >= p) a -= p;}
inline void submod(int& a, int val, int p = MOD) {if ((a = (a - val)) < 0) a += p;}
inline int mult(int a, int b, int p = MOD) {return (ll) a * b % p;}
inline int inv(int a, int p = MOD) {return fpow(a, p - 2, p);}
inline int sign(ld x) {return x < -EPS ? -1 : x > +EPS;}
inline int sign(ld x, ld y) {return sign(x - y);}
#define db(x) cerr << #x << " = " << (x) << " ";
#define endln cerr << "\n";
void solve() {
multiset<string> st;
FOR(i, 0, 3) {
int x; cin >> x;
while (x--) {
string s = "";
s += char('a' + i);
st.insert(s);
}
}
while (sz(st) > 1) {
string s = *st.begin();
string t = *st.rbegin();
st.erase(st.find(s));
st.erase(st.find(t));
st.insert(s + t);
}
cout << *st.begin() << "\n";
}
int main() {
ios_base::sync_with_stdio(0), cin.tie(0);
int JUDGE_ONLINE = 1;
if (fopen("in.txt", "r")) {
JUDGE_ONLINE = 0;
assert(freopen("in.txt", "r", stdin));
//assert(freopen("out.txt", "w", stdout));
}
solve();
if (!JUDGE_ONLINE) {
cout << "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MX = 1000;
char ans[MX][MX];
void solve2(int x, int y, int p) {
if (x == 0) {
for (int i = 0; i < y; i++) ans[p][i] = 'b';
}
else if (y == 0) {
for (int i = 0; i < x; i++) ans[p][i] = 'a';
}
else if (x >= y) {
int g = (x + y - 1) / y;
int f = x % y;
if (f == 0) f = y;
solve2(f, y - f, p + 1);
for (int i = 0, j = 0; i < y; i++) {
for (int k = 0; k < g - 1; k++, j++) ans[p][j] = 'a';
if (ans[p + 1][i] == 'a') ans[p][j++] = 'a';
ans[p][j++] = 'b';
}
}
else {
int g = (x + y - 1) / x;
int f = y % x;
if (f == 0) f = x;
solve2(x - f, f, p + 1);
for (int i = 0, j = 0; i < x; i++) {
ans[p][j++] = 'a';
for (int k = 0; k < g - 1; k++, j++) ans[p][j] = 'b';
if (ans[p + 1][i] == 'b') ans[p][j++] = 'b';
}
}
}
void solve(int x, int y, int z, int p = 0) {
if (x == 0) {
solve2(y, z, p);
for (int i = 0; i < y + z; i++) ans[p][i]++;
}
else if (y == 0) {
solve2(x, z, p);
for (int i = 0; i < x + z; i++)
if (ans[p][i] == 'b')
ans[p][i] = 'c';
}
else if (z == 0) {
solve2(x, y, p);
}
else if (x >= y + z) {
int g = (x + y + z - 1) / (y + z);
int f = x % (y + z);
if (f == 0) f = y + z;
if (z >= f) {
solve(f, y, z - f, p + 1);
for (int i = 0, j = 0; i < y + z; i++) {
for (int k = 0; k < g - 1; k++, j++) ans[p][j] = 'a';
if (ans[p + 1][i] == 'a') {
ans[p][j++] = 'a';
ans[p][j++] = 'c';
}
else {
ans[p][j++] = ans[p + 1][i];
}
}
}
else {
solve(f - z, z, y + z - f, p + 1);
for (int i = 0, j = 0; i < y + z; i++) {
for (int k = 0; k < g - 1; k++, j++) ans[p][j] = 'a';
if (ans[p + 1][i] == 'c') {
ans[p][j++] = 'b';
}
else {
ans[p][j++] = 'a';
ans[p][j++] = ans[p + 1][i] + 1;
}
}
}
}
else {
static string S[MX];
for (int i = 0; i < x; i++) S[i] = "a";
for (int i = 0; i < z; i++) S[i % x] += "c";
for (int i = 0; i < y; i++) S[z % x + i % (x - z % x)] += "b";
set<string> strs;
for (int i = 0; i < x; i++) strs.insert(S[i]);
string SS[3];
int cnt[3] = {0, 0, 0}, iter = 0;
for (auto& s : strs) {
SS[iter] = s;
cnt[iter] = 0;
for (int i = 0; i < x; i++) if (S[i] == s) cnt[iter]++;
iter++;
}
solve(cnt[0], cnt[1], cnt[2], p + 1);
for (int i = 0, j = 0; i < x; i++)
for (char c : SS[ans[p + 1][i] - 'a'])
ans[p][j++] = c;
}
}
int main() {
int x, y, z;
ignore = scanf("%d %d %d", &x, &y, &z);
solve(x, y, z);
ans[0][x + y + z] = 0;
printf("%s\n", ans[0]);
return 0;
}
|
#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define each(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define rng(a) a.begin(),a.end()
#define maxs(x,y) x = max(x,y)
#define mins(x,y) x = min(x,y)
#define pb push_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcount
#define uni(x) x.erase(unique(rng(x)),x.end())
#define snuke srand((unsigned)clock()+(unsigned)time(NULL));
#define df(x) int x = in()
#define dame { puts("-1"); return 0;}
#define show(x) cout<<#x<<" = "<<x<<endl;
#define PQ(T) priority_queue<T,vector<T>,greater<T> >
#define bn(x) ((1<<x)-1)
#define newline puts("")
#define v(T) vector<T>
#define vv(T) vector<vector<T>>
using namespace std;
typedef long long int ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
inline int in() { int x; scanf("%d",&x); return x;}
inline void priv(vi a) { rep(i,sz(a)) printf("%d%c",a[i],i==sz(a)-1?'\n':' ');}
template<typename T>istream& operator>>(istream&i,vector<T>&v)
{rep(j,sz(v))i>>v[j];return i;}
template<typename T>string join(const vector<T>&v)
{stringstream s;rep(i,sz(v))s<<' '<<v[i];return s.str().substr(1);}
template<typename T>ostream& operator<<(ostream&o,const vector<T>&v)
{if(sz(v))o<<join(v);return o;}
template<typename T1,typename T2>istream& operator>>(istream&i,pair<T1,T2>&v)
{return i>>v.fi>>v.se;}
template<typename T1,typename T2>ostream& operator<<(ostream&o,const pair<T1,T2>&v)
{return o<<v.fi<<","<<v.se;}
const int MX = 200005, INF = 1001001001;
const ll LINF = 1e18;
const double eps = 1e-10;
typedef v(string) vs;
int main() {
multiset<string> s;
rep(i,3) {
int n;
scanf("%d",&n);
rep(j,n) s.insert(string(1,'a'+i));
}
while (sz(s) > 1) {
auto it = s.end(); --it;
string x = *(s.begin()) + *it;
s.erase(it); s.erase(s.begin());
s.insert(x);
}
cout<<*(s.begin())<<endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
string f(int x, int y, int z, string a, string b, string c) {
//cout << x << ' ' << y << ' ' << z << ' ' << a << ' ' << b << ' ' << c << endl;
if(y == 0 && z == 0) {
string ret;
for(int i = 0; i < x; i++) ret += a;
return ret;
}
if(x == 0) return f(y, z, 0, b, c, a);
if(y == 0 && z) return f(x, z, y, a, c, b);
if(z == 0) {
if(x <= y) {
string na = a;
for(int i = 0; i < y / x; i++) na += b;
return f(x, y % x, 0, na, b, c);
}
else {
string na = a, nb = a + b;
return f(x - y, y, 0, na, nb, c);
}
}
else if(x <= z) {
string na = a + c;
return f(x, y, z - x, na, b, c);
}
else if(x <= y + z) {
string nb = a + c;
return f(x - z, z, y, a, nb, b);
}
else {
string na = a, nb = a + b, nc = a + c;
return f(x - y - z, y, z, na, nb, nc);
}
}
int X, Y, Z;
int main() {
cin >> X >> Y >> Z;
cout << f(X, Y, Z, "a", "b", "c");
}
|
#include <bits/stdc++.h>
using namespace std;
#define times(n, i) uptil(0, n, i)
#define rtimes(n, i) downto((n) - 1, 0, i)
#define upto(f, t, i) for(int i##_to_ = (t), i = (f); i <= i##_to_; i++)
#define uptil(f, t, i) for(int i##_to_ = (t), i = (f); i < i##_to_; i++)
#define downto(f, t, i) for(int i##_to_ = (t), i = (f); i >= i##_to_; i--)
#define downtil(f, t, i) for(int i##_to_ = (t), i = (f); i > i##_to_; i--)
typedef long double LD;
#define long long long
#if defined(EBUG) && !defined(ONLINE_JUDGE)
#define debug true
#define _GLIBCXX_DEBUG
#define _LIBCPP_DEBUG 2
#define _LIBCPP_DEBUG2 2
#define ln << endl
#else
#define debug false
#define ln << '\n'
#endif
#define tb << '\t'
#define sp << ' '
vector<char> pyon(int x, int y, int z) {
vector<char> ans;
if(!y && !z) {
ans = vector<char>(x, 'a');
} else if(!z && !x) {
ans = vector<char>(y, 'b');
} else if(!x && !y) {
ans = vector<char>(z, 'c');
} else {
bool zoi = !x;
if(zoi) swap(x, y);
ans.reserve(x + y + z);
int p = z / x, s = z % x, q = y / (x - s), t = y % (x - s), u = x - s - t;
for(char c: pyon(u, t, s)) {
ans.push_back(zoi ? 'b' : 'a');
if(c == 'a') {
times(p, o) ans.push_back('c');
times(q, o) ans.push_back('b');
} else if(c == 'b') {
times(p, o) ans.push_back('c');
times(q+1, o) ans.push_back('b');
} else {
times(p+1, o) ans.push_back('c');
}
}
}
if(debug) { cout << x sp << y sp << z tb; for(char c: ans) cout << c; cout ln; }
return ans;
}
signed main() { // long: 64bit
if(!debug) {
cin.tie(0);
ios::sync_with_stdio(0);
}
int X, Y, Z; scanf("%d%d%d", &X, &Y, &Z);
for(char c: pyon(X, Y, Z)) cout << c;
cout ln;
return 0;
}
|
#include<cstdio>
#include<string>
int X,Y,Z;
char t[510],s[510];
void dfs(int x,int y,int z,int n){
if(!x&&!y&&!z){
t[n]=0;
bool fl=1;
for(int i=1;i<n&&fl;i++){
int j=0;while(j<n&&t[(i+j)%n]==t[j])j++;
if(j<n&&t[(i+j)%n]<t[j])fl=0;
}
if(fl)for(int i=0;i<=n;i++)s[i]=t[i];
}
else{
if(x)t[n]='a',dfs(x-1,y,z,n+1);
if(y)t[n]='b',dfs(x,y-1,z,n+1);
if(z)t[n]='c',dfs(x,y,z-1,n+1);
}
}
std::string con(int X,int Y,int Z){
std::string S;
if(!X){
if(!Y&&!Z)return S;
S=con(Y,Z,0);
for(int i=0;i<S.length();i++)S[i]++;
return S;
}
if(!Y){
if(!Z){
for(int i=0;i<X;i++)S.push_back('a');
return S;
}
S=con(X,Z,0);
for(int i=0;i<S.length();i++)S[i]=='b'?S[i]='c':1;
return S;
}
if(!Z){
for(int i=1;i<=X;i++){
S.push_back('a');
for(int j=Y*(i-1)/X;j<Y*i/X;j++)S.push_back('b');
}
return S;
}
int t=X-Z%X;
std::string T=con(t-Y%t,Y%t,Z%X);
for(int i=0;i<T.length();i++){
S.push_back('a');
if(T[i]=='a'){
for(int j=0;j<Z/X;j++)S.push_back('c');
for(int j=0;j<Y/t;j++)S.push_back('b');
}
if(T[i]=='b'){
for(int j=0;j<Z/X;j++)S.push_back('c');
for(int j=0;j<Y/t+1;j++)S.push_back('b');
}
if(T[i]=='c'){
for(int j=0;j<Z/X+1;j++)S.push_back('c');
}
}
return S;
}
int main(){
/*
for(X=0;X<=5;X++)
for(Y=0;Y<=8;Y++)
for(Z=0;Z<=8;Z++){
printf("%d,%d,%d: ",X,Y,Z);
dfs(X,Y,Z,0);
for(int i=0,p=0;i<X;i++){
int cs=0;
for(++p;s[p]&&s[p]!='a';p++)if(s[p]=='c')cs++;
printf("%d,",cs);
}
puts(s);
printf("(%d,%d,%d)",X,Y,Z);
puts(con(X,Y,Z).c_str());
if(!X){
printf("(%d,%d,%d)",X,Y,Z);
for(int i=1;i<=Y;i++){
putchar('b');
for(int j=Z*(i-1)/Y;j<Z*i/Y;j++)putchar('c');
}
if(!Y)for(int i=0;i<Z;i++)putchar('c');
puts("");
}
}*/
int X,Y,Z;scanf("%d%d%d",&X,&Y,&Z);
puts(con(X,Y,Z).c_str());
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
string slow(int ca, int cb, int cc) {
int n = ca + cb + cc;
string s = "";
for (int i = 0; i < ca; i++) s += 'a';
for (int i = 0; i < cb; i++) s += 'b';
for (int i = 0; i < cc; i++) s += 'c';
string ans = s;
do {
string mn = s;
for (int i = 0; i < n; i++) {
string t = s;
rotate(t.begin(), t.begin() + i, t.end());
mn = min(mn, t);
}
ans = max(ans, mn);
} while (next_permutation(s.begin(), s.end()));
return ans;
}
string lexmin(string s) {
string mn = s;
for (int i = 0; i < (int)s.length(); i++) {
string t = s;
rotate(t.begin(), t.begin() + i, t.end());
mn = min(mn, t);
}
return mn;
}
string solve(vector<string> v) {
sort(v.begin(), v.end());
int n = v.size();
if (v[0] == v[n - 1]) {
string s = "";
for (auto t : v) s += t;
return lexmin(s);
}
map<string, int> mp;
for (auto s : v) mp[s]++;
vector<pair<string, int> > b;
for (auto it : mp) {
b.push_back(it);
}
vector<string> nv;
vector<string> cur(b[0].second, b[0].first);
for (int i = (int)b.size() - 1; i >= 1; i--) {
for (int j = 0; j < b[i].second; j++) {
cur[j % (int)cur.size()] += b[i].first;
}
if (b[i].second % cur.size()) {
int rem = b[i].second % cur.size();
//while (cur.size() > rem) {
for (int l = 0; l < rem; l++) {
nv.push_back(*cur.begin());
//cur.pop_back();
cur.erase(cur.begin());
}
}
}
for (auto s : cur) nv.push_back(s);
return solve(nv);
}
string fast(int ca, int cb, int cc) {
bool f = 0;
if (ca == 0) {
f = 1;
ca = cb;
cb = cc;
cc = 0;
}
if (ca == 0) {
return string(cb, 'c');
}
int n = ca + cb + cc;
vector<string> a(ca, "a");
for (int i = 0; i < cc; i++) {
a[i % ca] += "c";
}
for (int i = 0; i < cb; i++) {
a[(i + cc) % (ca - cc % ca) + cc % ca] += "b";
}
sort(a.begin(), a.end());
string ans = solve(a);
//do {
/*while (1) {
string s = "";
random_shuffle(a.begin(), a.end());
for (string ss : a) s += ss;
string mn = s;
for (int i = 0; i < n; i++) {
string t = s;
rotate(t.begin(), t.begin() + i, t.end());
mn = min(mn, t);
}
ans = max(ans, mn);
if (clock() / (double)CLOCKS_PER_SEC > 1.9) break;
}*/
if (f) {
for (char &c : ans) {
if (c == 'a') c = 'b';
else c = 'c';
}
}
return ans;
}
int main() {
#ifdef HOME
freopen("in", "r", stdin);
#endif
/*int n = 10;
for (int ca = 0; ca <= n; ca++) {
for (int cb = 0; ca + cb <= n; cb++) {
//for (int cc = 0; ca + cb + cc <= n; cc++) {
int cc = n - ca - cb;
string ans1 = fast(ca, cb, cc);
string ans2 = slow(ca, cb, cc);
//string ans2 = ans1;
cout << ca << " " << cb << " " << cc << " " << ans1 << " " << ans2 << endl;
if (ans1 != ans2) {
cout << "FAIL" << endl;
fast(ca, cb, cc);
return 0;
}
}
}
cout << "OK" << endl;*/
int ca, cb, cc;
while (cin >> ca >> cb >> cc) {
cout << fast(ca, cb, cc) << endl;
}
#ifdef HOME
cerr << clock() / (double)CLOCKS_PER_SEC << endl;
#endif
return 0;
}
|
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
typedef long long ll ;
#define rep(i, a, b) for (int i = a; i <= b; ++ i)
using namespace std ;
string trans(string x, string a, string b, string c) {
string ret ;
rep(i, 0, (int) x.length() - 1) {
if (x[i] == 'a') ret += a ;
if (x[i] == 'b') ret += b ;
if (x[i] == 'c') ret += c ;
}
return ret ;
}
void dfs(string a, string b, string c, int x, int y, int z) {
if (!y && !z) {
rep(i, 1, x) cout << a ;
return ;
}
string s[55] ;
rep(i, 1, x) s[i] = 'a' ;
for ( ; z; ) {
for (int i = x; i; -- i) if (z) {
s[i] = s[i] + 'c' ;
-- z ;
}
}
int k = x ;
rep(i, 1, x - 1) if (s[i].length() != s[i + 1].length()) {
k = i ;
break ;
}
for ( ; y; ) {
for (int i = k; i; -- i) if (y) {
s[i] = s[i] + 'b' ;
-- y ;
}
}
int X = 0, Y = 0, Z = 0, d[5] = {0} ;
rep(i, 1, x - 1) if (s[i] != s[i + 1]) {
d[++ d[0]] = i ;
}
d[++ d[0]] = x ;
if (d[0]) X = d[1] ;
if (d[0] > 1) Y = d[2] - d[1] ;
if (d[0] > 2) Z = d[3] - d[2] ;
dfs(trans(s[d[1]], a, b, c), trans(s[d[2]], a, b, c), trans(s[d[3]], a, b, c), X, Y, Z) ;
}
int main() {
int x, y, z ;
string s[55] ;
scanf("%d%d%d", &x, &y, &z) ;
if (!x && !y) {
rep(i, 1, z) printf("%c", 'c') ;
} else
if (!x) {
dfs("b", "c", "a", y, z, x) ;
} else {
dfs("a", "b", "c", x, y, z) ;
}
return 0 ;
}
|
#include<iostream>
#include<vector>
#include<algorithm>
#include<cmath>
using namespace std;
int main(){
int n;
cin >> n;
vector<long> a(n);
for(int i=0;i<n;i++) cin >> a[i];
long odd=0,even=0,sum=0;
for(int i=0;i<n;i++){ //+-
sum+=a[i];
if(i%2==0&&sum<=0){
odd+=abs(sum)+1;
sum=+1;
}
else if(i%2==1&&sum>=0){
odd+=abs(sum)+1;
sum=-1;
}
}
sum=0;
for(int i=0;i<n;i++){ //-+
sum+=a[i];
if(i%2==1&&sum<=0){
even+=abs(sum)+1;
sum=+1;
}
else if(i%2==0&&sum>=0){
even+=abs(sum)+1;
sum=-1;
}
}
cout << min(odd,even) << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;cin>>n;
int a[n];
for (int i=0;i<n;i++)
cin>>a[i];
ll mn=1e18;
for (int i=0;i<2;i++) {
ll sm=0;
ll cnt=0;
for (int j=0;j<n;j++) {
sm+=a[j];
if ((i+j)%2==0) {
if (sm<=0) {
cnt+=-sm+1;
sm=1;
}
} else {
if (sm>=0) {
cnt+=sm+1;
sm=-1;
}
}
}
mn=min(mn,cnt);
}
cout<<mn<<endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
ll n,ce=0,cf=0;
cin>>n;
ll a[n],e[n],f[n];
cin>>a[0];
e[0]=a[0];
f[0]=a[0];
if(e[0]<1){
e[0]=1;
ce+=1-a[0];
}
if(f[0]>-1){
f[0]=-1;
cf+=a[0]+1;
}
for(int i=1;i<n;i++){
cin>>a[i];
e[i]=e[i-1]+a[i];
f[i]=f[i-1]+a[i];
if(i%2==1){
if(e[i]>-1){
ce+=e[i]+1;
e[i]=-1;
}
if(f[i]<1){
cf+=1-f[i];
f[i]=1;
}
}else{
if(f[i]>-1){
cf+=f[i]+1;
f[i]=-1;
}
if(e[i]<1){
ce+=1-e[i];
e[i]=1;
}
}
}
cout<<min(ce,cf);
}
|
// C - Sequence
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rp(i,n) for(int i=0;i<(n);i++)
ll counter(vector<ll> &A, int N, int sign){//sign: (+)start -> 1, (-)start -> -1
ll c = 0, s = 0;
rp(i,N){
s += A[i];
if(sign*s<=0){
c += abs(s) + 1;
s = sign;
}
sign *= -1;
}
return c;
}
int main(){
int N; cin>>N;
vector<ll> A(N);
rp(i,N) cin>>A[i];
ll a = counter(A,N, 1);
ll b = counter(A,N,-1);
cout<< (a<b?a:b) <<endl;
}
|
// C - Sequence
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define up(i,s,e,d) for(int i=(s);i<(e);i+=(d))
int main(){
int N; cin>>N;
vector<ll> A(N);
ll csum = 0;
ll a = 0;
up(i,0,N,1){
cin>>A[i];
csum += A[i];
if(i%2==0 && csum<=0){//even +
a += abs(csum) + 1;
csum = 1;
}
if(i%2==1 && csum>=0){//odd -
a += abs(csum) + 1;
csum = -1;
}
}
csum = 0;
ll b = 0;
up(i,0,N,1){
csum += A[i];
if(i%2==1 && csum<=0){//odd +
b += abs(csum) + 1;
csum = 1;
}
if(i%2==0 && csum>=0){//even -
b += abs(csum) + 1;
csum = -1;
}
}
cout<< (a<b?a:b) <<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#if __has_include("print.hpp")
#include "print.hpp"
#endif
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
typedef long long ll;
typedef pair<int, int> p;
int n;
vector<int> v;
ll calc(ll s) {
ll sum = 0, res = 0;
for (int i = 0; i < n; ++i, s *= -1) {
sum += v[i];
if (sum * s > 0) continue;
res += abs(sum - s);
sum += s * abs(sum - s);
}
return res;
}
int main(){
cin >> n;
for (int i = 0; i < n; i++)
{
int tmp;
cin >> tmp;
v.push_back(tmp);
}
cout << min(calc(1), calc(-1)) << endl;
}
|
#include <iostream>
#include <algorithm>
using namespace std;
int main(void){
int n,i,a[100010];
long s=0,h1=0,h2=0;
cin >> n;
for (i=0;i<n;i++) cin >> a[i];
for (i=0;i<n;i++){
s+=a[i];
if (i%2 && s>=0){
h1+=s+1;
s=-1;
}
if (i%2==0 && s<=0){
h1+=1-s;
s=1;
}
}
s=0;
for (i=0;i<n;i++){
s+=a[i];
if (i%2==0 && s>=0){
h2+=s+1;
s=-1;
}
if (i%2 && s<=0){
h2+=1-s;
s=1;
}
}
cout << min(h1,h2) << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll a[100010],n;
ll ans(int hugo){
ll sum=0,ANS=0;
for(int i=0;i<n;i++){
sum+=a[i];
if(hugo==-1){
hugo=1;
if(sum>=0){
ANS+=abs(sum)+1;
sum=-1;
}
}
else if(hugo==1){
hugo=-1;
if(sum<=0){
ANS+=abs(sum)+1;
sum=1;
}
}
}
return ANS;
}
int main() {
cin>>n;
for(int i=0;i<n;i++){
int z;
cin>>z;
a[i]=z;
}
cout << min(ans(-1),ans(1));
}
|
#include<bits/stdc++.h>
using namespace std;
int N;
vector<int>a(100010); // 終了コード136が出る場合は配列を余分に取る。制約最大+αが望ましい
long calc(long s){
long sum=0, res=0;
for(int i=0; i<N; i++, s*=-1){
sum+=a[i];
if(sum*s>0){continue;} // 初項が＋か―かで結果が出る問題である。sの変化を基準にしている。
res+=abs(sum-s); // abs(sum-s)を算出すると符号を変えるのに必要な操作回数の値がresに入る
sum+=s*abs(sum-s); // sum*sが成り立たないという事は、
} // sumに新しく入れる数値がsの基準に合致していないためであり、sを掛ける必要がある
return res; // 操作回数の最小値
}
int main() {
cin>>N;
for(int i=0; i<N; i++){
cin>>a[i]; }
cout<<min(calc(1), calc(-1));
return 0;
}
|
#include <iostream>
#include <algorithm>
#include <cstdlib>
using namespace std;
long long solver(bool pre_is_posi, long long a[], long long n)
{
long long total=0, ans=0;
for (int i=0; i<n; i++){
total += a[i];
if (pre_is_posi && total >= 0){
ans += abs(total)+1;
total = -1;
} else if (!(pre_is_posi) && total <= 0){
ans += abs(total)+1;
total = 1;
}
pre_is_posi = (total > 0);
}
return ans;
}
int main()
{
long long n, a[100000];
cin >> n;
for (int i=0; i<n; i++) cin >> a[i];
cout << min(solver(true, a, n), solver(false, a, n)) << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
long n;
cin >> n;
long a[n],sum = 0;
for(long i = 0;i < n;i++){
cin >> a[i];
}
long kekka = 0;
for(long i = 0;i < n;i++){
sum += a[i];
if(i % 2 == 0 && sum >= 0){
kekka += sum + 1;
sum = -1;
}
if(i % 2 == 1 && sum <= 0){
kekka += -sum + 1;
sum = 1;
}
}
long result = 0;
sum = 0;
for(long i = 0;i < n;i++){
sum += a[i];
if(i % 2 == 0 && sum <= 0){
result += -sum + 1;
sum = 1;
}
if(i % 2 == 1 && sum >= 0){
result += sum + 1;
sum = -1;
}
}
cout << min(kekka,result) << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#ifdef PAPITAS
#define DEBUG 1
#else
#define DEBUG 0
#endif
#define _DO_(x) if(DEBUG) x
int main()
{
ios::sync_with_stdio(false);cin.tie(NULL);
int n;
cin >> n;
int arr[n];
ll a = 0, b = 0, sa = 0, sb = 0;
for(int i = 0; i< n; i++){
cin >> arr[i];
}
for(int i = 0; i < n; i++){
sa += arr[i];
sb += arr[i];
if(i%2 == 0){
if(sa <= 0){
a += 1 - sa;
sa = 1;
}
if(sb >= 0){
b += sb + 1;
sb = -1;
}
}else{
if(sa >= 0){
a += sa + 1;
sa = -1;
}
if(sb <= 0){
b += 1 - sb;
sb = 1;
}
}
}
cout << min(a, b);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using lli = int64_t;
using vi = vector<lli>;
lli f(vi& v, int n, int fl)
{
lli ans = 0;
for(lli i = 0, s = 0; i < n; i++, fl = !fl)
{
s += v[i];
if(!fl && s >= 0) ans += s - (-1), s = -1;
else
if(fl && s <= 0) ans += 1 - s, s = 1;
}
return ans;
}
int main()
{
ios_base::sync_with_stdio(0);
int n; cin >> n;
vi v(n);
for(int i = 0; i < n; i++) cin >> v[i];
lli ans = min(f(v, n, 0), f(v, n, 1));
cout << ans << endl;
return 0;
}
|
#include<bits/stdc++.h>
#define REP(i,n) for(int i=0;i<(n);i++)
#define ALL(v) (v).begin(),(v).end()
#define int long long
using namespace std;
typedef vector<int> vint;
typedef pair<int,int> pint;
signed main()
{
int N; cin>>N;
vint a(N);
REP(i,N) cin>>a[i];
int cost1=0,S=0;
REP(i,N){
S+=a[i];
if(i%2==0 and S<=0) cost1+=1-S,S=1;
if(i%2==1 and S>=0) cost1+=S+1,S=-1;
}
int cost2=0; S=0;
REP(i,N){
S+=a[i];
if(i%2==0 and S>=0) cost2+=S+1,S=-1;
if(i%2==1 and S<=0) cost2+=1-S,S=1;
}
cout<<min(cost1,cost2)<<endl;
}
|
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; ++i) cin >> a[i];
long long cnt1 = 0, sum = 0;
for (int i = 0; i < n; ++i) {
long long _sum = sum + a[i], su = (i & 1 ? _sum : -_sum);
if (su >= 0) {
cnt1 += su + 1;
sum = (i & 1 ? -1 : 1);
} else sum = _sum;
}
long long cnt2 = 0;
sum = 0;
for (int i = 0; i < n; ++i) {
long long _sum = sum + a[i], su = (i & 1 ? -_sum : _sum);
if (su >= 0) {
cnt2 += su + 1;
sum = (i & 1 ? 1 : -1);
} else sum = _sum;
}
cout << min(cnt1, cnt2) << endl;
}
|
#include <iostream>
#include <algorithm>
using namespace std;
typedef long long int ll;
int main(){
int n;
cin >> n;
ll a[n],sum=0,cnt1=0,cnt2=0;
for(int i=0;i<n;i++) cin >> a[i];
for(int i=0;i<n;i++){//奇数番目が正
sum+=a[i];
if(i%2==0){
if(sum>=0) cnt1+=1+sum,sum=-1;//1にするまでの距離?を足す
}
else{
if(sum<=0) cnt1+=1-sum,sum=1;//sumは1か-1になってる
}
}
sum=0;
for(int i=0;i<n;i++){//奇数番目が負
sum+=a[i];
if(i%2==0){
if(sum<=0) cnt2+=1-sum,sum=1;
}
else{
if(sum>=0) cnt2+=1+sum,sum=-1;
}
}
cout << min(cnt1,cnt2)<<endl;
}
|
#include<bits/stdc++.h>
#define rep(i,s,t) for(int i=s;i<=t;i++)
using namespace std;
typedef long long LL;
LL ans1,ans2,sum;
int n;
int a[100010];
int main(){
scanf("%d",&n);
rep(i,1,n) scanf("%d",&a[i]);
sum=0;
for(int i=1,s=1;i<=n;i++,s*=-1){
sum+=a[i];
if(sum*s<=0) ans1+=abs(sum-s),sum=s;
}
sum=0;
for(int i=1,s=-1;i<=n;i++,s*=-1){
sum+=a[i];
if(sum*s<=0) ans2+=abs(sum-s),sum=s;
}
printf("%lld\n",min(ans1,ans2));
return 0;
}
|
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main() {
int n; cin >> n;
vector<int>a(n); for (auto&& x : a)cin >> x;
long long ans1 = 0, ans2 = 0, sum = 0;
for (int i = 0; i < n; i++) {
sum += a[i];
if (i % 2 == 0 && sum >= 0) {
ans1 += sum + 1;
sum = -1;
}
else if (i % 2 == 1 && sum <= 0) {
ans1 += -sum + 1;
sum = 1;
}
}
sum = 0;
for (int i = 0; i < n; i++) {
sum += a[i];
if (i % 2 == 1 && sum >= 0) {
ans2 += sum + 1;
sum = -1;
}
else if (i % 2 == 0 && sum <= 0) {
ans2 += -sum + 1;
sum = 1;
}
}
cout << min(ans1, ans2) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAXN = 1e5+10;
int n;
ll arr[ MAXN ];
int g( ll x ) {
if( x < 0 ) return -1;
if( x == 0 ) return 0;
return 1;
}
ll f( ll sgn ) {
ll r = 0, acc = 0;
for( int i = 0; i < n; ++i ) {
acc += arr[i];
if( g(acc) != sgn ) {
r += abs(sgn-acc);
acc = sgn;
}
sgn *= -1;
}
return r;
}
int main( ) {
ios_base::sync_with_stdio( 0 );
cin.tie( 0 );
#ifdef LOCAL
freopen( "input", "r", stdin );
#endif
while( cin >> n ) {
ll ans = 0;
for( int i = 0; i < n; ++i ) {
cin >> arr[i];
}
ans = min( f(1), f(-1) );
cout << ans << '\n';
}
return 0;
}
|
#include<iostream>
#include<algorithm>
#include<functional>
#include<cmath>
#include<string>
#include<vector>
#include<queue>
using namespace std;
const int mod = 1000000007;
#define ll long long
ll A[100010];
int main()
{
int N; cin >> N;
for (int i = 0; i < N; i++) {
cin >> A[i];
}
ll sum = 0;
ll ans1 = 0, ans2 = 0;
int x = 1;
for (int i = 0; i < N; i++) {
sum += A[i];
if (sum * x >= 0) {
ans1 += abs(sum + x);
sum = -x;
}
x *= -1;
}
sum = 0; x = -1;
for (int i = 0; i < N; i++) {
sum += A[i];
if (sum * x >= 0) {
ans2 += abs(sum + x);
sum = -x;
}
x *= -1;
}
cout << min(ans1, ans2) << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
std::cin >> n;
std::array<int64_t, 2> rets{};
std::array<int64_t, 2> sums{};
for (int i = 0; i < n; i++) {
int a;
std::cin >> a;
std::array<int64_t, 2> moves{};
for (int j = 0; j < 2; j++) {
sums[j] += a;
if (i % 2 == j) {
if (sums[j] >= 0) {
moves[j] = -sums[j] - 1;
}
} else {
if (sums[j] <= 0) {
moves[j] = -sums[j] + 1;
}
}
sums[j] += moves[j];
rets[j] += abs(moves[j]);
}
}
std::cout << std::min(rets[0], rets[1]) << std::endl;
return 0;
}
|
#include<bits/stdc++.h>
#define REP(i,n) for(int i=0,i##_len=(n);i<i##_len;++i)
using namespace std;
signed main(){
int N;cin>>N;
vector<long long> A(N);
REP(i, N) cin >> A[i];
long long ans=LLONG_MAX;
int sig[2]={1,-1};
REP(j,2){
long long sum=0;
long long count=0;
REP(i,N){
sum+=A[i];
if(sig[(i^j)&1]*sum>=0){
count+=llabs(sum)+1;
sum=-sig[(i^j)&1];
}
}
ans=min(ans,count);
}
cout<<ans<<endl;
}
|
#include <iostream>
using namespace std;
long long a[100001], res;
int n;
long long llabs(long long x) {
return x < 0 ? -x : x;
}
void solve() {
long long sum = 0; res = 0;
for(int i = 0; i < n; ++i) {
if((i%2)) {
if(sum + a[i] <= 0) {
res += llabs(sum + a[i]) + 1;
sum = 1;
}else {
sum += a[i];
}
}else {
if(sum + a[i] >= 0) {
res += llabs(sum + a[i]) + 1;
sum = -1;
}else {
sum += a[i];
}
}
}
}
int main() {
cin >> n;
for(int i = 0; i < n; ++i) {
cin >> a[i];
}
solve();
long long ress = res;
for(int i = 0; i < n ; ++i) {
a[i] = -a[i];
}
solve();
cout << (ress < res ? ress : res) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int64_t i;
int64_t n;cin >> n;
vector<int64_t> a(n);for(int i=0;i<n;i++) cin >> a[i];
int64_t sum=0,ans0=0,ans1=0;
for(i=0;i<n;i++){
sum += a[i];
if(i%2==0 && sum<=0){
ans0 += abs(sum) +1;
sum = 1;
} else if(i%2==1 && sum>=0){
ans0 += abs(sum) +1;
sum = -1;
}
}
sum=0;
for(i=0;i<n;i++){
sum += a[i];
if(i%2==0 && sum>=0){
ans1 += abs(sum) +1;
sum = -1;
} else if(i%2==1 && sum<=0){
ans1 += abs(sum) +1;
sum = 1;
}
}
cout << min(ans0,ans1) << endl;
return 0;
}
|
#include<iostream>
using namespace std;
int N;
int a[112345];
long long int ans[2];
int main () {
cin >> N;
for(int i=0; i<N; i++) cin >> a[i];
for(int i=0; i<2; i++) {
long long int sum = 0;
for(int j=0; j<N; j++) {
sum += a[j];
if(j % 2 == i ) {
if(sum <= 0) {
ans[i] += 1 - sum;
sum = 1;
}
} else {
if(sum >= 0) {
ans[i] += sum + 1;
sum = -1;
}
}
}
}
cout << min(ans[0],ans[1]) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<long long int> a(n);
long long int sum1=0, sum2=0, cost1=0, cost2=0;
for(int i=0; i<n; i++){
cin >> a[i];
sum1 += a[i];
sum2 += a[i];
if(i%2 == 0 && sum1 <= 0){
cost1 += 1-sum1;
sum1 = 1;
}
else if(i%2 == 1 && sum1 >= 0){
cost1 += sum1+1;
sum1 = -1;
}
if(i%2 == 0 && sum2 >= 0){
cost2 += 1+sum2;
sum2 = -1;
}
else if(i%2 == 1 && sum2 <= 0){
cost2 += 1-sum2;
sum2 = 1;
}
}
cout << min(cost1, cost2) << endl;
return 0;
}
|
#include <iostream>
#include <string>
#include<algorithm>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
ll s1, s2, c1, c2;
int main() {
ll n, a;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a;
s1 += a;
s2 += a;
if (i % 2) {
if (s1 <= 0) c1 += 1 - s1,s1 = 1;
if (s2 >= 0) c2 += 1 + s2,s2 = -1;
}
else {
if (s1 >= 0) c1 += 1 + s1,s1 = -1;
if (s2 <= 0) c2 += 1 - s2,s2 = 1;
}
}
cout << min(c1, c2) << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int N; cin >> N;
int a[100010];
for(int i=0; i<N; ++i) cin >> a[i];
long plus=0, minus=0;
long psum=0, msum=0;
for(int i=0; i<N; ++i){
psum += a[i];
msum += a[i];
if(i%2){
if(psum>=0){
plus += psum+1;
psum=-1;
}
if(msum<=0){
minus += 1-msum;
msum=1;
}
}else{
if(psum<=0){
plus += 1-psum;
psum=1;
}
if(msum>=0){
minus += msum+1;
msum=-1;
}
}
}
cout << min(plus, minus) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
typedef long long ll;
int main() {
int n,t=0;
ll r1=0,r2=0;
cin >> n;
vector<int> a(n);
rep(i,n)
cin >> a.at(i);
rep(i,n) {
t += a.at(i);
if(i%2==0 && t<=0) {
r1 += abs(-t)+1;
t = 1;
} else if(i%2 && t>=0) {
r1 += t+1;
t = -1;
}
}
t = 0;
rep(i,n) {
t += a.at(i);
if(i%2 && t<=0) {
r2 += abs(-t)+1;
t = 1;
} else if(i%2==0 && t>=0) {
r2 += t+1;
t = -1;
}
}
cout << min(r1,r2) << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >>N;
long S0=0;
long S1=0;
long T0=0;
long T1=0;
for (int i=0; i<N; i++) {
long a;
cin >>a;
S0 +=a;
S1 +=a;
if (0==i%2) {
if (0>=S0) {
S0=1-S0;
T0 +=S0;
S0=1;
}
if (0<=S1) {
S1=S1+1;
T1 +=S1;
S1=-1;
}
} else {
if (0<=S0) {
S0=S0+1;
T0 +=S0;
S0=-1;
}
if (0>=S1) {
S1=1-S1;
T1 +=S1;
S1=1;
}
}
}
cout <<min(T0, T1) <<endl;
return 0;
};
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
int solvePlus(vector<int> v) {
int cnt = 0, sum = 0;
for (int i = 0; i < v.size(); i++) {
sum += v[i];
if (i % 2 == 1) {
cnt = (sum < 0) ? cnt : (cnt + abs(sum) + 1);
sum = (sum < 0) ? sum : -1;
} else if (i % 2 == 0) {
cnt = (sum > 0) ? cnt : (cnt + abs(sum) + 1);
sum = (sum > 0) ? sum : 1;
}
}
return cnt;
}
signed main() {
int n;
cin >> n;
vector<int> a(n), b(n);
for (auto&& w : a) cin >> w;
copy(begin(a), end(a), begin(b));
for (auto&& w : b) w *= -1;
int ans = min(solvePlus(a), solvePlus(b));
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int n, a[100000], s = 0;
ll x = 0, y = 0;
bool b = 0;
int main() {
cin >> n;
for (int i = 0; i < n; ++i)
cin >> a[i];
for (int i = 0; i < n; ++i, b = !b) {
s += a[i];
if (b) {
if (s <= 0) {
x += 1 - s;
s = 1;
}
} else if (s >= 0) {
x += s + 1;
s = -1;
}
}
b = 1;
s = 0;
swap(x, y);
for (int i = 0; i < n; ++i, b = !b) {
s += a[i];
if (b) {
if (s <= 0) {
x += 1 - s;
s = 1;
}
} else if (s >= 0) {
x += s + 1;
s = -1;
}
}
cout << min(x, y) << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int posi(long long x){
if(x>0)return 1;
if(x<0)return -1;
return 0;
}
int main(){
int N;
cin >> N;
vector<long long> a(N);
for(auto &i:a)cin >> i;
long long ans=0,tmp=0;
long long sum=a[0];
if(a[0]==0){
tmp=1;
sum=-1;
}
for(int i=1;i<N;i++){
if(posi(sum+a[i])*posi(sum)!=-1 || sum+a[i]==0){
tmp+=abs(sum+a[i])+1;
sum=(sum>0)?-1:1;
}
else sum+=a[i];
}
ans=tmp;
tmp=abs(a[0])+1;
sum=(a[0]>0)?-1:1;
for(int i=1;i<N;i++){
if(posi(sum+a[i])*posi(sum)!=-1 || sum+a[i]==0){
tmp+=abs(sum+a[i])+1;
sum=(sum>0)?-1:1;
}
else sum+=a[i];
}
ans=min(ans,tmp);
cout << ans << endl;
return 0;
}
|
#include<iostream>
using namespace std;
int n;
long long a[100005];
long long ans1, ans2, sum;
void solver(){
sum = 0;
for(int i = 1, s = 1; i <= n; ++i, s *= -1){
sum += a[i];
if(sum * s <= 0)ans1+=abs(sum-s),sum=s;
}
sum = 0;
for(int i = 1, s = -1; i <= n; ++i, s *= -1){
sum += a[i];
if(sum * s <= 0)ans2+=abs(sum-s),sum=s;
}
cout << min(ans1, ans2) << endl;
}
int main(){
cin >> n;
for(int i = 1; i <= n; ++i){
cin >> a[i];
}
solver();
}
|
#include <iostream>
using namespace std;
typedef long long ll;
const int MAX = 1e5;
int n;
int a[MAX];
ll solve(bool flag, ll sum) {
ll res = 0;
for (int i = 0; i < n; i++) {
sum += a[i];
if (flag) {
if (sum >= 0) {
res += sum + 1;
sum = -1;
}
} else {
if (sum <= 0) {
res += -sum + 1;
sum = 1;
}
}
flag = !flag;
}
return res;
}
int main() {
cin >> n;
for (int i = 0; i < n; i++) cin >> a[i];
// 貪欲法で操作回数の最小値を求める
// プラスから始まるパターンとマイナスから始まるパターンの2パターン試して、その小さい方が答え
cout << min(solve(true, 0), solve(false, 0)) << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
vector<long long> a(n);
for(int i=0;i<n;i++)cin>>a[i];
long long res1=0, res2=0, sum=0;
for(int i=0;i<n;i++){
sum+=a[i];
if(i%2==0 && sum>=0){//奇数番目までの和を負に
res1+= sum+1;
sum=-1;
}
if(i%2==1 && sum<=0){//偶数番目までの和を正に
res1+= 1-sum;
sum=1;
}
}
sum=0;
for(int i=0;i<n;i++){
sum+=a[i];
if(i%2==0 && sum<=0){//奇数番目までの和を正に
res2+= 1-sum;
sum=1;
}
if(i%2==1 && sum>=0){//偶数番目までの和を負に
res2+= sum+1;
sum=-1;
}
}
cout<<min(res1, res2)<<endl;
return 0;
}
|
#include<bits/stdc++.h>
typedef long long ll;
int a[100010],n;
ll s,cnt,ans=1e9;
int main()
{
scanf("%d",&n);
for(int i=1;i<=n;++i)
scanf("%d",&a[i]);
if(a[1]>0)s=a[1];
else cnt=1-a[1],s=1;
for(int i=2;i<=n;++i)
if(s*(s+a[i])<0)s+=a[i];
else
{
cnt+=abs(s+a[i])+1;
s=((s<0)<<1)-1;
}
ans=cnt;
if(a[1]<0)cnt=0,s=a[1];
else cnt=a[1]+1,s=-1;
for(int i=2;i<=n;++i)
if(s*(s+a[i])<0)s+=a[i];
else
{
cnt+=abs(s+a[i])+1;
s=((s<0)<<1)-1;
}
printf("%lld\n",std::min(ans,cnt));
return 0;
}
|
#include <bits/stdc++.h>
#define REP(i,n,N) for(int i=(n);i<(int)N;i++)
#define p(s) cout<<(s)<<endl
#define ck(n,a,b) (a)<=(n)&&(n)<(b)
typedef long long ll;
using namespace std;
const int inf=1e9;
int main(){
int n;
cin>>n;
int a[100010];
REP(i,0,n){
cin>>a[i];
}
ll ans[2];
REP(hugou,0,2){
ans[hugou]=0;
ll sum=0;
REP(i,0,n){
sum+=a[i];
if(i%2==hugou&&sum>=0){
ans[hugou]+=sum+1;
sum=-1;
}else if(i%2!=hugou&&sum<=0){
ans[hugou]+=-sum+1;
sum=1;
}
}
}
p(min(ans[0],ans[1]));
return 0;
}
|
#include <iostream>
#include <algorithm>
using namespace std;
int main(void) {
int num, i = 0, a;
long long sumT = 0, sumF = 0, ansT = 0, ansF = 0;
bool sig = true;
cin >> num;
for (; i < num; i++) {
scanf("%d", &a);
sumT += a;
sumF += a;
if (sig && sumT >= 0) {
ansT += sumT + 1;
sumT = -1;
}
else if (!sig && sumT <= 0) {
ansT += 1 - sumT;
sumT = 1;
}
if (!sig && sumF >= 0) {
ansF += sumF + 1;
sumF = -1;
}
else if (sig && sumF <= 0) {
ansF += 1 - sumF;
sumF = 1;
}
sig = !sig;
}
cout << min(ansT, ansF) << "\n";
return 0;
}
|
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <map>
#include <set>
using namespace std;
#define lli long long int
#define REP(i,n) for(int i=0;i<n;i++)
#define DEBUG 1
lli n,a[100100];
lli calc(lli s){
lli sum=0,res = 0;
for(lli i=0;i<n;i++,s *= -1){
sum += a[i];
if(sum * s > 0)continue;
res += abs(sum-s);
sum += s*abs(sum-s);
}
return res;
}
int main(){
cin>>n;
REP(i,n)cin>>a[i];
cout<<min(calc(1),calc(-1))<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
int64_t min_ans = INT64_MAX;
for (int s = -1; s < 2; s += 2) {
int64_t ans = 0LLU;
int64_t sum = 0LLU;
int sign;
for (int i = 0, sign = s; i < n; ++i, sign *= -1) {
sum += a[i];
// cout << i << "| sign: " << sign << " sum: " << sum << "\n";
if (sum * sign <= 0) {
ans += abs(sign - sum);
sum = sign;
}
}
min_ans = min(min_ans, ans);
}
cout << min_ans << "\n";
}
|
#include<bits/stdc++.h>
using namespace std;
#define all(a) (a).begin(),(a).end()
typedef long long ll;
ll mod=1000000007;
int main() {
int n;cin >>n;
ll cnt_a=0;
ll cnt_b=0;
ll sum_a =0;
ll sum_b =0;
ll sign_a = 1;
ll sign_b = -1;
for(int i=0;i<n;++i){
ll t;cin >> t;
sum_a +=t;
sum_b +=t;
if (sum_a * sign_a <= 0){
cnt_a += abs(sum_a) + 1;
sum_a = sign_a;
}
if (sum_b * sign_b <= 0){
cnt_b += abs(sum_b) + 1;
sum_b = sign_b;
}
sign_a *=-1;
sign_b *=-1;
}
cout << min(cnt_a,cnt_b) << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
long long int a[100005]={0};
long long int solve(long long int n, long long int sum){
long long int ans = 0;
for(int i=1;i<n;++i){
long long int s = sum + a[i];
if((s^sum) >= 0 || s == 0){
ans += abs(s) + 1;
s = (sum < 0 ? 1 : -1);
}
sum = s;
}
return ans;
}
int main(){
int n;
cin >> n;
for(int i=0;i<n;++i)cin >> a[i];
long long int ans = solve(n, 1) + abs(1-a[0]);
ans = min(solve(n, -1) + abs(-1-a[0]), ans);
if(a[0] != 0)ans = min(solve(n, a[0]), ans);
cout << ans << endl;
return 0;
}
|
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <functional>
using namespace std;
using Int = long long;
#define REP(i, n) for (int i = 0; i < n; i++)
int main()
{
int n; cin >> n;
Int c1 = 0, c2 = 0, s1 = 0, s2 = 0;
REP(i, n) {
int a; cin >> a;
s1 += a;
s2 += a;
if (i % 2 == 0) {
if (s1 <= 0) c1 += 1 - s1, s1 = 1;
if (s2 >= 0) c2 += s2 - (-1), s2 = -1;
} else {
if (s1 >= 0) c1 += s1 - (-1), s1 = -1;
if (s2 <= 0) c2 += 1 - s2, s2 = 1;
}
}
cout << min(c1, c2) << endl;
return 0;
}
|
#include <iostream>
#include <string>
#include<algorithm>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
ll s1, s2, c1, c2;
int main() {
ll n, a[100010];
cin >> n;
for (int i = 1; i <= n; i++)cin >> a[i];
for (int i = 1; i <= n; i++) {
s1 += a[i];
s2 += a[i];
if (i % 2) {
if (s1 <= 0) {
c1 += 1 - s1;
s1 = 1;
}
if (s2 >= 0) {
c2 += 1 + s2;
s2 = -1;
}
}
else {
if (s1 >= 0) {
c1 += 1 + s1;
s1 = -1;
}
if (s2 <= 0) {
c2 += 1 - s2;
s2 = 1;
}
}
}
cout << min(c1, c2) << endl;
return 0;
}
|
#include<iostream>
using namespace std;
typedef long long ll;
int n;
ll a[100000] = {};
ll solve(bool judge){
ll sum = 0, score = 0;
for(int i = 0; i < n; i++){
sum += a[i];
if(judge){
if(sum <= 0){
score += 1-sum;
sum = 1;
}
}else{
if(sum >= 0){
score += sum+1;
sum = -1;
}
}
judge = !judge;
}
return score;
}
int main(){
cin >> n;
for(int i = 0; i < n; i++) cin >> a[i];
ll first = solve(true);
ll second = solve(false);
cout << min(first, second) << endl;
return 0;
}
|
#include <iostream>
using namespace std;
using ll = long long;
ll n, a, c[2], s[2];
int main() {
cin >> n;
for (int i = 0; i != n; ++i) {
cin >> a;
for (int j : {0, 1}) {
s[j] += a;
auto p = 1 - (i + j) % 2 * 2;
if (s[j] * p <= 0) {
c[j] += abs(p - s[j]);
s[j] = p;
}
}
}
cout << min(c[0], c[1]) << endl;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(int)(n); i++)
using namespace std;
typedef long long LL;
const LL INF=1e15;
int main(){
int n;
cin >> n;
vector<LL> a(n);
rep(i,n) cin >> a[i];
LL sum=0, sign=1;
LL res1=0, res2=0;
rep(i,n){
sum+=a[i];
if(sum*sign<=0){
res1+=abs(sum)+1;
sum=sign;
}
sign*=-1;
}
sum=0, sign=-1;
rep(i,n){
sum+=a[i];
if(sum*sign<=0){
res2+=abs(sum)+1;
sum=sign;
}
sign*=-1;
}
cout << min(res1,res2) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, sum1 = 0, sum2 = 0, b = 0, c = 0, a;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a;
if (i%2) {
if (sum1+a < 0) {
sum1 += a;
} else {
b += 1+(sum1+a);
sum1 = -1;
}
if (sum2+a > 0) {
sum2 += a;
} else {
c += 1-(sum2+a);
sum2 = 1;
}
} else {
if (sum1+a > 0) {
sum1 += a;
} else {
b += 1-(sum1+a);
sum1 = 1;
}
if (sum2+a < 0) {
sum2 += a;
} else {
c += 1+(sum2+a);
sum2 = -1;
}
}
}
cout << min(b,c);
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.