USACO: Checker Challenge

Checker Challenge

Examine the 6x6 checkerboard below and note that the six checkers are arranged on the board so that one and only one is placed in each row and each column, and there is never more than one in any diagonal. (Diagonals run from southeast to northwest and southwest to northeast and include all diagonals, not just the major two.)

 

          Column
    1   2   3   4   5   6
  -------------------------
1 |   | O |   |   |   |   |
  -------------------------
2 |   |   |   | O |   |   |
  -------------------------
3 |   |   |   |   |   | O |
  -------------------------
4 | O |   |   |   |   |   |
  -------------------------
5 |   |   | O |   |   |   |
  -------------------------
6 |   |   |   |   | O |   |
  -------------------------

The solution shown above is described by the sequence 2 4 6 1 3 5, which gives the column positions of the checkers for each row from 1 to 6:

ROW	1	2	3	4	5	6
COLUMN	2	4	6	1	3	5

This is one solution to the checker challenge. Write a program that finds all unique solution sequences to the Checker Challenge (with ever growing values of N). Print the solutions using the column notation described above. Print the the first three solutions in numerical order, as if the checker positions form the digits of a large number, and then a line with the total number of solutions.

Special note: the larger values of N require your program to be especially efficient. Do not precalculate the value and print it (or even find a formula for it); that's cheating. Work on your program until it can solve the problem properly. If you insist on cheating, your login to the USACO training pages will be removed and you will be disqualified from all USACO competitions. YOU HAVE BEEN WARNED.

TIME LIMIT: 1 CPU second

PROGRAM NAME: checker

INPUT FORMAT

A single line that contains a single integer N (6 <= N <= 13) that is the dimension of the N x N checkerboard.

SAMPLE INPUT (file checker.in)

6

OUTPUT FORMAT

The first three lines show the first three solutions found, presented as N numbers with a single space between them. The fourth line shows the total number of solutions found.

SAMPLE OUTPUT (file checker.out)

2 4 6 1 3 5
3 6 2 5 1 4
4 1 5 2 6 3
4

HINTS (use them carefully!)

       HINT 1          HINT 2          HINT 3          HINT 4          HINT 5          HINT 6  

 

一个N皇后问题，搜索、剪枝、位运算、加上对称实现，其实提示给得很充分了，不过写起来确实麻烦

 

/* ID: geterns1 PROG: checker LANG: C++ */ #include <iostream> #include <fstream> #include <cstring> using namespace std; struct board{ unsigned short v; unsigned l; unsigned r; }; int numFound = 0; short size; unsigned short sId[13] = { 32768, 16384, 8192, 4096, 2048, 1024, 512, 256, 128, 64, 32, 16, 8 }; unsigned uId[25] = { 2147483648, 1073741824, 536870912, 268435456, 134217728, 67108864, 33554432, 16777216, 8388608, 4194304, 2097152, 1048576, 524288, 262144, 131072, 65536, 32768, 16384, 8192, 4096, 2048, 1024, 512, 256, 128 }; ofstream ofs("checker.out"); short ps[13]; void putChk(const board &bd, short index){ for (short i = 0; i < size; i ++){ //对称，减少搜索量 if (index == 0){ if (size > 6){ if (size % 2 == 0){ if (i == size / 2){ numFound *= 2; break; } } else{ if (i == size / 2) numFound *= 2; if (i == size / 2 + 1) break; } } } // if (numFound < 3){ //new board nBd = bd; // if ((bd.v & sId[i]) || (bd.l & uId[size + index - i - 1]) || (bd.r & uId[index + i])){ continue; } ps[index] = i; nBd.v |= sId[i]; nBd.l |= uId[size + index - i - 1]; nBd.r |= uId[index + i]; if (index == size - 1){ numFound ++; ofs << ps[0] + 1; for (short i = 1; i < size; i ++) ofs << " " << ps[i] + 1; ofs << endl; } else putChk(nBd, index + 1); } else{ //copy new board nBd = bd; if ((bd.v & sId[i]) || (bd.l & uId[size + index - i - 1]) || (bd.r & uId[index + i])) continue; nBd.v |= sId[i]; nBd.l |= uId[size + index - i - 1]; nBd.r |= uId[index + i]; if (index == size - 1) numFound ++; else putChk(nBd, index + 1); } } } int main(){ ifstream ifs("checker.in"); ifs >> size; board bd; bd.l = 0; bd.r = 0; bd.v = 0; putChk(bd, 0); ofs << numFound << endl; ifs.close(); ofs.close(); return 0; }