text
stringlengths 49
983k
|
|---|
// C - Sequence
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
int N; cin>>N;
vector<ll> A(N);
for(int i=0; i<N; ++i) cin>>A[i];
vector<ll> C(2);
for(int c=0; c<2; ++c){
int sign = c?1:-1;
for(ll s=0, a=0; a<N; ++a, sign*=-1){
s += A[a];
if(sign*s<=0){ C[c]+=abs(s)+1; s=sign; }
}
}
cout<< (C[0]<C[1]?C[0]:C[1]) <<endl;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
long N;cin>>N;
vector<long>A(N),SP(N),SN(N);
long ansp=0,ansn=0;
for(int i=0;i<N;i++)cin>>A[i];
for(int i=0;i<N;i++){
SP[i]=(i==0?0:SP[i-1])+A[i];
if(i%2==0&&SP[i]<=0){ansp+=1-SP[i];SP[i]=1;}
if(i%2==1&&SP[i]>=0){ansp+=SP[i]+1;SP[i]=-1;}
}
for(int i=0;i<N;i++){
SN[i]=(i==0?0:SN[i-1])+A[i];
if(i%2==0&&SN[i]>=0){ansn+=SN[i]+1;SN[i]=-1;}
if(i%2==1&&SN[i]<=0){ansn+=1-SN[i];SN[i]=1;}
}
cout<<min(ansp,ansn);
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
long long N,sum,ans,ans2;
cin>>N;
sum=0;
ans=0;
ans2=0;
vector<long long>x(N);
for(int i=0;i<N;i++){
cin>>x[i];
}
for(int i=0;i<N;i++){
sum+=x[i];
if(i%2==0&&sum<=0){
ans+=1-sum;
sum=1;
}
if(i%2==1&&sum>=0){
ans+=1+sum;
sum=-1;
}
ans2=ans;
}
ans=0;
sum=0;
for(int i=0;i<N;i++){
sum+=x[i];
if(i%2==1&&sum<=0){
ans+=1-sum;
sum=1;
}
if(i%2==0&&sum>=0){
ans+=1+sum;
sum=-1;
}
}
cout<<min(ans,ans2)<<endl;
}
|
#include<iostream>
#include<stdlib.h>
using namespace std;
int main(){
int n;
cin>>n;
long sum;
long input;
cin>>sum;
long ans1,ans2,sum1,sum2;
if(sum>0){
sum1=sum;
sum2=-1;
ans1=0;
ans2=abs(sum)+1;
}
else if(sum<0){
sum1=1;
sum2=sum;
ans1=abs(sum)+1;
ans2=0;
}
else{
sum1=1;
sum2=-1;
ans1=1;
ans2=1;
}
for(long i=1;i<n;++i){
cin>>input;
if(sum1*(sum1+input)>=0){
ans1+=abs(sum1+input)+1;
if(sum1<0) sum1=1;
else sum1=-1;
}
else sum1+=input;
if(sum2*(sum2+input)>=0){
ans2+=abs(sum2+input)+1;
if(sum2<0) sum2=1;
else sum2=-1;
}
else sum2+=input;
}
cout<<min(ans1,ans2)<<endl;
}
|
#include<iostream>
#include<algorithm>
#include<string>
#include<cstdlib>
#include<map>
#include<iomanip>
#include<sstream>
using namespace std;
int main(void){
const long long int mod=1000000007;
long long int n,m,a[200005],plsum=0,misum=0,pl=0,mi=0;
cin>>n;
for(int i=0;i<n;i++){
cin>>a[i];
plsum+=a[i];
misum+=a[i];
if(plsum<=0&&i%2==0){pl+=1-plsum;plsum=1;}
if(plsum>=0&&i%2==1){pl+=plsum+1;plsum=-1;}
if(misum>=0&&i%2==0){mi+=1+misum;misum=-1;}
if(misum<=0&&i%2==1){mi+=1-misum;misum=1;}
}
cout<<min(mi,pl);
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin>>N;
vector<int> a(N);
for(int j=0;j<N;j++){
cin>>a[j];
}
long c1=0, c2=0;
long sum=0;
// a[0]>0
for(int i=0;i<N;i++){
sum += a[i];
if(i%2==1 && sum>=0){
c1 += sum+1;
sum =-1;
}
if(i%2==0 && sum<=0){
c1 += -sum+1;
sum = 1;
}
}
// a[0]<0
sum=0;
for(int i=0;i<N;i++){
sum += a[i];
if(i%2==1 && sum<=0){
c2 += -sum+1;
sum =1;
}
if(i%2==0 && sum>=0){
c2 += sum+1;
sum = -1;
}
// cout<<sum<<endl;
}
// cout<<c1<<" "<<c2<<endl;
cout<<min(c1,c2)<<endl;
}
|
#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);
for (auto&& w : a) cin >> w;
int ans1, ans2;
ans1 = solvePlus(a);
for (auto&& w : a) w *= -1;
ans2 = solvePlus(a);
cout << min(ans1, ans2) << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[100005];
int n;
long long calc(int MOD) {
long long sum = 0, res = 0;
for (int i = 1; i <= n; ++i) {
sum += a[i];
if (i%2 == MOD && sum <= 0) {
res += (1-sum);
sum = 1;
}
else if (i%2 != MOD && sum >= 0) {
res += (sum+1);
sum = -1;
}
}
return res;
}
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; ++i)
scanf("%d", &a[i]);
cout << min(calc(0), calc(1));
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) cin >> a[i];
auto f = [&](int sign) {
long long ans = 0;
int sum = 0;
for (int i = 0; i < n; i++) {
sum += a[i];
if (sign * sum <= 0) {
ans += -1 * sign * sum + 1;
sum = sign;
}
sign = sum < 0 ? 1 : -1;
}
return ans;
};
cout << min(f(1), f(-1)) << endl;
}
|
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
const long long int inf = 1e18;
int main(){
int n;
cin >> n;
vector<int> a(n);
for(int i=0; i<n; i++){
cin >> a[i];
}
long long int ans = inf;
for(int r=0; r<2; r++){
long long int sum=0, t=0;
for(int i=0; i<n; i++){
sum += a[i];
if(i%2==r && sum<=0){
t += -sum+1;
sum = 1;
}else if(i%2!=r && sum>=0){
t += sum+1;
sum = -1;
}
}
ans = min(ans, t);
}
cout << ans << endl;
return 0;
}
|
#include<iostream>
using namespace std;
int main(){
int n;cin>>n;
int a[n];
for(int i=0;i<n;i++) cin>>a[i];
long long s1=0,s2=0,r1=0,r2=0,ans;
for(int i=0;i<n;i++){
s1+=a[i];
if((i&1)&&s1<=0){
r1=r1+1-s1;
s1=1;
}else if(!(i&1)&&s1>=0){
r1=r1+s1+1;
s1=-1;
}
s2+=a[i];
if(!(i&1)&&s2<=0){
r2=r2+1-s2;
s2=1;
}else if((i&1)&&s2>=0){
r2=r2+s2+1;
s2=-1;
}
}
ans=min(r1,r2);
cout<<ans<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<long long> a(n);
long long 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;
}
|
#include<iostream>
#include <algorithm>
#include <string>
using namespace std;
int main()
{int N;
int C[200000];
cin >> N;
for(int i=0; i<N; i++){
cin >> C[i];}
long long cnt_a=0;
long long cnt_b=0;
int sum_a=0;
int sum_b=0;
for(int i=0; i<N; i++){
sum_a += C[i];
if((i%2==0)&&(sum_a<=0)){
cnt_a += 1 - sum_a;
sum_a = 1;}
if((i%2==1)&&(sum_a>=0)){
cnt_a += sum_a + 1;
sum_a = -1;}
}
for(int i=0; i<N; i++){
sum_b += C[i];
if((i%2==0)&&(sum_b>=0)){
cnt_b += 1 + sum_b;
sum_b = -1;}
if((i%2==1)&&(sum_b<=0)){
cnt_b += 1 - sum_b;
sum_b = 1;}
}
cout << min(cnt_a, cnt_b) << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int m,i;
int64_t ans0=0,ans1=0,t=0;
cin>>m;
vector<int64_t> x(m);
for(i=0;i<m;i++) cin>>x.at(i);
for(i=0;i<m;i++){
t+=x.at(i);
if(i%2==0&&t<=0){
ans0+=abs(t)+1;
t=1;
}
else if(i%2==1&&t>=0){
ans0+=abs(t)+1;
t=-1;
}
}
t=0;
for(i=0;i<m;i++){
t+=x.at(i);
if(i%2==0&&t>=0){
ans1+=abs(t)+1;
t=-1;
}
else if(i%2==1&&t<=0){
ans1+=abs(t)+1;
t=1;
}
}
cout<<min(ans0,ans1)<<endl;
}
|
#include <iostream>
using namespace std;
int N, a, i, x, y;
long long X, Y;
int main() {
cin >> N;
while (cin >> a && ++i) {
x += a, y += a;
if (i % 2) {
if (x > -1) X += x + 1, x = -1;
if (y < 1) Y += 1 - y, y = 1;
} else {
if (y > -1) Y += y + 1, y = -1;
if (x < 1) X += 1 - x, x = 1;
}
}
cout << min(X, Y) << "\n";
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
int main() {
int n;
cin >> n;
vector<ll> A(n);
ll a,now1=0,cnt1=0,now2=0,cnt2=0;
rep(i,n) cin >> A[i];
rep(i,n) {
now1 += A[i];
now2 += A[i];
if (now1<=0) {
cnt1+=abs(now1)+1;now1=1;
}
if (now2>=0) {
cnt2+=abs(now2)+1;now2=-1;
}
swap(now1,now2);swap(cnt1,cnt2);
}
cout << min(cnt1,cnt2) << endl;
}
|
#include <iostream>
#include<algorithm>
using namespace std;
typedef long long ll;
ll s1, s2, c1, c2;
int main() {
ll n, a;
scanf("%lld", &n);
for (int i = 1; i <= n; i++) {
scanf("%lld", &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 <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
using lint=long long;
const lint INF=1LL<<61;
int main(){
int n; cin>>n;
vector<int> a(n);
rep(i,n) cin>>a[i];
lint ans=INF;
for(int a0:{1,-1,a[0]}) if(a0!=0) {
lint tmp=abs(a0-a[0]),sum=a0;
for(int i=1;i<n;i++){
sum+=a[i];
if(sum-a[i]>0){
if(sum>=0){
tmp+=sum+1;
sum=-1;
}
}
else if(sum-a[i]<0){
if(sum<=0){
tmp+=1-sum;
sum=1;
}
}
}
ans=min(ans,tmp);
}
cout<<ans<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
long long int sum1=0,prev1=0;
long long int sum2=0,prev2=0;
long long int ans1=0, ans2=0;
for(int i=0;i<n;i++){
long long int a;
cin >> a;
sum1 += a;
sum2 += a;
if(i%2==0){
if(sum1 >= 0){
ans1 += abs(sum1)+1;
sum1 = -1;
}
if(sum2 <= 0){
ans2 += abs(sum2)+1;
sum2 = 1;
}
} else {
if(sum1 <= 0){
ans1 += abs(sum1)+1;
sum1 = 1;
}
if(sum2 >= 0){
ans2 += abs(sum2)+1;
sum2 = -1;
}
}
prev1 = sum1;
prev2 = sum2;
}
cout << min(ans1, ans2) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int>a(n);
for (int i = 0; i < n; i++)cin >> a.at(i);
ll ans = 1e18;
bool x = true;
for (int i = 0; i < 2; i++) {
ll res = 0;
ll sig = 0;
for (int j = 0; j < n; j++) {
if (x) {
sig += a.at(j);
x = false;
if (sig > 0)continue;
else {
res += abs(1 - sig);
sig = 1;
}
}
else {
sig += a.at(j);
x = true;
if (sig < 0)continue;
else {
res += abs(-1 - sig);
sig = -1;
}
}
}
x = false;
ans = min(ans, res);
}
cout << ans << endl;
}
|
#include <iostream>
#include<sstream>
#include<vector>
#include<iterator>
#include<cmath>
using namespace std;
long long f(int sign, const vector<long long>& a)
{
long long cnt = 0;
long long sum = 0;
for(int i=0; i<a.size(); i++)
{
sum += a[i];
if(sign*sum <= 0)
{
long long d = sign - sum;
sum += d;
cnt += abs(d);
}
sign *= -1;
}
return cnt;
}
int main(void)
{
int n;
cin >> n;
vector<long long> a(n);
for(int i=0; i<n; i++)
cin >> a[i];
long long sum[2];
sum[0] = f(1, a);
sum[1] = f(-1, a);
cout << min(sum[0], sum[1]) << endl;
return 0;
}
|
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <math.h>
#define MOD 1000000007
typedef long long ll;
using namespace std;
int main(){
int n;
cin>>n;
ll a[n];
for(int i=0;i<n;i++){
cin>>a[i];
}
ll ans1=0,ans2=0;
ll s=0;
for(int i=0;i<n;i++){
s+=a[i];
if(i%2==0&&s<=0){
ans1+=1-s;
s=1ll;
}else if(i%2==1&&s>=0){
ans1+=s+1;
s=-1ll;
}
}
s=0;
for(int i=0;i<n;i++){
s+=a[i];
if(i%2==1&&s<=0){
ans2+=1-s;
s=1ll;
}else if(i%2==0&&s>=0){
ans2+=s+1;
s=-1ll;
}
}
cout<<min(ans1,ans2)<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int INF = 1e9;
const int MOD = 1e9 + 7;
int main()
{
int n;
cin >> n;
vector<ll> a(n);
for (auto &e : a)
cin >> e;
ll ans = 1e16;
for (int i = 0; i < 2; ++i)
{
ll cnt = 0, sum = 0;
for (int j = 0; j < n; ++j)
{
sum += a[j];
if (j % 2 == i)
{
if (sum <= 0)
{
cnt += abs(sum) + 1;
sum = 1;
}
}
else
{
if (sum >= 0)
{
cnt += abs(sum) + 1;
sum = -1;
}
}
}
ans = min(cnt, ans);
}
cout << ans << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main(){
int n;
long sum1 = 0;
long sum2 = 0;
long op1 = 0;
long op2 = 0;
cin >> n;
for(int i = 0; i <n; i++){
int tmp;
cin >> tmp;
sum1 += tmp;
sum2 += tmp;
if(i%2){
if(sum1 >= 0) {
op1 += sum1 + 1;
sum1 = -1;
}
if(sum2 <= 0) {
op2 += -sum2 + 1;
sum2 = 1;
}
} else {
if(sum1 <= 0) {
op1 += -sum1 + 1;
sum1 = 1;
}
if(sum2 >= 0) {
op2 += sum2 + 1;
sum2 = -1;
}
}
}
if(op1 < op2) cout << op1;
else cout << op2;
return 0;
}
|
#include<iostream>
#include<vector>
#include<cmath>
using namespace std;
int main(void) {
long n;
cin >> n;
long a[n];
for(int i=0;i<n;++i) {
cin >> a[i];
}
long tmp1=0, tmp2=0;
long ans1=0, ans2=0;
for(int i=1;i<=n;++i){
tmp1 += a[i-1];
tmp2 += a[i-1];
if(i%2){
if(tmp1 <= 0){
ans1 += 1 - tmp1;
tmp1 = 1;
}
if(tmp2 >= 0){
ans2 += 1 + tmp2;
tmp2 = -1;
}
}
else{
if(tmp1 >= 0){
ans1 += 1 + tmp1;
tmp1 = -1;
}
if(tmp2 <= 0){
ans2 += 1 - tmp2;
tmp2 = 1;
}
}
}
cout << min(ans1, ans2) << endl;
}
|
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <cstdint>
int main() {
int n;
std::cin >> n;
std::vector<int> vec(n);
for (auto&& e : vec)
std::cin >> e;
auto solve = [&](bool positive) {
int64_t ret = 0;
int sum = 0;
for (int i = 0; i < vec.size(); ++i) {
sum += vec[i];
if (sum == 0 || positive != sum > 0) {
ret += std::abs(sum) + 1;
sum = (positive ? 1 : -1);
}
positive = !positive;
}
return ret;
};
std::cout << std::min(solve(true), solve(false)) << std::endl;
}
|
#include <iostream>
#include<algorithm>
using namespace std;
typedef long long ll;
ll s1, s2, c1, c2;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
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>
#include <cmath>
using namespace std;
int main(){
int n;cin>>n;
int a[n];
for(int i = 0; n > i; i++)cin>>a[i];
long long sh = 0;
long long nw = 0;
for(int i = 0; n > i; i++){
nw = (long long)nw+a[i];
if(i % 2 == 0)if(nw<=0)sh = (long long)sh+1-nw,nw=1;
if(i % 2 == 1)if(nw>=0)sh = (long long)sh+nw+1,nw=-1;
}
long long hs = 0;
nw = 0;
for(int i = 0; n > i; i++){
nw = (long long)nw+a[i];
if(i % 2 == 1)if(nw<=0)hs = (long long)hs+1-nw,nw=1;
if(i % 2 == 0)if(nw>=0)hs = (long long)hs+nw+1,nw=-1;
}
cout << min(hs,sh) << endl;
}
|
#include <iostream>
#include <algorithm>
using namespace std;
long long n,no,ans,notw,anstw;
int main(){
cin>>n;
int a;
for(int i=0;i<n;i++){
cin>>a;
if(no>0){
no+=a;
if(no>=0){
ans+=no+1;
no=-1;
}
}else{
no+=a;
if(no<=0){
ans+=no*-1+1;
no=1;
}
}
if(notw>=0){
notw+=a;
if(notw>=0){
anstw+=notw+1;
notw=-1;
}
}else{
notw+=a;
if(notw<=0){
anstw+=notw*-1+1;
notw=1;
}
}
}
cout<<min(ans,anstw)<<endl;
return 0;
}
|
#include<iostream>
#include<vector>
using namespace std;
int main(){
int n,i;
cin>>n;
vector<long long>a(n+1);
for(i=1;i<=n;i++)cin>>a[i];
for(i=1;i<n;i++)a[i+1]+=a[i];
long o=0,oc=0,e=0,ec=0;
for(i=1;i<=n;i++){
if(i%2){
if(a[i]+o<1)oc+=1-a[i]-o,o+=1-a[i]-o;
if(a[i]+e>-1)ec+=1+a[i]+e,e-=1+a[i]+e;
}
else{
if(a[i]+o>-1)oc+=1+a[i]+o,o-=1+a[i]+o;
if(a[i]+e<1)ec+=1-a[i]-e,e+=1-a[i]-e;
}
}
cout<<min(oc,ec)<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define rep(i, n) for(ll i = 0;i < n;i++)
int main() {
cin.tie(0); ios::sync_with_stdio(false);
int n;
cin >> n;
int a[100000];
rep(i, n) cin >> a[i];
ll ans = 1LL<<62;
ll sum[100001] = {};
// parity
rep(p, 2) {
ll cnt = 0;
rep(i, n) {
int border = 1+(p+i)%2*-2;
sum[i+1] = sum[i] + a[i];
if (border == 1 && sum[i+1] >= border) continue;
if (border == -1 && sum[i+1] <= border) continue;
cnt += abs(border-sum[i+1]);
sum[i+1] = border;
}
ans = min(ans, cnt);
}
cout << ans << endl;
}
|
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<climits>
#include<iostream>
#include<sstream>
#include<utility>
#include<map>
#include<vector>
#include<queue>
#include<algorithm>
#include<set>
#include<stack>
using namespace std;
typedef long long ll;
typedef pair<int,int>P;
int A[100005],N;
ll ch(int p)
{
ll t=0,r=0;
for(int i=0;i<N;i++,p*=-1)
{
t+=A[i];
if(t*p<=0)
{
if(p==-1){r+=abs(-1-t);t=-1;}
else {r+=abs(1-t);t=1;}
}
}
return r;
}
int main()
{
scanf("%d",&N);
for(int i=0;i<N;i++)scanf("%d",&A[i]);
printf("%lld\n",min(ch(1),ch(-1)));
return 0;
}
|
#include <iostream>
#include <vector>
using namespace std;
using ll = long long;
int main() {
ll n, ans1{}, ans2{}, s1{}, s2{}, t[2] = {1,-1};;
cin >> n;
vector<ll> a(n);
for (ll &x: a) cin >> x;
for (int i = 0; i != n; ++i) {
s1 += a[i];
s2 += a[i];
auto p = t[i%2];
if (s1 * p <= 0) {
ans1 += abs(p - s1);
s1 = p;
}
if (s2 * -p <= 0) {
ans2 += abs(p + s2);
s2 = -p;
}
}
cout << min(ans1,ans2) << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long lint;
const int MAX_N = 1e5;
lint N, a[MAX_N+5];
lint solve(lint next){
lint s = 0, cnt = 0;
for(int i=0;i<N;i++){
s += a[i];
if(next==1 && s<=0){
cnt += next - s; s = 1;
}else if(next==-1 && s>=0){
cnt += s - next; s = -1;
}
next *= -1;
}
return cnt;
}
int main(){
cin >> N;
for(int i=0;i<N;i++) cin >> a[i];
cout << min(solve(1), solve(-1)) << endl;
return 0;
}
|
#include <iostream>
#include <cstdio>
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++) scanf("%d", a + i);
// 貪欲法で操作回数の最小値を求める
// プラスから始まるパターンとマイナスから始まるパターンの2パターン試して、その小さい方が答え
cout << min(solve(true, 0), solve(false, 0)) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n;
long long a[100007];
long long solve()
{
long long res = 0;
long long sum = 0;
for(int i=0;i<n;i++)
{
if(i%2 == 0)
{
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];
}
}
return res;
}
int main()
{
cin >> n;
for(int i=0;i<n;i++) cin >> a[i];
long long ans = solve();
for(int i=0;i<n;i++) a[i] *= -1;
ans = min(ans,solve());
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
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 ans1=0LL, ans2=0LL, sum=0LL;
for(int i=0; i<n; ++i){
sum+=a[i];
if(i%2==0 && sum<=0){ans1+=1-sum; sum=1;}
else if(i%2==1 && sum>=0){ans1+=1+sum; sum=-1;}
}
sum=0;
for(int i=0; i<n; ++i){
sum+=a[i];
if(i%2==1 && sum<=0){ans2+=1-sum; sum=1;}
else if(i%2==0 && sum>=0){ans2+=1+sum; sum=-1;}
}
cout<<min(ans1, ans2)<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<ll> a(n);
for(int i=0; i<n; i++) cin >> a[i];
ll sum = 0, ans1 = 0;
for(int i=0; i<n; i++) {
sum += a[i];
if(i%2 == 0 && sum <= 0) {
ans1 += 1 - sum;
sum = 1;
}
if(i%2 == 1 && sum >= 0) {
ans1 += 1 + sum;
sum = -1;
}
}
sum = 0;
ll ans2 = 0;
for(int i=0; i<n; i++) {
sum += a[i];
if(i%2 == 1 && sum <= 0) {
ans2 += 1 - sum;
sum = 1;
}
if(i%2 == 0 && sum >= 0) {
ans2 += 1 + sum;
sum = -1;
}
}
cout << min(ans1, ans2) << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, s, t) for (int i = s; i <= t; i++)
ll ans1, ans2, sum;
int n;
int a[100010];
int main() {
cin >> n;
rep(i, 0, n - 1) cin >> a[i];
sum = 0;
for (int i = 0, 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 = 0, 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;
}
|
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const ll INF = 1LL << 60;
const double PI = 3.141592653589793238;
const double EPS = 1e-10;
int a[100000];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
ll ans = INF;
for (int b = 0; b < 2; b++) {
bool plus = b;
ll cost = 0;
ll sum = 0;
for (int i = 0; i < n; i++) {
sum += a[i];
if (plus) {
if (sum <= 0) cost += 1 - sum, sum = 1;
}
else {
if (sum >= 0) cost += sum + 1, sum = -1;
}
plus ^= 1;
}
ans = min(ans, cost);
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef long long ll;
using namespace std;
int n, a[100010];
ll calc(ll s) {
ll sum = 0, res = 0;
for (int i = 0; i < n; ++i, s *= -1) {
sum += a[i];
if (sum * s > 0) continue;
if (s > 0)
res += (-sum + s), sum += (-sum + s);
else
res += (sum - s), sum += -(sum - s);
}
return res;
}
int main() {
cin >> n;
rep(i, n) cin >> a[i];
cout << min(calc(1), calc(-1)) << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main(void){
int n;
long long a,b=0,c=0,d=0,e=0;
cin>>n;
for(int i=0;i<n;i++){
cin>>a;
b+=a;
c+=a;
if(i%2==0){
if(b>=0){
d+=b+1;
b=-1;
}
if(c<=0){
e+=-c+1;
c=1;
}
}else{
if(b<=0){
d+=-b+1;
b=1;
}
if(c>=0){
e+=c+1;
c=-1;
}
}
}
cout<<min(d,e)<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) cin >> a[i];
long long c1 = 0, c2 = 0, s1 = 0, s2 = 0;
for (int i = 0; i < n; i++) {
s1 += a[i];
s2 += a[i];
if (i & 1) {
if (s1 >= 0) {c1 += s1 + 1; s1 = -1;}
if (s2 <= 0) {c2 += 1 - s2; s2 = 1;}
} else {
if (s1 <= 0) {c1 += 1 - s1; s1 = 1;}
if (s2 >= 0) {c2 += s2 + 1; s2 = -1;}
}
}
cout << min(c1, c2) << endl;
}
|
#include<iostream>
#define rep(i,n) for(int i=0;i<n;++i)
using namespace std;
int n, a[100000];
int64_t solve(bool plus) {
int64_t ret = 0, sum = 0;
rep(i, n) {
sum += a[i];
if (plus && sum <= 0 || !plus && sum >= 0) {
ret += abs(sum) + 1;
sum = plus ? 1 : -1;
}
plus ^= true;
}
return ret;
}
int main() {
cin >> n;
rep(i, n) cin >> a[i];
cout << min(solve(true), solve(false)) << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
constexpr ll inf = 1e9+7;
ll solve(vector<ll> As, bool flag) {
ll ans = 0;
ll sum = 0;
for (auto A : As) {
sum += A;
if (flag && sum <= 0) { ans += 1 - sum; sum = 1; }
else if (!flag && sum >= 0) { ans += 1 + sum; sum = -1; }
flag = !flag;
}
return ans;
}
int main () {
cin.tie(0);
ios::sync_with_stdio(false);
ll N;
cin>>N;
vector<ll> A(N);
for (ll n = 0; n < N; n++) cin>>A[n];
cout<<min(solve(A, false), solve(A, true))<<endl;
return 0;
}
|
/* "It's okay if you hate me. I hate me too." */
#include <bits/stdc++.h>
using namespace std;
int a[100005];
int n;
long long calc(int MOD) {
long long sum = 0, res = 0;
for (int i = 1; i <= n; ++i) {
sum += a[i];
if (i%2 == MOD && sum <= 0) {
res += (1-sum);
sum = 1;
}
else if (i%2 != MOD && sum >= 0) {
res += (sum+1);
sum = -1;
}
}
return res;
}
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; ++i)
scanf("%d", &a[i]);
cout << min(calc(0), calc(1));
return 0;
}
|
#include <iostream>
#include <algorithm>
#include <map>
#include <string>
#include <math.h>
typedef long long ll;
using namespace std;
int main(){
int n;
cin >> n;
ll a[100001]={0};
for (int i=0;i<n;i++) cin >> a[i];
bool sign=true;
ll res=0,res2=0,sum=0;
for (int x=0;x<2;x++){
res=0;
sum=0;
for (int i=0;i<n;i++){
sum+=a[i];
if (sign){
if (sum <= 0){
res+=1-sum;
sum=1;
}
sign=false;
} else {
if (sum >= 0){
res+=1+sum;
sum=-1;
}
sign=true;
}
}
sign=false;
if (x == 0) res2=res;
}
cout << min(res,res2) << 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(i%2==0&&sig[j]*sum<=0){
count+=llabs(sum-sig[j]*1);
sum=sig[j]*1;
}
if(i%2==1&&sig[j]*sum>=0){
count+=llabs(sum+sig[j]*1);
sum=-1*sig[j];
}
}
ans=min(ans,count);
}
cout<<ans<<endl;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
using ll = long long;
const ll INF = 1LL << 61;
int main(){
int n;
cin >> n;
vector<int> a(n);
rep(i,n) cin >> a[i];
ll ans = INF;
for(int a0 : {1,-1,a[0]} ) if(a0 != 0) {
ll tmp = abs(a0 - a[0]), sum = a0;
for(int i = 1; i < n; i++){
sum += a[i];
if(sum - a[i] > 0){
if(sum >= 0){
tmp += sum + 1;
sum = -1;
}
}
else if(sum - a[i] < 0){
if(sum <= 0){
tmp += 1 - sum;
sum = 1;
}
}
}
ans = min(ans, tmp);
}
cout << ans << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define mp make_pair
#define pb push_back
ll n,a[100005],sum,cnt1,cnt2;
int main(){
cin>>n;
for(int i=1;i<=n;i++) cin>>a[i];
for(int i=1;i<=n;i++){
sum+=a[i];
if(i%2 && sum<=0){
cnt1+=1-sum;
sum=1;
}
if(i%2==0 && sum>=0){
cnt1+=sum+1;
sum=-1;
}
}
sum=0;
for(int i=1;i<=n;i++){
sum+=a[i];
if(i%2==0 && sum<=0){
cnt2+=1-sum;
sum=1;
}
if(i%2 && sum>=0){
cnt2+=sum+1;
sum=-1;
}
}
cout<<min(cnt1,cnt2);
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, n) REP(i, 0, n)
#define REP(i, l, r) for (int i = l; i < r; ++i)
#define int long long
using namespace std;
typedef pair<int, int> P;
signed main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) {
cin >> a[i];
if (i)
a[i] += a[i - 1];
}
int out = LLONG_MAX;
rep(i, 2) {
int cnt = 0, ans = 0;
rep(j, n) {
if (j % 2 == i) {
ans += max(1 - (a[j] + cnt), 0ll);
cnt += max(1 - (a[j] + cnt), 0ll);
} else {
ans += max((a[j] + cnt) + 1, 0ll);
cnt += min(-(a[j] + cnt) - 1, 0ll);
}
}
out = min(out, ans);
}
cout << out << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
vector<int64_t> a(n);
for(int i=0;i<n;++i){
cin>>a.at(i);
}
int64_t S1=0,S2=0,count1=0,count2=0;
//odd>0,even<0
for(int i=0;i<n;++i){
S1 += a.at(i);
if(i%2!=0 && S1<=0){
count1 += (1-S1);
S1=1;
}
else if(i%2==0 && S1>=0){
count1 += (1+S1);
S1=-1;
}
}
//odd<0,even>0
for(int i=0;i<n;++i){
S2 += a.at(i);
if(i%2!=0 && S2>=0){
count2 += (1+S2);
S2=-1;
}
else if(i%2==0 && S2<=0){
count2 += (1-S2);
S2=1;
}
}
cout<<min(count1,count2)<<endl;
}
|
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
int n;
ll c = 0, d = 0, pm = 0, mp = 0;
scanf("%d", &n);
for(int i = 0; i < n; i++) {
int a;
scanf("%d", &a);
pm += a;
mp += a;
if(pm * (i % 2 ? -1 : 1) <= 0) {
c += abs(pm) + 1;
pm = i % 2 ? -1 : 1;
}
if(mp * (i % 2 ? -1 : 1) >= 0) {
d += abs(mp) + 1;
mp = i % 2 ? 1 : -1;
}
}
printf("%lld\n", min(c, d));
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)n; i++)
using ll = long long;
int main(){
int n;
cin >> n;
ll a[n];
rep(i,n) cin >> a[i];
ll c = 0, d = 0, s = 0, t = 0;
rep(i,n) {
s += a[i]; t += a[i];
if(i % 2 == 0) {
if(s <= 0) {
c += 1 - s;
s = 1;
}
if(t >= 0) {
d += t + 1;
t = -1;
}
} else {
if(s >= 0) {
c += s + 1;
s = -1;
}
if(t <= 0) {
d += 1 - t;
t = 1;
}
}
}
cout << min(c,d) << endl;
return 0;
}
|
#include <iostream>
#include <vector>
using namespace std;
long long ope_cnt(vector<long long> a, int n, bool plus) {
long long sum = 0, ret = 0;
for (int i = 0; i < n; i++) {
sum += a[i];
if (plus && sum <= 0) {
ret += 1 - sum;
sum = 1;
}
else if (!plus && sum >= 0) {
ret += 1 + sum;
sum = -1;
}
plus = !plus;
}
return ret;
}
int main() {
int n;
cin >> n;
vector<long long> a(n);
for (int i = 0; i < n; i++) cin >> a[i];
long long ans_p = ope_cnt(a, n, true);
long long ans_m = ope_cnt(a, n, false);
cout << min(ans_p, ans_m) << endl;
}
|
// Sequence
#include <iostream>
#include <stdlib.h>
#include <algorithm>
using namespace std;
int n;
int a[100000];
long long c[2];
int main(){
cin>>n;
for(int i=0;i<n;i++)cin>>a[i];
for(int C=0;C<2;C++){
int sign=C*2-1;
int sum=0;
for(int i=0;i<n;i++){
if((sum+a[i])*sign<1){
c[C]+=abs(sum+a[i]-sign);
sum=sign;
}else sum+=a[i];
sign*=-1;
}
}
cout<<min(c[0],c[1]);
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
long re,ro,se,so;
re=ro=se=so=0;
cin>>n;
vector<int> a(n);
for(int i=0;i<n;i++)cin>>a[i];
for(int i=0;i<n;i++){
se+=a[i],so+=a[i];
if(i%2){
if(se<0 && so>0)continue;
else{
if(se>=0)re+=1+se,se-=1+se;
if(so<=0)ro+=1-so,so+=1-so;
}
}else{
if(se>0 && so<0)continue;
else{
if(se<=0)re+=1-se,se+=1-se;
if(so>=0)ro+=1+so,so-=1+so;
}
}
}
cout<<min(re,ro)<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) REP(i,0,n)
#define REP(i,a,n) for(int i = a ; i < (int)n ; i++)
typedef long long int ll;
int sign(int a){
return a/abs(a);
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
ll a[100001];
int n;
cin>>n;
rep(i,n) cin >> a[i];
ll sum=0;
ll c=1;
ll c1=0,c2=0;
//奇数番目を正とする
rep(i,n){
sum+=a[i];
if(sum*c<=0){
c1+=abs(sum)+1;
sum=c;
}
c*=-1;
}
//奇数番目を偶数とする
c=-1;
sum=0;
rep(i,n){
sum+=a[i];
if(sum*c<=0){
c2+=abs(sum)+1;
sum=c;
}
c*=-1;
}
cout<<min(c1,c2)<<endl;
//system("pause");
return 0;
}
|
#include <iostream>
#include <vector>
#include <set>
#include <utility>
#include <string>
#include <algorithm>
#include <cmath>
typedef long long ll;
using namespace std;
int a[100005];
int n;
ll calc(int mod)
{
ll sum = 0, res = 0;
for (int i = 1; i <= n; i++){
sum += a[i];
if (i % 2 == mod && sum <= 0){
res += (1 - sum);
sum = 1;
}
else if(i % 2 != mod && sum >= 0){
res += (sum + 1);
sum = -1;
}
}
return res;
}
int main()
{
cin >> n;
for (int i = 1; i <= n; i++){
cin >> a[i];
}
cout << min(calc(0), calc(1)) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
using ll = long long;
int n;
int a[100000];
ll solve(ll t){
ll res = 0, sum = 0;
for (ll i = 0; i < n; i++, t = -t){
sum += a[i];
if (sum * t > 0) continue;
res += abs(sum - t);
sum += t * abs(sum - t);
}
return res;
}
int main(){
cin >> n;
REP(i,n) cin >> a[i];
ll res = solve(1);
res = min(res, solve(-1));
cout << res << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin >> n;
vector<int64_t> a_vec(n);
for (int i = 0; i < n; ++i)
cin >> a_vec.at(i);
int64_t min_step;
for (int j = 0; j < 2; ++j) {
int sign = 2 * j - 1;
int64_t sum = 0;
int64_t step = 0;
for (int i = 0; i < n; ++i, sign *= -1) {
sum += a_vec.at(i);
if (sign * sum > 0)
continue;
step += - sign * sum + 1;
sum = sign;
}
if (j == 0 || min_step > step)
min_step = step;
}
cout << min_step << endl;
}
|
#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;cin>>n;ll p=0,m=0;
vector<int> a(n,0);
REP(i,n) cin>>a.at(i);
//プラスで始める場合
int sm=0;
REP(i,n){
sm+=a.at(i);
if(!(i%2)){
while(sm<=0){
p++;
sm++;
}
}else{
while(sm>=0){
p++;
sm--;
}
}
}
//マイナスで始める場合
sm=0;
REP(i,n){
sm+=a.at(i);
if(!(i%2)){
while(sm>=0){
m++;
sm--;
}
}else{
while(sm<=0){
m++;
sm++;
}
}
}
cout<<min(m,p)<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll cnt = 1e15;
int main(){
int n;
cin >> n;
int a[n];
for(int i=0;i<n;i++) cin >> a[i];
for(int j=0;j<2;j++){
ll cnt1 = 0,s = 0;
for(int i=0;i<n;i++){
s += a[i];
int k = (1-2*(i%2))*(1-2*j);
if(s*k<=0){
cnt1 += 1-k*s;
s = k;
}
}
cnt = min(cnt1,cnt);
}
cout << cnt << endl;
}
|
#include<iostream>
#include<vector>
using namespace std;
typedef long long li;
#define rep(i,n) for(int i=0;i<(n);i++)
#define df 0
template<class T> void print(const T& t){ cout << t << "\n"; }
template<class T, class... Ts> void print(const T& t, const Ts&... ts) { cout << t; if (sizeof...(ts)) cout << " "; print(ts...); }
int main(){
int n; cin >>n;
vector<li> s(2,0),c(2,0);
rep(i,n){
li a; cin >>a;
rep(j,2){
s[j]+=a;
if((i+j)%2){
if(s[j]>=0){
c[j]+=s[j]+1;
s[j]=-1;
}
}else{
if(s[j]<=0){
c[j]+=-s[j]+1;
s[j]=1;
}
}
}
}
print(min(c[0],c[1]));
}
|
#include <iostream>
#include <vector>
using namespace std;
int main() {
long long n;
cin >> n;
vector<long long> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
long long ans = 1e18;
for (int b = 0; b < 2; b++) {
long long s = 0, now = 0;
for (int i = 0; i < n; i++) {
long long c = i%2==b ? 1 : -1;
s += a[i];
if (s <= 0 && c == 1) {
now += c - s;
s = 1;
} else if (s >= 0 && c == -1) {
now += s - c;
s = -1;
}
}
ans = min(ans, now);
}
cout << ans << endl;
return 0;
}
|
#include <iostream>
#include <cmath>
using namespace std;
#define rep(i,n) REP(i,0,n)
#define REP(i,a,n) for(int i = a ; i < (int)n ; i++)
signed main(){
long long a[100001];
long long n;
cin >> n;
rep(i,n){
cin >> a[i];
}
long long c1 = 0, c2 = 0;
long long sum = 0;
long long c = 1;
// 奇数番目を正
REP(i,0,n){
sum += a[i];
if(sum * c <= 0){
c1 += (abs(sum)+1);
sum = c;
}
c*=(-1);
}
// 偶数番目が正
c = -1;
sum = 0;
REP(i,0,n){
sum += a[i];
if(sum * c <= 0){
c2 += abs(sum)+1;
sum = c;
}
c*=(-1);
}
cout << min(c1, c2) << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int N;
const int MAX_N = 1e5 + 10;
int A[MAX_N];
ll cnt(bool flg) {
ll sm = (ll)A[0], res = 0;
if(flg && sm <= 0) res += -sm + 1, sm = 1;
if(!flg && sm >= 0) res += sm + 1, sm = -1;
for(int i = 1; i < N; ++i) {
flg = sm > 0;
sm += (ll)A[i];
if(flg && sm >= 0) res += sm + 1, sm = -1;
if(!flg && sm <= 0) res += -sm + 1, sm = 1;
}
return res;
}
int main()
{
scanf("%d", &N);
for(int i = 0; i < N; ++i) scanf("%d", &A[i]);
ll res = min(cnt(true), cnt(false));
printf("%lld\n", res);
return 0;
}
|
#include <cstdio>
#include <algorithm>
#define maxn 100010
using namespace std;
int n;
long long a[maxn];
long long ans1,ans2;
long long sum;
int main() {
scanf("%d",&n);
for (int i=1;i<=n;i++) {
scanf("%lld",&a[i]);
}
sum=0LL; ans1=0LL;
for (int i=1;i<=n;i++) {
sum+=a[i];
if (i%2==1) {
if (sum<=0) {
ans1+=1-sum;
sum=1;
}
}
else if (sum>=0) {
ans1+=sum+1;
sum=-1;
}
}
sum=0LL; ans2=0LL;
for (int i=1;i<=n;i++) {
sum+=a[i];
if (i%2==0) {
if (sum<=0) {
ans2+=1-sum;
sum=1;
}
}
else if (sum>=0) {
ans2+=sum+1;
sum=-1;
}
}
printf("%lld\n",min(ans1,ans2));
return 0;
}
|
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
using ll = long long;
using vi = vector<int>;
#define rep(i,n) for(int i=0,_i=(n);i<_i;++i)
constexpr int sign(int n) { return n < 0 ? -1 : n > 0; }
int main() {
int N; cin >> N;
vi A(N);
rep(i, N)
cin >> A[i];
ll ans = 1e18;
rep(k, 2) {
ll sum = 0, tmp = 0;
int SIGN = k*2-1;
rep(i, N) {
SIGN *= -1;
if (sign(sum+A[i]) != SIGN) {
tmp += abs(SIGN - (sum + A[i]));
sum = SIGN;
} else
sum += A[i];
}
if (sum == 0)
++tmp;
ans = min(ans, tmp);
}
cout << ans << endl;
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;
int main(){
int N;
cin >> N;
vector<long> a(N);
for(int i=0; i<N; i++){
cin >> a.at(i);
}
long sump=0,sumn=0,p=0,n=0;
for(int i=0; i<N; i++){
sump+=a.at(i);
if(i%2==0&&sump<=0){
p+=1-sump;
sump=1;
}
if(i%2==1&&sump>=0){
p+=1+sump;
sump=-1;
}
}
for(int i=0; i<N; i++){
sumn+=a.at(i);
if(i%2==0&&sumn>=0){
n+=1+sumn;
sumn=-1;
}
if(i%2==1&&sumn<=0){
n+=1-sumn;
sumn=1;
}
}
cout << min(p,n) << 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))
ll counting(vector<ll> &A, int N, bool OddEven){//OddEven: odd true, even false
ll c = 0, csum = 0;
up(i,0,N,1){
csum += A[i];
if(i%2==OddEven && csum<=0){// -0 NG
c += abs(csum) + 1;
csum = 1;
}
if(i%2==!OddEven && csum>=0){// +0 NG
c += abs(csum) + 1;
csum = -1;
}
}
return c;
}
int main(){
int N; cin>>N;
vector<ll> A(N);
up(i,0,N,1) cin>>A[i];
ll a = counting(A,N,true);
ll b = counting(A,N,false);
cout<< (a<b?a:b) <<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define MAX 100000
int n;
long long a[MAX];
int main()
{
cin >> n;
for( int i = 0; i < n; i++ ) {
cin >> a[i];
}
long long esum = 0;
long long osum = 0;
long long eans = 0;
long long oans = 0;
for( int i = 0; i < n; i++ ) {
esum += a[i];
osum += a[i];
if( i % 2 ) {
if( osum <= 0 ) {
oans += 1 - osum;
osum = 1;
}
if( esum >= 0 ) {
eans += 1 + esum;
esum = -1;
}
}
else {
if( osum >= 0 ) {
oans += 1 + osum;
osum = -1;
}
if( esum <= 0 ) {
eans += 1 - esum;
esum = 1;
}
}
}
cout << min( eans, oans ) << endl;
return 0;
}
|
#include<iostream>
#include<algorithm>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0;i < n;++i)cin >> a[i];
long long sum = 0, ans[2] = {};
for (int j = 0;j < 2;++j) {
sum = 0;
for (int i = 0;i < n;++i) {
if (i % 2 == j) {//+
sum += a[i];
if (sum <= 0) {
ans[j] += 1 - sum;
sum = 1;
}
}
else {//-
sum += a[i];
if (sum >= 0) {
ans[j] += 1 + sum;
sum = -1;
}
}
}
}
cout << min(ans[0],ans[1]) << endl;
}
|
#include <iostream>
#include <algorithm>
using namespace std;
typedef long long ll;
int main(void) {
int n;
cin >> n;
ll sum1 = 0, sum2 = 0, ans1 = 0, ans2 = 0;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
sum1 += a;
sum2 += a;
if (i % 2 == 0) {
if (sum1 <= 0) {
ans1 += (1 - sum1);
sum1 = 1;
}
if (sum2 >= 0) {
ans2 += (sum2 + 1);
sum2 = -1;
}
} else {
if (sum2 <= 0) {
ans2 += (1 - sum2);
sum2 = 1;
}
if (sum1 >= 0) {
ans1 += (sum1 + 1);
sum1 = -1;
}
}
}
cout << min(ans1, ans2) << endl;
return 0;
}
|
#include <bits/stdc++.h>
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>
#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;
int N,a[100005];
int solve(){
int res=0,sum=0;
REP(i,N){
sum+=a[i];
if(i%2==0 and sum<=0){
res+=1-sum;
sum=1;
}
if(i%2==1 and sum>=0){
res+=sum+1;
sum=-1;
}
}
return res;
}
signed main()
{
cin>>N;
REP(i,N) cin>>a[i];
int ans=solve();
REP(i,N) a[i]*=-1;
ans=min(ans,solve());
cout<<ans<<endl;
}
|
#include <iostream>
#include <algorithm>
int n;
long long a[100005];
int main(){
std::cin>>n;
for(int i=0;i<n;++i)
std::cin>>a[i];
long long ans1=0;
long long sum=0;
for(int i=0;i<n;++i){
sum+=a[i];
if(i%2==0){
if(sum>=0){
ans1+=sum+1;
sum=-1;
}
}
else
if(sum<=0){
ans1+=1-sum;
sum=1;
}
}
long long ans2=0;
sum=0;
for(int i=0;i<n;++i){
sum+=a[i];
if(i%2==0){
if(sum<=0){
ans2+=1-sum;
sum=1;
}
}
else
if(sum>=0){
ans2+=sum+1;
sum=-1;
}
}
std::cout<<std::min(ans1,ans2)<<std::endl;
return 0;
}
|
#include <iostream>
#include <cmath>
#include <algorithm>
using namespace std;
int main() {
int n;
cin >> n;
long long int a[n];
long long int ans[2] = {0};
for (int i=0; i<n; ++i) cin >> a[i];
for (int i=0; i<2; ++i) {
int sign;
long long int suma = 0;
if (i==0) sign = 1;
else sign = -1;
for (int j=0; j<n; ++j) {
suma += a[j];
if (suma * sign <= 0) {
ans[i] += abs(suma - sign);
suma = sign;
}
sign *= -1;
}
}
cout << min(ans[0], ans[1]) << endl;
return 0;
}
|
//Sequence.cpp (C)
#include <iostream>
using namespace std;
long long ans(int n, int*, int change);
int main(){
int n;
int a[110000];
cin >> n;
for(int i = 0; i < n; i++) cin >> a[i];
long long pAns,nAns;
pAns = ans(n,a,1);
nAns = ans(n,a,-1);
printf("%lld\n",min(pAns,nAns));
}
long long ans(int n, int *a, int change){
long long Ans = 0;
long long sum = 0;
for(int i = 0; i < n; i++){
sum += a[i];
switch (change) {
case -1:
if(sum > -1) Ans += 1 + sum, sum = -1;
change *= -1;
break;
case 1:
if(sum < 1) Ans += 1 - sum, sum = 1;
change *= -1;
break;
}
}
return Ans;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll N;
vector<ll> a;
ll calc(bool sig){
ll ans = 0LL;
ll sum = 0LL;
for(ll i = 0; i < N; i++){
if(sig ^ (i%2)){
if(sum + a[i] <= 0){
ans += 1 - (sum + a[i]); sum = 1;
}else{
sum += a[i];
}
}else{
if(sum + a[i] >= 0){
ans += 1 + (sum + a[i]); sum = -1;
}else{
sum += a[i];
}
}
}
return ans;
}
int main(){
cin >> N;
a.resize(N);
for(ll i = 0; i < N; i++){
cin >> a[i];
}
cout << min(calc(1), calc(0));
}
|
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
signed main() {
ios::sync_with_stdio(false); cin.tie(0);
int n;
cin >> n;
long long ans[2] = {};
long long sum[2] = {};
for (int i = 0; i < n; i++) {
int x;
cin >> x;
for (int j = 0; j < 2; j++) {
sum[j] += x;
if (j % 2 == i % 2) {
if (sum[j] <= 0) {
ans[j] += 1 + abs(sum[j]);
sum[j] = 1;
}
} else {
if (sum[j] >= 0) {
ans[j] += 1 + abs(sum[j]);
sum[j] = -1;
}
}
}
}
cout << min(ans[0], ans[1]) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int64_t A=0,B=0;
cin>>N;
vector<int> p(N);
for(int i=0;i<N;i++){
cin>>p.at(i);
}
int Z=0;
for(int i=0;i<N;i++){
Z+=p.at(i);
if(i%2==0){
if(Z>=0){
A+=1+Z;
Z=-1;
}
}
else{
if(Z<=0){
A+=1-Z;
Z=1;
}
}
}
Z=0;
for(int i=0;i<N;i++){
Z+=p.at(i);
if(i%2==1){
if(Z>=0){
B+=1+Z;
Z=-1;
}
}
else{
if(Z<=0){
B+=1-Z;
Z=1;
}
}
}
cout<<min(A,B)<<endl;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int main(){
int n;
cin>>n;
ll a[100005];
rep(i,n) cin>>a[i];
ll sum=0;
ll a1=0,a2=0;
rep(i,n){
sum+=a[i];
if(i&1){
if(sum>=0){
a1+=sum+1;
sum=-1;
}
}
else{
if(sum<=0){
a1+=1-sum;
sum=1;
}
}
}
sum=0;
rep(i,n){
sum+=a[i];
if(!(i&1)){
if(sum>=0){
a2+=sum+1;
sum=-1;
}
}
else{
if(sum<=0){
a2+=1-sum;
sum=1;
}
}
}
cout<<min(a1,a2)<<endl;
return 0;
}
|
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int main(){
int n;
cin>>n;
ll ans=0,vec[n];
for(int i=0;i<n;i++){
cin>>vec[i];
}
ll sum=0,sumb=0;
for(int i=0;i<n;i++){
sum+=vec[i];
if(i%2==0){
if(sum<1){
sumb+=1-sum;
sum=1;
}
}
if(i%2==1){
if(sum>-1){
sumb+=sum+1;
sum=-1;
}
}
}
ans=sumb;
sumb=0;
sum=0;
for(int i=0;i<n;i++){
sum+=vec[i];
if(i%2==0){
if(sum>-1){
sumb+=sum+1;
sum=-1;
}
}
if(i%2==1){
if(sum<1){
sumb+=1-sum;
sum=1;
}
}
}
cout<<min(ans,sumb)<<endl;
}
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin >> n;
vector<int> a;
for (int i = 0; i < n; i++) {
int t;
cin >> t;
a.push_back(t);
}
long long s1 = 0, s2 = 0, c1 = 0, c2 = 0;
for (int i = 0; i < n; i++) {
s1 += a[i];
s2 += a[i];
if (i % 2 == 0 && s1 <= 0) {
c1 += abs(1 - s1);
s1 = 1;
}
else if (i % 2 == 1 && s1 >= 0) {
c1 += abs(-1 - s1);
s1 = -1;
}
if(i % 2 == 0 && s2 >= 0){
c2 += abs(-1 - s2);
s2 = -1;
}
else if (i % 2 == 1 && s2 <= 0) {
c2 += abs(1 - s2);
s2 = 1;
}
}
cout << min(c1, c2) << endl;
return 0;
}
|
#include <iostream>
#include <string.h>
#include <algorithm>
#include <vector>
#include <queue>
using namespace std;
typedef long long ll;
const ll INF=100000000000000LL;
ll a[100001];
ll r[2]={};
int main() {
int n;
cin>>n;
ll t1=0;
ll t2=0;
ll s1=0;
ll s2=0;
ll a1;
for(int i=0;i<n;++i){
cin>>a1;
t1+=a1;
t2+=a1;
if(i%2==0){
if(t1<=0){
s1+=-t1+1;
t1=1;
}
if(t2>=0){
s2+=t2+1;
t2=-1;
}
}else{
if(t1>=0){
s1+=t1+1;
t1=-1;
}
if(t2<=0){
s2+=-t2+1;
t2=1;
}
}
}
cout<<min(s1,s2)<<endl;
return 0;
}
|
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
using ll = long long;
using namespace std;
ll n;
vector<ll> a;
ll solve(int x);
int main(){
cin >> n;
for(ll i=0;i<n;i++){
int x;
cin >> x;
a.push_back(x);
}
cout << min(solve(0),solve(1)) << endl;
return 0;
}
ll solve(int x){
ll ans = 0; ll now = 0;
for(ll i=0;i<n;i++){
now += a[i];
if((i%2^x)&&(now>=0)){
ans += now + 1;
now = -1;
}
if(!(i%2^x)&&(now<=0)){
ans -= now - 1;
now = 1;
}
}
return ans;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; ++i) cin >> a[i];
ll cnt = 0;
ll sum = 0;
for (int i = 0; i < N; ++i) {
ll t = sum + a[i];
if (i % 2 == 0 && t <= 0) cnt += 1 - t, t = 1;
if (i % 2 == 1 && t >= 0) cnt += t + 1, t = -1;
sum = t;
}
ll ans = cnt;
cnt = sum = 0;
for (int i = 0; i < N; ++i) {
ll t = sum + a[i];
if (i % 2 == 1 && t <= 0) cnt += 1 - t, t = 1;
if (i % 2 == 0 && t >= 0) cnt += t + 1, t = -1;
sum = t;
}
ans = min(ans, cnt);
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n; cin>>n;
vector<ll> a(n);
for (int i=0; i<n; i++) cin>>a[i];
vector<ll> ret(2);
for (int c=0; c<2; ++c){
int sgn=c?1:-1;
for (ll s=0, t=0; t<n; t++, sgn*=-1) {
s+=a[t];
if(sgn*s<=0) ret[c]+=abs(s)+1, s=sgn;
}
}
cout<<min(ret[0],ret[1])<<"\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) cin >> a[i];
long long c1 = 0, c2 = 0, s1 = 0, s2 = 0;
for (int i = 0; i < n; i++) {
s1 += a[i];
s2 += a[i];
if (i & 1) {
if (s1 >= 0) {c1 += s1 + 1; s1 = -1;}
if (s2 <= 0) {c2 += 1 - s2; s2 = 1;}
} else {
if (s1 <= 0) {c1 += 1 - s1; s1 = 1;}
if (s2 >= 0) {c2 += s2 + 1; s2 = -1;}
}
}
cout << min(c1, c2) << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long n,ansa=0,ansb=0,x=0,y=0;
cin >> n;
vector<long> a(n),wa(n);
for(long i=0;i<n;i++) cin >> a[i];
wa[0]=a[0];
for(long i=1;i<n;i++) wa[i]=wa[i-1]+a[i];
for(long i=0;i<n;i++) {
if(i%2==0) {
if(wa[i]+x<=0) {
ansa+=1-wa[i]-x;
x+=1-wa[i]-x;
}
if(wa[i]+y>=0) {
ansb+=1+wa[i]+y;
y+=-1-wa[i]-y;
}
} else {
if(wa[i]+x>=0) {
ansa+=1+wa[i]+x;
x+=-1-wa[i]-x;
}
if(wa[i]+y<=0) {
ansb+=1-wa[i]-y;
y+=1-wa[i]-y;
}
}
}
cout << min(ansa,ansb) << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
vector<int> v(n);
for(auto &i:v) cin>>i;
long long ansq=1e17;
for(int x=0;x<2;x++)
{
int h=x;
long long int sum=0,ans=0;
for(int i=0;i<n;i++)
{
sum+=v[i];
if(h)
{
if(sum<=0)
{ ans+= abs(1-sum); sum=1;}
}
else
{
if(sum>=0)
{
ans+=abs(sum+1);
sum=-1;
}
}
h = h^1;
}
ansq=min(ansq,ans);
}
cout<<ansq<<"\n";
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
ll s1, s2, c1, c2;
int main() {
ll n;
cin>>n;
rep(i,n){
int a;
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 <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin >> n;
vector<long long> a(n);
for (auto&& ai : a) cin >> ai;
long long r1 = 0, r2 = 0;
long long sum = 0;
for (int i = 0; i < n; i++)
{
sum += a[i];
if (i%2 == 0 && sum <= 0)
{
r1 += 1 - sum;
sum = 1;
}
else if (i%2 == 1 && sum >= 0)
{
r1 += sum + 1;
sum = -1;
}
}
sum = 0;
for (int i = 0; i < n; i++)
{
sum += a[i];
if (i%2 == 0 && sum >= 0)
{
r2 += sum + 1;
sum = -1;
}
else if (i%2 == 1 && sum <= 0)
{
r2 += 1 - sum;
sum = 1;
}
}
cout << min(r1, r2) << endl;
return 0;
}
|
// C - Sequence
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int N;
vector<ll> A(100000);
ll counter(int sign){//sign: (+)start -> 1, (-)start -> -1
ll c = 0;
for(ll s=0, i=0; i<N; ++i, sign*=-1){
s += A[i];
if(sign*s<=0){ c += abs(s) + 1; s = sign; }
}
return c;
}
int main(){
cin>>N;
for(int i=0; i<N; ++i) cin>>A[i];
ll a = counter(1), b = counter(-1);
cout<< (a<b?a:b) <<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll n;
cin>>n;
ll a[n];
for(int i=0;i<n;i++)
cin>>a[i];
ll c1=0,c2=0,sum=0;
for(int i=0;i<n;i++){
if(i%2==0){
sum=sum+a[i];
if(sum<0)
continue;
c1+=abs(-1-sum);
sum=-1;
}
else{
sum=sum+a[i];
if(sum>0)
continue;
c1+=abs(1-sum);
sum=1;
}
}
sum=0;
for(int i=0;i<n;i++){
if(i%2==1){
sum=sum+a[i];
if(sum<0)
continue;
c2+=abs(-1-sum);
sum=-1;
}
else{
sum=sum+a[i];
if(sum>0)
continue;
c2+=abs(1-sum);
sum=1;
}
}
cout<<min(c1,c2)<<endl;
return 0;
}
|
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
int N;
cin>>N;
vector<long long> a(N);
for(int i=0;i<N;i++) cin>>a[i];
int initial_sign[2]={-1,1};
vector<long long> res(2);
for(int i=0;i<2;i++){
long long cumsum=0;
long long current_sign=initial_sign[i];
for(int j=0;j<N;j++){
cumsum+=a[j];
if(cumsum*current_sign<=0){
res[i]+=abs(cumsum-current_sign);
cumsum=current_sign;
}
current_sign=-1*current_sign;
}
}
cout << min(res[0],res[1]);
return 0;
}
|
#include<iostream>
#include<vector>
using namespace std;
int main(){
int n;
cin >> n;
vector<long long> a(n+1,0);
for(int i=1;i<=n;i++){
cin >> a[i];
a[i]+=a[i-1];
}
long long ans=1LL<<50;
for(int k=-1;k<=1;k+=2){
int sign=k;
long long plus=0,minus=0;
for(int i=1;i<=n;i++){
if(a[i]+plus-minus>0){
if(sign==-1) minus+=a[i]+plus-minus+1;
}else if(a[i]+plus-minus<0){
if(sign==1) plus+=-(a[i]+plus-minus)+1;
}else{
if(sign==-1) minus+=1;
else if(sign==1) plus+=1;
}
sign*=-1;
}
if(ans>plus+minus) ans=plus+minus;
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n; cin >> n;
vector<ll> a(n);
for (int i = 0; i < n; i++) cin >> a[i];
ll ans1 = 0, ans2 = 0;
ll S = 0;
for (int i = 0; i < n; i++) {
S += a[i];
if (i % 2 == 0 && S <= 0) {
ans1 += 1 - S;
S = 1ll;
}
else if (i % 2 == 1 && S >= 0) {
ans1 += S + 1;
S = -1ll;
}
}
S = 0;
for (int i = 0; i < n; i++) {
S += a[i];
if (i % 2 == 1 && S <= 0) {
ans2 += 1 - S;
S = 1ll;
}
else if (i % 2 == 0 && S >= 0) {
ans2 += S + 1;
S = -1ll;
}
}
cout << min(ans1, ans2) << endl;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.