POJ 1176 dfs
来源:互联网 发布:2017年网络大电影 编辑:程序博客网 时间:2024/06/06 02:28
这道题真恶心,,写出来dfs后提交,,wa了,仔细看题,才发现还要对二进制升序排序后输出。我去,,真够麻烦的。接下来就是转化成字符串,然后在用字符串比较,最后输出。。。值得注意的是,如果按开关的次数大于4,则和c%4+4次的效果是一样的,题目:
Party Lamps
Time Limit: 1000MS Memory Limit: 10000KTotal 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.
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.
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
101-17 -1
Sample Output
000000000001010101010110110110ac代码:
#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;}
- POJ 1176 dfs
- POJ 1176 Party Lamps (DFS)
- POJ 1176 Party Lamps (DFS)
- DFS POJ
- POJ DFS
- poj 3083 DFS+DFS+BFS
- POJ 1753 ID+DFS
- poj 1950 数字dfs
- poj 1816(trie+dfs)
- POJ 3107 Godfather(DFS)
- poj 3620(DFS)
- poj 1020 DFS
- poj 2362Square(DFS)
- POJ 2676 Sudoku dfs
- POJ 2357 Labyrinth [DFS]
- poj 1011 dfs
- poj 1190 dfs(生日蛋糕)
- poj 1154 dfs
- 关于汉字与Ascii码
- 多线程应用---使用WaveOut* API开发AMR音频播放器(含源码下载)
- Java中的保留字和关键字
- 计算IP地址的CIDR
- 关于网页给flash传递参数的问题
- POJ 1176 dfs
- JDK1.6下载|JDK1.6官方下载|JDK1.6中文版下载|JDK1.6中文CHM中文API下载
- 笔试中常见数据结构的题
- Hibernate学习体会
- 理解HashMap
- poj1840
- Snooper taoism 2版常用cla ins组合
- SQL Server 2008中SQL应用系列及BI学习笔记系列--目录索引
- Spring实例化