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()... |
#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;}
i... |
#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,... |
#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... |
#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 ... |
#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... |
#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... |
#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;
con... |
#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(... |
#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_... |
#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.... |
#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) {
strin... |
#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... |
#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 st... |
#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 ... |
#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+... |
// #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>... |
#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();
... |
//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;
... |
#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 {
... |
#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 ZER... |
// 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
#defi... |
#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 c... |
//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 cm... |
#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()... |
#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... |
#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 namesp... |
#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++){
strin... |
#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 dou... |
#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>... |
/**
* 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 {
... |
#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... |
#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);
... |
#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... |
#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';
... |
#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... |
#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)... |
#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::... |
#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_st... |
#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++)
#defin... |
#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;
... |
#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 <cmat... |
#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')... |
#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())
... |
#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 % ... |
#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).... |
#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 ... |
#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... |
#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... |
#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 {
... |
#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') r... |
#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;
su... |
#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) ... |
#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];... |
// 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;
}
re... |
// 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;
}... |
#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 ... |
#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=... |
#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;
... |
#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)を算出すると符号を変えるのに必要... |
#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 ... |
#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 <=... |
#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 >> ar... |
#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 ... |
#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... |
#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... |
#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)... |
#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... |
#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... |
#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... |
#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, an... |
#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... |
#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;
RE... |
#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... |
#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)... |
#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... |
#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 == ... |
#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 ... |
#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... |
#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>=... |
#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;
... |
#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) {
... |
#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 ... |
#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+... |
#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];
i... |
#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) ... |
#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){... |
#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;
}
... |
#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;
... |
#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;
}
e... |
#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... |
#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 = 0... |
#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;... |
#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 ... |
#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 >> ... |
#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) {... |
#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;
}
}el... |
#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;
}
... |
#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=si... |
#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) {
... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.