【CodeForces 1255E1 --- Send Boxes to Alice [Easy Version]】

Description

This is the easier version of the problem. In this version, 1≤n≤105 and 0≤ai≤1. You can hack this problem only if you solve and lock both problems.

Christmas is coming, and our protagonist, Bob, is preparing a spectacular present for his long-time best friend Alice. This year, he decides to prepare n boxes of chocolate, numbered from 1 to n. Initially, the i-th box contains ai chocolate pieces.

Since Bob is a typical nice guy, he will not send Alice n empty boxes. In other words, at least one of a1,a2,…,an is positive. Since Alice dislikes coprime sets, she will be happy only if there exists some integer k>1 such that the number of pieces in each box is divisible by k. Note that Alice won’t mind if there exists some empty boxes.

Charlie, Alice’s boyfriend, also is Bob’s second best friend, so he decides to help Bob by rearranging the chocolate pieces. In one second, Charlie can pick up a piece in box i and put it into either box i−1 or box i+1 (if such boxes exist). Of course, he wants to help his friend as quickly as possible. Therefore, he asks you to calculate the minimum number of seconds he would need to make Alice happy.

Input

The first line contains a single integer n (1≤n≤105) — the number of chocolate boxes.

The second line contains n integers a1,a2,…,an (0≤ai≤1) — the number of chocolate pieces in the i-th box.

It is guaranteed that at least one of a1,a2,…,an is positive.

Output

If there is no way for Charlie to make Alice happy, print −1.

Otherwise, print a single integer x — the minimum number of seconds for Charlie to help Bob make Alice happy.

Sample Input

3
1 0 1

Sample Output

AC代码：

#include <bits/stdc++.h>
using namespace std;
#define SIS std::ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define endl '\n'
using ll = long long;
const int MAXN = 1e6+5;
const ll INF = (1LL<<60);
int arr[MAXN],b[MAXN];
vector<int> v;
ll fun(int x)
{int mid=x>>1,len=v.size();ll sum=0;for(int i=0;i<len;i+=x)for(int j=0;j<x;j++) sum+=abs(v[i+j]-v[i+mid]);return sum;
}int main()
{SIS;ll n,sum=0,x,ans=INF;cin >> n;for(int i=0;i<n;i++){cin >> arr[i];sum+=arr[i];if(arr[i]) v.emplace_back(i);}if(sum<2){cout << -1 << endl;return 0;}for(int i=2;i<=sum;i++)if(sum%i==0) ans=min(ans,fun(i));cout << ans << endl;return 0;
}

【CodeForces 1255E1 --- Send Boxes to Alice [Easy Version]】相关推荐

Codeforces Round #601 (Div. 2) E2. Send Boxes to Alice (Hard Version) 思维 + 质因子
传送门文章目录题意: 思路: 题意: 大体题意跟easyeasyeasy版本差不多,就是hardhardhard版本的aaa范围更大.见这里Codeforces Round #601 (Div. ...
CodeForces - 1543D1 RPD and Rap Sheet (Easy Version)(异或+交互)
题目链接:点击查看题目大意:交互题猜密码,设原密码为 xxx,猜的密码为 yyy,如果没猜到,密码会自适应变成 zzz,满足 x⊕z=yx \oplus z=yx⊕z=y ,最多猜 nnn 次题目 ...
【Codeforces Round #514 (Div. 2) D. Nature Reserve】三分+推公式
题目链接 Codeforces Round #514 (Div. 2) D. Nature Reserve 题意给你一些二维平面上的点,找一个与x轴相切的半径最小的圆包含所有点. 做法首先如果两边 ...
【Codeforces 851D Arpa and a list of numbers】
Arpa的数列要根据GCD变成好数列. ·英文题,述大意: 给出一个长度为n(n<=5000000)的序列,其中的元素a[i]<=106,然后输入两个数x,y(x,y<= ...
【codeforces round#800 D题 Fake Plastic Trees】树上贪心
题目链接题意: 给你一棵树,树上有n个节点,树的根节点是1,一开始树上的每个节点的权值都是0,现在有一种操作,选择一个节点,使得根节点到这个节点的路径上的所有节点的权值都增加,增加的幅度从根节点到这 ...
【codeforces Round#801 Div2 D题 Tree Queries】树形贪心结论
题目链接题意: 给你一棵树,你需要执行多次询问来确定一个节点x的位置,对于每一次询问,你需要选择一个节点,能得到这个节点与x节点的距离是多少,问至少需要多少次询问才能确定x的位置. 分析: 有一个结 ...
【Codeforces Round #523 (Div. 2) D.TV Shows】贪心+二分
D. TV Shows 题意给你要看的n个电视节目的 l i 和 r i l_i和r_i li和ri,每次要申请一个新的电视的花费是 x + ( r i − l i ) ∗ y x+(r_i-l ...
C1. Make Nonzero Sum (easy version)【Codeforces Round #829 (Div. 2】
Codeforces Round #829 (Div. 2)中C1题目 Codeforces比赛记录文章目录题目链接: 一.C1. Make Nonzero Sum (easy version) ...
【Codeforces】Codeforces之丰【部分题解】
Codeforces之丰 [by_041] 文章目录 Codeforces之丰 [by_041] @[toc] Codeforces Round #721 (Div. 2) A. And Then T ...

【CodeForces 1255E1 --- Send Boxes to Alice [Easy Version]】

【CodeForces 1255E1 --- Send Boxes to Alice [Easy Version]】

【CodeForces 1255E1 --- Send Boxes to Alice [Easy Version]】相关推荐

最新文章

热门文章