제출 #150752

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
150752		TLEWA맞 (#200)	Organizing the Best Squad (FXCUP4_squad)	C++17	19 / 100	3096 ms	11004 KiB

squad

#include "squad.h"
#include<cstdio>
#include<vector>
#include<algorithm>
using namespace std;
#define inf 1e18
typedef long long LL;
int n;
int a[300010], d[300010], p[300010];
void Init(std::vector<int> A, std::vector<int> D, std::vector<int> P){
    n=A.size();
    for(int i=0; i<n; i++){
        a[i]=A[i];
        d[i]=D[i];
        p[i]=P[i];
    }
}
long long BestSquad(int X, int Y){
    LL maxx11=0, maxx21=0, maxx12=0, maxx22=0;
    int maxnum1, maxnum2;
    for(int i=0; i<n; i++){
        if(maxx12<(LL)X*a[i]+(LL)Y*p[i]){
            if(maxx11<(LL)X*a[i]+(LL)Y*p[i]){
                maxx12=maxx11;
                maxx11=(LL)X*a[i]+(LL)Y*p[i];
                maxnum1=i;
            }
            else maxx12=(LL)X*a[i]+(LL)Y*p[i];
        }
    }
    for(int i=0; i<n; i++){
        if(maxx22<(LL)X*d[i]+(LL)Y*p[i]){
            if(maxx21<(LL)X*d[i]+(LL)Y*p[i]){
                maxx22=maxx21;
                maxx21=(LL)X*d[i]+(LL)Y*p[i];
                maxnum2=i;
            }
            else maxx22=(LL)X*d[i]+(LL)Y*p[i];
        }
    }
    if(maxnum1!=maxnum2)return maxx11+maxx21;
    return max(maxx11+maxx22, maxx12+maxx21);
}

컴파일 시 표준 에러 (stderr) 메시지

squad.cpp: In function 'long long int BestSquad(int, int)':
squad.cpp:41:5: warning: 'maxnum1' may be used uninitialized in this function [-Wmaybe-uninitialized]
     if(maxnum1!=maxnum2)return maxx11+maxx21;
     ^~
squad.cpp:41:5: warning: 'maxnum2' may be used uninitialized in this function [-Wmaybe-uninitialized]

• Subtask 1: 19 / 19
• Subtask 2: 0 / 28
• Subtask 3: 0 / 53