2020多校第四场Blow up the Enemy

思路

暴力。。

代码

#include <bits/stdc++.h>
#define hi cout<<"hi\n";
#define inf 0x3f3f3f3f
#define ll long long
#define ull unsigned long long
using namespace std;
const ll mod = 1000000009;
const int maxn = 100005;
ll power(long long a, long long b, long long mode)
{
    long long sum = 1;
    while (b)
    {
        if (b & 1)
        {
            sum = (sum * a) % mode;
            b--;
        }
        b /= 2;
        a = a * a % mode;
    }
    return sum;
}
ll gcd(int a,int b)
{
    if(b==0)
        return a;
    else
        return gcd(b,a%b);
}
ll lcm(int a,int b)
{
    return a/gcd(a,b)*b;
}
struct st
{
    int dmg;
    int dly;
}arr[1005];
int time(st a)
{
    if(100%a.dmg==0)
        return (100/a.dmg-1)*a.dly;
    if(100<a.dmg)
        return 0;
    int k=100/a.dmg;
    return (k)*a.dly;
}
int main()
{
    int T;
    cin>>T;
    while(T--)
    {
        int n;cin>>n;
        for(int i=0;i<n;i++)
        {
            cin>>arr[i].dmg>>arr[i].dly;
        }
        double ans=-100;
        for(int i=0;i<n;i++)
        {
            int x=time(arr[i]);
            int win=0;
            int qul=0;
            for(int j=0;j<n;j++)
            {
                int y=time(arr[j]);
                //cout<<y<<' ';
                if(x<y)
                    win++;
                if(x==y)
                    qul++;
            }
            double p=win*1.0/n+0.5*qul/n;
            //cout<<win<<' ' <<qul<<' '<<p<<endl;
            ans = max(ans,p);
        }
        cout<<ans<<endl;
    }
}