POJ 1176 dfs

原创 2012年03月22日 10:52:47

      这道题真恶心,,写出来dfs后提交,,wa了,仔细看题,才发现还要对二进制升序排序后输出。我去,,真够麻烦的。接下来就是转化成字符串,然后在用字符串比较,最后输出。。。值得注意的是,如果按开关的次数大于4,则和c%4+4次的效果是一样的,题目:

Party Lamps
Time Limit: 1000MS   Memory Limit: 10000K
Total Submissions: 3315   Accepted: 1127

Description

To brighten up the gala dinner of the IOI'98 we have a set of N coloured lamps numbered from 
1 to N. The lamps are connected to four buttons: 
button 1 -- when this button is pressed, all the lamps change their state: those that are ON are turned OFF and those that are OFF are turned ON. 
button 2 -- changes the state of all the odd numbered lamps. 
button 3 -- changes the state of all the even numbered lamps. 
button 4 -- changes the state of the lamps whose number is of the form 3K+1 (with K >= 0), i.e., 1,4,7,... 
There is a counter C which records the total number of button presses. 
When the party starts, all the lamps are ON and the counter C is set to zero. 

You are given the value of counter C and information on the final state of some of the lamps. Write a program to determine all the possible final configurations of the N lamps that are consistent with the given information, without repetitions.

Input

Your program is to read from standard input. The input contains four lines, describing the number N of lamps available, the number C of button presses, and the state of some of the lamps in the final configuration. 
The first line contains the number N and the second line the final value of counter C. The third line lists the lamp numbers you are informed to be ON in the final configuration, separated by one space and terminated by the integer -1. The fourth line lists the lamp numbers you are informed to be OFF in the final configuration, separated by one space and terminated by the integer -1. 

The parameters N and C are constrained by: 
10 <= N <= 100 
1 <= C <= 10000 
The number of lamps you are informed to be ON, in the final configuration, is less than or equal to 2.The number of lamps you are informed to be OFF, in the final configuration, is less than or equal to 2.

Output

Your program is to write to standard output. The output must contain all the possible final configurations (without repetitions) of all the lamps. There is at least one possible final configuration. Each possible configuration must be written on a different line. Each line has N characters, where the first character represents the state of lamp 1 and the last character represents the state of lamp N. A 0 (zero) stands for a lamp that is OFF, and a 1 (one) stands for a lamp that is ON. Configurations should be listed in binary ascending order.

Sample Input

10
1
-1
7 -1

Sample Output

0000000000
0101010101
0110110110
ac代码:

#include <iostream>
#include <cstdio>
#include <queue>
#include <stdio.h>
#include <string>
#include <algorithm>
#include <string.h>
using namespace std;
int num[110];
int on[2],off[2];
int n,c,k,kk,total;//total记录的是结果共有多少,k记录的是最后开着的灯有几个,kk记录的是最后关着的灯有几个
struct ss{
  char ch[110];
}aa[1010];
void dfs(int x){
	if(x==c+1){
		int flag=1;
		for(int i=0;i<k;++i){
			if(num[on[i]]!=1){
			  flag=0;break;
			}
		}
		for(int i=0;i<kk;++i){
			if(num[off[i]]!=0){
			  flag=0;break;
			}
		}
		if(flag==1){
		  char str[105];
		  int newflag=1;
		  for(int i=1;i<=n;++i)
		  {str[i-1]='0'+num[i];}
		  str[n]='\0';
		  for(int i=0;i<total;++i){
			  if(strcmp(str,aa[i].ch)==0)
			  {flag=0;break;}
		  }
		  if(flag==1){
		  strcpy(aa[total].ch,str);
		  total++;
		  }
		  return;
		}
	}
	else{
		for(int i=1;i<=4;++i){
			if(i==1){
				for(int j=1;j<=n;++j){
				  num[j]=!num[j];
				}
				dfs(x+1);
				for(int j=1;j<=n;++j)
					num[j]=!num[j];
			}
			else if(i==2){
				for(int j=1;j<=n;++j){
				  if(j%2)
					  num[j]=!num[j];
				}
				dfs(x+1);
				for(int j=1;j<=n;++j)
					if(j%2)
						num[j]=!num[j];
			}
			else if(i==3){
				for(int j=1;j<=n;++j){
				  if(j%2==0)
					  num[j]=!num[j];
				}
				dfs(x+1);
				for(int j=1;j<=n;++j)
					if(j%2==0)
						num[j]=!num[j];
			}
			else{
				for(int j=1;j<=n;++j){
				  if((j-1)%3==0)
					  num[j]=!num[j];
				}
				dfs(x+1);
				for(int j=1;j<=n;++j)
					if((j-1)%3==0)
						num[j]=!num[j];
			}
		}
	}
}
int cmp(ss a,ss b){
	return strcmp(a.ch,b.ch)<0;
}
int main(){
	//freopen("11.txt","r",stdin);
	while(~scanf("%d%d",&n,&c)){
		if(c>4){
	      c=c%4+4;
		}
	  int x,y;
	  for(int i=1;i<=n;++i)
	  {num[i]=1;}
	  k=0,kk=0,total=0;
	  while(scanf("%d",&x)&&x!=-1){
	    on[k++]=x;
	  }
	  while(scanf("%d",&y)&&y!=-1)
		 off[kk++]=y;
	  dfs(1);
	  sort(aa,aa+total,cmp);//字符串排序
	  for(int i=0;i<total;++i)
		  printf("%s\n",aa[i].ch);
	}
  return 0;
}


poj1176 Party Lamps dfs优化+规律枚举

To brighten up the gala dinner of the IOI'98 we have a set of N coloured lamps numbered from 1 to N...
  • ly59782
  • ly59782
  • 2016年08月19日 16:45
  • 535

poj 1176 Party Lamps 搜索

Party Lamps Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 4119   Ac...
  • yskyskyer123
  • yskyskyer123
  • 2015年10月29日 23:42
  • 351

假期训练——POJ - 1176 Party Lamps 思维+暴力+DFS

To brighten up the gala dinner of the IOI'98 we have a set of N coloured lamps numbered from  1 to ...
  • chudongfang2015
  • chudongfang2015
  • 2017年01月24日 23:14
  • 206

Gym-100712C-Street Lamps

标记一下能够照亮的地方,然后开始统计一下就好了#include #include #include #include using namespace std;bool vis[105];int mai...
  • Ypopstar
  • Ypopstar
  • 2016年05月12日 21:25
  • 161

C++——USACO Section 2.2 题解

Preface Numbering A certain book's prefaces are numbered in upper case Roman numerals. Traditio...
  • McDonnell_Douglas
  • McDonnell_Douglas
  • 2017年08月24日 15:37
  • 174

POJ 1176 Party Lamps (DFS)

POJ 1176
  • wdkirchhoff
  • wdkirchhoff
  • 2014年11月18日 18:39
  • 1180

DFS深度优先搜索(2)--poj1321(棋盘问题 经典DFS)

棋盘问题  Time Limit:1000MS    Memory Limit:10000KB    64bit IO Format:%lld & %llu Description...
  • Acmer_Sly
  • Acmer_Sly
  • 2016年09月10日 14:17
  • 1424

USACO Section 2.2 Party Lamps

/* ID: lucien23 PROG: lamps LANG: C++ */ /* * 此题的技巧之处就是需要注意到任何button只要按下2的倍数次就相当于没有按 * 所以其实只需要考虑4个...
  • LucienDuan
  • LucienDuan
  • 2014年08月04日 15:13
  • 803

Street Lamps

C. Street Lamps   Bahosain is walking in a street of N​​blocks. Each block is either empty or has ...
  • qq_30076791
  • qq_30076791
  • 2016年06月30日 09:28
  • 307

POJ 2676 Sudoku (数独 DFS)

Sudoku Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 14368   Accept...
  • Tc_To_Top
  • Tc_To_Top
  • 2015年02月10日 09:11
  • 1152
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:POJ 1176 dfs
举报原因:
原因补充:

(最多只允许输入30个字)