VK Cup 2017 - Round 3 B. Dynamic Problem Scoring

#include<bits/stdc++.h>

using namespace std;

#define X first
#define Y second
#define eps  1e-2
#define gcd __gcd
#define pb push_back
#define PI acos(-1.0)
#define lowbit(x) (x)&(-x)
#define bug printf("!!!!!\n");
#define mem(x,y) memset(x,y,sizeof(x))

typedef long long LL;
typedef long double LD;
typedef pair<int,int> pii;
typedef unsigned long long uLL;

const int maxn = 1e5+2;
const int INF  = 1<<30;
const int mod  = 1e9+7;

int n,a[125][10],cnt[10];

int get(int pos,int fl,int add){
    if(a[fl][pos]==-1) return 0;
    int sum=0,sc=500;
    if(a[1][pos]==-1||a[2][pos]==-1||a[1][pos]<a[2][pos]) sum=cnt[pos];
    else sum=cnt[pos]+add;
    for(int i=2;i<=32;i=i*2){
        if(sum*i>n+add) break;
        else sc+=500;
    }
    return sc*(250.0-a[fl][pos])/250.0;

}

void solve(){
    scanf("%d",&n);
    for(int i=1;i<=n;i++){
        for(int j=1;j<=5;j++){
             scanf("%d",&a[i][j]);
             if(a[i][j]!=-1) cnt[j]++;
        }
    }
    
    for(int i=0;;i++){
        int a=0,b=0;
        for(int j=1;j<=5;j++) a+=get(j,1,i);
        for(int j=1;j<=5;j++) b+=get(j,2,i);
        // cout<<a<<" "<<b<<endl;
        if(a>b){
            cout<<i<<endl;
            return ;
        
        }
        if(i>1e5) {
            cout<<-1<<endl;return ;
        }
    } 
    return;
}

int main()
{
//    freopen("in.txt","r",stdin);
//    freopen("out.txt","w",stdout);
//    ios::sync_with_stdio(false);
    int t = 1;
    //scanf("%d",&t);
    while(t--){
    //    printf("Case %d: ",cas++);
        solve();
    }
    return 0;
}