Codeforces 888F - Connecting Vertices

 

Problem Link:

 

http://codeforces.com/problemset/problem/888/F

 

---

 

Problem Statement:

 

F. Connecting Vertices

 

time limit per test: 4 seconds

memory limit per test: 256 megabytes

input: standard input

output: standard output

 

There are n points marked on the plane. The points are situated in such a way that they form a regular polygon (marked points are its vertices, and they are numbered in counter-clockwise order). You can draw n - 1 segments, each connecting any two marked points, in such a way that all points have to be connected with each other (directly or indirectly).

But there are some restrictions. Firstly, some pairs of points cannot be connected directly and have to be connected undirectly. Secondly, the segments you draw must not intersect in any point apart from the marked points (that is, if any two segments intersect and their intersection is not a marked point, then the picture you have drawn is invalid).

How many ways are there to connect all vertices with n - 1 segments? Two ways are considered different iff there exist some pair of points such that a segment is drawn between them in the first way of connection, but it is not drawn between these points in the second one. Since the answer might be large, output it modulo 10⁹ + 7.

 

Input

The first line contains one number n (3 ≤ n ≤ 500) — the number of marked points.

Then n lines follow, each containing n elements. a_i, j (j-th element of line i) is equal to 1 iff you can connect points i and j directly (otherwise a_i, j= 0). It is guaranteed that for any pair of points a_i, j = a_j, i, and for any point a_i, i = 0.

 

Output

Print the number of ways to connect points modulo 10⁹ + 7.

 

---

 

Analysis:

 

The difficulty here is how to avoid double counting and how to store dp values.

The first observation we could made is that if we connect vertex i and j directly, the rest vertices are split into two parts, and vertices in each part can only connect to vertices in their own parts. This fact reminds us of the classical way of dynamic programming, i.e., the number of ways to connect vertices on a large interval is based on the number of ways to connect vertices on smaller intervals.

Next, how can we avoid duplicate counting? We need to see some characteristics of the way of connecting the vertices on some interval. If we are to connect the vertices on the interval from l to r, i.e., connecting vertex l, l+1, …, r-1, and r, vertex l must directly connect to one or more of the vertices in the interval from l+1 to r, since the all vertices must be connected. We can split the situation into different cases, each case in which the last vertex in the interval vertex l connects to is different. Notice that if the last vertex vertex l connects to is vertex m in the interval, it does not follow that vertex l will not connect to any vertices other than vertex m, but what it really means is that all the other vertices that vertex l can connect to must come before vertex m in this interval. Then we can make the following claim: counting the ways of connecting vertices in the interval from different cases won’t count any distinct way of connecting the vertices more than once, and this is clear, as we have made the first observation. To handle the cases, we just need to calculate the ways of connecting vertices between vertex l and vertex m to vertex l or vertex m and the ways of connecting vertices between vertex m (inclusive) and vertex r (inclusive). The special case here is the case where we connect vertex l and vertex r directly, and we can handle this case by splitting the interval differently by iterating on the split point, and then connect the left part of the interval to vertex l and the right part of the interval to vertex r.

 

---

 

The DP Equations:

 

If we store the total number of ways of connecting vertices in interval from vertex l to vertex r in dp1[l][r], and the ways when vertex l and vertex r are directly connected in dp2[l][r], we can write the following equations:

dp2[l][r] = if(l and r can be connected) sum(dp1[l][m] * dp1[m+1][r]);

dp1[l][r] = sum(dp2[l][m] * dp1[m][r]);

 

---

 

Time Complexity:

 

O(n³)

 

---

 

AC Code:

 

#include <iostream>
#include <sstream>
#include <fstream>
#include <string>
#include <vector>
#include <deque>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <algorithm>
#include <functional>
#include <utility>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <cstdio>
#include <memory.h>
#include <iomanip>
#include <unordered_set>
#include <unordered_map>
using namespace std;

typedef long long ll;

const ll md=1e9+7;

int n;
int a[505][505];
ll dp1[505][505]; //stands for total ways
ll dp2[505][505]; //stands for ways to directly connect

int main(){
    scanf("%d",&n);
    for(int i=0;i<n;i++){
        for(int j=0;j<n;j++){
            scanf("%d",&a[i][j]);
        }
    }
    for(int i=0;i<n;i++){
        dp1[i][i]=dp2[i][i]=1;
    }
    for(int i=1;i<n;i++){
        for(int x=0,y=i;x<n;x++,y=(y+1)%n){
            if(a[x][y]){
                for(int k=x;k!=y;k=(k+1)%n){
                    dp2[x][y]+=dp1[x][k]*dp1[(k+1)%n][y];
                    dp2[x][y]%=md;
                }
            }
            for(int k=x;k!=y;k=(k+1)%n){
                dp1[x][y]+=dp2[x][(k+1)%n]*dp1[(k+1)%n][y];
                dp1[x][y]%=md;
            }
        } 
    }
    printf("%I64d\n",dp1[0][n-1]);
}