Codeforces Round #281(Div.2) B. Vasya and Wrestling 물문제
9466 단어 codeforces
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.
두 개의 cha점: LL과 마지막 한 발은 누가 이기는지
#include <cstdio>
#include <cmath>
#include <cstring>
#include <ctime>
#include <iostream>
#include <algorithm>
#include <set>
#include <vector>
#include <sstream>
#include <queue>
#include <typeinfo>
#include <fstream>
typedef long long ll;
using namespace std;
//freopen("D.in","r",stdin);
//freopen("D.out","w",stdout);
#define sspeed ios_base::sync_with_stdio(0);cin.tie(0)
ll kiss[1000000];
ll kill[1000000];
int main()
{
int n;
cin>>n;
ll ans1=0;
ll ans2=0;
int path1=0;
int path2=0;
int flag3=0;
int num=0;
for(int i=0;i<n;i++)
{
cin>>num;
if(num<0)
{
kill[path2++]=-num;
ans2-=num;
}
else
{
kiss[path1++]=num;
ans1+=num;
}
if(i==n-1)
{
if(num<0)
flag3=2;
else
flag3=1;
}
}
//cout<<ans1<<" "<<ans2<<endl;
int flag=0;
if(ans1>ans2)
{
flag=1;
}
else if(ans2>ans1)
{
flag=2;
}
else
{
int len=min(path1-1,path2-1);
for(int i=0;i<len+1;i++)
{
//cout<<kiss[i]<<" "<<kill[i]<<endl;
if(kiss[i]>kill[i])
{
flag=1;
break;
}
if(kill[i]>kiss[i])
{
flag=2;
break;
}
}
if(flag==0)
{
if(path1>path2)
flag=1;
else if(path2>path1)
flag=2;
else
flag=flag3;
}
}
if(flag==1)
cout<<"first"<<endl;
else
cout<<"second"<<endl;
return 0;
}
이 내용에 흥미가 있습니까?
현재 기사가 여러분의 문제를 해결하지 못하는 경우 AI 엔진은 머신러닝 분석(스마트 모델이 방금 만들어져 부정확한 경우가 있을 수 있음)을 통해 가장 유사한 기사를 추천합니다:
Codeforces Round #715 Div. 2C The Sports Festival: 구간 DP전형구간 DP의 초전형. 이하, 0-indexed. 입력을 정렬하여 어디서나 시작하고 최적으로 좌우로 계속 유지하면 좋다는 것을 알 수 있습니다. {2000})$의 주문이 된다. 우선, 입력을 소트하여 n개의 요소를 $...
텍스트를 자유롭게 공유하거나 복사할 수 있습니다.하지만 이 문서의 URL은 참조 URL로 남겨 두십시오.
CC BY-SA 2.5, CC BY-SA 3.0 및 CC BY-SA 4.0에 따라 라이센스가 부여됩니다.