Algernon's Noxious Emissions POJ1121 zoj1052
One of the greatest alchemists of the lower Middle Renaissance, Algernon da Vinci (one of Leonardo's lesserknown cousins), had the foresight to construct his chemical works directly over a fast-running stream. Through a series of clever pipes and sluices, he routed portions of the stream past each of the tables where his alchemists prepared their secret brews, allowing them to dispose of their chemical byproducts into the waters flowing by the table.
As Algernon's business grew, he even added additional floors to his
factory, with water lifted to the higher floors by treadmill-powered pumps (much
to the dismay of the apprentices who found themselves assigned to pump duty).
The pipework for the entire disposal system became quite complex. It was even
rumored by some that the pipes actually circled back in some places, so that a
particularly odorous compound flushed away from one table might return to that
very same spot a few minutes later.
All was not well, however.
Algernon's factory suffered from a series of mishaps, minor explosions, gas
clouds, etc. It became obvious that chemicals dumped at one table might react
violently with other chemicals dumped from another table downstream. Algernon
realized that he needed to trace the possible chemical flows through his
factory.
Write a program to aid Algernon in this task. To preserve the
secrecy of the chemical processes that are Algernon's stock in trade, all
chemicals will be identified by a single upper-case letter. All tables are
identified by positive numbers in the range 1��N, where N is the number of
tables.
Input Format:
Line 1:
# of work tables, integer
(henceforth referred to as N). N < 50
Lines 2��N+1
For each
table:
- a list of chemicals dumped into the stream at that table, followed by
- a list of chemicals that, if they appeared at that table, would be
harmlessly neutralized by the reactions at that table, allowing no further trace
of that chemical to flow downstream (we will assume that the rate of work at
each table can be adjusted as necessary to guarantee total neutralization of
whatever amount of these chemicals arrive from upstream).
Each
of these lists is given as a series of upper-case alphabetic characters. The
only exception is that a special list, consisting of a single '.' character,
will be used to denote an empty list. The two lists are separated from one other
by one or more blanks. The same chemical will never appear in both lists.
Lines N+2��?
These lines provide a description of the pipeworks.
Each line contains a pair of integers in the range 1��N, separated by one or
more blanks:
I J
meaning that the table number I is upstream of table
number J - anything dumped into the stream at table I or that arrives in the
stream at table I and is not neutralized can then be counted on to arrive at
table J.
No (I,J) pair will be listed more than once, but the pairs may occur in any
order. I and J will never be the same number.
The end of input is
signaled by a pair of zeros:
0 0
Note that if a table only receives
water directly from the stream entering the building, that table will never
occur in the second position of a pair. Similarly, any table that discharges
only into the stream leaving the building will never occur in the first position
of a pair.
Output Format:
There will be N lines of output, one for each
table, in the same order as they appeared in the program input. Each line will
contain the list of chemicals that can be expected at that table's output. This
list will be printed as a (possibly empty) list of upper-case alphabetic
characters between two colons (:). No empty spaces should be printed on the
line. The characters in the list should be sorted in alphabetic order.
This problem contains multiple test cases!
The first line of a multiple input is an integer N, then a blank line
followed by N input blocks. Each input block is in the format indicated in the
problem description. There is a blank line between input blocks.
The output format consists of N output blocks. There is a blank line between
output blocks.
Sample Input:
For the figure at the right, an input would be:
1
4
AB C
C BDA
BCD .
. A
1 2
2 4
3 1
1 3
3 4
0 0
Sample Output:
:ABD:
:C:
:ABCD:
:BCD:
POJ是一个测试案例,只需注释Line 和ICase这几行就行。
#include <stdio.h>
#include <memory.h> const int MAXN = ; int main()
{
int i, j;
int mask[];
for (i = ; i < ; i++)
mask[i] = <<i;
int iCase;
scanf("%d", &iCase);
int line = ;
while (iCase--)
{
if (line) printf("\n");
line = ;
int output[MAXN];
int dump[MAXN];
int neutra[MAXN];
char c;
int n;
scanf("%d\n", &n);
for (i = ; i <= n; i++)
{
int temp = ;
do {
c = getc(stdin);
if (c >= 'A') temp |= mask[c-'A'];
} while (c != ' ');
dump[i] = output[i] = temp;
temp = ;
while((c = getc(stdin)) != '\n')
if (c >= 'A') temp |= mask[c-'A'];
neutra[i] = temp;
dump[i] &= ~temp;
output[i] &= ~temp;
}
bool graph[MAXN][MAXN];
bool table[MAXN];
memset(graph, , sizeof(graph));
for (i = ; i <= n; i++)
table[i] = true;
int a, b;
while(scanf("%d %d", &a, &b) && (a || b))
graph[a][b] = true;
bool flag;
do {
flag = false;
for (i = ; i <= n; i++)
if (table[i])
{
table[i] = false;
int temp = output[i];
for (j = ; j <= n; j++)
if (graph[i][j])
{
int newOut = (output[j] | temp) & (~neutra[j]);
if (output[j] != newOut)
{
output[j] = newOut;
table[j] = true;
}
}
flag = true;
break;
}
} while (flag);
for (i = ; i <= n; i++)
{
printf(":");
for (j = ; j <= ; j++)
if ((output[i] & mask[j]) != )
printf("%c", char(j+'A'));
printf(":\n");
}
}
return ;
}
Algernon's Noxious Emissions POJ1121 zoj1052的更多相关文章
- POJ题目细究
acm之pku题目分类 对ACM有兴趣的同学们可以看看 DP: 1011 NTA 简单题 1013 Great Equipment 简单题 102 ...
- 【转】POJ百道水题列表
以下是poj百道水题,新手可以考虑从这里刷起 搜索1002 Fire Net1004 Anagrams by Stack1005 Jugs1008 Gnome Tetravex1091 Knight ...
- algernon 基于golang 的独立的支持redis lua pg。。。 的web server
algernon 看到github 的介绍很很强大,一下子想到了openresty,功能看着很强大,支持 redis pg lua markdown quic http2 mysql 限速 pongo ...
- 38 Cell-phone Emissions can change Brain Activity 手机辐射有可能改变大脑活动
Cell-phone Emissions can change Brain Activity 手机辐射有可能改变大脑活动 So many people use the cell phone so fr ...
- Lesson 11 Not guilty
Lesson 11 Not guilty guilty ['gɪlti] adj. 有罪的:内疚的 be guilty of - He is guilty of murder. be innocent ...
- RXJava by Example--转
原文地址:https://www.infoq.com/articles/rxjava-by-example Key takeaways Reactive programming is a specif ...
- Android Weekly Notes Issue #223
Android Weekly Issue #223 September 18th, 2016 Android Weekly Issue #223 本期内容包括: Offline时间戳处理; Acces ...
- rxjs5.X系列 —— transform系列 api 笔记
欢迎指导与讨论:) 前言 本文是笔者翻译 RxJS 5.X 官网各类operation操作系列的的第一篇 -- transform转换.如有错漏,希望大家指出提醒O(∩_∩)O.更详细的资料尽在rxj ...
- 安卓中的Model-View-Presenter模式介绍
转载自:http://www.jcodecraeer.com/a/anzhuokaifa/androidkaifa/2015/0425/2782.html 英文原文:Introduction to M ...
随机推荐
- 使用 CreateInstallMedia 创建 苹果系统安装U盘
一般来说,从app store上面 下载下来的image位置,都是在 /Applications 下面 使用命令创建安装U盘,(备份一下命令,太长,记不住) sudo /Applications/In ...
- Designing Evolvable Web API with ASP.NET 随便读,随便记 “The Internet,the World Wide Web,and HTTP”——HTTP
HTTP 我们将只聚焦在于与创建 Web APIs有关的部分. HTTP 是信息系统中的一个应用层协议,是Web的支柱. 其原先由 Berners-Lee, Roy Fielding 和 Henrik ...
- oc_转_构造对象的方法,以及类的继承
一.构造方法 (一)构造方法的调用 完整的创建一个可用的对象:Person *p=[Person new]; New方法的内部会分别调用两个方法来完成2件事情: 1) 使用alloc方法来分配存储空间 ...
- .net组件技术
.NET是什么? •.NET是一个平台,而不是一种语言. •.NET是Microsoft的用以创建XML Web服务(下一代软件)平台,该平台将信息.设备和人以一种统一的.个性化的方式联系起来. ...
- 第二百九十三天 how can I 坚持
总感觉怪怪的,换了个领导,好烦,虽然对我没用影响. 其实,还是智商低,不懂人情世故,就像...算了,不说了,只能当自己傻. 最近好冷啊,十年不遇的寒冬. 心情有些压抑. 不玩游戏了,看了集康熙来了.小 ...
- JavaWeb应用中重定向与跳转的区别
针对JSP与Servlet: 两种重要的跳转: 1.request.getRequestDispatcher("地址").forward(ServletRequest, Servl ...
- FrameWork 建模时查询项的usage
§ Identifier:代表被用于分组或汇总与其相关的Fact数据的列.也代表一个索引列.还代表日期或时间列.§ Fact:代表一个包含数值数据可被分组或汇总的列,例如,产品成本.§ Attribu ...
- [iOS UI进阶 - 2.0] 彩票Demo v1.0
A.需求 1.模仿“网易彩票”做出有5个导航页面和相应功能的Demo 2.v1.0 版本搭建基本框架 code source:https://github.com/hellovoidworld/H ...
- JQuery学习使用笔记 -- JQuery插件开发
内容转载自 http://www.css88.com/archives/4821 扩展jQuery插件和方法的作用是非常强大的,它可以节省大量开发时间.这篇文章将概述jQuery插件开发的基本知识,最 ...
- Edit Box多行显示时如何使滚动条始终在下方
两种方法: ① CEdit *pEdit = ((CEdit*)GetDlgItem(IDC_EDIT_RXDATA)); pEdit->LineScroll(pEdit->GetLin ...