Sicily 2610/1897. Chutter and Ladder
来源:互联网 发布:中南大学怎么样 知乎 编辑:程序博客网 时间:2024/06/15 01:56
2610. Chutter and Ladder
Constraints
Time Limit: 1 secs, Memory Limit: 256 MB
Description
Here is a simpler version of the interesting game “Chutter and Ladder”:
Given a sequence of small grids, numbered from 0 to n-1. As the player of this game, your starting position is grid 0, and your destination is grid n-1. Each time you can drop a dice and move 1-6 steps forward according to the number on top of the dice. As the dice is perfect, each number from 1 to 6 can evenly show on top of the dice.
However, each grid i is marked with an integer a[i], that means if you move into that grid, then you will immediately jump |a[i]| grids more (if a[i] > 0, the direction is forward, otherwise it’s backward). For example, suppose grid 5 is marked with integer 3, -3 respectively, then when you come to grid 5, you will immediately move to grid 8 or 2 correspondingly. Of course, if a[i] is 0, then you will stay at grid i. It’s guaranteed that you will always jump into a grid marked with 0.
What’s worse, the sequence is cyclic, that means when you are moving to a grid k which is out of the range of 0 and n-1, you will actually move to grid k%n.
Now, given the configuration of the grids, please write a program to calculate the expected number of moves to reach grid n-1.
Input
Input may contain several test cases. The first lines is a positive integer, T, (1<=T<=20), the number of test cases below. Each test cases starts with a positive integer n, (1<=n<=100), the number of grids in the game, followed by n integers a[i] (-n<=a[i]<=n, 1<=i<=n). It’s guaranteed that grid 0 and grid n-1 is always marked with 0.
Output
For each test case, please output the expected number of moves to reach grid n-1, round to 3 digits after the decimal point. If it’s impossible to reach grid n-1, simply output “-1”.
Sample Input
230 0 080 -1 -2 -3 -4 -5 -6 0
Sample Output
3.000-1
Problem Source
系列热身赛2@2011年上半学期算法考试和4+2选拔赛
// Problem#: 2610// Submission#: 3593228// The source code is licensed under Creative Commons Attribution-NonCommercial-ShareAlike 3.0 Unported License// URI: http://creativecommons.org/licenses/by-nc-sa/3.0/// All Copyright reserved by Informatic Lab of Sun Yat-sen University#include <stdio.h>#include <string.h>#include <math.h>const int MAXN = 101;const double EPS = 1e-9;int n, jump[MAXN];double a[MAXN][MAXN], b[MAXN], x[MAXN];int GaussEimination() { int i, j, k, p, q[MAXN]; double max, l; memset(q, 0, sizeof(q)); for (k = 1; k <= n; k++) { p = 0; max = 0; for (i = 1; i <= n; i++) if (!q[i] && max + EPS < fabs(a[i][k])) max = fabs(a[p = i][k]); if (!p) return 0; else q[p] = 1; for (i = 1; i <= n; i++) if (i != p) { l = a[i][k] / a[p][k]; for (j = 1; j <= n; j++) a[i][j] -= l * a[p][j]; b[i] -= l * b[p]; } } for (i = 1; i <= n; i++) for (j = 1; j <= n; j++) if (fabs(a[i][j]) > EPS) x[j] = b[i] / a[i][j]; return 1;}void modeling() { int i, j; memset(a, 0, sizeof(a)); memset(b, 0, sizeof(b)); memset(x, 0, sizeof(x)); for (i = 0; i < n - 1; i++) { for (j = 1; j <= 6; j++) { int k = (i + j) % n; k = ((k + jump[k]) % n + n) % n; a[i + 1][k + 1] += -1.0 / 6; } a[i + 1][i + 1] += 1.0; b[i + 1] = 1.0; } a[n][n] = 1.0;}int main() { int tn, i; scanf("%d", &tn); while (tn--) { scanf("%d", &n); for (i = 0; i < n; i++) scanf("%d", jump + i); modeling(); if (!GaussEimination()) printf("-1\n"); else printf("%.3lf\n", x[1]); } return 0;}
0 0
- Sicily 2610/1897. Chutter and Ladder
- [PLC] Ladder Logic for PIC and AVR
- Sicily 1798. Alice and Bob
- sicily 1491 Look and Say
- sicily--1798. Alice and Bob
- sicily--1007. To and Fro
- Sicily.1007. To and Fro
- Sicily 1007. To and Fro
- sicily 1007. To and Fro
- sicily 1050.Numbers and Letters
- sicily 1007.To and Fro
- sicily 1798.Aclie and Bob
- Sicily 1007 To and Fro
- sicily 1001. To and Fro
- Sicily 1007. To and Fro
- Sicily 1491 Look and Say
- Sicily 1798. Alice and Bob
- Sicily 1620 SCVs and minerals
- Sicily 2611. Da Vinci Code
- 【转】Linux_lsof追踪进程或用户恢复删除文件
- Android开发-四大组件之服务、广播
- C++11中bind的用法
- LeetCode - Trap Rain Water
- Sicily 2610/1897. Chutter and Ladder
- 编译Sanbox
- ARM裸机编程系列---UART
- Sicily 2609/1954. Bracket Expression
- zendstudio 12 配置 xdebug 开发 thinkphp
- Sicily 1898. Tree
- Swift语法基础:17 - Swift的For循环, While, Do-While, If, Switch
- poj 3667 hotel
- a nginx version: nginx/1.0.15 configure arguments(笔记)