글 읽기 - 2015 인터넷 예선J번요!!

wlsqudgk12 8년 전 0

내림도 잘 했는데 왜죠.. ㅠㅠㅠ

#include <cstdio>
#include <algorithm>
#include <iostream>
#include <cstdlib>
#include <cstring>
#include <cmath>

using namespace std;

typedef long long bint;

struct Overalls {
    bint win, lose;
};

Overalls teams[1001];

bint power(bint a ) {
    return a * a;
}

int main() {
    bint times;
    scanf("%lld", &times);
    
    for( int cnt = 0; cnt < times; ++ cnt ) {
        memset(teams, 0, 2002);
        
        bint teamNumber, dataSize;
        scanf("%lld %lld", &teamNumber, &dataSize);
        
        bint team1, team2, team1Score, team2Score;
        for( int i = 0; i < dataSize; ++ i ) {
            scanf("%lld %lld %lld %lld", &team1, &team2, &team1Score, &team2Score);
            
            teams[team1].win += team1Score;
            teams[team1].lose += team2Score;
            
            teams[team2].win += team2Score;
            teams[team2].lose += team1Score;
            
        }
        
        bint maxVal = 0, minVal = 1000000000;
        for( int i = 1; i <= teamNumber; ++ i ) {
            bint pythagorean = floor((power(teams[i].win) / static_cast<double>( power(teams[i].win) + power(teams[i].lose) ) ) * 1000);
            
            if( pythagorean > maxVal )
                maxVal = pythagorean;
            
            if( pythagorean < minVal )
                minVal = pythagorean;
        }
        
        cout << maxVal << endl << minVal << endl;
    }
    
    return 0;
}