usaco——clocks

往后还是多看看别人的代码吧，自己的代码看起来的确不咋地，像枚举应该是递归，我写了九个for（汗！），这样都不能剪枝。。。

不过这几天身体不大好，头晕晕的，每天至少一道吧。等以后会把好的代码提出来，分析的。

The Clocks
IOI'94 - Day 2

Consider nine clocks arranged in a 3x3 array thusly:

|-------|    |-------|    |-------|    
|       |    |       |    |   |   |    
|---O   |    |---O   |    |   O   |          
|       |    |       |    |       |           
|-------|    |-------|    |-------|    
    A            B            C

|-------|    |-------|    |-------|
|       |    |       |    |       |
|   O   |    |   O   |    |   O   |
|   |   |    |   |   |    |   |   |
|-------|    |-------|    |-------|
    D            E            F

|-------|    |-------|    |-------|
|       |    |       |    |       |
|   O   |    |   O---|    |   O   |
|   |   |    |       |    |   |   |
|-------|    |-------|    |-------|
    G            H            I

The goal is to find a minimal sequence of moves to return all the dials to 12 o'clock. Nine different ways to turn the dials on the clocks are supplied via a table below; each way is called a move. Select for each move a number 1 through 9 which will cause the dials of the affected clocks (see next table) to be turned 90 degrees clockwise.

Move	Affected clocks
1	ABDE
2	ABC
3	BCEF
4	ADG
5	BDEFH
6	CFI
7	DEGH
8	GHI
9	EFHI

Example

Each number represents a time accoring to following table:

9 9 12       9 12 12       9 12 12        12 12 12      12 12 12 
6 6 6  5 ->  9  9  9  8->  9  9  9  4 ->  12  9  9  9-> 12 12 12 
6 3 6        6  6  6       9  9  9        12  9  9      12 12 12 

[But this might or might not be the `correct' answer; see below.]

PROGRAM NAME: clocks

INPUT FORMAT

Lines 1-3:

Three lines of three space-separated numbers; each number represents the start time of one clock, 3, 6, 9, or 12. The ordering of the numbers corresponds to the first example above.

SAMPLE INPUT (file clocks.in)

9 9 12
6 6 6
6 3 6

OUTPUT FORMAT

A single line that contains a space separated list of the shortest sequence of moves (designated by numbers) which returns all the clocks to 12:00. If there is more than one solution, print the one which gives the lowest number when the moves are concatenated (e.g., 5 2 4 6 < 9 3 1 1).

SAMPLE OUTPUT (file clocks.out)

4 5 8 9

 

---

我的代码：

/* ID: guangxue1 PROG: clocks LANG: C++ */ #include <iostream> #include <fstream> #include <string> using namespace std; ofstream fout ("clocks.out"); int used[9] = { 0 } ; int clocks[9] ; int moves[9][9] = { 3 , 3 , 0 , 3 , 3 , 0 , 0 , 0 , 0 , 3 , 3 , 3 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 3 , 3 , 0 , 3 , 3 , 0 , 0 , 0 , 3 , 0 , 0 , 3 , 0 , 0 , 3 , 0 , 0 , 0 , 3 , 0 , 3 , 3 , 3 , 0 , 3 , 0 , 0 , 0 , 3 , 0 , 0 , 3 , 0 , 0 , 3 , 0 , 0 , 0 , 3 , 3 , 0 , 3 , 3 , 0 , 0 , 0 , 0 , 0 , 0 , 0 , 3 , 3 , 3 , 0 , 0 , 0 , 0 , 3 , 3 , 0 , 3 , 3 } ; bool programend( int *clocks ){ int i ; for( i = 0 ; i < 9 ; ++i ){ if( clocks[i] % 12 ){ break ; } } if( i == 9 ){ return true ; } return false ; } bool Is(int *clocks, int *means) { int clocks2[9]; for(int i=0; i<9; ++i) clocks2[i]=clocks[i]; for(int i=0; i<9; ++i) for(int j=0; j<9; ++j) clocks2[j]+=moves[i][j]*means[i]; return programend(clocks2); } void dfs(int clocks[]) { for(int i1=0; i1<4; i1++) for(int i2=0; i2<4; i2++) for(int i3=0; i3<4; i3++) for(int i4=0; i4<4; i4++) for(int i5=0; i5<4; i5++) for(int i6=0; i6<4; i6++) for(int i7=0; i7<4; i7++) for(int i8=0; i8<4; i8++) for(int i9=0; i9<4; i9++) {int means[9]={i1,i2,i3,i4,i5,i6,i7,i8,i9}; if(Is(clocks, means)) {int last;for(int i=8; i>-1; i--) if(means[i]!=0) {last=i; break;} for(int i=0; i<last; i++) while(means[i]!=0) {fout<<i+1<<' '; --means[i];} while(means[last]>1){fout<<last+1<<' '; --means[last];}fout<<last+1<<endl; } } } int main() { ifstream fin ("clocks.in"); for(int i=0; i<9; i++) fin>>clocks[i]; dfs(clocks); return 0; }