hdu 2293 Name PK

  

Name PK

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 148    Accepted Submission(s): 75

Problem Description

Name PK is a funny game on the Internet. The game will calculate character's property based on its name.
Now we're simulating a simple Name PK game. Each character has 3 parameters: HP, STR and SPD (HP for health point, STR for strength and SPD for attacking speed).

For a name string of length N, Ci is ASCII code (decimal) of the i-th char.
 
PK rule:
1. Timer begins to increase from 1. When it is a multiple of (20-SPD), the corresponding character A has that SPD attack once, the opposite lose STR(A's) HP.

2. When any side has a HP ≤ 0, the PK is over.

 

 

Input

The input consists of several test cases. The first line of input consists of an integer T, indicating the number of test cases. Each test case is on a separate line, and it consists two strings separated by a whitespace, indicating the name of the characters.
Technical Specification

1. Names contain only English letters.
2. The length of each character's name is more than 1 and no more than 20.
3. T ≤ 1000.

 

 

Output

For each test case, output a line consisting of the result of the first character: "win", "lose" or "tie".

 

 

Sample Input

3
Sylvia xay
Ivan Stacy
Boyd Greg

 

 

Sample Output

lose
win
lose

这题的关键是最后一步， 不能模拟timer 进行攻击， 否则会超时。要算出a被攻击致死的时间， 和b被攻击致死的时间，相比较就能得出答案。

 #include <iostream>
#include <cmath>
#include <cstring>
#include <map>
#include <algorithm>
using namespace std;

int main()
{
    int test;
    int ahp, bhp, astr, bstr, aspd, bspd;
    string a,b;
    int alen , blen;
    cin>>test;
    while(test--)
    {
        ahp = 0, bhp = 0, astr = 1, bstr = 1, aspd = 0, bspd = 0;
        cin>>a>>b;
        alen = a.length();
        blen = b.length();
        for(int i = 0; i < alen; i++)
        {
            ahp = (ahp + (83 -a[i])*(83-a[i]))%97;
            astr = (astr * a[i])%79;
            for(int j = i + 1; j < alen; j++)
            {
                aspd = (aspd + a[i]*a[j])%11;
            }
        }
        for(int i = 0; i < blen; i++)
        {
            bhp = (bhp + (83 -b[i])*(83-b[i]))%97;
            bstr = (bstr * b[i])%79;
            for(int j = i + 1; j < blen; j++)
            {
                bspd = (bspd + b[i]*b[j])%11;
            }
        }
        ahp = 300 - ahp;
        bhp = 300 - bhp;
        astr += 22;
        bstr += 22;
        
        int aw = bhp/astr; //a win , b 需要被a攻打几次.
        if (bhp%astr != 0) //a最后一次攻击是否恰好打死b, 打不死再打一次.
            aw++;
        int bw = ahp/bstr;
        if (ahp%bstr != 0)
            bw++;
        aw *= (20 - aspd);
        bw *= (20 - bspd);
        if (aw == bw)
        {
            cout<<"tie"<<endl;
        }
        else
        if (aw < bw)
        {
            cout<<"win"<<endl;
        }
        else
        {
            cout<<"lose"<<endl;
        }
    }
}