zoukankan      html  css  js  c++  java
  • cf493B Vasya and Wrestling

    B. Vasya and Wrestling
    time limit per test 2 seconds
    memory limit per test 256 megabytes
    input standard input
    output standard output

    Vasya has become interested in wrestling. In wrestling wrestlers use techniques for which they are awarded points by judges. The wrestler who gets the most points wins.

    When the numbers of points of both wrestlers are equal, the wrestler whose sequence of points is lexicographically greater, wins.

    If the sequences of the awarded points coincide, the wrestler who performed the last technique wins. Your task is to determine which wrestler won.

    Input

    The first line contains number n — the number of techniques that the wrestlers have used (1 ≤ n ≤ 2·105).

    The following n lines contain integer numbers ai (|ai| ≤ 109, ai ≠ 0). If ai is positive, that means that the first wrestler performed the technique that was awarded with ai points. And if ai is negative, that means that the second wrestler performed the technique that was awarded with ( - ai) points.

    The techniques are given in chronological order.

    Output

    If the first wrestler wins, print string "first", otherwise print "second"

    Sample test(s)
    input
    5
    1
    2
    -3
    -4
    3
    output
    second
    input
    3
    -1
    -2
    3
    output
    first
    input
    2
    4
    -4
    output
    second
    Note

    Sequence x  =  x1x2... x|x| is lexicographically larger than sequence y  =  y1y2... y|y|, if either |x|  >  |y| and x1  =  y1,  x2  =  y2, ... ,  x|y|  =  y|y|, or there is such number r (r  <  |x|, r  <  |y|), that x1  =  y1,  x2  =  y2,  ... ,  xr  =  yr and xr  +  1  >  yr  +  1.

    We use notation |a| to denote length of sequence a.

    模拟

    #include <stdio.h>
    #include <iostream>
    #include <cstring>
    #include <algorithm>
    #include <cmath>
    #define ll long long 
    using namespace std;
    ll i,j,t,n,m,l,r,k,z,y,x;
    ll a[200005],b[200005];
    ll suma,sumb;
    int main()
    {
    	scanf("%I64d",&n);
    	a[0]=b[0]=0;
    	suma=sumb=0;
    	for (i=1;i<=n;i++)
    	{
    		scanf("%I64d",&x);
    		if (x>0)
    		{
    			a[++a[0]]=x;
    			suma+=x;
    		}
    		if (x<0)
    		{
    			b[++b[0]]=-x;
    			sumb+=-x;
    		}
    		t=x;
    	}
    	if (suma>sumb) printf("first
    ");
    	else if (suma<sumb) printf("second
    ");
    	else
    	{
    		for (i=1;i<=max(a[0],b[0]);i++) if (a[i]!=b[i]) break;
    		if (a[i]>b[i]) printf("first
    ");
    		else if (a[i]<b[i]) printf("second
    ");
    		else
    		{
    			if (t>0) printf("first
    ");
    			else printf("second
    ");
    		}
    	}
    	return 0;
    }
    
    ——by zhber,转载请注明来源
  • 相关阅读:
    数据库事务查看
    在SQL中删除重复记录(多种方法)
    OO设计原则
    NHibernate开源框架Cuyahoga学习之权限映射
    链队列的实现
    二叉树的实现
    NHibernate.cfg.xml文件配置
    HQL查询实例
    对象枚举遍历实现二
    NHibernate开源框架Cuyahoga学习之数据访问泛型约束的实现
  • 原文地址:https://www.cnblogs.com/zhber/p/4141930.html
Copyright © 2011-2022 走看看