topcoder SRM495 div1 level2
2012-05-28 13:54
691 查看
Problem Statement | ||||||||||||
There are N boxes numbered 0 through N-1. Every box except for one contains carrots, but Rabbit Hanako does not know which box is the empty one. Each box has the same probability of being empty. Hanako wants to find the empty box without opening it. Fortunately, she has some clues. Some of the boxes contain information about the content of other boxes, and she knows which boxes contain such information. You are given a String[] information, where the j-th character of the i-th element is 'Y' if opening the i-th box will reveal whether or not the j-th box contains carrots, or 'N' if the i-th box contains no such information. Return the probability that she can find the empty box without opening it, assuming she behaves optimally. | ||||||||||||
Definition | ||||||||||||
| ||||||||||||
Constraints | ||||||||||||
- | information will contain between 1 and 50 elements, inclusive. | |||||||||||
- | Each element of information will contain exactly N characters, where N is the number of elements of information. | |||||||||||
- | The i-th character of the i-th element of information will be 'Y'. | |||||||||||
- | Each character in information will be 'Y' or 'N'. | |||||||||||
Examples | ||||||||||||
0) | ||||||||||||
| ||||||||||||
1) | ||||||||||||
| ||||||||||||
2) | ||||||||||||
| ||||||||||||
3) | ||||||||||||
| ||||||||||||
4) | ||||||||||||
| ||||||||||||
5) | ||||||||||||
|
显然,我们可以用一个图来描述问题。G(V,E) V是N个点的集合,而E则是关系。
其实这是一个类似覆盖的问题。由于是有向图,所以要缩点
必然是要选入度为0的点,所以算法由此而生。
但要注意一点:存在一种情况,可以不打开最后一个箱子,因为那时已经可以得出那个箱子是空的。
【代码】
public class CarrotBoxes { public double theProbability(String[] information) { int n = information.length; // Floyd-Warshall to get an array connected[i][j] // connected[i][j] is true if there is a directed path // between i and j. boolean[][] connected = new boolean ; for (int i=0; i<n; i++) { for (int j=0; j<n; j++) { connected[i][j] = (information[i].charAt(j)=='Y'); } } for (int k=0; k<n; k++) { for (int i=0; i<n; i++) { for (int j=0; j<n; j++) { connected[i][j] = connected[i][j] || (connected[i][k] && connected[k][j] ); } } } // Find the top-most components int[] top = new int ; int tn = 0; boolean[] tried = new boolean ; for (int i=0; i<n; i++) { if(! tried[i]) { //mark all the boxes in the same component as tried for (int j=0; j<n; j++) { if ( connected[i][j] && connected[j][i] ) { tried[j] = true; } } // count the number of in-going connections to the // box. int c = 0; for (int j=0; j<n; j++) { // interested only in connections from other components if ( connected[j][i] && ! connected[i][j] ) { c ++; } } if ( c== 0) { // It is a "top-most" component, add to our array top[tn++] = i; } } } // Try to pick which box to open last. for (int lastid = 0; lastid < tn; lastid++) { int last = top[lastid]; boolean[] opened = new boolean ; // Assume we open a box from each of the // other top components, then mark all the // boxes reachable from those components // as "opened" for (int j=0; j<tn; j++) { if ( j != lastid ) { for (int k=0; k<n; k++) { if (connected[ top[j] ][k]) { opened[k] = true; } } } } // If only one box is left open, then we can use // this improvement. boolean ok = true; for (int j=0; j<n; j++) { if ( (j!=last) && ! opened[j] ) { ok = false; } } if ( ok ) { return ( (n-(tn-1) ) / (double)(n)); } } // Since there is no improvement with last method, // we will have to open one box per each of the tn top components: return ( (n-tn) / (double)(n)); } }
相关文章推荐
- topcoder SRM500 DIV1 level2 500分
- SRM575 div1 level2
- 去掉GridView中自带的div
- div 的边框显示不同效果
- Codeforces Round #228 div1前三题
- Codeforces Round #263 (Div. 1)
- 当获取div的宽度为“100%”想获取其具体的像素值px怎么办
- jQuery-div点击展示详细内容
- 设置div中的div居中显示
- Codeforces Round #394 (Div. 2) B. Dasha and friends(暴力)
- div滚动条时div内容显示一半
- DIV-CSS相关资料连接收集
- 一个DIV调用多个CSS样式
- SRM 607 D1 L1:PalindromicSubstringsDiv1,DP
- Codeforces Round #276 (Div. 2)
- Codeforces Round #299 (Div. 2) Tavas and Karafs(二分)
- Codeforces Round #303 (Div. 2)-C. Woodcutters(模拟)
- Codeforces Round #295 (Div. 2)-C. DNA Alignment
- Codeforces Round #301 (Div. 2)(A,【模拟】B,【贪心构造】C,【DFS】)
- HTML div动画