제출 #303616

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
303616		medmdg	카니발 티켓 (IOI20_tickets)	C++14	0 / 100	1 ms	384 KiB

tickets

#include <bits/stdc++.h>
#include "tickets.h"
using namespace std;
 long long int fin(vector<vector<int> > a,int n,int m,int k){
     long long int ans=0;
    for(int i=0;i<n;i++){
        double mid=0;
        for(int j=0;j<m;j++){
            mid+=a[i][j];
        }
        mid/=m;
         double ff=0;
        for(int j=0;j<m;j++){
            if(abs(ff-mid)>abs(a[i][j]-mid)){
                ff=a[i][j];
            }
        }
        for(int j=0;j<m;j++){
            ans+=(long long int)(abs(ff-a[i][j]));
        }
    }
    return ans;
}
long long int find_maximum(int k, vector<vector<int> > x){
    int n=x.size();
    int m=x[0].size();
    if(m==1){
        vector<vector<int> > ans(n);
        vector<vector<int> > answ(k);
        for(int i=0;i<n;i++){
            ans[i].push_back(0);
            answ[0].push_back(x[i][0]);
        }
            allocate_tickets(ans);
            return fin(answ,k,n,k);
    }
}

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

tickets.cpp: In function 'long long int find_maximum(int, std::vector<std::vector<int> >)':
tickets.cpp:37:1: warning: control reaches end of non-void function [-Wreturn-type]
   37 | }
      | ^

• Subtask 1: 0 / 11
• Subtask 2: 0 / 16
• Subtask 3: 0 / 14
• Subtask 4: 0 / 14
• Subtask 5: 0 / 12
• Subtask 6: 0 / 23
• Subtask 7: 0 / 10