Codeforces Round #851 (Div. 2) D. Moving Dots

Codeforces Round #851 (Div. 2) D. Moving Dots

Let’s think about the original problem where we do not think about subsets.

We can easily observe that each dot does not change direction during moving.

Assume that dots gather at coordinate $x$. Rightmost dot of dots that have smaller coordinate than $x$ should move right, and leftmost dot which has bigger coordinate than $x$ should move left. We can observe that the number of adjacent dot where each move toward each other will be the answer.

Now let’s solve the problem for subsets. Instead of counting number of adjacent dot that moves toward each other for each subset of dots, we will count the number of subset for each possible $1\le i<j\le N$ where dot $i$ moves right and dot $j$ moves left and there are no dots between $i$ and $j$.

Let the coordinate of a dot in a subset be $k$. We will try to find out which $k$ can be in a subset where dot $i$ and dot $j$ move toward each other.

Since there are no dot between $i$ and $j$, dots satistying $x_i<k<x_j$; should not be in the subset.Since dot $i$ should move right, dotsthat satisfy $k<x_i$ and $x_k\le x_j-x_i$; should not be in the subset.As the same way for dot $j$, dots that satisfy $k>x_j$; and $k-x_j<x_j-x_i$; should not be in the subset. Summing these up, dots satisfying $2x_i--x_{j}k\le 2x_j--x_j$; should not bein the subset.By using binary search, we can find the number of dots that cannot be in the subset in $O(logN)$.

lf there are p dots that can be in the subset, the number of subset where $i$ and $j$ moves toward each other will be $2^P$ .summing all $2^P$ will give us the answer. Since there are $O(N^2)$ pairs of $(i,j)$, we can solve the problem in $O(N^{2}logN)$.

There were some dynamic programming solutions from some testers.

#include<bits/stdc++.h>
using namespace std;

typedef long long LL;
const int MOD = 1000000000 + 7;

int main()
{
	int n;cin>>n;
	vector<int> a(n+1);
    for(int i=1;i<=n;i++) cin>>a[i];
    vector<LL> fac(n+1);
    fac[0]=1;
    for(int i=1;i<=n;i++)
        fac[i]=fac[i-1]*2%MOD;
    LL ans=0;
    for(int i=1;i<=n;i++)
        for(int j=i+1;j<=n;j++)
        {
            int d=a[j]-a[i];
            int pos1=lower_bound(a.begin()+1,a.begin()+i,a[i]-d)-a.begin()-1;
            int pos2=a.begin()+n-lower_bound(a.begin()+j,a.end(),a[j]+d)+1;
            ans+=fac[pos1]*fac[pos2];
            ans%=MOD;
        }
    cout<<ans<<endl;
    return 0;
}