제출 #303908

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

tickets

#include <bits/stdc++.h>
#include "tickets.h"
using namespace std;
long long int fin(vector<vector<int> > a,int n,int m){
    for(int i=0;i<n;i++){
        sort(a[i].begin(),a[i].end());
    }
     long long int ans=0;
    for(int i=0;i<n;i++){
        long long int ff=a[i][(m)/2];
        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);
    }
    if(k==1){
        vector<vector<int> > a(k);
        vector<vector<int> > b(n);
        for(int i=0;i<n;i++)
            for(int j=0;j<m;j++)
                b[i].push_back(-1);
        /*int mi[n];
        int ma[n];
        for(int i=0;i<n;i++){
            mi[i]=0;
            ma[i]=m-1;
        }*/
        vector<int> al;
        for(int i=0;i<n;i++){
            al.push_back(x[i][0]);
            al.push_back(x[i][m-1]);
        }
        sort(al.begin(),al.end());
        int mid=al[n];
        for(int i=0;i<n;i++){
            if(abs(x[i][0]-mid)>abs(x[i][m-1]-mid)){
                a[0].push_back(x[i][0]);
                b[i][0]=0;
            }else{
                a[0].push_back(x[i][m-1]);
                b[i][m-1]=0;
            }
        }
        allocate_tickets(b);
        return fin(a,k,n);
    }
}

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

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

• Subtask 1: 11 / 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