A - System Administrator CodeForces - 245A（水题）

最新推荐文章于 2020-05-11 22:19:51 发布

原创最新推荐文章于 2020-05-11 22:19:51 发布 · 421 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#水题

本文介绍了一种用于判断服务器是否“存活”的算法。通过分析发送到两个服务器的ping命令及其返回结果，确定至少一半的数据包成功到达即认为服务器“存活”。文章提供了一个简单的代码实现，帮助理解如何处理和解析输入数据。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Polycarpus is a system administrator. There are two servers under his strict guidance — a and b. To stay informed about the servers’ performance, Polycarpus executes commands “ping a” and “ping b”. Each ping command sends exactly ten packets to the server specified in the argument of the command. Executing a program results in two integers x and y (x + y = 10; x, y ≥ 0). These numbers mean that x packets successfully reached the corresponding server through the network and y packets were lost.

Today Polycarpus has performed overall n ping commands during his workday. Now for each server Polycarpus wants to know whether the server is “alive” or not. Polycarpus thinks that the server is “alive”, if at least half of the packets that we send to this server reached it successfully along the network.

Help Polycarpus, determine for each server, whether it is “alive” or not by the given commands and their results.

Input
The first line contains a single integer n (2 ≤ n ≤ 1000) — the number of commands Polycarpus has fulfilled. Each of the following n lines contains three integers — the description of the commands. The i-th of these lines contains three space-separated integers ti, xi, yi (1 ≤ ti ≤ 2; xi, yi ≥ 0; xi + yi = 10). If ti = 1, then the i-th command is “ping a”, otherwise the i-th command is “ping b”. Numbers xi, yi represent the result of executing this command, that is, xi packets reached the corresponding server successfully and yi packets were lost.

It is guaranteed that the input has at least one “ping a” command and at least one “ping b” command.

Output
In the first line print string “LIVE” (without the quotes) if server a is “alive”, otherwise print “DEAD” (without the quotes).

In the second line print the state of server b in the similar format.

Examples
Input
2
1 5 5
2 6 4
Output
LIVE
LIVE
Input
3
1 0 10
2 0 10
1 10 0
Output
LIVE
DEAD
Note
Consider the first test case. There 10 packets were sent to server a, 5 of them reached it. Therefore, at least half of all packets sent to this server successfully reached it through the network. Overall there were 10 packets sent to server b, 6 of them reached it. Therefore, at least half of all packets sent to this server successfully reached it through the network.

Consider the second test case. There were overall 20 packages sent to server a, 10 of them reached it. Therefore, at least half of all packets sent to this server successfully reached it through the network. Overall 10 packets were sent to server b, 0 of them reached it. Therefore, less than half of all packets sent to this server successfully reached it through the network.
这个题目乍一看又臭又长，看不太懂。其实看懂了就是一个水题。
有两个东西，看看传递到它的是不是超过总数的二分之一，分别输出就好了。主要是看懂题意。
代码如下：

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;

const int maxx=1e3+10;
struct node{
	int ping;
	int ac;
	int wa;
}p[maxx];
int n;

int main()
{
	while(scanf("%d",&n)!=EOF)
	{
		int sum1=0;
		int sum2=0;
		int sum1a=0;
		int sum1w=0;
		int sum2a=0;
		int sum2w=0;
		for(int i=0;i<n;i++)
		{
			scanf("%d%d%d",&p[i].ping,&p[i].ac,&p[i].wa);
			if(p[i].ping==1)
			{
				sum1+=(p[i].ac+p[i].wa);
				sum1a+=p[i].ac;
				sum1w+=p[i].wa;
			}
			else
			{
				sum2+=(p[i].ac+p[i].wa);
				sum2a+=p[i].ac;
				sum2w+=p[i].wa;
			}
		}
		if(sum1a*2>=sum1) cout<<"LIVE"<<endl;
		else cout<<"DEAD"<<endl;
		if(sum2a*2>=sum2) cout<<"LIVE"<<endl;
		else cout<<"DEAD"<<endl;
	}
}

努力加油a啊，(^o)/~